{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QACLVWG2N6N6F7OFF5V33UGID4","short_pith_number":"pith:QACLVWG2","schema_version":"1.0","canonical_sha256":"8004bad8da6f9be2fdc52f6bbdd0c81f12ea69f7963f852a66cdcff34cc69e17","source":{"kind":"arxiv","id":"1803.01285","version":1},"attestation_state":"computed","paper":{"title":"Maximizing Efficiency in Dynamic Matching Markets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Amin Saberi, Itai Ashlagi, Maximilien Burq, Patrick Jaillet","submitted_at":"2018-03-04T02:36:15Z","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. We study matching algorithms that perform well over any sequence of arrivals when there is no a priori information about the match values or arrival times.\n  Our main contribution is a 1/4-competitive algorithm. The algorithm randomly selects a subset of agents who will wait until r"},"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":"1803.01285","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-04T02:36:15Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"6201ceed667eebd83545a3d1883e3ee9fb500356f592d33c1477e882021984f8","abstract_canon_sha256":"daac9c38aab43559de89500073be7de7f37de0ee97ca4802dde44ada4cc98cc8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:01.182747Z","signature_b64":"1d7IbFF8/vR3iYOxnkh5+ojsArResOvqaYvAQzRK+TCR/dOd5YaBpACgpFZgORXiUvUCdZhEDH7O3Bio0OWrDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8004bad8da6f9be2fdc52f6bbdd0c81f12ea69f7963f852a66cdcff34cc69e17","last_reissued_at":"2026-05-18T00:22:01.182133Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:01.182133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximizing Efficiency in Dynamic Matching Markets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Amin Saberi, Itai Ashlagi, Maximilien Burq, Patrick Jaillet","submitted_at":"2018-03-04T02:36:15Z","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. We study matching algorithms that perform well over any sequence of arrivals when there is no a priori information about the match values or arrival times.\n  Our main contribution is a 1/4-competitive algorithm. The algorithm randomly selects a subset of agents who will wait until r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01285","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":"1803.01285","created_at":"2026-05-18T00:22:01.182232+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.01285v1","created_at":"2026-05-18T00:22:01.182232+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01285","created_at":"2026-05-18T00:22:01.182232+00:00"},{"alias_kind":"pith_short_12","alias_value":"QACLVWG2N6N6","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"QACLVWG2N6N6F7OF","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"QACLVWG2","created_at":"2026-05-18T12:32:46.962924+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/QACLVWG2N6N6F7OFF5V33UGID4","json":"https://pith.science/pith/QACLVWG2N6N6F7OFF5V33UGID4.json","graph_json":"https://pith.science/api/pith-number/QACLVWG2N6N6F7OFF5V33UGID4/graph.json","events_json":"https://pith.science/api/pith-number/QACLVWG2N6N6F7OFF5V33UGID4/events.json","paper":"https://pith.science/paper/QACLVWG2"},"agent_actions":{"view_html":"https://pith.science/pith/QACLVWG2N6N6F7OFF5V33UGID4","download_json":"https://pith.science/pith/QACLVWG2N6N6F7OFF5V33UGID4.json","view_paper":"https://pith.science/paper/QACLVWG2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.01285&json=true","fetch_graph":"https://pith.science/api/pith-number/QACLVWG2N6N6F7OFF5V33UGID4/graph.json","fetch_events":"https://pith.science/api/pith-number/QACLVWG2N6N6F7OFF5V33UGID4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QACLVWG2N6N6F7OFF5V33UGID4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QACLVWG2N6N6F7OFF5V33UGID4/action/storage_attestation","attest_author":"https://pith.science/pith/QACLVWG2N6N6F7OFF5V33UGID4/action/author_attestation","sign_citation":"https://pith.science/pith/QACLVWG2N6N6F7OFF5V33UGID4/action/citation_signature","submit_replication":"https://pith.science/pith/QACLVWG2N6N6F7OFF5V33UGID4/action/replication_record"}},"created_at":"2026-05-18T00:22:01.182232+00:00","updated_at":"2026-05-18T00:22:01.182232+00:00"}