{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:6BQDFR6VQP2XO4MZDYDDDL2HRD","short_pith_number":"pith:6BQDFR6V","schema_version":"1.0","canonical_sha256":"f06032c7d583f57771991e0631af4788c613d434dd45743edf078d7d6fa654e8","source":{"kind":"arxiv","id":"2606.11178","version":1},"attestation_state":"computed","paper":{"title":"A Proof of Nash-Williams' Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Luke Postle, Michelle Delcourt","submitted_at":"2026-06-09T17:55:22Z","abstract_excerpt":"A central open question in extremal design theory is Nash-Williams' Conjecture from 1970 that every triangle-divisible graph on $n$ vertices (for $n$ large enough) with minimum degree at least $0.75 n$ has a triangle decomposition. In this paper, we prove this conjecture in full.\n  In 2016, Barber, K\\\"{u}hn, Lo, and Osthus proved that if the fractional relaxation of Nash-Williams' Conjecture holds for minimum degree $cn$ for some constant $c\\ge 0.75$, then Nash-Williams' Conjecture holds for any constant $c' > c$. The previously best-known bound on the fractional relaxation was due to Delcourt"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2606.11178","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-09T17:55:22Z","cross_cats_sorted":[],"title_canon_sha256":"8f17e80d41047ab23b7836b8b6ad65ed7885c3b380426afc54bd19d92260c1bf","abstract_canon_sha256":"78cd8cac56b865da3c89484c94cbe9f83fa7ec1c80979e74ccebcc018747d2c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-10T01:11:15.456386Z","signature_b64":"Ia8nsp2RDjBJ+tXw5MitJNNibnyuVk1oUYY9Jv7mOm0A7UhLl3ZIPRFd6xuUXofsT+bqXUvVGApVl4WJXXjdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f06032c7d583f57771991e0631af4788c613d434dd45743edf078d7d6fa654e8","last_reissued_at":"2026-06-10T01:11:15.455471Z","signature_status":"signed_v1","first_computed_at":"2026-06-10T01:11:15.455471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Proof of Nash-Williams' Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Luke Postle, Michelle Delcourt","submitted_at":"2026-06-09T17:55:22Z","abstract_excerpt":"A central open question in extremal design theory is Nash-Williams' Conjecture from 1970 that every triangle-divisible graph on $n$ vertices (for $n$ large enough) with minimum degree at least $0.75 n$ has a triangle decomposition. In this paper, we prove this conjecture in full.\n  In 2016, Barber, K\\\"{u}hn, Lo, and Osthus proved that if the fractional relaxation of Nash-Williams' Conjecture holds for minimum degree $cn$ for some constant $c\\ge 0.75$, then Nash-Williams' Conjecture holds for any constant $c' > c$. The previously best-known bound on the fractional relaxation was due to Delcourt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11178","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.11178/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.11178","created_at":"2026-06-10T01:11:15.455618+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.11178v1","created_at":"2026-06-10T01:11:15.455618+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11178","created_at":"2026-06-10T01:11:15.455618+00:00"},{"alias_kind":"pith_short_12","alias_value":"6BQDFR6VQP2X","created_at":"2026-06-10T01:11:15.455618+00:00"},{"alias_kind":"pith_short_16","alias_value":"6BQDFR6VQP2XO4MZ","created_at":"2026-06-10T01:11:15.455618+00:00"},{"alias_kind":"pith_short_8","alias_value":"6BQDFR6V","created_at":"2026-06-10T01:11:15.455618+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6BQDFR6VQP2XO4MZDYDDDL2HRD","json":"https://pith.science/pith/6BQDFR6VQP2XO4MZDYDDDL2HRD.json","graph_json":"https://pith.science/api/pith-number/6BQDFR6VQP2XO4MZDYDDDL2HRD/graph.json","events_json":"https://pith.science/api/pith-number/6BQDFR6VQP2XO4MZDYDDDL2HRD/events.json","paper":"https://pith.science/paper/6BQDFR6V"},"agent_actions":{"view_html":"https://pith.science/pith/6BQDFR6VQP2XO4MZDYDDDL2HRD","download_json":"https://pith.science/pith/6BQDFR6VQP2XO4MZDYDDDL2HRD.json","view_paper":"https://pith.science/paper/6BQDFR6V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.11178&json=true","fetch_graph":"https://pith.science/api/pith-number/6BQDFR6VQP2XO4MZDYDDDL2HRD/graph.json","fetch_events":"https://pith.science/api/pith-number/6BQDFR6VQP2XO4MZDYDDDL2HRD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6BQDFR6VQP2XO4MZDYDDDL2HRD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6BQDFR6VQP2XO4MZDYDDDL2HRD/action/storage_attestation","attest_author":"https://pith.science/pith/6BQDFR6VQP2XO4MZDYDDDL2HRD/action/author_attestation","sign_citation":"https://pith.science/pith/6BQDFR6VQP2XO4MZDYDDDL2HRD/action/citation_signature","submit_replication":"https://pith.science/pith/6BQDFR6VQP2XO4MZDYDDDL2HRD/action/replication_record"}},"created_at":"2026-06-10T01:11:15.455618+00:00","updated_at":"2026-06-10T01:11:15.455618+00:00"}