{"payload":{"schema_version":"research-record-v0","publication":{"version":2,"sha256":"ed9e2f4cc3e5435c75f3399d28402089169ce92ef9c41bb74f89737d527ad94b","published_at":"2026-10-10T06:01:24.721059+00:00","reason":"Add cited resolution scope and consolidate equivalent prime formulations and supporting Claims; mathematical evidence and execution review remain distinct.","withdrawn":false,"draft":{"schema_version":"research-record-v1","problem":{"resolution_scope":{"resolution":"unknown","extent":"unspecified","summary":"The 2006 survey states a conjecture; this historical source does not establish its present status.","report_ids":["caccetta-haggkvist:report:0:v1"],"progress_claim_ids":[],"remaining":null},"statement_kind":"conjecture","problem_id":"problem-caccetta-haggkvist","slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","question":"Must a simple directed graph with n vertices and minimum out-degree at least r ≥ 1 contain a directed cycle of length at most ⌈n/r⌉?","scope":"Finite simple directed graphs. This historical survey is a discovery source; the present research state has not been assessed.","aliases":[],"fields":["Combinatorics"],"msc":["05C20","05C38"],"topics":[],"background":"graduate","scale":"focused question","depth":"source-linked","source_entry_ids":["caccetta-haggkvist:entry:0:v1"],"status_report_ids":["caccetta-haggkvist:report:0:v1"],"editorial":null,"literature":[{"title":"2006 workshop survey","url":"https://aimath.org/WWN/caccetta/caccetta.pdf","note":"Blair D. Sullivan, 14 April 2006, Conjecture 2.1 on page 2. Only a paraphrase and source link are published."}],"formalizations":[],"related":[],"tasks":[],"insights":[],"coverage_gaps":["No exhaustive literature or source-list coverage.","Independent mathematical assessment has not been performed.","Historical source from 2006; recent progress and present status are unreviewed."],"checked_on":"2026-10-01"},"sources":[{"id":"aim-caccetta@2006-04-14","source_id":"aim-caccetta","title":"AIM · Caccetta–Häggkvist workshop survey","owner":"Blair D. Sullivan; hosted by American Institute of Mathematics","url":"https://aimath.org/WWN/caccetta/caccetta.pdf","subject_scope":"Directed graph questions and partial results from the 2006 workshop","revision":"2006-04-14","content_sha256":null,"update_method":"Manual checked import; new observations require staff preview and publication","identifier_policy":"Canonical source URL plus explicit item/declaration locator; no fuzzy identity merge","observed_on":"2026-10-01","source_updated_on":"2006-04-14","rights":"metadata-link","license":"Not established; links and OpenMath paraphrases only","terms_url":"https://aimath.org/WWN/caccetta/caccetta.pdf","attribution":"Blair D. Sullivan; hosted by American Institute of Mathematics","rights_note":"Store metadata and original OpenMath paraphrases; follow the original source for authoritative wording.","check_interval_days":180}],"entries":[{"id":"caccetta-haggkvist:entry:0:v1","source_version_id":"aim-caccetta@2006-04-14","item_id":"Page 2, Conjecture 2.1","url":"https://aimath.org/WWN/caccetta/caccetta.pdf","wording":"Must a simple directed graph with n vertices and minimum out-degree at least r ≥ 1 contain a directed cycle of length at most ⌈n/r⌉?","wording_kind":"paraphrase","locator":"Page 2, Conjecture 2.1","supersedes":null}],"reports":[{"id":"caccetta-haggkvist:report:0:v1","entry_id":"caccetta-haggkvist:entry:0:v1","state":"unknown","source_label":"Conjecture 2.1; no current-status report","scope":"The cited source item and version only; this is not an independent OpenMath assessment.","source_date":"2006-04-14","observed_on":"2026-10-01","evidence_url":"https://aimath.org/WWN/caccetta/caccetta.pdf","supersedes":null}]},"status":{"state":"unknown","label":"Current status unknown","extent":"unspecified","summary":"The 2006 survey states a conjecture; this historical source does not establish its present status.","basis":"source","attributed_to":"AIM · Caccetta–Häggkvist workshop survey","as_of":"2026-10-01","progress_label":null,"progress_claim_ids":[],"remaining":null,"views":["uncertain"]}},"data_mode":"published catalog snapshot; historical Phase 0 checks only","context_packs":[],"reference_fixture_checks":[],"repeat_instructions":"No verification task is attached to this discovery record."},"payload_sha256":"8ca1a85e410ce983607d58b47909aaafdd7827bd9d2c07cd5cd33f54ee31802c","canonicalization":"RFC 8785 JSON Canonicalization Scheme. Hash the payload, excluding this envelope. Immutable embedded domain hashes retain their original profile."}