{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:2RLNNTHTSYXIQM4XY4B6F7PDP5","short_pith_number":"pith:2RLNNTHT","schema_version":"1.0","canonical_sha256":"d456d6ccf3962e883397c703e2fde37f73b85e4e556b44a98f2a83c4d4fd3cc8","source":{"kind":"arxiv","id":"2208.02229","version":6},"attestation_state":"computed","paper":{"title":"A Nonparametric Framework for Online Stochastic Matching with Correlated Arrivals","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Ali Aouad, Will Ma","submitted_at":"2022-08-03T17:31:35Z","abstract_excerpt":"The design of online algorithms for matching markets and revenue management settings is usually bound by the assumption that the demand process is formed by a fixed-length sequence of queries with unknown types, each drawn independently. This notion of serial independence implies that the demand of each type, i.e., the number of queries of a given type, has low variance and is approximately Poisson-distributed.\n  This paper proposes a nonparametric framework for modeling arrival sequences in online stochastic matching that departs from the serial independent assumption. We propose two models, "},"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":"2208.02229","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-08-03T17:31:35Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"be0798f5118160bb1735973f336a8a039c8aef20c530969bb1c2626d24802723","abstract_canon_sha256":"39f1e41ad5a2589c63b5d0bc14a74a7bee4ff50240fda5f96d0bd945f5b34375"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:18.607752Z","signature_b64":"7g8u5d/5UGm2hyQaKcOGtyCi009xo+lj8d4RNB62+JzoZqwUuCTpt32Xu2/j+/caqvx8BNKbIxkjlU1yp1evAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d456d6ccf3962e883397c703e2fde37f73b85e4e556b44a98f2a83c4d4fd3cc8","last_reissued_at":"2026-05-17T23:39:18.607067Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:18.607067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Nonparametric Framework for Online Stochastic Matching with Correlated Arrivals","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Ali Aouad, Will Ma","submitted_at":"2022-08-03T17:31:35Z","abstract_excerpt":"The design of online algorithms for matching markets and revenue management settings is usually bound by the assumption that the demand process is formed by a fixed-length sequence of queries with unknown types, each drawn independently. This notion of serial independence implies that the demand of each type, i.e., the number of queries of a given type, has low variance and is approximately Poisson-distributed.\n  This paper proposes a nonparametric framework for modeling arrival sequences in online stochastic matching that departs from the serial independent assumption. We propose two models, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.02229","kind":"arxiv","version":6},"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":"2208.02229","created_at":"2026-05-17T23:39:18.607162+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.02229v6","created_at":"2026-05-17T23:39:18.607162+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.02229","created_at":"2026-05-17T23:39:18.607162+00:00"},{"alias_kind":"pith_short_12","alias_value":"2RLNNTHTSYXI","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"2RLNNTHTSYXIQM4X","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"2RLNNTHT","created_at":"2026-05-18T12:33:33.725879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.12181","citing_title":"How to Use Prices for Efficient Online Matching","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2RLNNTHTSYXIQM4XY4B6F7PDP5","json":"https://pith.science/pith/2RLNNTHTSYXIQM4XY4B6F7PDP5.json","graph_json":"https://pith.science/api/pith-number/2RLNNTHTSYXIQM4XY4B6F7PDP5/graph.json","events_json":"https://pith.science/api/pith-number/2RLNNTHTSYXIQM4XY4B6F7PDP5/events.json","paper":"https://pith.science/paper/2RLNNTHT"},"agent_actions":{"view_html":"https://pith.science/pith/2RLNNTHTSYXIQM4XY4B6F7PDP5","download_json":"https://pith.science/pith/2RLNNTHTSYXIQM4XY4B6F7PDP5.json","view_paper":"https://pith.science/paper/2RLNNTHT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.02229&json=true","fetch_graph":"https://pith.science/api/pith-number/2RLNNTHTSYXIQM4XY4B6F7PDP5/graph.json","fetch_events":"https://pith.science/api/pith-number/2RLNNTHTSYXIQM4XY4B6F7PDP5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2RLNNTHTSYXIQM4XY4B6F7PDP5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2RLNNTHTSYXIQM4XY4B6F7PDP5/action/storage_attestation","attest_author":"https://pith.science/pith/2RLNNTHTSYXIQM4XY4B6F7PDP5/action/author_attestation","sign_citation":"https://pith.science/pith/2RLNNTHTSYXIQM4XY4B6F7PDP5/action/citation_signature","submit_replication":"https://pith.science/pith/2RLNNTHTSYXIQM4XY4B6F7PDP5/action/replication_record"}},"created_at":"2026-05-17T23:39:18.607162+00:00","updated_at":"2026-05-17T23:39:18.607162+00:00"}