{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HMOUZM5FLPEAQJ5HXPTCERD2CS","short_pith_number":"pith:HMOUZM5F","canonical_record":{"source":{"id":"1808.03526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-09T04:03:08Z","cross_cats_sorted":[],"title_canon_sha256":"b3e2d7efb2cb058d51bc3837877239011c3702c8d78ae5d7d877291b73d28fb7","abstract_canon_sha256":"f629724b84b4f80726929ebe10171e7056b6931041322122d95f60cf47374b50"},"schema_version":"1.0"},"canonical_sha256":"3b1d4cb3a55bc80827a7bbe622447a14abd1a410b699d0c4c9253feeb7dca25d","source":{"kind":"arxiv","id":"1808.03526","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03526","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03526v1","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03526","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"pith_short_12","alias_value":"HMOUZM5FLPEA","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HMOUZM5FLPEAQJ5H","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HMOUZM5F","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HMOUZM5FLPEAQJ5HXPTCERD2CS","target":"record","payload":{"canonical_record":{"source":{"id":"1808.03526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-09T04:03:08Z","cross_cats_sorted":[],"title_canon_sha256":"b3e2d7efb2cb058d51bc3837877239011c3702c8d78ae5d7d877291b73d28fb7","abstract_canon_sha256":"f629724b84b4f80726929ebe10171e7056b6931041322122d95f60cf47374b50"},"schema_version":"1.0"},"canonical_sha256":"3b1d4cb3a55bc80827a7bbe622447a14abd1a410b699d0c4c9253feeb7dca25d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:24.759728Z","signature_b64":"bSMAhpwilXbcKS7uGxXfvmuLjYkCLEuiJmQy67XrfHymFGqPDL80YFff1v5nW9G5CveSMfsBaXa8PxDA2RQXCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b1d4cb3a55bc80827a7bbe622447a14abd1a410b699d0c4c9253feeb7dca25d","last_reissued_at":"2026-05-18T00:08:24.759233Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:24.759233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.03526","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:08:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zlE1nSUYPDuLB0r00SvFH5DoiZseN4T1Ntdp29zdXY2K3ibOHpPjCQL/u5ahfzc4FolAXqbFzmLVMUVOZlaOBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T07:15:11.561788Z"},"content_sha256":"3ef763f0b7320515a4a27dd94d3360e063ae832576251480ed179db4bf69e28e","schema_version":"1.0","event_id":"sha256:3ef763f0b7320515a4a27dd94d3360e063ae832576251480ed179db4bf69e28e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HMOUZM5FLPEAQJ5HXPTCERD2CS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum Weight Online Matching with Deadlines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amin Saberi, Chinmoy Dutta, Chris Sholley, Itai Ashlagi, Maximilien Burq, Patrick Jaillet","submitted_at":"2018-08-09T04:03:08Z","abstract_excerpt":"We study the problem of matching agents who arrive at a marketplace over time and leave after d time periods. Agents can only be matched while they are present in the marketplace. Each pair of agents can yield a different match value, and the planner's goal is to maximize the total value over a finite time horizon. First we study the case in which vertices arrive in an adversarial order. We provide a randomized 0.25-competitive algorithm building on a result by Feldman et al. (2009) and Lehman et al. (2006). We extend the model to the case in which departure times are drawn independently from "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03526","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:08:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uY/PEvT1V+KJNhnIZ3M6I01VPeaUuAgfQJs4uro3Wz+KZRuD2SqUWiJJZKU10KvvwUlaYMCfifsPePOCnbYPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T07:15:11.562127Z"},"content_sha256":"71de4b6e6fe0f30a62291cda06846c3760cd90e3660da0081242d13a20ee8ec5","schema_version":"1.0","event_id":"sha256:71de4b6e6fe0f30a62291cda06846c3760cd90e3660da0081242d13a20ee8ec5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HMOUZM5FLPEAQJ5HXPTCERD2CS/bundle.json","state_url":"https://pith.science/pith/HMOUZM5FLPEAQJ5HXPTCERD2CS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HMOUZM5FLPEAQJ5HXPTCERD2CS/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-28T07:15:11Z","links":{"resolver":"https://pith.science/pith/HMOUZM5FLPEAQJ5HXPTCERD2CS","bundle":"https://pith.science/pith/HMOUZM5FLPEAQJ5HXPTCERD2CS/bundle.json","state":"https://pith.science/pith/HMOUZM5FLPEAQJ5HXPTCERD2CS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HMOUZM5FLPEAQJ5HXPTCERD2CS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HMOUZM5FLPEAQJ5HXPTCERD2CS","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":"f629724b84b4f80726929ebe10171e7056b6931041322122d95f60cf47374b50","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-09T04:03:08Z","title_canon_sha256":"b3e2d7efb2cb058d51bc3837877239011c3702c8d78ae5d7d877291b73d28fb7"},"schema_version":"1.0","source":{"id":"1808.03526","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03526","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03526v1","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03526","created_at":"2026-05-18T00:08:24Z"},{"alias_kind":"pith_short_12","alias_value":"HMOUZM5FLPEA","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HMOUZM5FLPEAQJ5H","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HMOUZM5F","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:71de4b6e6fe0f30a62291cda06846c3760cd90e3660da0081242d13a20ee8ec5","target":"graph","created_at":"2026-05-18T00:08:24Z","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 problem of matching agents who arrive at a marketplace over time and leave after d time periods. Agents can only be matched while they are present in the marketplace. Each pair of agents can yield a different match value, and the planner's goal is to maximize the total value over a finite time horizon. First we study the case in which vertices arrive in an adversarial order. We provide a randomized 0.25-competitive algorithm building on a result by Feldman et al. (2009) and Lehman et al. (2006). We extend the model to the case in which departure times are drawn independently from ","authors_text":"Amin Saberi, Chinmoy Dutta, Chris Sholley, Itai Ashlagi, Maximilien Burq, Patrick Jaillet","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-09T04:03:08Z","title":"Maximum Weight Online Matching with Deadlines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03526","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:3ef763f0b7320515a4a27dd94d3360e063ae832576251480ed179db4bf69e28e","target":"record","created_at":"2026-05-18T00:08:24Z","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":"f629724b84b4f80726929ebe10171e7056b6931041322122d95f60cf47374b50","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-09T04:03:08Z","title_canon_sha256":"b3e2d7efb2cb058d51bc3837877239011c3702c8d78ae5d7d877291b73d28fb7"},"schema_version":"1.0","source":{"id":"1808.03526","kind":"arxiv","version":1}},"canonical_sha256":"3b1d4cb3a55bc80827a7bbe622447a14abd1a410b699d0c4c9253feeb7dca25d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b1d4cb3a55bc80827a7bbe622447a14abd1a410b699d0c4c9253feeb7dca25d","first_computed_at":"2026-05-18T00:08:24.759233Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:24.759233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bSMAhpwilXbcKS7uGxXfvmuLjYkCLEuiJmQy67XrfHymFGqPDL80YFff1v5nW9G5CveSMfsBaXa8PxDA2RQXCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:24.759728Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.03526","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ef763f0b7320515a4a27dd94d3360e063ae832576251480ed179db4bf69e28e","sha256:71de4b6e6fe0f30a62291cda06846c3760cd90e3660da0081242d13a20ee8ec5"],"state_sha256":"a79ac2de50887a5081840e05cb6e45f21d3f518db8c921b8bd07b11d62bcb97e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kNS8/82JnuXFGxgC3LbaZdi5xqr083Ulv/aDgXPt9cm+zHpJnr0IhM4AmVp3fRfPNy59PhabX9cceJDJERh/CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T07:15:11.563955Z","bundle_sha256":"1f8927f72b5ca3e49b78c0042399414e1b40a5cd5c10715056aca8f8a61c65a4"}}