{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:TLUVNCON6QIREWGNRW55SOC5LU","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":"512863d136619412239f9a93cb97231cbfac04a8bf45c85fb82c31553489f527","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-25T17:11:41Z","title_canon_sha256":"d16e5b44d50a393a05ef020fa84f380b82e5d5bbd7164a21103281c558d44b67"},"schema_version":"1.0","source":{"id":"1010.5192","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.5192","created_at":"2026-05-18T04:38:49Z"},{"alias_kind":"arxiv_version","alias_value":"1010.5192v1","created_at":"2026-05-18T04:38:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5192","created_at":"2026-05-18T04:38:49Z"},{"alias_kind":"pith_short_12","alias_value":"TLUVNCON6QIR","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"TLUVNCON6QIREWGN","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"TLUVNCON","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:6a8b5075130add1fc1ea08adfd0e1418bbf4a258475a42a139037bc907fa72e1","target":"graph","created_at":"2026-05-18T04:38:49Z","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":"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.","authors_text":"E. R. Vaughan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-25T17:11:41Z","title":"An Asymptotic Version of the Multigraph 1-Factorization Conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5192","kind":"arxiv","version":1},"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:93e813a6de2e6c471e72d447093b451916423c4099576a009a5743105af766b3","target":"record","created_at":"2026-05-18T04:38:49Z","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":"512863d136619412239f9a93cb97231cbfac04a8bf45c85fb82c31553489f527","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-25T17:11:41Z","title_canon_sha256":"d16e5b44d50a393a05ef020fa84f380b82e5d5bbd7164a21103281c558d44b67"},"schema_version":"1.0","source":{"id":"1010.5192","kind":"arxiv","version":1}},"canonical_sha256":"9ae95689cdf4111258cd8dbbd9385d5d251c68138ccbc4136d87585433e4d549","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ae95689cdf4111258cd8dbbd9385d5d251c68138ccbc4136d87585433e4d549","first_computed_at":"2026-05-18T04:38:49.175918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:38:49.175918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vc7ww8O+wC1rODeCof0lD0P7NmYAHhY7at1+XfIo/v34a3hKFMwDAqjNQEPDbfzh/oc1vaog22JJ6SOOBEQVAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:38:49.176404Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.5192","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93e813a6de2e6c471e72d447093b451916423c4099576a009a5743105af766b3","sha256:6a8b5075130add1fc1ea08adfd0e1418bbf4a258475a42a139037bc907fa72e1"],"state_sha256":"b219d5cd21e88c69120f52d596bcf09be89e2fffbf0d3e35c88a280e502ee531"}