{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SPFIWPO7U2KUQNEVV6HUNVGQ36","short_pith_number":"pith:SPFIWPO7","schema_version":"1.0","canonical_sha256":"93ca8b3ddfa695483495af8f46d4d0dfb3fa65b5f5f1611b394837f9d2eebafe","source":{"kind":"arxiv","id":"2408.12524","version":1},"attestation_state":"computed","paper":{"title":"Stochastic Online Correlated Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Enze Sun, Zhiyi Huang, Ziyun Chen","submitted_at":"2024-08-22T16:29:55Z","abstract_excerpt":"We study Stochastic Online Correlated Selection (SOCS), a family of online rounding algorithms for Non-IID Stochastic Online Submodular Welfare Maximization and special cases such as Online Stochastic Matching, Stochastic AdWords, and Stochastic Display Ads. At each step, the algorithm sees an online item's type and fractional allocation, then immediately allocates it to an agent. We propose a metric called the convergence rate for the quality of SOCS. This is cleaner than most metrics in the OCS literature.\n  We propose a Type Decomposition that reduces SOCS to the two-way special case. First"},"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":"2408.12524","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-08-22T16:29:55Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"f880cca4d605478c08b0198836c093a8323f54106c70d683fb0c4f4d61c93765","abstract_canon_sha256":"9fe9ec3c7976461b9199d0157a6a704f8a3bf464bb63910e1beb3bd0568c43e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:58:11.300294Z","signature_b64":"7yrWjQ36Zab+K2V8ctiSaG1gdalj16IhfQwWLDn3oJcODDvPAP1M4hgtPrMIhv+TwEMgPkMP7GrB01da54h6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93ca8b3ddfa695483495af8f46d4d0dfb3fa65b5f5f1611b394837f9d2eebafe","last_reissued_at":"2026-07-05T08:58:11.299881Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:58:11.299881Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Online Correlated Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Enze Sun, Zhiyi Huang, Ziyun Chen","submitted_at":"2024-08-22T16:29:55Z","abstract_excerpt":"We study Stochastic Online Correlated Selection (SOCS), a family of online rounding algorithms for Non-IID Stochastic Online Submodular Welfare Maximization and special cases such as Online Stochastic Matching, Stochastic AdWords, and Stochastic Display Ads. At each step, the algorithm sees an online item's type and fractional allocation, then immediately allocates it to an agent. We propose a metric called the convergence rate for the quality of SOCS. This is cleaner than most metrics in the OCS literature.\n  We propose a Type Decomposition that reduces SOCS to the two-way special case. First"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.12524","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/2408.12524/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":"2408.12524","created_at":"2026-07-05T08:58:11.299938+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.12524v1","created_at":"2026-07-05T08:58:11.299938+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.12524","created_at":"2026-07-05T08:58:11.299938+00:00"},{"alias_kind":"pith_short_12","alias_value":"SPFIWPO7U2KU","created_at":"2026-07-05T08:58:11.299938+00:00"},{"alias_kind":"pith_short_16","alias_value":"SPFIWPO7U2KUQNEV","created_at":"2026-07-05T08:58:11.299938+00:00"},{"alias_kind":"pith_short_8","alias_value":"SPFIWPO7","created_at":"2026-07-05T08:58:11.299938+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.08218","citing_title":"Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SPFIWPO7U2KUQNEVV6HUNVGQ36","json":"https://pith.science/pith/SPFIWPO7U2KUQNEVV6HUNVGQ36.json","graph_json":"https://pith.science/api/pith-number/SPFIWPO7U2KUQNEVV6HUNVGQ36/graph.json","events_json":"https://pith.science/api/pith-number/SPFIWPO7U2KUQNEVV6HUNVGQ36/events.json","paper":"https://pith.science/paper/SPFIWPO7"},"agent_actions":{"view_html":"https://pith.science/pith/SPFIWPO7U2KUQNEVV6HUNVGQ36","download_json":"https://pith.science/pith/SPFIWPO7U2KUQNEVV6HUNVGQ36.json","view_paper":"https://pith.science/paper/SPFIWPO7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.12524&json=true","fetch_graph":"https://pith.science/api/pith-number/SPFIWPO7U2KUQNEVV6HUNVGQ36/graph.json","fetch_events":"https://pith.science/api/pith-number/SPFIWPO7U2KUQNEVV6HUNVGQ36/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SPFIWPO7U2KUQNEVV6HUNVGQ36/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SPFIWPO7U2KUQNEVV6HUNVGQ36/action/storage_attestation","attest_author":"https://pith.science/pith/SPFIWPO7U2KUQNEVV6HUNVGQ36/action/author_attestation","sign_citation":"https://pith.science/pith/SPFIWPO7U2KUQNEVV6HUNVGQ36/action/citation_signature","submit_replication":"https://pith.science/pith/SPFIWPO7U2KUQNEVV6HUNVGQ36/action/replication_record"}},"created_at":"2026-07-05T08:58:11.299938+00:00","updated_at":"2026-07-05T08:58:11.299938+00:00"}