{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:I7GCV72B7SIXW2CMF4FS74CHKO","short_pith_number":"pith:I7GCV72B","schema_version":"1.0","canonical_sha256":"47cc2aff41fc917b684c2f0b2ff047539846e49cb26ba543e255c0705ef069d0","source":{"kind":"arxiv","id":"2407.15285","version":1},"attestation_state":"computed","paper":{"title":"New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amin Saberi, David Wajc, Mahsa Derakhshan, Mark Braverman, Tristan Pollner","submitted_at":"2024-07-21T22:42:58Z","abstract_excerpt":"We study the polynomial-time approximability of the optimal online stochastic bipartite matching algorithm, initiated by Papadimitriou et al. (EC'21). Here, nodes on one side of the graph are given upfront, while at each time $t$, an online node and its edge weights are drawn from a time-dependent distribution. The optimal algorithm is $\\textsf{PSPACE}$-hard to approximate within some universal constant. We refer to this optimal algorithm, which requires time to think (compute), as a philosopher, and refer to polynomial-time online approximations of the above as philosopher inequalities. The b"},"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":"2407.15285","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-07-21T22:42:58Z","cross_cats_sorted":[],"title_canon_sha256":"7a1bb452d6aca221f9c79eea38557ae85f23fed1695dbb2bf58e3d0c2d44b6a1","abstract_canon_sha256":"98e3a5f434af76022e12737d25d4b37ec3d7e3d1f80c9bb4e13e5e2415eb0bdd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:46:41.392736Z","signature_b64":"91pGWEKgrylBQsudo8ma9L+zQyUwL//ljkEfB4uZBpt6nAQYjcwExuuN7VoRLMIFa0U3WzilkS8kS2bvU7wEDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47cc2aff41fc917b684c2f0b2ff047539846e49cb26ba543e255c0705ef069d0","last_reissued_at":"2026-07-05T08:46:41.392240Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:46:41.392240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amin Saberi, David Wajc, Mahsa Derakhshan, Mark Braverman, Tristan Pollner","submitted_at":"2024-07-21T22:42:58Z","abstract_excerpt":"We study the polynomial-time approximability of the optimal online stochastic bipartite matching algorithm, initiated by Papadimitriou et al. (EC'21). Here, nodes on one side of the graph are given upfront, while at each time $t$, an online node and its edge weights are drawn from a time-dependent distribution. The optimal algorithm is $\\textsf{PSPACE}$-hard to approximate within some universal constant. We refer to this optimal algorithm, which requires time to think (compute), as a philosopher, and refer to polynomial-time online approximations of the above as philosopher inequalities. The b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.15285","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/2407.15285/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":"2407.15285","created_at":"2026-07-05T08:46:41.392300+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.15285v1","created_at":"2026-07-05T08:46:41.392300+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.15285","created_at":"2026-07-05T08:46:41.392300+00:00"},{"alias_kind":"pith_short_12","alias_value":"I7GCV72B7SIX","created_at":"2026-07-05T08:46:41.392300+00:00"},{"alias_kind":"pith_short_16","alias_value":"I7GCV72B7SIXW2CM","created_at":"2026-07-05T08:46:41.392300+00:00"},{"alias_kind":"pith_short_8","alias_value":"I7GCV72B","created_at":"2026-07-05T08:46:41.392300+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/I7GCV72B7SIXW2CMF4FS74CHKO","json":"https://pith.science/pith/I7GCV72B7SIXW2CMF4FS74CHKO.json","graph_json":"https://pith.science/api/pith-number/I7GCV72B7SIXW2CMF4FS74CHKO/graph.json","events_json":"https://pith.science/api/pith-number/I7GCV72B7SIXW2CMF4FS74CHKO/events.json","paper":"https://pith.science/paper/I7GCV72B"},"agent_actions":{"view_html":"https://pith.science/pith/I7GCV72B7SIXW2CMF4FS74CHKO","download_json":"https://pith.science/pith/I7GCV72B7SIXW2CMF4FS74CHKO.json","view_paper":"https://pith.science/paper/I7GCV72B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.15285&json=true","fetch_graph":"https://pith.science/api/pith-number/I7GCV72B7SIXW2CMF4FS74CHKO/graph.json","fetch_events":"https://pith.science/api/pith-number/I7GCV72B7SIXW2CMF4FS74CHKO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I7GCV72B7SIXW2CMF4FS74CHKO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I7GCV72B7SIXW2CMF4FS74CHKO/action/storage_attestation","attest_author":"https://pith.science/pith/I7GCV72B7SIXW2CMF4FS74CHKO/action/author_attestation","sign_citation":"https://pith.science/pith/I7GCV72B7SIXW2CMF4FS74CHKO/action/citation_signature","submit_replication":"https://pith.science/pith/I7GCV72B7SIXW2CMF4FS74CHKO/action/replication_record"}},"created_at":"2026-07-05T08:46:41.392300+00:00","updated_at":"2026-07-05T08:46:41.392300+00:00"}