{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:2PYHOT7QFJ3OB4RJYUYMWI5WLI","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":"a3cfba8ac12729cd7f2dba45f0a1671a1e499f5e30e08c7dd362f177eb946b6c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-09-18T02:11:43Z","title_canon_sha256":"63d87c69a564ba7cbaa3cd4622c1d0ae176cb0dadd967a648d1c1c10b022fa46"},"schema_version":"1.0","source":{"id":"0909.3346","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.3346","created_at":"2026-05-18T04:36:08Z"},{"alias_kind":"arxiv_version","alias_value":"0909.3346v3","created_at":"2026-05-18T04:36:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.3346","created_at":"2026-05-18T04:36:08Z"},{"alias_kind":"pith_short_12","alias_value":"2PYHOT7QFJ3O","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"2PYHOT7QFJ3OB4RJ","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"2PYHOT7Q","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:760cb16d70fcc6c99ab42240de80ed72903bd7ae0bd1faa299863ce794b1431a","target":"graph","created_at":"2026-05-18T04:36:08Z","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 this paper we consider the well-studied problem of finding a perfect matching in a d-regular bipartite graph on 2n nodes with m=nd edges. The best-known algorithm for general bipartite graphs (due to Hopcroft and Karp) takes time O(m\\sqrt{n}). In regular bipartite graphs, however, a matching is known to be computable in O(m) time (due to Cole, Ost and Schirra). In a recent line of work by Goel, Kapralov and Khanna the O(m) time algorithm was improved first to \\tilde O(min{m, n^{2.5}/d}) and then to \\tilde O(min{m, n^2/d}). It was also shown that the latter algorithm is optimal up to polylog","authors_text":"Ashish Goel, Michael Kapralov, Sanjeev Khanna","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-09-18T02:11:43Z","title":"Perfect Matchings in O(n \\log n) Time in Regular Bipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.3346","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:88ce29005990b3dd2a33b1951df465ac021a890a0e55082d35d97a6a54ad91e6","target":"record","created_at":"2026-05-18T04:36:08Z","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":"a3cfba8ac12729cd7f2dba45f0a1671a1e499f5e30e08c7dd362f177eb946b6c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-09-18T02:11:43Z","title_canon_sha256":"63d87c69a564ba7cbaa3cd4622c1d0ae176cb0dadd967a648d1c1c10b022fa46"},"schema_version":"1.0","source":{"id":"0909.3346","kind":"arxiv","version":3}},"canonical_sha256":"d3f0774ff02a76e0f229c530cb23b65a2e4c0682265985d91513d9c21eae0339","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3f0774ff02a76e0f229c530cb23b65a2e4c0682265985d91513d9c21eae0339","first_computed_at":"2026-05-18T04:36:08.857411Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:36:08.857411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LiPiBi5eq5UCF1LWxVrT2QeVfdiV2w1Qb70BB0vegQ/RHLcdlgOut6sBJmlOJQ/PurhGJA9Kjy/aLDUfFa7lDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:36:08.857934Z","signed_message":"canonical_sha256_bytes"},"source_id":"0909.3346","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88ce29005990b3dd2a33b1951df465ac021a890a0e55082d35d97a6a54ad91e6","sha256:760cb16d70fcc6c99ab42240de80ed72903bd7ae0bd1faa299863ce794b1431a"],"state_sha256":"05e1c49714a137a995c43bec3520812328cd231ab4dbe65930c00807b482d687"}