{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FKC5LGURR2WWGX7Q7ACIEFU7KJ","short_pith_number":"pith:FKC5LGUR","schema_version":"1.0","canonical_sha256":"2a85d59a918ead635ff0f80482169f527c9c733472dcadb0564768b54bbe5d36","source":{"kind":"arxiv","id":"1711.08345","version":2},"attestation_state":"computed","paper":{"title":"Allocation Problems in Ride-Sharing Platforms: Online Matching with Offline Reusable Resources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.AI","authors_text":"Aravind Srinivasan, John P Dickerson, Karthik A Sankararaman, Pan Xu","submitted_at":"2017-11-22T15:39:57Z","abstract_excerpt":"Bipartite matching markets pair agents on one side of a market with agents, items, or contracts on the opposing side. Prior work addresses online bipartite matching markets, where agents arrive over time and are dynamically matched to a known set of disposable resources. In this paper, we propose a new model, Online Matching with (offline) Reusable Resources under Known Adversarial Distributions (OM-RR-KAD), in which resources on the offline side are reusable instead of disposable; that is, once matched, resources become available again at some point in the future. We show that our model is tr"},"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":"1711.08345","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-11-22T15:39:57Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"52b98caf4cac7bebff846bee5aa74ebb7f860a5308c412b88980a69e05cc2899","abstract_canon_sha256":"496d853b7bb3a1e508192468a2013eb6747182d72838c09969a963fbf9812058"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:10.147913Z","signature_b64":"7LvmZppSve+FUATwqndIfrfnDoCcLJ4EF6t9hM3bdHShXIiNpLlHZ6v5A91t04fPOckNUYjHx9gI31CRVztXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a85d59a918ead635ff0f80482169f527c9c733472dcadb0564768b54bbe5d36","last_reissued_at":"2026-05-18T00:28:10.147130Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:10.147130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Allocation Problems in Ride-Sharing Platforms: Online Matching with Offline Reusable Resources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.AI","authors_text":"Aravind Srinivasan, John P Dickerson, Karthik A Sankararaman, Pan Xu","submitted_at":"2017-11-22T15:39:57Z","abstract_excerpt":"Bipartite matching markets pair agents on one side of a market with agents, items, or contracts on the opposing side. Prior work addresses online bipartite matching markets, where agents arrive over time and are dynamically matched to a known set of disposable resources. In this paper, we propose a new model, Online Matching with (offline) Reusable Resources under Known Adversarial Distributions (OM-RR-KAD), in which resources on the offline side are reusable instead of disposable; that is, once matched, resources become available again at some point in the future. We show that our model is tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08345","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.08345","created_at":"2026-05-18T00:28:10.147229+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.08345v2","created_at":"2026-05-18T00:28:10.147229+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08345","created_at":"2026-05-18T00:28:10.147229+00:00"},{"alias_kind":"pith_short_12","alias_value":"FKC5LGURR2WW","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FKC5LGURR2WWGX7Q","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FKC5LGUR","created_at":"2026-05-18T12:31:15.632608+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/FKC5LGURR2WWGX7Q7ACIEFU7KJ","json":"https://pith.science/pith/FKC5LGURR2WWGX7Q7ACIEFU7KJ.json","graph_json":"https://pith.science/api/pith-number/FKC5LGURR2WWGX7Q7ACIEFU7KJ/graph.json","events_json":"https://pith.science/api/pith-number/FKC5LGURR2WWGX7Q7ACIEFU7KJ/events.json","paper":"https://pith.science/paper/FKC5LGUR"},"agent_actions":{"view_html":"https://pith.science/pith/FKC5LGURR2WWGX7Q7ACIEFU7KJ","download_json":"https://pith.science/pith/FKC5LGURR2WWGX7Q7ACIEFU7KJ.json","view_paper":"https://pith.science/paper/FKC5LGUR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.08345&json=true","fetch_graph":"https://pith.science/api/pith-number/FKC5LGURR2WWGX7Q7ACIEFU7KJ/graph.json","fetch_events":"https://pith.science/api/pith-number/FKC5LGURR2WWGX7Q7ACIEFU7KJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FKC5LGURR2WWGX7Q7ACIEFU7KJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FKC5LGURR2WWGX7Q7ACIEFU7KJ/action/storage_attestation","attest_author":"https://pith.science/pith/FKC5LGURR2WWGX7Q7ACIEFU7KJ/action/author_attestation","sign_citation":"https://pith.science/pith/FKC5LGURR2WWGX7Q7ACIEFU7KJ/action/citation_signature","submit_replication":"https://pith.science/pith/FKC5LGURR2WWGX7Q7ACIEFU7KJ/action/replication_record"}},"created_at":"2026-05-18T00:28:10.147229+00:00","updated_at":"2026-05-18T00:28:10.147229+00:00"}