{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:P4ZSG7AESE2MGUPFQNDUSPFW6Y","short_pith_number":"pith:P4ZSG7AE","canonical_record":{"source":{"id":"1805.02014","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-05T07:09:46Z","cross_cats_sorted":[],"title_canon_sha256":"7712eea7021fef7eb555913c4c9845e5339b4099c8c3c65302ff87b8197e553a","abstract_canon_sha256":"a47b8ccdf12fbb17df9ece2250144f89f158394f657f9ff8e8e9b6f3678df559"},"schema_version":"1.0"},"canonical_sha256":"7f33237c049134c351e58347493cb6f60040cb8af9edccc23bbcaf219ca4ef44","source":{"kind":"arxiv","id":"1805.02014","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02014","created_at":"2026-05-17T23:44:38Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02014v4","created_at":"2026-05-17T23:44:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02014","created_at":"2026-05-17T23:44:38Z"},{"alias_kind":"pith_short_12","alias_value":"P4ZSG7AESE2M","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"P4ZSG7AESE2MGUPF","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"P4ZSG7AE","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:P4ZSG7AESE2MGUPFQNDUSPFW6Y","target":"record","payload":{"canonical_record":{"source":{"id":"1805.02014","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-05T07:09:46Z","cross_cats_sorted":[],"title_canon_sha256":"7712eea7021fef7eb555913c4c9845e5339b4099c8c3c65302ff87b8197e553a","abstract_canon_sha256":"a47b8ccdf12fbb17df9ece2250144f89f158394f657f9ff8e8e9b6f3678df559"},"schema_version":"1.0"},"canonical_sha256":"7f33237c049134c351e58347493cb6f60040cb8af9edccc23bbcaf219ca4ef44","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:38.248627Z","signature_b64":"YJY19doo0T7YLDAuZ1lV5CGIWZiN2eGPAuq5wUzkjk/+iwj5J6tCC00yLZBj/I+JHZHbUl9fkzWPdosqB0tfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f33237c049134c351e58347493cb6f60040cb8af9edccc23bbcaf219ca4ef44","last_reissued_at":"2026-05-17T23:44:38.248229Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:38.248229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.02014","source_version":4,"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-17T23:44:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"StLCL7FsVrBDETwPS+gL+Us4gkfOX9/tKAu3RngdLeKkUaKUS/+DROb2/OCc9BYn62LbrIjTsOXe58kLaWOwAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-21T02:20:10.023210Z"},"content_sha256":"683c8682bceff5c985cd346bddf460d60501023d854e737ddfddd8733d6af534","schema_version":"1.0","event_id":"sha256:683c8682bceff5c985cd346bddf460d60501023d854e737ddfddd8733d6af534"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:P4ZSG7AESE2MGUPFQNDUSPFW6Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dorit S. Hochbaum, Mark Velednitsky, Minjun Chang, Quico Spaen","submitted_at":"2018-05-05T07:09:46Z","abstract_excerpt":"This work presents an optimally-competitive algorithm for the problem of maximum weighted online perfect bipartite matching with i.i.d. arrivals. In this problem, we are given a known set of workers, a distribution over job types, and non-negative utility weights for each pair of worker and job types. At each time step, a job is drawn i.i.d. from the distribution over job types. Upon arrival, the job must be irrevocably assigned to a worker and cannot be dropped. The goal is to maximize the expected sum of utilities after all jobs are assigned.\n  We introduce DISPATCH, a 0.5-competitive, rando"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02014","kind":"arxiv","version":4},"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-17T23:44:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dZKe3R+nO/1wdNGH9zq9wBojnqpiNf5WbM5eIbCdNBn5IJeIESHxBI6EAllyF/tiXxi9tXA0wYw8yn6gZf+aBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-21T02:20:10.023561Z"},"content_sha256":"6de1b5d1fe9c55a61d6c7084b3b3ef0e9158fc5880bbd5c8d271d9fb0bd6f168","schema_version":"1.0","event_id":"sha256:6de1b5d1fe9c55a61d6c7084b3b3ef0e9158fc5880bbd5c8d271d9fb0bd6f168"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P4ZSG7AESE2MGUPFQNDUSPFW6Y/bundle.json","state_url":"https://pith.science/pith/P4ZSG7AESE2MGUPFQNDUSPFW6Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P4ZSG7AESE2MGUPFQNDUSPFW6Y/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-07-21T02:20:10Z","links":{"resolver":"https://pith.science/pith/P4ZSG7AESE2MGUPFQNDUSPFW6Y","bundle":"https://pith.science/pith/P4ZSG7AESE2MGUPFQNDUSPFW6Y/bundle.json","state":"https://pith.science/pith/P4ZSG7AESE2MGUPFQNDUSPFW6Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P4ZSG7AESE2MGUPFQNDUSPFW6Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:P4ZSG7AESE2MGUPFQNDUSPFW6Y","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":"a47b8ccdf12fbb17df9ece2250144f89f158394f657f9ff8e8e9b6f3678df559","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-05T07:09:46Z","title_canon_sha256":"7712eea7021fef7eb555913c4c9845e5339b4099c8c3c65302ff87b8197e553a"},"schema_version":"1.0","source":{"id":"1805.02014","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02014","created_at":"2026-05-17T23:44:38Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02014v4","created_at":"2026-05-17T23:44:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02014","created_at":"2026-05-17T23:44:38Z"},{"alias_kind":"pith_short_12","alias_value":"P4ZSG7AESE2M","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"P4ZSG7AESE2MGUPF","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"P4ZSG7AE","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:6de1b5d1fe9c55a61d6c7084b3b3ef0e9158fc5880bbd5c8d271d9fb0bd6f168","target":"graph","created_at":"2026-05-17T23:44:38Z","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":"This work presents an optimally-competitive algorithm for the problem of maximum weighted online perfect bipartite matching with i.i.d. arrivals. In this problem, we are given a known set of workers, a distribution over job types, and non-negative utility weights for each pair of worker and job types. At each time step, a job is drawn i.i.d. from the distribution over job types. Upon arrival, the job must be irrevocably assigned to a worker and cannot be dropped. The goal is to maximize the expected sum of utilities after all jobs are assigned.\n  We introduce DISPATCH, a 0.5-competitive, rando","authors_text":"Dorit S. Hochbaum, Mark Velednitsky, Minjun Chang, Quico Spaen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-05T07:09:46Z","title":"DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02014","kind":"arxiv","version":4},"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:683c8682bceff5c985cd346bddf460d60501023d854e737ddfddd8733d6af534","target":"record","created_at":"2026-05-17T23:44:38Z","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":"a47b8ccdf12fbb17df9ece2250144f89f158394f657f9ff8e8e9b6f3678df559","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-05T07:09:46Z","title_canon_sha256":"7712eea7021fef7eb555913c4c9845e5339b4099c8c3c65302ff87b8197e553a"},"schema_version":"1.0","source":{"id":"1805.02014","kind":"arxiv","version":4}},"canonical_sha256":"7f33237c049134c351e58347493cb6f60040cb8af9edccc23bbcaf219ca4ef44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f33237c049134c351e58347493cb6f60040cb8af9edccc23bbcaf219ca4ef44","first_computed_at":"2026-05-17T23:44:38.248229Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:38.248229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YJY19doo0T7YLDAuZ1lV5CGIWZiN2eGPAuq5wUzkjk/+iwj5J6tCC00yLZBj/I+JHZHbUl9fkzWPdosqB0tfCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:38.248627Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.02014","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:683c8682bceff5c985cd346bddf460d60501023d854e737ddfddd8733d6af534","sha256:6de1b5d1fe9c55a61d6c7084b3b3ef0e9158fc5880bbd5c8d271d9fb0bd6f168"],"state_sha256":"47dc638a0caeac09951e6656278ca0e696f4fe367d99e36664ce59c6ea6b4edb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Mq6foAVn390OAVpAv2cI/LDd/V7v4BvGtPd2h8gY6b58ipoC+vLErhWegtfjL+hb5OKlC0owSgT5hgyet1wDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-21T02:20:10.025565Z","bundle_sha256":"8d3685d179f351c6fdafcd100ee06e4f7049ec585032df15f22e34ae0afdea09"}}