{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5W4CMLKNLKAIDFJ3U4SVNT7V4D","short_pith_number":"pith:5W4CMLKN","canonical_record":{"source":{"id":"1401.0119","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-31T09:41:59Z","cross_cats_sorted":[],"title_canon_sha256":"58c80841593562c838aaad27acb56648f2dfe9eee88ebca11187d9f141f6a774","abstract_canon_sha256":"a76fc8a8da69b483c707f940903ae6001383e30396ec17f07e359b18e74949ef"},"schema_version":"1.0"},"canonical_sha256":"edb8262d4d5a8081953ba72556cff5e0c91219b6e4c5b89f28f913d53e30b0bb","source":{"kind":"arxiv","id":"1401.0119","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0119","created_at":"2026-05-18T00:46:56Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0119v1","created_at":"2026-05-18T00:46:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0119","created_at":"2026-05-18T00:46:56Z"},{"alias_kind":"pith_short_12","alias_value":"5W4CMLKNLKAI","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5W4CMLKNLKAIDFJ3","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5W4CMLKN","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5W4CMLKNLKAIDFJ3U4SVNT7V4D","target":"record","payload":{"canonical_record":{"source":{"id":"1401.0119","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-31T09:41:59Z","cross_cats_sorted":[],"title_canon_sha256":"58c80841593562c838aaad27acb56648f2dfe9eee88ebca11187d9f141f6a774","abstract_canon_sha256":"a76fc8a8da69b483c707f940903ae6001383e30396ec17f07e359b18e74949ef"},"schema_version":"1.0"},"canonical_sha256":"edb8262d4d5a8081953ba72556cff5e0c91219b6e4c5b89f28f913d53e30b0bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:56.024405Z","signature_b64":"Y/iR5HRj0wct3xeeq4DugnqFo5HgHTAEvZ/RzbkC4zpc4eFic8TZT9DEMFbMmc6bme0EH7kHfxU8K5EprP6TAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edb8262d4d5a8081953ba72556cff5e0c91219b6e4c5b89f28f913d53e30b0bb","last_reissued_at":"2026-05-18T00:46:56.023913Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:56.023913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.0119","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:46:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HgJ6PtXTK9t0/OgpSBQU/d1UpK2k/gX6EEgtpD23B9Q554CqQklmGUE3vFcAGRHpyEDRoG/IQARGA9EGfgoyDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:24:25.473366Z"},"content_sha256":"0ab86ca8e31c24296b10b046db9a8179a874564e0a080250341bce762614fd65","schema_version":"1.0","event_id":"sha256:0ab86ca8e31c24296b10b046db9a8179a874564e0a080250341bce762614fd65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5W4CMLKNLKAIDFJ3U4SVNT7V4D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Expected time complexity of the auction algorithm and the push relabel algorithm for maximal bipartite matching on random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amir Leshem, Oshri Naparstek","submitted_at":"2013-12-31T09:41:59Z","abstract_excerpt":"In this paper we analyze the expected time complexity of the auction algorithm for the matching problem on random bipartite graphs. We prove that the expected time complexity of the auction algorithm for bipartite matching is $O\\left(\\frac{N\\log^2(N)}{\\log\\left(Np\\right)}\\right)$ on sequential machines. This is equivalent to other augmenting path algorithms such as the HK algorithm. Furthermore, we show that the algorithm can be implemented on parallel machines with $O(\\log(N))$ processors and shared memory with an expected time complexity of $O(N\\log(N))$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0119","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:46:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8NzsINRwmzLMRSVRFe5gIZHiyojQfETIq0Ehf4UIWbEchqj4o00zHmgxPj1ZRWx8hSsbP3hYsBPpo3+bsY0qCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:24:25.474035Z"},"content_sha256":"a83529fb2dcd114c9582cfe7018580d0f78a488e362f53b1d50bb89f39714eb2","schema_version":"1.0","event_id":"sha256:a83529fb2dcd114c9582cfe7018580d0f78a488e362f53b1d50bb89f39714eb2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5W4CMLKNLKAIDFJ3U4SVNT7V4D/bundle.json","state_url":"https://pith.science/pith/5W4CMLKNLKAIDFJ3U4SVNT7V4D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5W4CMLKNLKAIDFJ3U4SVNT7V4D/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T02:24:25Z","links":{"resolver":"https://pith.science/pith/5W4CMLKNLKAIDFJ3U4SVNT7V4D","bundle":"https://pith.science/pith/5W4CMLKNLKAIDFJ3U4SVNT7V4D/bundle.json","state":"https://pith.science/pith/5W4CMLKNLKAIDFJ3U4SVNT7V4D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5W4CMLKNLKAIDFJ3U4SVNT7V4D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5W4CMLKNLKAIDFJ3U4SVNT7V4D","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":"a76fc8a8da69b483c707f940903ae6001383e30396ec17f07e359b18e74949ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-31T09:41:59Z","title_canon_sha256":"58c80841593562c838aaad27acb56648f2dfe9eee88ebca11187d9f141f6a774"},"schema_version":"1.0","source":{"id":"1401.0119","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0119","created_at":"2026-05-18T00:46:56Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0119v1","created_at":"2026-05-18T00:46:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0119","created_at":"2026-05-18T00:46:56Z"},{"alias_kind":"pith_short_12","alias_value":"5W4CMLKNLKAI","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5W4CMLKNLKAIDFJ3","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5W4CMLKN","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:a83529fb2dcd114c9582cfe7018580d0f78a488e362f53b1d50bb89f39714eb2","target":"graph","created_at":"2026-05-18T00:46:56Z","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 analyze the expected time complexity of the auction algorithm for the matching problem on random bipartite graphs. We prove that the expected time complexity of the auction algorithm for bipartite matching is $O\\left(\\frac{N\\log^2(N)}{\\log\\left(Np\\right)}\\right)$ on sequential machines. This is equivalent to other augmenting path algorithms such as the HK algorithm. Furthermore, we show that the algorithm can be implemented on parallel machines with $O(\\log(N))$ processors and shared memory with an expected time complexity of $O(N\\log(N))$.","authors_text":"Amir Leshem, Oshri Naparstek","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-31T09:41:59Z","title":"Expected time complexity of the auction algorithm and the push relabel algorithm for maximal bipartite matching on random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0119","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:0ab86ca8e31c24296b10b046db9a8179a874564e0a080250341bce762614fd65","target":"record","created_at":"2026-05-18T00:46:56Z","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":"a76fc8a8da69b483c707f940903ae6001383e30396ec17f07e359b18e74949ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-31T09:41:59Z","title_canon_sha256":"58c80841593562c838aaad27acb56648f2dfe9eee88ebca11187d9f141f6a774"},"schema_version":"1.0","source":{"id":"1401.0119","kind":"arxiv","version":1}},"canonical_sha256":"edb8262d4d5a8081953ba72556cff5e0c91219b6e4c5b89f28f913d53e30b0bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"edb8262d4d5a8081953ba72556cff5e0c91219b6e4c5b89f28f913d53e30b0bb","first_computed_at":"2026-05-18T00:46:56.023913Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:56.023913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y/iR5HRj0wct3xeeq4DugnqFo5HgHTAEvZ/RzbkC4zpc4eFic8TZT9DEMFbMmc6bme0EH7kHfxU8K5EprP6TAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:56.024405Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.0119","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ab86ca8e31c24296b10b046db9a8179a874564e0a080250341bce762614fd65","sha256:a83529fb2dcd114c9582cfe7018580d0f78a488e362f53b1d50bb89f39714eb2"],"state_sha256":"3b497dfba734731629b809233eda9fe796492bfd612458915fa437f0693feb18"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jyg9Vzw0zVuNaZjk86n6XXklw8g6CUIIdvI23jGqsBkLAhTNAmApgD9UkIcbbvcaZl/1HVwFALaSQpGvUmCsDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T02:24:25.477380Z","bundle_sha256":"824f4e3c70410bbcfb3f92532901796bebc726949b3f701dd7cfb5d6f122fb5f"}}