{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6A72WHROGLLUNXPST7DB6IFBNY","short_pith_number":"pith:6A72WHRO","schema_version":"1.0","canonical_sha256":"f03fab1e2e32d746ddf29fc61f20a16e0a46a09074862d2127cf0e70315c3289","source":{"kind":"arxiv","id":"2411.16947","version":1},"attestation_state":"computed","paper":{"title":"Online $b$-Matching with Stochastic Rewards","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sebastian Schubert, Susanne Albers","submitted_at":"2024-11-25T21:37:55Z","abstract_excerpt":"The $b$-matching problem is an allocation problem where the vertices on the left-hand side of a bipartite graph, referred to as servers, may be matched multiple times. In the setting with stochastic rewards, an assignment between an incoming request and a server turns into a match with a given success probability. Mehta and Panigrahi (FOCS 2012) introduced online bipartite matching with stochastic rewards, where each vertex may be matched once. The framework is equally interesting in graphs with vertex capacities. In Internet advertising, for instance, the advertisers seek successful matches w"},"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.16947","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-25T21:37:55Z","cross_cats_sorted":[],"title_canon_sha256":"a09b00408c3bae05f704e0c44c1db95f678c0c8f86de5aa35e1801219c711847","abstract_canon_sha256":"657c9c222a72ac2c506474326f1e8fcceb7e912251770a92ba8317de45fb677a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:40:25.002696Z","signature_b64":"pGPsf+5Qz20QvRuTWcgbGvoYT7Mpa0TARlHRNa6BgTOBZ7FLvWohyR9Acbz90bckYqzaWEsGRgsURLqLQyhwCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f03fab1e2e32d746ddf29fc61f20a16e0a46a09074862d2127cf0e70315c3289","last_reissued_at":"2026-07-05T09:40:25.002231Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:40:25.002231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online $b$-Matching with Stochastic Rewards","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sebastian Schubert, Susanne Albers","submitted_at":"2024-11-25T21:37:55Z","abstract_excerpt":"The $b$-matching problem is an allocation problem where the vertices on the left-hand side of a bipartite graph, referred to as servers, may be matched multiple times. In the setting with stochastic rewards, an assignment between an incoming request and a server turns into a match with a given success probability. Mehta and Panigrahi (FOCS 2012) introduced online bipartite matching with stochastic rewards, where each vertex may be matched once. The framework is equally interesting in graphs with vertex capacities. In Internet advertising, for instance, the advertisers seek successful matches w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.16947","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.16947/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.16947","created_at":"2026-07-05T09:40:25.002285+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.16947v1","created_at":"2026-07-05T09:40:25.002285+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.16947","created_at":"2026-07-05T09:40:25.002285+00:00"},{"alias_kind":"pith_short_12","alias_value":"6A72WHROGLLU","created_at":"2026-07-05T09:40:25.002285+00:00"},{"alias_kind":"pith_short_16","alias_value":"6A72WHROGLLUNXPS","created_at":"2026-07-05T09:40:25.002285+00:00"},{"alias_kind":"pith_short_8","alias_value":"6A72WHRO","created_at":"2026-07-05T09:40:25.002285+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/6A72WHROGLLUNXPST7DB6IFBNY","json":"https://pith.science/pith/6A72WHROGLLUNXPST7DB6IFBNY.json","graph_json":"https://pith.science/api/pith-number/6A72WHROGLLUNXPST7DB6IFBNY/graph.json","events_json":"https://pith.science/api/pith-number/6A72WHROGLLUNXPST7DB6IFBNY/events.json","paper":"https://pith.science/paper/6A72WHRO"},"agent_actions":{"view_html":"https://pith.science/pith/6A72WHROGLLUNXPST7DB6IFBNY","download_json":"https://pith.science/pith/6A72WHROGLLUNXPST7DB6IFBNY.json","view_paper":"https://pith.science/paper/6A72WHRO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.16947&json=true","fetch_graph":"https://pith.science/api/pith-number/6A72WHROGLLUNXPST7DB6IFBNY/graph.json","fetch_events":"https://pith.science/api/pith-number/6A72WHROGLLUNXPST7DB6IFBNY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6A72WHROGLLUNXPST7DB6IFBNY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6A72WHROGLLUNXPST7DB6IFBNY/action/storage_attestation","attest_author":"https://pith.science/pith/6A72WHROGLLUNXPST7DB6IFBNY/action/author_attestation","sign_citation":"https://pith.science/pith/6A72WHROGLLUNXPST7DB6IFBNY/action/citation_signature","submit_replication":"https://pith.science/pith/6A72WHROGLLUNXPST7DB6IFBNY/action/replication_record"}},"created_at":"2026-07-05T09:40:25.002285+00:00","updated_at":"2026-07-05T09:40:25.002285+00:00"}