{"schema_version":"source-reader-v1","record":{"source_id":"hkn-triangle-bound","versions":[{"work":{"authors":["Jan Hladký","Daniel Král’","Sergey Norin"],"kind":"research_paper","publication":"published","publication_note":"Source-backed selection; publication and proof assessment are separate.","ai_role":"not_reported","ai_note":"AI use is not reported in the selected source.","artifacts":[{"kind":"project_notes","title":"Companion Maple arithmetic","url":"https://arxiv.org/src/0908.2791v4/anc/CH.mw","version":"0908.2791v4","assessment":"not_executed","note":"Companion arithmetic for the published bound; no OpenMath execution is attached."}],"published":{"value":"2017"}},"id":"hkn-triangle-bound@arxiv-0908.2791v4","source_id":"hkn-triangle-bound","title":"Counting flags in triangle-free digraphs","owner":"Jan Hladký; Daniel Král’; Sergey Norin","url":"https://arxiv.org/abs/0908.2791v4","subject_scope":"Counting flags in triangle-free digraphs","revision":"arxiv-0908.2791v4","content_sha256":null,"update_method":"Manual source review; publish new observations with immutable versions","identifier_policy":"Source revision plus exact passage or declaration; no fuzzy identity merge","observed_on":"2026-10-12","source_updated_on":null,"rights":"metadata-link","license":"Metadata, links and original OpenMath paraphrases only","terms_url":"https://arxiv.org/abs/0908.2791v4","attribution":"Jan Hladký; Daniel Král’; Sergey Norin","rights_note":"Follow the original source for authoritative statements and reuse terms.","check_interval_days":90}],"entries":[{"id":"caccetta-haggkvist:entry:triangle-bound:v1","source_version_id":"hkn-triangle-bound@arxiv-0908.2791v4","item_id":"Theorem 1.2; §2 notation; §5 computation","url":"https://arxiv.org/abs/0908.2791v4","wording":"An oriented graph with minimum out-degree at least 0.3465 times its order contains a directed triangle. The paper forbids opposite arcs and uses flag algebras with auxiliary arithmetic.","wording_kind":"paraphrase","locator":"Theorem 1.2; §2 notation; §5 computation","supersedes":null},{"id":"caccetta-haggkvist:entry:triangle-target:v1","source_version_id":"hkn-triangle-bound@arxiv-0908.2791v4","item_id":"§1, triangle specialization","url":"https://arxiv.org/abs/0908.2791v4","wording":"The triangle specialization asks for a directed triangle at minimum out-degree at least one third of the vertex count, in an oriented graph.","wording_kind":"paraphrase","locator":"§1, triangle specialization","supersedes":null}],"problems":[{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":11}],"selected_version_id":"hkn-triangle-bound@arxiv-0908.2791v4","available_versions":[{"id":"hkn-triangle-bound@arxiv-0908.2791v4","revision":"arxiv-0908.2791v4","observed_on":"2026-10-12","title":"Counting flags in triangle-free digraphs","publication":"published","content_sha256":null,"used_in_current_publications":true}],"usages":[{"id":"source-use-ff36b9cfcd2f3255cda9","entry_id":"caccetta-haggkvist:entry:triangle-bound:v1","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":11},"kind":"activity","title":"Arithmetic accompanying the triangle bound","claim":null,"fragment":"activity","assessment":null,"superseded":false,"formalization":null,"update":{"id":"ch-companion-arithmetic","title":"Arithmetic accompanying the triangle bound","kind":"computation","source_entry_ids":["caccetta-haggkvist:entry:triangle-bound:v1"],"summary":"The authors provide companion Maple arithmetic supporting the published argument.","limitation":"An external resource link is not an OpenMath execution or formal verification of the full conjecture.","related_claim_ids":["claim-ch-triangle-03465"]}},{"id":"source-use-d2062dba95eb83b968f3","entry_id":"caccetta-haggkvist:entry:triangle-bound:v1","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":11},"kind":"assessment","title":"Established result in cited source","claim":{"id":"claim-ch-triangle-03465","version":1,"slug":"ch-triangle-03465","title":"A proved 0.3465 triangle threshold"},"fragment":"claim-ch-triangle-03465","assessment":{"id":"caccetta-haggkvist:report:ch-triangle-03465:v1","entry_id":"caccetta-haggkvist:entry:triangle-bound:v1","state":"resolved","source_label":"Established result in cited source","scope":"The assumption is stronger than n/3. This published threshold is selected evidence, not a claim to be the best current bound.","source_date":null,"observed_on":"2026-10-12","evidence_url":"https://arxiv.org/abs/0908.2791v4","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-c57e2fbd6d821995c6cf","entry_id":"caccetta-haggkvist:entry:triangle-bound:v1","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":11},"kind":"milestone","title":"A published triangle threshold","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-66d55cdfdcb01641a6d2","entry_id":"caccetta-haggkvist:entry:triangle-bound:v1","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":11},"kind":"question","title":"Caccetta–Häggkvist cycle bound","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-a6bdb9702a361c0414ac","entry_id":"caccetta-haggkvist:entry:triangle-bound:v1","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":11},"kind":"statement","title":"A proved 0.3465 triangle threshold","claim":{"id":"claim-ch-triangle-03465","version":1,"slug":"ch-triangle-03465","title":"A proved 0.3465 triangle threshold"},"fragment":"claim-ch-triangle-03465","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-812173e05ccc89c7c9cc","entry_id":"caccetta-haggkvist:entry:triangle-target:v1","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":11},"kind":"assessment","title":"Open question in cited source","claim":{"id":"claim-ch-triangle-target","version":1,"slug":"ch-triangle-target","title":"The one-third directed triangle question"},"fragment":"claim-ch-triangle-target","assessment":{"id":"caccetta-haggkvist:report:ch-triangle-target:v1","entry_id":"caccetta-haggkvist:entry:triangle-target:v1","state":"reported_open","source_label":"Open question in cited source","scope":"Oriented graphs have no loops, parallel arcs or opposite arcs; this is a specialization of the full conjecture.","source_date":null,"observed_on":"2026-10-12","evidence_url":"https://arxiv.org/abs/0908.2791v4","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-b74ba5a72dd9cccb59e5","entry_id":"caccetta-haggkvist:entry:triangle-target:v1","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":11},"kind":"connection","title":"The one-third triangle question is a specialization for oriented graphs.","claim":null,"fragment":"connections","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-9f7672c5596b539a7f00","entry_id":"caccetta-haggkvist:entry:triangle-target:v1","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":11},"kind":"question","title":"Caccetta–Häggkvist cycle bound","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-8b67c94a8347b302fcf7","entry_id":"caccetta-haggkvist:entry:triangle-target:v1","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":11},"kind":"reading","title":"Read the mathematical argument; inspect its Claim for assessment and scope.","claim":null,"fragment":"provenance","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-f3ab127f591ba7aeef29","entry_id":"caccetta-haggkvist:entry:triangle-target:v1","problem":{"slug":"caccetta-haggkvist","title":"Caccetta–Häggkvist cycle bound","publication_version":11},"kind":"statement","title":"The one-third directed triangle question","claim":{"id":"claim-ch-triangle-target","version":1,"slug":"ch-triangle-target","title":"The one-third directed triangle question"},"fragment":"claim-ch-triangle-target","assessment":null,"superseded":false,"formalization":null,"update":null}],"linked_entries":[],"linked_sources":[]}}