{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:2PYHOT7QFJ3OB4RJYUYMWI5WLI","short_pith_number":"pith:2PYHOT7Q","schema_version":"1.0","canonical_sha256":"d3f0774ff02a76e0f229c530cb23b65a2e4c0682265985d91513d9c21eae0339","source":{"kind":"arxiv","id":"0909.3346","version":3},"attestation_state":"computed","paper":{"title":"Perfect Matchings in O(n \\log n) Time in Regular Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Ashish Goel, Michael Kapralov, Sanjeev Khanna","submitted_at":"2009-09-18T02:11:43Z","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"},"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":"0909.3346","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-09-18T02:11:43Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"63d87c69a564ba7cbaa3cd4622c1d0ae176cb0dadd967a648d1c1c10b022fa46","abstract_canon_sha256":"a3cfba8ac12729cd7f2dba45f0a1671a1e499f5e30e08c7dd362f177eb946b6c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:36:08.857934Z","signature_b64":"LiPiBi5eq5UCF1LWxVrT2QeVfdiV2w1Qb70BB0vegQ/RHLcdlgOut6sBJmlOJQ/PurhGJA9Kjy/aLDUfFa7lDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3f0774ff02a76e0f229c530cb23b65a2e4c0682265985d91513d9c21eae0339","last_reissued_at":"2026-05-18T04:36:08.857411Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:36:08.857411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfect Matchings in O(n \\log n) Time in Regular Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Ashish Goel, Michael Kapralov, Sanjeev Khanna","submitted_at":"2009-09-18T02:11:43Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.3346","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":"0909.3346","created_at":"2026-05-18T04:36:08.857504+00:00"},{"alias_kind":"arxiv_version","alias_value":"0909.3346v3","created_at":"2026-05-18T04:36:08.857504+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.3346","created_at":"2026-05-18T04:36:08.857504+00:00"},{"alias_kind":"pith_short_12","alias_value":"2PYHOT7QFJ3O","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"2PYHOT7QFJ3OB4RJ","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"2PYHOT7Q","created_at":"2026-05-18T12:25:58.018023+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/2PYHOT7QFJ3OB4RJYUYMWI5WLI","json":"https://pith.science/pith/2PYHOT7QFJ3OB4RJYUYMWI5WLI.json","graph_json":"https://pith.science/api/pith-number/2PYHOT7QFJ3OB4RJYUYMWI5WLI/graph.json","events_json":"https://pith.science/api/pith-number/2PYHOT7QFJ3OB4RJYUYMWI5WLI/events.json","paper":"https://pith.science/paper/2PYHOT7Q"},"agent_actions":{"view_html":"https://pith.science/pith/2PYHOT7QFJ3OB4RJYUYMWI5WLI","download_json":"https://pith.science/pith/2PYHOT7QFJ3OB4RJYUYMWI5WLI.json","view_paper":"https://pith.science/paper/2PYHOT7Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0909.3346&json=true","fetch_graph":"https://pith.science/api/pith-number/2PYHOT7QFJ3OB4RJYUYMWI5WLI/graph.json","fetch_events":"https://pith.science/api/pith-number/2PYHOT7QFJ3OB4RJYUYMWI5WLI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2PYHOT7QFJ3OB4RJYUYMWI5WLI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2PYHOT7QFJ3OB4RJYUYMWI5WLI/action/storage_attestation","attest_author":"https://pith.science/pith/2PYHOT7QFJ3OB4RJYUYMWI5WLI/action/author_attestation","sign_citation":"https://pith.science/pith/2PYHOT7QFJ3OB4RJYUYMWI5WLI/action/citation_signature","submit_replication":"https://pith.science/pith/2PYHOT7QFJ3OB4RJYUYMWI5WLI/action/replication_record"}},"created_at":"2026-05-18T04:36:08.857504+00:00","updated_at":"2026-05-18T04:36:08.857504+00:00"}