{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:TLUVNCON6QIREWGNRW55SOC5LU","short_pith_number":"pith:TLUVNCON","schema_version":"1.0","canonical_sha256":"9ae95689cdf4111258cd8dbbd9385d5d251c68138ccbc4136d87585433e4d549","source":{"kind":"arxiv","id":"1010.5192","version":1},"attestation_state":"computed","paper":{"title":"An Asymptotic Version of the Multigraph 1-Factorization Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"E. R. Vaughan","submitted_at":"2010-10-25T17:11:41Z","abstract_excerpt":"We give a self-contained proof that for all positive integers $r$ and all $\\epsilon > 0$, there is an integer $N = N(r, \\epsilon)$ such that for all $n \\ge N$ any regular multigraph of order $2n$ with multiplicity at most $r$ and degree at least $(1+\\epsilon)rn$ is 1-factorizable. This generalizes results of Perkovi{\\'c} and Reed, and Plantholt and Tipnis."},"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":"1010.5192","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-25T17:11:41Z","cross_cats_sorted":[],"title_canon_sha256":"d16e5b44d50a393a05ef020fa84f380b82e5d5bbd7164a21103281c558d44b67","abstract_canon_sha256":"512863d136619412239f9a93cb97231cbfac04a8bf45c85fb82c31553489f527"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:38:49.176404Z","signature_b64":"vc7ww8O+wC1rODeCof0lD0P7NmYAHhY7at1+XfIo/v34a3hKFMwDAqjNQEPDbfzh/oc1vaog22JJ6SOOBEQVAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ae95689cdf4111258cd8dbbd9385d5d251c68138ccbc4136d87585433e4d549","last_reissued_at":"2026-05-18T04:38:49.175918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:38:49.175918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Asymptotic Version of the Multigraph 1-Factorization Conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"E. R. Vaughan","submitted_at":"2010-10-25T17:11:41Z","abstract_excerpt":"We give a self-contained proof that for all positive integers $r$ and all $\\epsilon > 0$, there is an integer $N = N(r, \\epsilon)$ such that for all $n \\ge N$ any regular multigraph of order $2n$ with multiplicity at most $r$ and degree at least $(1+\\epsilon)rn$ is 1-factorizable. This generalizes results of Perkovi{\\'c} and Reed, and Plantholt and Tipnis."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5192","kind":"arxiv","version":1},"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":"1010.5192","created_at":"2026-05-18T04:38:49.175987+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.5192v1","created_at":"2026-05-18T04:38:49.175987+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5192","created_at":"2026-05-18T04:38:49.175987+00:00"},{"alias_kind":"pith_short_12","alias_value":"TLUVNCON6QIR","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"TLUVNCON6QIREWGN","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"TLUVNCON","created_at":"2026-05-18T12:26:13.927090+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/TLUVNCON6QIREWGNRW55SOC5LU","json":"https://pith.science/pith/TLUVNCON6QIREWGNRW55SOC5LU.json","graph_json":"https://pith.science/api/pith-number/TLUVNCON6QIREWGNRW55SOC5LU/graph.json","events_json":"https://pith.science/api/pith-number/TLUVNCON6QIREWGNRW55SOC5LU/events.json","paper":"https://pith.science/paper/TLUVNCON"},"agent_actions":{"view_html":"https://pith.science/pith/TLUVNCON6QIREWGNRW55SOC5LU","download_json":"https://pith.science/pith/TLUVNCON6QIREWGNRW55SOC5LU.json","view_paper":"https://pith.science/paper/TLUVNCON","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.5192&json=true","fetch_graph":"https://pith.science/api/pith-number/TLUVNCON6QIREWGNRW55SOC5LU/graph.json","fetch_events":"https://pith.science/api/pith-number/TLUVNCON6QIREWGNRW55SOC5LU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TLUVNCON6QIREWGNRW55SOC5LU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TLUVNCON6QIREWGNRW55SOC5LU/action/storage_attestation","attest_author":"https://pith.science/pith/TLUVNCON6QIREWGNRW55SOC5LU/action/author_attestation","sign_citation":"https://pith.science/pith/TLUVNCON6QIREWGNRW55SOC5LU/action/citation_signature","submit_replication":"https://pith.science/pith/TLUVNCON6QIREWGNRW55SOC5LU/action/replication_record"}},"created_at":"2026-05-18T04:38:49.175987+00:00","updated_at":"2026-05-18T04:38:49.175987+00:00"}