{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HMOUZM5FLPEAQJ5HXPTCERD2CS","short_pith_number":"pith:HMOUZM5F","schema_version":"1.0","canonical_sha256":"3b1d4cb3a55bc80827a7bbe622447a14abd1a410b699d0c4c9253feeb7dca25d","source":{"kind":"arxiv","id":"1808.03526","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1808.03526","created_at":"2026-05-18T00:08:24.759327+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.03526v1","created_at":"2026-05-18T00:08:24.759327+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03526","created_at":"2026-05-18T00:08:24.759327+00:00"},{"alias_kind":"pith_short_12","alias_value":"HMOUZM5FLPEA","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HMOUZM5FLPEAQJ5H","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HMOUZM5F","created_at":"2026-05-18T12:32:28.185984+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/HMOUZM5FLPEAQJ5HXPTCERD2CS","json":"https://pith.science/pith/HMOUZM5FLPEAQJ5HXPTCERD2CS.json","graph_json":"https://pith.science/api/pith-number/HMOUZM5FLPEAQJ5HXPTCERD2CS/graph.json","events_json":"https://pith.science/api/pith-number/HMOUZM5FLPEAQJ5HXPTCERD2CS/events.json","paper":"https://pith.science/paper/HMOUZM5F"},"agent_actions":{"view_html":"https://pith.science/pith/HMOUZM5FLPEAQJ5HXPTCERD2CS","download_json":"https://pith.science/pith/HMOUZM5FLPEAQJ5HXPTCERD2CS.json","view_paper":"https://pith.science/paper/HMOUZM5F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.03526&json=true","fetch_graph":"https://pith.science/api/pith-number/HMOUZM5FLPEAQJ5HXPTCERD2CS/graph.json","fetch_events":"https://pith.science/api/pith-number/HMOUZM5FLPEAQJ5HXPTCERD2CS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HMOUZM5FLPEAQJ5HXPTCERD2CS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HMOUZM5FLPEAQJ5HXPTCERD2CS/action/storage_attestation","attest_author":"https://pith.science/pith/HMOUZM5FLPEAQJ5HXPTCERD2CS/action/author_attestation","sign_citation":"https://pith.science/pith/HMOUZM5FLPEAQJ5HXPTCERD2CS/action/citation_signature","submit_replication":"https://pith.science/pith/HMOUZM5FLPEAQJ5HXPTCERD2CS/action/replication_record"}},"created_at":"2026-05-18T00:08:24.759327+00:00","updated_at":"2026-05-18T00:08:24.759327+00:00"}