{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WBQME2PTWB5TKXHPXJXQBTRTPO","short_pith_number":"pith:WBQME2PT","schema_version":"1.0","canonical_sha256":"b060c269f3b07b355cefba6f00ce337bb5772e3e5d571a1eef466691c5232e83","source":{"kind":"arxiv","id":"1307.2536","version":1},"attestation_state":"computed","paper":{"title":"Greedy Online Bipartite Matching on Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrew Mastin, Patrick Jaillet","submitted_at":"2013-07-09T18:24:09Z","abstract_excerpt":"We study the average performance of online greedy matching algorithms on $G(n,n,p)$, the random bipartite graph with $n$ vertices on each side and edges occurring independently with probability $p=p(n)$. In the online model, vertices on one side of the graph are given up front while vertices on the other side arrive sequentially; when a vertex arrives its edges are revealed and it must be immediately matched or dropped. We begin by analyzing the \\textsc{oblivious} algorithm, which tries to match each arriving vertex to a random neighbor, even if the neighbor has already been matched. The algor"},"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":"1307.2536","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-09T18:24:09Z","cross_cats_sorted":[],"title_canon_sha256":"99cad7086f5951cf4830202b9ef0915b4a1efe9b974cdf36e110b215614504f1","abstract_canon_sha256":"07c297c642f8b7ad78d945ec4745f45dc29c041740099724b02018120513bc03"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:52.252942Z","signature_b64":"oAQ+IrEZDiGfV8vRLFmgdBdugjXDqiPoWZGs8OYfPJ0P98c5HbKVZw3QjyKHlZxHpdwEZbCiAekflUKo8582Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b060c269f3b07b355cefba6f00ce337bb5772e3e5d571a1eef466691c5232e83","last_reissued_at":"2026-05-18T03:18:52.252157Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:52.252157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Greedy Online Bipartite Matching on Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrew Mastin, Patrick Jaillet","submitted_at":"2013-07-09T18:24:09Z","abstract_excerpt":"We study the average performance of online greedy matching algorithms on $G(n,n,p)$, the random bipartite graph with $n$ vertices on each side and edges occurring independently with probability $p=p(n)$. In the online model, vertices on one side of the graph are given up front while vertices on the other side arrive sequentially; when a vertex arrives its edges are revealed and it must be immediately matched or dropped. We begin by analyzing the \\textsc{oblivious} algorithm, which tries to match each arriving vertex to a random neighbor, even if the neighbor has already been matched. The algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2536","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":"1307.2536","created_at":"2026-05-18T03:18:52.252288+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.2536v1","created_at":"2026-05-18T03:18:52.252288+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2536","created_at":"2026-05-18T03:18:52.252288+00:00"},{"alias_kind":"pith_short_12","alias_value":"WBQME2PTWB5T","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"WBQME2PTWB5TKXHP","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"WBQME2PT","created_at":"2026-05-18T12:28:04.890932+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/WBQME2PTWB5TKXHPXJXQBTRTPO","json":"https://pith.science/pith/WBQME2PTWB5TKXHPXJXQBTRTPO.json","graph_json":"https://pith.science/api/pith-number/WBQME2PTWB5TKXHPXJXQBTRTPO/graph.json","events_json":"https://pith.science/api/pith-number/WBQME2PTWB5TKXHPXJXQBTRTPO/events.json","paper":"https://pith.science/paper/WBQME2PT"},"agent_actions":{"view_html":"https://pith.science/pith/WBQME2PTWB5TKXHPXJXQBTRTPO","download_json":"https://pith.science/pith/WBQME2PTWB5TKXHPXJXQBTRTPO.json","view_paper":"https://pith.science/paper/WBQME2PT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.2536&json=true","fetch_graph":"https://pith.science/api/pith-number/WBQME2PTWB5TKXHPXJXQBTRTPO/graph.json","fetch_events":"https://pith.science/api/pith-number/WBQME2PTWB5TKXHPXJXQBTRTPO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WBQME2PTWB5TKXHPXJXQBTRTPO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WBQME2PTWB5TKXHPXJXQBTRTPO/action/storage_attestation","attest_author":"https://pith.science/pith/WBQME2PTWB5TKXHPXJXQBTRTPO/action/author_attestation","sign_citation":"https://pith.science/pith/WBQME2PTWB5TKXHPXJXQBTRTPO/action/citation_signature","submit_replication":"https://pith.science/pith/WBQME2PTWB5TKXHPXJXQBTRTPO/action/replication_record"}},"created_at":"2026-05-18T03:18:52.252288+00:00","updated_at":"2026-05-18T03:18:52.252288+00:00"}