{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XLGHIFOXSQQSZPGKBQOHOK37W3","short_pith_number":"pith:XLGHIFOX","schema_version":"1.0","canonical_sha256":"bacc7415d794212cbcca0c1c772b7fb6f62391f3c15040c6a152133b66571ce8","source":{"kind":"arxiv","id":"1610.01113","version":3},"attestation_state":"computed","paper":{"title":"Random 4-regular graphs have 3-star decompositions asymptotically almost surely","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Luke Postle, Michelle Delcourt","submitted_at":"2016-10-04T18:06:31Z","abstract_excerpt":"In 2006, Barat and Thomassen conjectured in 2006 that the edges of every planar 4-regular 4-edge-connected graph can be decomposed into copies of the star with 3 leaves. Shortly afterward, Lai constructed a counterexample to this conjecture. Using the small subgraph conditioning method of Robinson and Wormald, we prove that a random 4-regular graph has an $S_3$-decomposition asymptotically almost surely, provided the number of vertices is divisible by 3."},"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":"1610.01113","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-04T18:06:31Z","cross_cats_sorted":[],"title_canon_sha256":"4387f0be2140cfbb3a5c635386d28acfd5aa557882f4d060544572c985ed87c5","abstract_canon_sha256":"629358a0c487506feede515049fa3efafd0e8630cd319e5fb7b0d4855c6758e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:47.801176Z","signature_b64":"ZMLNLUlW82H3f4Q1dCYa0IaH9mSaX97Rw2YX0ywiDzcpUU9/F5wAXSCwVwBSKlSOA5V8MTVSn02ytGozZYUHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bacc7415d794212cbcca0c1c772b7fb6f62391f3c15040c6a152133b66571ce8","last_reissued_at":"2026-05-18T00:19:47.800517Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:47.800517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random 4-regular graphs have 3-star decompositions asymptotically almost surely","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Luke Postle, Michelle Delcourt","submitted_at":"2016-10-04T18:06:31Z","abstract_excerpt":"In 2006, Barat and Thomassen conjectured in 2006 that the edges of every planar 4-regular 4-edge-connected graph can be decomposed into copies of the star with 3 leaves. Shortly afterward, Lai constructed a counterexample to this conjecture. Using the small subgraph conditioning method of Robinson and Wormald, we prove that a random 4-regular graph has an $S_3$-decomposition asymptotically almost surely, provided the number of vertices is divisible by 3."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.01113","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":""},"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":"1610.01113","created_at":"2026-05-18T00:19:47.800618+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.01113v3","created_at":"2026-05-18T00:19:47.800618+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.01113","created_at":"2026-05-18T00:19:47.800618+00:00"},{"alias_kind":"pith_short_12","alias_value":"XLGHIFOXSQQS","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XLGHIFOXSQQSZPGK","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XLGHIFOX","created_at":"2026-05-18T12:30:51.357362+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/XLGHIFOXSQQSZPGKBQOHOK37W3","json":"https://pith.science/pith/XLGHIFOXSQQSZPGKBQOHOK37W3.json","graph_json":"https://pith.science/api/pith-number/XLGHIFOXSQQSZPGKBQOHOK37W3/graph.json","events_json":"https://pith.science/api/pith-number/XLGHIFOXSQQSZPGKBQOHOK37W3/events.json","paper":"https://pith.science/paper/XLGHIFOX"},"agent_actions":{"view_html":"https://pith.science/pith/XLGHIFOXSQQSZPGKBQOHOK37W3","download_json":"https://pith.science/pith/XLGHIFOXSQQSZPGKBQOHOK37W3.json","view_paper":"https://pith.science/paper/XLGHIFOX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.01113&json=true","fetch_graph":"https://pith.science/api/pith-number/XLGHIFOXSQQSZPGKBQOHOK37W3/graph.json","fetch_events":"https://pith.science/api/pith-number/XLGHIFOXSQQSZPGKBQOHOK37W3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XLGHIFOXSQQSZPGKBQOHOK37W3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XLGHIFOXSQQSZPGKBQOHOK37W3/action/storage_attestation","attest_author":"https://pith.science/pith/XLGHIFOXSQQSZPGKBQOHOK37W3/action/author_attestation","sign_citation":"https://pith.science/pith/XLGHIFOXSQQSZPGKBQOHOK37W3/action/citation_signature","submit_replication":"https://pith.science/pith/XLGHIFOXSQQSZPGKBQOHOK37W3/action/replication_record"}},"created_at":"2026-05-18T00:19:47.800618+00:00","updated_at":"2026-05-18T00:19:47.800618+00:00"}