{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YET4NKH2GEEJRF3HPLZRSTZOCF","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":"cff90038f6f13379897a8eaa8fea649c80da52c62e02f5348a0b9e5a68624a14","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-28T00:21:01Z","title_canon_sha256":"83f39673acddfecb19ae7e58149dc0e7b41c18620d479100ad2a8dbd67174ab3"},"schema_version":"1.0","source":{"id":"1803.10360","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.10360","created_at":"2026-05-17T23:42:43Z"},{"alias_kind":"arxiv_version","alias_value":"1803.10360v3","created_at":"2026-05-17T23:42:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10360","created_at":"2026-05-17T23:42:43Z"},{"alias_kind":"pith_short_12","alias_value":"YET4NKH2GEEJ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YET4NKH2GEEJRF3H","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YET4NKH2","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:591c7f4b2293cb52809a53e01dc83316499fac1deab44dac2ce640fa0278757f","target":"graph","created_at":"2026-05-17T23:42:43Z","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":"A $1$-factor in an $n$-vertex graph $G$ is a collection of $\\frac{n}{2}$ vertex-disjoint edges and a $1$-factorization of $G$ is a partition of its edges into edge-disjoint $1$-factors. Clearly, a $1$-factorization of $G$ cannot exist unless $n$ is even and $G$ is regular (that is, all vertices are of the same degree). The problem of finding $1$-factorizations in graphs goes back to a paper of Kirkman in 1847 and has been extensively studied since then. Deciding whether a graph has a $1$-factorization is usually a very difficult question. For example, it took more than 60 years and an impressi","authors_text":"Asaf Ferber, Benny Sudakov, Vishesh Jain","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-28T00:21:01Z","title":"Number of 1-factorizations of regular high-degree graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10360","kind":"arxiv","version":3},"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:994bd35d462d68515916d55571b8cfc879835ce5b1dd8191fc5ebed83c5db8f8","target":"record","created_at":"2026-05-17T23:42:43Z","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":"cff90038f6f13379897a8eaa8fea649c80da52c62e02f5348a0b9e5a68624a14","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-28T00:21:01Z","title_canon_sha256":"83f39673acddfecb19ae7e58149dc0e7b41c18620d479100ad2a8dbd67174ab3"},"schema_version":"1.0","source":{"id":"1803.10360","kind":"arxiv","version":3}},"canonical_sha256":"c127c6a8fa31089897677af3194f2e114f8323b240bf20db342b76c78e1dc6e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c127c6a8fa31089897677af3194f2e114f8323b240bf20db342b76c78e1dc6e8","first_computed_at":"2026-05-17T23:42:43.373232Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:43.373232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MGCZ/6FT5zzocUj7P1Dt25AkZKaEVBU6MrxiVmnSg7+7aLv1j6QKN8BodsKLxZQegbaQbURCCmyEI8u4XER/AQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:43.373883Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.10360","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:994bd35d462d68515916d55571b8cfc879835ce5b1dd8191fc5ebed83c5db8f8","sha256:591c7f4b2293cb52809a53e01dc83316499fac1deab44dac2ce640fa0278757f"],"state_sha256":"84d703afbc2a9557cc7515ef68db59d9ef782221eb4c7334c76ce8da4800b3ba"}