{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YET4NKH2GEEJRF3HPLZRSTZOCF","short_pith_number":"pith:YET4NKH2","schema_version":"1.0","canonical_sha256":"c127c6a8fa31089897677af3194f2e114f8323b240bf20db342b76c78e1dc6e8","source":{"kind":"arxiv","id":"1803.10360","version":3},"attestation_state":"computed","paper":{"title":"Number of 1-factorizations of regular high-degree graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Benny Sudakov, Vishesh Jain","submitted_at":"2018-03-28T00:21:01Z","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"},"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":"1803.10360","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-28T00:21:01Z","cross_cats_sorted":[],"title_canon_sha256":"83f39673acddfecb19ae7e58149dc0e7b41c18620d479100ad2a8dbd67174ab3","abstract_canon_sha256":"cff90038f6f13379897a8eaa8fea649c80da52c62e02f5348a0b9e5a68624a14"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:43.373883Z","signature_b64":"MGCZ/6FT5zzocUj7P1Dt25AkZKaEVBU6MrxiVmnSg7+7aLv1j6QKN8BodsKLxZQegbaQbURCCmyEI8u4XER/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c127c6a8fa31089897677af3194f2e114f8323b240bf20db342b76c78e1dc6e8","last_reissued_at":"2026-05-17T23:42:43.373232Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:43.373232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Number of 1-factorizations of regular high-degree graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Benny Sudakov, Vishesh Jain","submitted_at":"2018-03-28T00:21:01Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10360","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":"1803.10360","created_at":"2026-05-17T23:42:43.373331+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.10360v3","created_at":"2026-05-17T23:42:43.373331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10360","created_at":"2026-05-17T23:42:43.373331+00:00"},{"alias_kind":"pith_short_12","alias_value":"YET4NKH2GEEJ","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YET4NKH2GEEJRF3H","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YET4NKH2","created_at":"2026-05-18T12:33:04.347982+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/YET4NKH2GEEJRF3HPLZRSTZOCF","json":"https://pith.science/pith/YET4NKH2GEEJRF3HPLZRSTZOCF.json","graph_json":"https://pith.science/api/pith-number/YET4NKH2GEEJRF3HPLZRSTZOCF/graph.json","events_json":"https://pith.science/api/pith-number/YET4NKH2GEEJRF3HPLZRSTZOCF/events.json","paper":"https://pith.science/paper/YET4NKH2"},"agent_actions":{"view_html":"https://pith.science/pith/YET4NKH2GEEJRF3HPLZRSTZOCF","download_json":"https://pith.science/pith/YET4NKH2GEEJRF3HPLZRSTZOCF.json","view_paper":"https://pith.science/paper/YET4NKH2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.10360&json=true","fetch_graph":"https://pith.science/api/pith-number/YET4NKH2GEEJRF3HPLZRSTZOCF/graph.json","fetch_events":"https://pith.science/api/pith-number/YET4NKH2GEEJRF3HPLZRSTZOCF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YET4NKH2GEEJRF3HPLZRSTZOCF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YET4NKH2GEEJRF3HPLZRSTZOCF/action/storage_attestation","attest_author":"https://pith.science/pith/YET4NKH2GEEJRF3HPLZRSTZOCF/action/author_attestation","sign_citation":"https://pith.science/pith/YET4NKH2GEEJRF3HPLZRSTZOCF/action/citation_signature","submit_replication":"https://pith.science/pith/YET4NKH2GEEJRF3HPLZRSTZOCF/action/replication_record"}},"created_at":"2026-05-17T23:42:43.373331+00:00","updated_at":"2026-05-17T23:42:43.373331+00:00"}