{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SAFQOUPELPFT7DEGX4Q76IE5CJ","short_pith_number":"pith:SAFQOUPE","canonical_record":{"source":{"id":"1709.01557","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-05T19:14:08Z","cross_cats_sorted":[],"title_canon_sha256":"d1716f234727670d0150875b50ae8825599cdee3b0e9c634e1edc4690b4d4eb1","abstract_canon_sha256":"4932e43bb431dc9feee4fa29c10dfed170635081f2090ba080ab8b30ae18fbb3"},"schema_version":"1.0"},"canonical_sha256":"900b0751e45bcb3f8c86bf21ff209d124f75dc62e253ad42d943ef38dfb63dde","source":{"kind":"arxiv","id":"1709.01557","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01557","created_at":"2026-05-17T23:57:48Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01557v2","created_at":"2026-05-17T23:57:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01557","created_at":"2026-05-17T23:57:48Z"},{"alias_kind":"pith_short_12","alias_value":"SAFQOUPELPFT","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SAFQOUPELPFT7DEG","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SAFQOUPE","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SAFQOUPELPFT7DEGX4Q76IE5CJ","target":"record","payload":{"canonical_record":{"source":{"id":"1709.01557","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-05T19:14:08Z","cross_cats_sorted":[],"title_canon_sha256":"d1716f234727670d0150875b50ae8825599cdee3b0e9c634e1edc4690b4d4eb1","abstract_canon_sha256":"4932e43bb431dc9feee4fa29c10dfed170635081f2090ba080ab8b30ae18fbb3"},"schema_version":"1.0"},"canonical_sha256":"900b0751e45bcb3f8c86bf21ff209d124f75dc62e253ad42d943ef38dfb63dde","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:48.862205Z","signature_b64":"XIEIVmhF0WEQoIaJAXZOtQG8FSLBjJBaIeYDSBI1tf0RW79CzbmvQgCBRvRbpAcnEKZx9CzCe/nLPvtmqZoqBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"900b0751e45bcb3f8c86bf21ff209d124f75dc62e253ad42d943ef38dfb63dde","last_reissued_at":"2026-05-17T23:57:48.861564Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:48.861564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.01557","source_version":2,"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:57:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NtnY6gSjldKWzHjvM1xLCorzNmN74k+S+cZyZdgRytnb7FV1j2Fw7Lh5hXipsjnzjHPHvvJlWmMRQmzZfKz1Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:54:41.853793Z"},"content_sha256":"05e737e42e67ca00cf7aa006ee9a4dfce898db8a394ac42484067026711f5819","schema_version":"1.0","event_id":"sha256:05e737e42e67ca00cf7aa006ee9a4dfce898db8a394ac42484067026711f5819"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SAFQOUPELPFT7DEGX4Q76IE5CJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Relaxations for Online Bipartite Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alejandro Toriello, Alfredo Torrico","submitted_at":"2017-09-05T19:14:08Z","abstract_excerpt":"Online bipartite matching (OBM) is a fundamental model underpinning many important applications, including search engine advertisement, website banner and pop-up ads, and ride-hailing. We study the i.i.d. OBM problem, where one side of the bipartition is fixed and known in advance, while nodes from the other side appear sequentially as i.i.d. realizations of an underlying distribution, and must immediately be matched or discarded. We introduce dynamic relaxations of the set of achievable matching probabilities, show how they theoretically dominate lower-dimensional, static relaxations from pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01557","kind":"arxiv","version":2},"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:57:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dhw2lT0lyz0+8u2wKhkHcpOma9Vuu5aMHeUVxH4n+9qq8Irwia0drYmUF2SgrGgXO8x0EkR8ZQ+yQe+WFk9NAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:54:41.854268Z"},"content_sha256":"8b93ffaa4f73ecf0e77e4c0307e585ed25d48834dc13b78ba463bee053bdd9d7","schema_version":"1.0","event_id":"sha256:8b93ffaa4f73ecf0e77e4c0307e585ed25d48834dc13b78ba463bee053bdd9d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SAFQOUPELPFT7DEGX4Q76IE5CJ/bundle.json","state_url":"https://pith.science/pith/SAFQOUPELPFT7DEGX4Q76IE5CJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SAFQOUPELPFT7DEGX4Q76IE5CJ/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-26T11:54:41Z","links":{"resolver":"https://pith.science/pith/SAFQOUPELPFT7DEGX4Q76IE5CJ","bundle":"https://pith.science/pith/SAFQOUPELPFT7DEGX4Q76IE5CJ/bundle.json","state":"https://pith.science/pith/SAFQOUPELPFT7DEGX4Q76IE5CJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SAFQOUPELPFT7DEGX4Q76IE5CJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SAFQOUPELPFT7DEGX4Q76IE5CJ","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":"4932e43bb431dc9feee4fa29c10dfed170635081f2090ba080ab8b30ae18fbb3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-05T19:14:08Z","title_canon_sha256":"d1716f234727670d0150875b50ae8825599cdee3b0e9c634e1edc4690b4d4eb1"},"schema_version":"1.0","source":{"id":"1709.01557","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01557","created_at":"2026-05-17T23:57:48Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01557v2","created_at":"2026-05-17T23:57:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01557","created_at":"2026-05-17T23:57:48Z"},{"alias_kind":"pith_short_12","alias_value":"SAFQOUPELPFT","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SAFQOUPELPFT7DEG","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SAFQOUPE","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:8b93ffaa4f73ecf0e77e4c0307e585ed25d48834dc13b78ba463bee053bdd9d7","target":"graph","created_at":"2026-05-17T23:57:48Z","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":"Online bipartite matching (OBM) is a fundamental model underpinning many important applications, including search engine advertisement, website banner and pop-up ads, and ride-hailing. We study the i.i.d. OBM problem, where one side of the bipartition is fixed and known in advance, while nodes from the other side appear sequentially as i.i.d. realizations of an underlying distribution, and must immediately be matched or discarded. We introduce dynamic relaxations of the set of achievable matching probabilities, show how they theoretically dominate lower-dimensional, static relaxations from pre","authors_text":"Alejandro Toriello, Alfredo Torrico","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-05T19:14:08Z","title":"Dynamic Relaxations for Online Bipartite Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01557","kind":"arxiv","version":2},"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:05e737e42e67ca00cf7aa006ee9a4dfce898db8a394ac42484067026711f5819","target":"record","created_at":"2026-05-17T23:57:48Z","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":"4932e43bb431dc9feee4fa29c10dfed170635081f2090ba080ab8b30ae18fbb3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-09-05T19:14:08Z","title_canon_sha256":"d1716f234727670d0150875b50ae8825599cdee3b0e9c634e1edc4690b4d4eb1"},"schema_version":"1.0","source":{"id":"1709.01557","kind":"arxiv","version":2}},"canonical_sha256":"900b0751e45bcb3f8c86bf21ff209d124f75dc62e253ad42d943ef38dfb63dde","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"900b0751e45bcb3f8c86bf21ff209d124f75dc62e253ad42d943ef38dfb63dde","first_computed_at":"2026-05-17T23:57:48.861564Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:48.861564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XIEIVmhF0WEQoIaJAXZOtQG8FSLBjJBaIeYDSBI1tf0RW79CzbmvQgCBRvRbpAcnEKZx9CzCe/nLPvtmqZoqBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:48.862205Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.01557","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05e737e42e67ca00cf7aa006ee9a4dfce898db8a394ac42484067026711f5819","sha256:8b93ffaa4f73ecf0e77e4c0307e585ed25d48834dc13b78ba463bee053bdd9d7"],"state_sha256":"c933fa7c40ae06f7923584a60baaa002f4a152fac5c424bc0b05e03160a0e1ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"if0u0Rjv/vG8+EztmQpsz++9a43xcX8bvCp6OPMKeyeu6LFDDlyAYPTQcG9cIXnQe8IehEnCcqRTvk/X4EvWAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:54:41.857365Z","bundle_sha256":"c425635dc723cba0f16785abfb640c3283effd03ba4d7de8c238e4ddd2df6c64"}}