{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:RUR3AZTPAHT7YMXVFP6XPMSD2M","short_pith_number":"pith:RUR3AZTP","canonical_record":{"source":{"id":"1401.4159","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-16T20:44:15Z","cross_cats_sorted":[],"title_canon_sha256":"b47b6742d8690b3da06554eada1fd260605a410ed2a4684a1cf5ca55059568fe","abstract_canon_sha256":"a4ebb0310004fc6d288e763d28fc9fa0a71649f5967f2e3e3402de2b07cce9d4"},"schema_version":"1.0"},"canonical_sha256":"8d23b0666f01e7fc32f52bfd77b243d33b1ec1d883858d60210bd41e85f05214","source":{"kind":"arxiv","id":"1401.4159","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4159","created_at":"2026-05-18T02:39:38Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4159v2","created_at":"2026-05-18T02:39:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4159","created_at":"2026-05-18T02:39:38Z"},{"alias_kind":"pith_short_12","alias_value":"RUR3AZTPAHT7","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RUR3AZTPAHT7YMXV","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RUR3AZTP","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:RUR3AZTPAHT7YMXVFP6XPMSD2M","target":"record","payload":{"canonical_record":{"source":{"id":"1401.4159","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-16T20:44:15Z","cross_cats_sorted":[],"title_canon_sha256":"b47b6742d8690b3da06554eada1fd260605a410ed2a4684a1cf5ca55059568fe","abstract_canon_sha256":"a4ebb0310004fc6d288e763d28fc9fa0a71649f5967f2e3e3402de2b07cce9d4"},"schema_version":"1.0"},"canonical_sha256":"8d23b0666f01e7fc32f52bfd77b243d33b1ec1d883858d60210bd41e85f05214","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:38.227697Z","signature_b64":"ynUd6WIKvOg9mn44IBxnBeJZXSoLPNaTKU/164NC86OusqmW3pBEPy0bFLOiqMohos32VAZUsGGDS59vurhjBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d23b0666f01e7fc32f52bfd77b243d33b1ec1d883858d60210bd41e85f05214","last_reissued_at":"2026-05-18T02:39:38.227267Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:38.227267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.4159","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:39:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E8vsOtVw7euV85BD5kDttsTwua/PPOunWsrnY7nkqn60vd7f97bdhFpOV6Htkoyc4MUy+K7ZfvqgI78z2TzLBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:58:26.893809Z"},"content_sha256":"a650620c6adf10d1f9168e07ea855ccf29ddb499c4b2a0246d9d7b4688bed201","schema_version":"1.0","event_id":"sha256:a650620c6adf10d1f9168e07ea855ccf29ddb499c4b2a0246d9d7b4688bed201"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:RUR3AZTPAHT7YMXVFP6XPMSD2M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proof of the $1$-factorization and Hamilton Decomposition Conjectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Allan Lo, Andrew Treglown, B\\'ela Csaba, Daniela K\\\"uhn, Deryk Osthus","submitted_at":"2014-01-16T20:44:15Z","abstract_excerpt":"In this paper we prove the following results (via a unified approach) for all sufficiently large $n$:\n  (i) [$1$-factorization conjecture] Suppose that $n$ is even and $D\\geq 2\\lceil n/4\\rceil -1$. Then every $D$-regular graph $G$ on $n$ vertices has a decomposition into perfect matchings. Equivalently, $\\chi'(G)=D$.\n  (ii) [Hamilton decomposition conjecture] Suppose that $D \\ge \\lfloor n/2 \\rfloor $. Then every $D$-regular graph $G$ on $n$ vertices has a decomposition into Hamilton cycles and at most one perfect matching.\n  (iii) [Optimal packings of Hamilton cycles] Suppose that $G$ is a gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4159","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:39:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KFRM0227op3oZ/ohS4regpl1XSJWnH3pN1gYfs2lOcWvvtugz/ccUVXJFn/GPCtAJ+9IFwbUMm5xx17DyjWoAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:58:26.894276Z"},"content_sha256":"2faf4e984702f94a8d38271043596583def67f980019f2ddff4b4971a119e896","schema_version":"1.0","event_id":"sha256:2faf4e984702f94a8d38271043596583def67f980019f2ddff4b4971a119e896"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RUR3AZTPAHT7YMXVFP6XPMSD2M/bundle.json","state_url":"https://pith.science/pith/RUR3AZTPAHT7YMXVFP6XPMSD2M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RUR3AZTPAHT7YMXVFP6XPMSD2M/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T04:58:26Z","links":{"resolver":"https://pith.science/pith/RUR3AZTPAHT7YMXVFP6XPMSD2M","bundle":"https://pith.science/pith/RUR3AZTPAHT7YMXVFP6XPMSD2M/bundle.json","state":"https://pith.science/pith/RUR3AZTPAHT7YMXVFP6XPMSD2M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RUR3AZTPAHT7YMXVFP6XPMSD2M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RUR3AZTPAHT7YMXVFP6XPMSD2M","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a4ebb0310004fc6d288e763d28fc9fa0a71649f5967f2e3e3402de2b07cce9d4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-16T20:44:15Z","title_canon_sha256":"b47b6742d8690b3da06554eada1fd260605a410ed2a4684a1cf5ca55059568fe"},"schema_version":"1.0","source":{"id":"1401.4159","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4159","created_at":"2026-05-18T02:39:38Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4159v2","created_at":"2026-05-18T02:39:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4159","created_at":"2026-05-18T02:39:38Z"},{"alias_kind":"pith_short_12","alias_value":"RUR3AZTPAHT7","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RUR3AZTPAHT7YMXV","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RUR3AZTP","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:2faf4e984702f94a8d38271043596583def67f980019f2ddff4b4971a119e896","target":"graph","created_at":"2026-05-18T02:39:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper we prove the following results (via a unified approach) for all sufficiently large $n$:\n  (i) [$1$-factorization conjecture] Suppose that $n$ is even and $D\\geq 2\\lceil n/4\\rceil -1$. Then every $D$-regular graph $G$ on $n$ vertices has a decomposition into perfect matchings. Equivalently, $\\chi'(G)=D$.\n  (ii) [Hamilton decomposition conjecture] Suppose that $D \\ge \\lfloor n/2 \\rfloor $. Then every $D$-regular graph $G$ on $n$ vertices has a decomposition into Hamilton cycles and at most one perfect matching.\n  (iii) [Optimal packings of Hamilton cycles] Suppose that $G$ is a gra","authors_text":"Allan Lo, Andrew Treglown, B\\'ela Csaba, Daniela K\\\"uhn, Deryk Osthus","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-16T20:44:15Z","title":"Proof of the $1$-factorization and Hamilton Decomposition Conjectures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4159","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a650620c6adf10d1f9168e07ea855ccf29ddb499c4b2a0246d9d7b4688bed201","target":"record","created_at":"2026-05-18T02:39:38Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a4ebb0310004fc6d288e763d28fc9fa0a71649f5967f2e3e3402de2b07cce9d4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-16T20:44:15Z","title_canon_sha256":"b47b6742d8690b3da06554eada1fd260605a410ed2a4684a1cf5ca55059568fe"},"schema_version":"1.0","source":{"id":"1401.4159","kind":"arxiv","version":2}},"canonical_sha256":"8d23b0666f01e7fc32f52bfd77b243d33b1ec1d883858d60210bd41e85f05214","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d23b0666f01e7fc32f52bfd77b243d33b1ec1d883858d60210bd41e85f05214","first_computed_at":"2026-05-18T02:39:38.227267Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:38.227267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ynUd6WIKvOg9mn44IBxnBeJZXSoLPNaTKU/164NC86OusqmW3pBEPy0bFLOiqMohos32VAZUsGGDS59vurhjBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:38.227697Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.4159","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a650620c6adf10d1f9168e07ea855ccf29ddb499c4b2a0246d9d7b4688bed201","sha256:2faf4e984702f94a8d38271043596583def67f980019f2ddff4b4971a119e896"],"state_sha256":"eb54e71a5348e4670a4344bfbc49288259b4102f804f1c4a9b71400735c2c156"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4/4laBTDetm31J4LNKrCJRT5stiikFO1yeKL/Jw3D8D9NtbtkiE0mpiZJGBxpJ7tnStLjLJwA8aYnPW/Dom8CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T04:58:26.897093Z","bundle_sha256":"03a2b29b15b5b1d9350ab3dfbb3a87dc02f5d5b4bb27a373503ef9f609baf80a"}}