{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:STDIPVV6GTE7DCJZWGRZ42W5KX","short_pith_number":"pith:STDIPVV6","schema_version":"1.0","canonical_sha256":"94c687d6be34c9f18939b1a39e6add55eab8ea382527106563e2b3367fb9c739","source":{"kind":"arxiv","id":"2102.10261","version":3},"attestation_state":"computed","paper":{"title":"Online Stochastic Max-Weight Bipartite Matching: Beyond Prophet Inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amin Saberi, Christos Papadimitriou, David Wajc, Tristan Pollner","submitted_at":"2021-02-20T05:27:28Z","abstract_excerpt":"The rich literature on online Bayesian selection problems has long focused on so-called prophet inequalities, which compare the gain of an online algorithm to that of a \"prophet\" who knows the future. An equally-natural, though significantly less well-studied benchmark is the optimum online algorithm, which may be omnipotent (i.e., computationally-unbounded), but not omniscient. What is the computational complexity of the optimum online? How well can a polynomial-time algorithm approximate it?\n  We study the above questions for the online stochastic maximum-weight matching problem under vertex"},"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":"2102.10261","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-02-20T05:27:28Z","cross_cats_sorted":[],"title_canon_sha256":"1bfc7043f5d98ef56ec592a27d6d3b598a4e5dcf106c6b285ea30ad8e65dac01","abstract_canon_sha256":"089b1d0ee24568b238eb6264a26f26b678da8ed11da93fd8c8d6bc48bfaa3ab0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:06:57.949753Z","signature_b64":"pTU2GM9V5eihSEXoNyPlin0QZkzgRGpSnTjPJVjFzXKe+VxZqCOe+dbPXCffe/gviIj7UgqKAH06D6GhliqPCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94c687d6be34c9f18939b1a39e6add55eab8ea382527106563e2b3367fb9c739","last_reissued_at":"2026-07-05T03:06:57.949370Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:06:57.949370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Stochastic Max-Weight Bipartite Matching: Beyond Prophet Inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amin Saberi, Christos Papadimitriou, David Wajc, Tristan Pollner","submitted_at":"2021-02-20T05:27:28Z","abstract_excerpt":"The rich literature on online Bayesian selection problems has long focused on so-called prophet inequalities, which compare the gain of an online algorithm to that of a \"prophet\" who knows the future. An equally-natural, though significantly less well-studied benchmark is the optimum online algorithm, which may be omnipotent (i.e., computationally-unbounded), but not omniscient. What is the computational complexity of the optimum online? How well can a polynomial-time algorithm approximate it?\n  We study the above questions for the online stochastic maximum-weight matching problem under vertex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.10261","kind":"arxiv","version":3},"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/2102.10261/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":"2102.10261","created_at":"2026-07-05T03:06:57.949428+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.10261v3","created_at":"2026-07-05T03:06:57.949428+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.10261","created_at":"2026-07-05T03:06:57.949428+00:00"},{"alias_kind":"pith_short_12","alias_value":"STDIPVV6GTE7","created_at":"2026-07-05T03:06:57.949428+00:00"},{"alias_kind":"pith_short_16","alias_value":"STDIPVV6GTE7DCJZ","created_at":"2026-07-05T03:06:57.949428+00:00"},{"alias_kind":"pith_short_8","alias_value":"STDIPVV6","created_at":"2026-07-05T03:06:57.949428+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/STDIPVV6GTE7DCJZWGRZ42W5KX","json":"https://pith.science/pith/STDIPVV6GTE7DCJZWGRZ42W5KX.json","graph_json":"https://pith.science/api/pith-number/STDIPVV6GTE7DCJZWGRZ42W5KX/graph.json","events_json":"https://pith.science/api/pith-number/STDIPVV6GTE7DCJZWGRZ42W5KX/events.json","paper":"https://pith.science/paper/STDIPVV6"},"agent_actions":{"view_html":"https://pith.science/pith/STDIPVV6GTE7DCJZWGRZ42W5KX","download_json":"https://pith.science/pith/STDIPVV6GTE7DCJZWGRZ42W5KX.json","view_paper":"https://pith.science/paper/STDIPVV6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.10261&json=true","fetch_graph":"https://pith.science/api/pith-number/STDIPVV6GTE7DCJZWGRZ42W5KX/graph.json","fetch_events":"https://pith.science/api/pith-number/STDIPVV6GTE7DCJZWGRZ42W5KX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/STDIPVV6GTE7DCJZWGRZ42W5KX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/STDIPVV6GTE7DCJZWGRZ42W5KX/action/storage_attestation","attest_author":"https://pith.science/pith/STDIPVV6GTE7DCJZWGRZ42W5KX/action/author_attestation","sign_citation":"https://pith.science/pith/STDIPVV6GTE7DCJZWGRZ42W5KX/action/citation_signature","submit_replication":"https://pith.science/pith/STDIPVV6GTE7DCJZWGRZ42W5KX/action/replication_record"}},"created_at":"2026-07-05T03:06:57.949428+00:00","updated_at":"2026-07-05T03:06:57.949428+00:00"}