{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WBQME2PTWB5TKXHPXJXQBTRTPO","short_pith_number":"pith:WBQME2PT","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"},"canonical_sha256":"b060c269f3b07b355cefba6f00ce337bb5772e3e5d571a1eef466691c5232e83","source":{"kind":"arxiv","id":"1307.2536","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.2536","created_at":"2026-05-18T03:18:52Z"},{"alias_kind":"arxiv_version","alias_value":"1307.2536v1","created_at":"2026-05-18T03:18:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2536","created_at":"2026-05-18T03:18:52Z"},{"alias_kind":"pith_short_12","alias_value":"WBQME2PTWB5T","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WBQME2PTWB5TKXHP","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WBQME2PT","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WBQME2PTWB5TKXHPXJXQBTRTPO","target":"record","payload":{"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"},"canonical_sha256":"b060c269f3b07b355cefba6f00ce337bb5772e3e5d571a1eef466691c5232e83","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"},"source_kind":"arxiv","source_id":"1307.2536","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-18T03:18:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aR6OivAFx+VHrTvz0ZAg+YbxHDcS6fftOHcMgfLq/CUxGrkAltdXP81A6Hd8jl0/pkw9MfSCS4uTOUymPzxUBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:19:11.670826Z"},"content_sha256":"473d78ebebb080408fa01b5058bc0112d0432d36ce2bf6462660670bf51395ef","schema_version":"1.0","event_id":"sha256:473d78ebebb080408fa01b5058bc0112d0432d36ce2bf6462660670bf51395ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WBQME2PTWB5TKXHPXJXQBTRTPO","target":"graph","payload":{"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"},"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-18T03:18:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"celSq54dyOxWPvFqXtgZPyVFGmlHrjvfmBZZrMc8bvZzy9um7OFRCO25PVUVvBl3//8LmpB82UeM00THrn9vCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:19:11.671369Z"},"content_sha256":"039963e22c03aef35fb36f5fed14e60f0685f76c491b5bef6cf089a60eb881a7","schema_version":"1.0","event_id":"sha256:039963e22c03aef35fb36f5fed14e60f0685f76c491b5bef6cf089a60eb881a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WBQME2PTWB5TKXHPXJXQBTRTPO/bundle.json","state_url":"https://pith.science/pith/WBQME2PTWB5TKXHPXJXQBTRTPO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WBQME2PTWB5TKXHPXJXQBTRTPO/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-06-03T19:19:11Z","links":{"resolver":"https://pith.science/pith/WBQME2PTWB5TKXHPXJXQBTRTPO","bundle":"https://pith.science/pith/WBQME2PTWB5TKXHPXJXQBTRTPO/bundle.json","state":"https://pith.science/pith/WBQME2PTWB5TKXHPXJXQBTRTPO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WBQME2PTWB5TKXHPXJXQBTRTPO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WBQME2PTWB5TKXHPXJXQBTRTPO","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":"07c297c642f8b7ad78d945ec4745f45dc29c041740099724b02018120513bc03","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-09T18:24:09Z","title_canon_sha256":"99cad7086f5951cf4830202b9ef0915b4a1efe9b974cdf36e110b215614504f1"},"schema_version":"1.0","source":{"id":"1307.2536","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.2536","created_at":"2026-05-18T03:18:52Z"},{"alias_kind":"arxiv_version","alias_value":"1307.2536v1","created_at":"2026-05-18T03:18:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2536","created_at":"2026-05-18T03:18:52Z"},{"alias_kind":"pith_short_12","alias_value":"WBQME2PTWB5T","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WBQME2PTWB5TKXHP","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WBQME2PT","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:039963e22c03aef35fb36f5fed14e60f0685f76c491b5bef6cf089a60eb881a7","target":"graph","created_at":"2026-05-18T03:18:52Z","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 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","authors_text":"Andrew Mastin, Patrick Jaillet","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-09T18:24:09Z","title":"Greedy Online Bipartite Matching on Random Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2536","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:473d78ebebb080408fa01b5058bc0112d0432d36ce2bf6462660670bf51395ef","target":"record","created_at":"2026-05-18T03:18:52Z","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":"07c297c642f8b7ad78d945ec4745f45dc29c041740099724b02018120513bc03","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-09T18:24:09Z","title_canon_sha256":"99cad7086f5951cf4830202b9ef0915b4a1efe9b974cdf36e110b215614504f1"},"schema_version":"1.0","source":{"id":"1307.2536","kind":"arxiv","version":1}},"canonical_sha256":"b060c269f3b07b355cefba6f00ce337bb5772e3e5d571a1eef466691c5232e83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b060c269f3b07b355cefba6f00ce337bb5772e3e5d571a1eef466691c5232e83","first_computed_at":"2026-05-18T03:18:52.252157Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:52.252157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oAQ+IrEZDiGfV8vRLFmgdBdugjXDqiPoWZGs8OYfPJ0P98c5HbKVZw3QjyKHlZxHpdwEZbCiAekflUKo8582Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:52.252942Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.2536","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:473d78ebebb080408fa01b5058bc0112d0432d36ce2bf6462660670bf51395ef","sha256:039963e22c03aef35fb36f5fed14e60f0685f76c491b5bef6cf089a60eb881a7"],"state_sha256":"3752021b668c27839b7e46c25f2b263945c3e272c1fe51c6ba46c8e06fac15e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XaQ71B8rgsPiS3sJruJE/Cn2wobZaRLtEqPdkoVjN5HHzGTOGKGejb029GxhecKtDhMI7qJ6YNPqR1lg3yflDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:19:11.673954Z","bundle_sha256":"08916219f29442da1207d071ccf1fd115766c3147910c7f89cbf8118c2c272f0"}}