{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:TSKETN43BPO7SSOUXSP6RLURBX","short_pith_number":"pith:TSKETN43","schema_version":"1.0","canonical_sha256":"9c9449b79b0bddf949d4bc9fe8ae910dfbbcbf35203d68833b19c0d1ec837a92","source":{"kind":"arxiv","id":"2012.00689","version":3},"attestation_state":"computed","paper":{"title":"Dynamic Weighted Matching with Heterogeneous Arrival and Departure Rates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Brendan Lucier, Kevin Leyton-Brown, Natalie Collina, Neil Newman, Nicole Immorlica","submitted_at":"2020-12-01T17:49:53Z","abstract_excerpt":"We study a dynamic non-bipartite matching problem. There is a fixed set of agent types, and agents of a given type arrive and depart according to type-specific Poisson processes. Agent departures are not announced in advance. The value of a match is determined by the types of the matched agents. We present an online algorithm that is (1/8)-competitive with respect to the value of the optimal-in-hindsight policy, for arbitrary weighted graphs. Our algorithm treats agents heterogeneously, interpolating between immediate and delayed matching in order to thicken the market while still matching val"},"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":"2012.00689","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2020-12-01T17:49:53Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c8ec96c8dfd5799fba3cee1d698ce5e33d0b30805f7a3eb8f43e42b6cd9c6069","abstract_canon_sha256":"bf8513a86e9cb28997738164bf2452a3a678fea2de7a6d31abc208f1e5af33d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:05:45.637274Z","signature_b64":"GQgOuqlaHqH8QN7ftFbUXJSjdn30BqGd176kR4s4TLS94GfMhD09dQoAziemkgjW71b7F7uCLSdcsyQ2f+2eBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c9449b79b0bddf949d4bc9fe8ae910dfbbcbf35203d68833b19c0d1ec837a92","last_reissued_at":"2026-07-05T02:05:45.636818Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:05:45.636818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Weighted Matching with Heterogeneous Arrival and Departure Rates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Brendan Lucier, Kevin Leyton-Brown, Natalie Collina, Neil Newman, Nicole Immorlica","submitted_at":"2020-12-01T17:49:53Z","abstract_excerpt":"We study a dynamic non-bipartite matching problem. There is a fixed set of agent types, and agents of a given type arrive and depart according to type-specific Poisson processes. Agent departures are not announced in advance. The value of a match is determined by the types of the matched agents. We present an online algorithm that is (1/8)-competitive with respect to the value of the optimal-in-hindsight policy, for arbitrary weighted graphs. Our algorithm treats agents heterogeneously, interpolating between immediate and delayed matching in order to thicken the market while still matching val"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.00689","kind":"arxiv","version":3},"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/2012.00689/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":"2012.00689","created_at":"2026-07-05T02:05:45.636878+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.00689v3","created_at":"2026-07-05T02:05:45.636878+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.00689","created_at":"2026-07-05T02:05:45.636878+00:00"},{"alias_kind":"pith_short_12","alias_value":"TSKETN43BPO7","created_at":"2026-07-05T02:05:45.636878+00:00"},{"alias_kind":"pith_short_16","alias_value":"TSKETN43BPO7SSOU","created_at":"2026-07-05T02:05:45.636878+00:00"},{"alias_kind":"pith_short_8","alias_value":"TSKETN43","created_at":"2026-07-05T02:05:45.636878+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/TSKETN43BPO7SSOUXSP6RLURBX","json":"https://pith.science/pith/TSKETN43BPO7SSOUXSP6RLURBX.json","graph_json":"https://pith.science/api/pith-number/TSKETN43BPO7SSOUXSP6RLURBX/graph.json","events_json":"https://pith.science/api/pith-number/TSKETN43BPO7SSOUXSP6RLURBX/events.json","paper":"https://pith.science/paper/TSKETN43"},"agent_actions":{"view_html":"https://pith.science/pith/TSKETN43BPO7SSOUXSP6RLURBX","download_json":"https://pith.science/pith/TSKETN43BPO7SSOUXSP6RLURBX.json","view_paper":"https://pith.science/paper/TSKETN43","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.00689&json=true","fetch_graph":"https://pith.science/api/pith-number/TSKETN43BPO7SSOUXSP6RLURBX/graph.json","fetch_events":"https://pith.science/api/pith-number/TSKETN43BPO7SSOUXSP6RLURBX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TSKETN43BPO7SSOUXSP6RLURBX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TSKETN43BPO7SSOUXSP6RLURBX/action/storage_attestation","attest_author":"https://pith.science/pith/TSKETN43BPO7SSOUXSP6RLURBX/action/author_attestation","sign_citation":"https://pith.science/pith/TSKETN43BPO7SSOUXSP6RLURBX/action/citation_signature","submit_replication":"https://pith.science/pith/TSKETN43BPO7SSOUXSP6RLURBX/action/replication_record"}},"created_at":"2026-07-05T02:05:45.636878+00:00","updated_at":"2026-07-05T02:05:45.636878+00:00"}