{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GFLJDQSE2M4SY7JB2MGOREB2FG","short_pith_number":"pith:GFLJDQSE","schema_version":"1.0","canonical_sha256":"315691c244d3392c7d21d30ce8903a298b332ebc4c5756b2d0b3a832a9fdd668","source":{"kind":"arxiv","id":"2507.04551","version":2},"attestation_state":"computed","paper":{"title":"Greedy Dynamic Matching","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Felipe Simon, Nick Arnosti","submitted_at":"2025-07-06T21:49:52Z","abstract_excerpt":"We study a foundational model of dynamic matching market with abandonment. This model has been studied by Collina et al (2020) and Aouad and Saritac (2022), and many other papers have considered special cases. We compare the performance of greedy policies -- which identify a set of \"acceptable\" matches up front, and perform these matches as soon as possible -- to that of an omniscient benchmark which knows the full arrival and departure sequence.\n  We use a novel family of linear programs ($LP^{ALG}$) to identify which greedy policy to follow. We show that the value of $LP^{ALG}$ is a *lower b"},"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":"2507.04551","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2025-07-06T21:49:52Z","cross_cats_sorted":[],"title_canon_sha256":"bba5f6846f31c5c47abb6607e04db9c2f6ea800e1a3c75a6205443401dd4e0b2","abstract_canon_sha256":"30ae2d2cc2dc4d54c3a27f97d9bef45393e87f7492f67a6c75ba2ff3c7f4f1ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:33:26.639002Z","signature_b64":"UbtH4g12AsRE5O/b474HzfY4PrRpstJ1sJkiOG67bVSr0NNQwfn2dLWdCKsguC8qG11VespWtE7ESJhdh4mtDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"315691c244d3392c7d21d30ce8903a298b332ebc4c5756b2d0b3a832a9fdd668","last_reissued_at":"2026-07-05T11:33:26.638538Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:33:26.638538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Greedy Dynamic Matching","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Felipe Simon, Nick Arnosti","submitted_at":"2025-07-06T21:49:52Z","abstract_excerpt":"We study a foundational model of dynamic matching market with abandonment. This model has been studied by Collina et al (2020) and Aouad and Saritac (2022), and many other papers have considered special cases. We compare the performance of greedy policies -- which identify a set of \"acceptable\" matches up front, and perform these matches as soon as possible -- to that of an omniscient benchmark which knows the full arrival and departure sequence.\n  We use a novel family of linear programs ($LP^{ALG}$) to identify which greedy policy to follow. We show that the value of $LP^{ALG}$ is a *lower b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.04551","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.04551/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2507.04551","created_at":"2026-07-05T11:33:26.638595+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.04551v2","created_at":"2026-07-05T11:33:26.638595+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.04551","created_at":"2026-07-05T11:33:26.638595+00:00"},{"alias_kind":"pith_short_12","alias_value":"GFLJDQSE2M4S","created_at":"2026-07-05T11:33:26.638595+00:00"},{"alias_kind":"pith_short_16","alias_value":"GFLJDQSE2M4SY7JB","created_at":"2026-07-05T11:33:26.638595+00:00"},{"alias_kind":"pith_short_8","alias_value":"GFLJDQSE","created_at":"2026-07-05T11:33:26.638595+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/GFLJDQSE2M4SY7JB2MGOREB2FG","json":"https://pith.science/pith/GFLJDQSE2M4SY7JB2MGOREB2FG.json","graph_json":"https://pith.science/api/pith-number/GFLJDQSE2M4SY7JB2MGOREB2FG/graph.json","events_json":"https://pith.science/api/pith-number/GFLJDQSE2M4SY7JB2MGOREB2FG/events.json","paper":"https://pith.science/paper/GFLJDQSE"},"agent_actions":{"view_html":"https://pith.science/pith/GFLJDQSE2M4SY7JB2MGOREB2FG","download_json":"https://pith.science/pith/GFLJDQSE2M4SY7JB2MGOREB2FG.json","view_paper":"https://pith.science/paper/GFLJDQSE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.04551&json=true","fetch_graph":"https://pith.science/api/pith-number/GFLJDQSE2M4SY7JB2MGOREB2FG/graph.json","fetch_events":"https://pith.science/api/pith-number/GFLJDQSE2M4SY7JB2MGOREB2FG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GFLJDQSE2M4SY7JB2MGOREB2FG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GFLJDQSE2M4SY7JB2MGOREB2FG/action/storage_attestation","attest_author":"https://pith.science/pith/GFLJDQSE2M4SY7JB2MGOREB2FG/action/author_attestation","sign_citation":"https://pith.science/pith/GFLJDQSE2M4SY7JB2MGOREB2FG/action/citation_signature","submit_replication":"https://pith.science/pith/GFLJDQSE2M4SY7JB2MGOREB2FG/action/replication_record"}},"created_at":"2026-07-05T11:33:26.638595+00:00","updated_at":"2026-07-05T11:33:26.638595+00:00"}