{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SIVRXZO24BZ3WUMFWAEM6MMP2U","short_pith_number":"pith:SIVRXZO2","schema_version":"1.0","canonical_sha256":"922b1be5dae073bb5185b008cf318fd514666b27fbea5c8675e14bf04d7c5424","source":{"kind":"arxiv","id":"1909.00514","version":3},"attestation_state":"computed","paper":{"title":"Progress towards Nash-Williams' Conjecture on Triangle Decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Luke Postle, Michelle Delcourt","submitted_at":"2019-09-02T02:16:15Z","abstract_excerpt":"Partitioning the edges of a graph into edge disjoint triangles forms a triangle decomposition of the graph. A famous conjecture by Nash-Williams from 1970 asserts that any sufficiently large, triangle divisible graph on $n$ vertices with minimum degree at least $0.75 n$ admits a triangle decomposition. In the light of recent results, the fractional version of this problem is of central importance. A fractional triangle decomposition is an assignment of non-negative weights to each triangle in a graph such that the sum of the weights along each edge is precisely 1.\n  We show that for any graph "},"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":"1909.00514","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-09-02T02:16:15Z","cross_cats_sorted":[],"title_canon_sha256":"93ea43d2ad705b9a53fcd3c40ccdc8ef70f20a439432147a667820a3c70ce2d0","abstract_canon_sha256":"bf1c294c5885ed5e11d1348af4a0190a111986de92773cbe974c41419c49d007"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:39:24.689662Z","signature_b64":"uqoFLU8C5n71sR5pI3/P7B4fr3D5x9I5Vy0lDJuP89LcyFR3bRWaX2682mqaVOzZBB8snEfW/3gZaPkW9WLfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"922b1be5dae073bb5185b008cf318fd514666b27fbea5c8675e14bf04d7c5424","last_reissued_at":"2026-07-05T01:39:24.689217Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:39:24.689217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Progress towards Nash-Williams' Conjecture on Triangle Decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Luke Postle, Michelle Delcourt","submitted_at":"2019-09-02T02:16:15Z","abstract_excerpt":"Partitioning the edges of a graph into edge disjoint triangles forms a triangle decomposition of the graph. A famous conjecture by Nash-Williams from 1970 asserts that any sufficiently large, triangle divisible graph on $n$ vertices with minimum degree at least $0.75 n$ admits a triangle decomposition. In the light of recent results, the fractional version of this problem is of central importance. A fractional triangle decomposition is an assignment of non-negative weights to each triangle in a graph such that the sum of the weights along each edge is precisely 1.\n  We show that for any graph "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.00514","kind":"arxiv","version":3},"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/1909.00514/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":"1909.00514","created_at":"2026-07-05T01:39:24.689282+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.00514v3","created_at":"2026-07-05T01:39:24.689282+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.00514","created_at":"2026-07-05T01:39:24.689282+00:00"},{"alias_kind":"pith_short_12","alias_value":"SIVRXZO24BZ3","created_at":"2026-07-05T01:39:24.689282+00:00"},{"alias_kind":"pith_short_16","alias_value":"SIVRXZO24BZ3WUMF","created_at":"2026-07-05T01:39:24.689282+00:00"},{"alias_kind":"pith_short_8","alias_value":"SIVRXZO2","created_at":"2026-07-05T01:39:24.689282+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.11076","citing_title":"On the minimum degree required for a triangle decomposition","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SIVRXZO24BZ3WUMFWAEM6MMP2U","json":"https://pith.science/pith/SIVRXZO24BZ3WUMFWAEM6MMP2U.json","graph_json":"https://pith.science/api/pith-number/SIVRXZO24BZ3WUMFWAEM6MMP2U/graph.json","events_json":"https://pith.science/api/pith-number/SIVRXZO24BZ3WUMFWAEM6MMP2U/events.json","paper":"https://pith.science/paper/SIVRXZO2"},"agent_actions":{"view_html":"https://pith.science/pith/SIVRXZO24BZ3WUMFWAEM6MMP2U","download_json":"https://pith.science/pith/SIVRXZO24BZ3WUMFWAEM6MMP2U.json","view_paper":"https://pith.science/paper/SIVRXZO2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.00514&json=true","fetch_graph":"https://pith.science/api/pith-number/SIVRXZO24BZ3WUMFWAEM6MMP2U/graph.json","fetch_events":"https://pith.science/api/pith-number/SIVRXZO24BZ3WUMFWAEM6MMP2U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SIVRXZO24BZ3WUMFWAEM6MMP2U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SIVRXZO24BZ3WUMFWAEM6MMP2U/action/storage_attestation","attest_author":"https://pith.science/pith/SIVRXZO24BZ3WUMFWAEM6MMP2U/action/author_attestation","sign_citation":"https://pith.science/pith/SIVRXZO24BZ3WUMFWAEM6MMP2U/action/citation_signature","submit_replication":"https://pith.science/pith/SIVRXZO24BZ3WUMFWAEM6MMP2U/action/replication_record"}},"created_at":"2026-07-05T01:39:24.689282+00:00","updated_at":"2026-07-05T01:39:24.689282+00:00"}