{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:2RLNNTHTSYXIQM4XY4B6F7PDP5","short_pith_number":"pith:2RLNNTHT","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"},"canonical_sha256":"d456d6ccf3962e883397c703e2fde37f73b85e4e556b44a98f2a83c4d4fd3cc8","source":{"kind":"arxiv","id":"2208.02229","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.02229","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"2208.02229v6","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.02229","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"2RLNNTHTSYXI","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"2RLNNTHTSYXIQM4X","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"2RLNNTHT","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:2RLNNTHTSYXIQM4XY4B6F7PDP5","target":"record","payload":{"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"},"canonical_sha256":"d456d6ccf3962e883397c703e2fde37f73b85e4e556b44a98f2a83c4d4fd3cc8","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"},"source_kind":"arxiv","source_id":"2208.02229","source_version":6,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"doZ4odFN8c98as4UmCQ5dEJdEN11cv8wQ4NQoPc6xdZFjdpTKBfTUVj8d8TzQUbJ62tGza53VHcfiATND/yEDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:03:17.218395Z"},"content_sha256":"fb0af2d325180042128fb7ac58641b506e343b225bbfb5f7361982d14601d32f","schema_version":"1.0","event_id":"sha256:fb0af2d325180042128fb7ac58641b506e343b225bbfb5f7361982d14601d32f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:2RLNNTHTSYXIQM4XY4B6F7PDP5","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GV46lUnHBofB7DkHch66rD0XENOUENnSPEPImI599u965YPyP7QXrCJeIcgi1qSyi6Mj6j5w2ZdcssGDDrUSDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:03:17.218746Z"},"content_sha256":"0c7c9b501d2442201de6be1b035b31158e8b393ba8da238139b4cfac40003c25","schema_version":"1.0","event_id":"sha256:0c7c9b501d2442201de6be1b035b31158e8b393ba8da238139b4cfac40003c25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2RLNNTHTSYXIQM4XY4B6F7PDP5/bundle.json","state_url":"https://pith.science/pith/2RLNNTHTSYXIQM4XY4B6F7PDP5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2RLNNTHTSYXIQM4XY4B6F7PDP5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T18:03:17Z","links":{"resolver":"https://pith.science/pith/2RLNNTHTSYXIQM4XY4B6F7PDP5","bundle":"https://pith.science/pith/2RLNNTHTSYXIQM4XY4B6F7PDP5/bundle.json","state":"https://pith.science/pith/2RLNNTHTSYXIQM4XY4B6F7PDP5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2RLNNTHTSYXIQM4XY4B6F7PDP5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:2RLNNTHTSYXIQM4XY4B6F7PDP5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"39f1e41ad5a2589c63b5d0bc14a74a7bee4ff50240fda5f96d0bd945f5b34375","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-08-03T17:31:35Z","title_canon_sha256":"be0798f5118160bb1735973f336a8a039c8aef20c530969bb1c2626d24802723"},"schema_version":"1.0","source":{"id":"2208.02229","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.02229","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"2208.02229v6","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.02229","created_at":"2026-05-17T23:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"2RLNNTHTSYXI","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"2RLNNTHTSYXIQM4X","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"2RLNNTHT","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:0c7c9b501d2442201de6be1b035b31158e8b393ba8da238139b4cfac40003c25","target":"graph","created_at":"2026-05-17T23:39:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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, ","authors_text":"Ali Aouad, Will Ma","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-08-03T17:31:35Z","title":"A Nonparametric Framework for Online Stochastic Matching with Correlated Arrivals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.02229","kind":"arxiv","version":6},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fb0af2d325180042128fb7ac58641b506e343b225bbfb5f7361982d14601d32f","target":"record","created_at":"2026-05-17T23:39:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"39f1e41ad5a2589c63b5d0bc14a74a7bee4ff50240fda5f96d0bd945f5b34375","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-08-03T17:31:35Z","title_canon_sha256":"be0798f5118160bb1735973f336a8a039c8aef20c530969bb1c2626d24802723"},"schema_version":"1.0","source":{"id":"2208.02229","kind":"arxiv","version":6}},"canonical_sha256":"d456d6ccf3962e883397c703e2fde37f73b85e4e556b44a98f2a83c4d4fd3cc8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d456d6ccf3962e883397c703e2fde37f73b85e4e556b44a98f2a83c4d4fd3cc8","first_computed_at":"2026-05-17T23:39:18.607067Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:18.607067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7g8u5d/5UGm2hyQaKcOGtyCi009xo+lj8d4RNB62+JzoZqwUuCTpt32Xu2/j+/caqvx8BNKbIxkjlU1yp1evAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:18.607752Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.02229","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb0af2d325180042128fb7ac58641b506e343b225bbfb5f7361982d14601d32f","sha256:0c7c9b501d2442201de6be1b035b31158e8b393ba8da238139b4cfac40003c25"],"state_sha256":"616b33fa22fcadecc8d3159195ebbab03beb019a657b7043c8af4600240e4b49"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QBry1/7z+b1nSaqLEQgW0UqooFfOoSImV3kWM5GcXiduZX/uwfxNQSevL6yexiT9LvvGU5FIk6qNAUdvNVauBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T18:03:17.220956Z","bundle_sha256":"9b9ee74ea7206a13178aa3a5b1d1032a76b574121db65efcb1819a6c5c55f017"}}