{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XCDEUEBORD2BNHANIZDCF5WHPQ","short_pith_number":"pith:XCDEUEBO","schema_version":"1.0","canonical_sha256":"b8864a102e88f4169c0d464622f6c77c02324594c8a704d47d96788ef3afaa26","source":{"kind":"arxiv","id":"2411.08218","version":1},"attestation_state":"computed","paper":{"title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ali Aouad, Alireza Amanihamedani, Amin Saberi, Tristan Pollner","submitted_at":"2024-11-12T22:21:09Z","abstract_excerpt":"We study stationary online bipartite matching, where both types of nodes--offline and online--arrive according to Poisson processes. Offline nodes wait to be matched for some random time, determined by an exponential distribution, while online nodes need to be matched immediately. This model captures scenarios such as deceased organ donation and time-sensitive task assignments, where there is an inflow of patients and workers (offline nodes) with limited patience, while organs and tasks (online nodes) must be assigned upon arrival.\n  We present an efficient online algorithm that achieves a $(1"},"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":"2411.08218","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-12T22:21:09Z","cross_cats_sorted":[],"title_canon_sha256":"cf6be95546b078c20b0ce54e5536cbef6b45f41feb80445e51a71b3eb8e8a137","abstract_canon_sha256":"78f5cc53fa2f91fa87cf4b69697fefddf90dd3ed3ebdc202050177d4e5e5ca69"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:34:43.528892Z","signature_b64":"nW/c7wdr84hTaypqJTFXE+TUbe6U2UPVINHkMMK75JpfUPyfQn08xxl7TdKVjzooPUCCVtQXAWgbAVUxLfmiAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8864a102e88f4169c0d464622f6c77c02324594c8a704d47d96788ef3afaa26","last_reissued_at":"2026-07-05T09:34:43.528441Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:34:43.528441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ali Aouad, Alireza Amanihamedani, Amin Saberi, Tristan Pollner","submitted_at":"2024-11-12T22:21:09Z","abstract_excerpt":"We study stationary online bipartite matching, where both types of nodes--offline and online--arrive according to Poisson processes. Offline nodes wait to be matched for some random time, determined by an exponential distribution, while online nodes need to be matched immediately. This model captures scenarios such as deceased organ donation and time-sensitive task assignments, where there is an inflow of patients and workers (offline nodes) with limited patience, while organs and tasks (online nodes) must be assigned upon arrival.\n  We present an efficient online algorithm that achieves a $(1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.08218","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.08218/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":"2411.08218","created_at":"2026-07-05T09:34:43.528500+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.08218v1","created_at":"2026-07-05T09:34:43.528500+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.08218","created_at":"2026-07-05T09:34:43.528500+00:00"},{"alias_kind":"pith_short_12","alias_value":"XCDEUEBORD2B","created_at":"2026-07-05T09:34:43.528500+00:00"},{"alias_kind":"pith_short_16","alias_value":"XCDEUEBORD2BNHAN","created_at":"2026-07-05T09:34:43.528500+00:00"},{"alias_kind":"pith_short_8","alias_value":"XCDEUEBO","created_at":"2026-07-05T09:34:43.528500+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.04551","citing_title":"Greedy Dynamic Matching","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XCDEUEBORD2BNHANIZDCF5WHPQ","json":"https://pith.science/pith/XCDEUEBORD2BNHANIZDCF5WHPQ.json","graph_json":"https://pith.science/api/pith-number/XCDEUEBORD2BNHANIZDCF5WHPQ/graph.json","events_json":"https://pith.science/api/pith-number/XCDEUEBORD2BNHANIZDCF5WHPQ/events.json","paper":"https://pith.science/paper/XCDEUEBO"},"agent_actions":{"view_html":"https://pith.science/pith/XCDEUEBORD2BNHANIZDCF5WHPQ","download_json":"https://pith.science/pith/XCDEUEBORD2BNHANIZDCF5WHPQ.json","view_paper":"https://pith.science/paper/XCDEUEBO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.08218&json=true","fetch_graph":"https://pith.science/api/pith-number/XCDEUEBORD2BNHANIZDCF5WHPQ/graph.json","fetch_events":"https://pith.science/api/pith-number/XCDEUEBORD2BNHANIZDCF5WHPQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XCDEUEBORD2BNHANIZDCF5WHPQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XCDEUEBORD2BNHANIZDCF5WHPQ/action/storage_attestation","attest_author":"https://pith.science/pith/XCDEUEBORD2BNHANIZDCF5WHPQ/action/author_attestation","sign_citation":"https://pith.science/pith/XCDEUEBORD2BNHANIZDCF5WHPQ/action/citation_signature","submit_replication":"https://pith.science/pith/XCDEUEBORD2BNHANIZDCF5WHPQ/action/replication_record"}},"created_at":"2026-07-05T09:34:43.528500+00:00","updated_at":"2026-07-05T09:34:43.528500+00:00"}