{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WA3GU5U4BU4Q6MV4FYMAR6TIZD","short_pith_number":"pith:WA3GU5U4","canonical_record":{"source":{"id":"1401.4164","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-16T20:54:20Z","cross_cats_sorted":[],"title_canon_sha256":"b0febe20376fcadbbdea18134fd2b47a389c0f2009a7dc7a341ceb87f3a8fe1d","abstract_canon_sha256":"a8c5c3fffac2b62ec89ee248164bb7fc702c495d38a6fe50986a16af8c118225"},"schema_version":"1.0"},"canonical_sha256":"b0366a769c0d390f32bc2e1808fa68c8f2f773a4070749c8aef88ea6e347db83","source":{"kind":"arxiv","id":"1401.4164","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4164","created_at":"2026-05-18T02:39:32Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4164v2","created_at":"2026-05-18T02:39:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4164","created_at":"2026-05-18T02:39:32Z"},{"alias_kind":"pith_short_12","alias_value":"WA3GU5U4BU4Q","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WA3GU5U4BU4Q6MV4","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WA3GU5U4","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WA3GU5U4BU4Q6MV4FYMAR6TIZD","target":"record","payload":{"canonical_record":{"source":{"id":"1401.4164","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-16T20:54:20Z","cross_cats_sorted":[],"title_canon_sha256":"b0febe20376fcadbbdea18134fd2b47a389c0f2009a7dc7a341ceb87f3a8fe1d","abstract_canon_sha256":"a8c5c3fffac2b62ec89ee248164bb7fc702c495d38a6fe50986a16af8c118225"},"schema_version":"1.0"},"canonical_sha256":"b0366a769c0d390f32bc2e1808fa68c8f2f773a4070749c8aef88ea6e347db83","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:32.051824Z","signature_b64":"c1X5sS621vuZGGRKoFtC/Dsd4e/Dk2DsNx+6F3C4iiIaRPKNRQJgIovwVKx2iKdZdD05EF9IFR8SjnBeR0EUAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0366a769c0d390f32bc2e1808fa68c8f2f773a4070749c8aef88ea6e347db83","last_reissued_at":"2026-05-18T02:39:32.051224Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:32.051224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.4164","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:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KzRdJ7iQjEwF3Cxb6eSfnE9pngVPMRZQXqjrJfh06LZN/WR0FvXH4ZSDbmpV83Q8e2fDlshrGkBpzkZluyAmBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:06:08.457511Z"},"content_sha256":"4d16e8d1d2f3ea44fa25a3b76d428e258a24273a2c4fec522977e084e2976390","schema_version":"1.0","event_id":"sha256:4d16e8d1d2f3ea44fa25a3b76d428e258a24273a2c4fec522977e084e2976390"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WA3GU5U4BU4Q6MV4FYMAR6TIZD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proof of the 1-factorization and Hamilton decomposition conjectures II: the bipartite case","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:54:20Z","abstract_excerpt":"In a sequence of four papers, 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 th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4164","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:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"474gF7gvw1ECDwWnNbJ8ENEqcuyYWbfs2Lo+aMbknuuMb9e9V1cydpJ8cMo+8AkgDe6uFkj09mZsKAy8Wwf9BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:06:08.457880Z"},"content_sha256":"35f095f0f2014d5867aa6898924c3c8cd09dd8b68f5525283fc8f4ff2671cb09","schema_version":"1.0","event_id":"sha256:35f095f0f2014d5867aa6898924c3c8cd09dd8b68f5525283fc8f4ff2671cb09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WA3GU5U4BU4Q6MV4FYMAR6TIZD/bundle.json","state_url":"https://pith.science/pith/WA3GU5U4BU4Q6MV4FYMAR6TIZD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WA3GU5U4BU4Q6MV4FYMAR6TIZD/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-31T04:06:08Z","links":{"resolver":"https://pith.science/pith/WA3GU5U4BU4Q6MV4FYMAR6TIZD","bundle":"https://pith.science/pith/WA3GU5U4BU4Q6MV4FYMAR6TIZD/bundle.json","state":"https://pith.science/pith/WA3GU5U4BU4Q6MV4FYMAR6TIZD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WA3GU5U4BU4Q6MV4FYMAR6TIZD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WA3GU5U4BU4Q6MV4FYMAR6TIZD","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":"a8c5c3fffac2b62ec89ee248164bb7fc702c495d38a6fe50986a16af8c118225","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-16T20:54:20Z","title_canon_sha256":"b0febe20376fcadbbdea18134fd2b47a389c0f2009a7dc7a341ceb87f3a8fe1d"},"schema_version":"1.0","source":{"id":"1401.4164","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4164","created_at":"2026-05-18T02:39:32Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4164v2","created_at":"2026-05-18T02:39:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4164","created_at":"2026-05-18T02:39:32Z"},{"alias_kind":"pith_short_12","alias_value":"WA3GU5U4BU4Q","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WA3GU5U4BU4Q6MV4","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WA3GU5U4","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:35f095f0f2014d5867aa6898924c3c8cd09dd8b68f5525283fc8f4ff2671cb09","target":"graph","created_at":"2026-05-18T02:39:32Z","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 a sequence of four papers, 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 th","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:54:20Z","title":"Proof of the 1-factorization and Hamilton decomposition conjectures II: the bipartite case"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4164","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:4d16e8d1d2f3ea44fa25a3b76d428e258a24273a2c4fec522977e084e2976390","target":"record","created_at":"2026-05-18T02:39:32Z","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":"a8c5c3fffac2b62ec89ee248164bb7fc702c495d38a6fe50986a16af8c118225","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-16T20:54:20Z","title_canon_sha256":"b0febe20376fcadbbdea18134fd2b47a389c0f2009a7dc7a341ceb87f3a8fe1d"},"schema_version":"1.0","source":{"id":"1401.4164","kind":"arxiv","version":2}},"canonical_sha256":"b0366a769c0d390f32bc2e1808fa68c8f2f773a4070749c8aef88ea6e347db83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b0366a769c0d390f32bc2e1808fa68c8f2f773a4070749c8aef88ea6e347db83","first_computed_at":"2026-05-18T02:39:32.051224Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:32.051224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c1X5sS621vuZGGRKoFtC/Dsd4e/Dk2DsNx+6F3C4iiIaRPKNRQJgIovwVKx2iKdZdD05EF9IFR8SjnBeR0EUAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:32.051824Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.4164","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d16e8d1d2f3ea44fa25a3b76d428e258a24273a2c4fec522977e084e2976390","sha256:35f095f0f2014d5867aa6898924c3c8cd09dd8b68f5525283fc8f4ff2671cb09"],"state_sha256":"ffffbdc82d4d62b4d7d99f0ab95feb823cddf1b1eb0a47204b9fa64160422eec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9W7VsTb65HFZhgbaS1Grf+QkrRS4lnqGh6nq3y0oHCkdpc1EwIjrJW3d3WzHIK/8PggYFmNn3s/5ozbKVGC3Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:06:08.459849Z","bundle_sha256":"05282f9b74c7ce48838207e82010a5fbf0328efbee41c67229eb224283532a97"}}