{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ONMAVVM2CZCG23SUGHQNPAQ65C","short_pith_number":"pith:ONMAVVM2","schema_version":"1.0","canonical_sha256":"73580ad59a16446d6e5431e0d7821ee8887d3ffd3a5df34696021a8b0ee019c7","source":{"kind":"arxiv","id":"1611.00665","version":1},"attestation_state":"computed","paper":{"title":"Combinatorial Prophet Inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aviad Rubinstein, Sahil Singla","submitted_at":"2016-11-02T16:09:26Z","abstract_excerpt":"We introduce a novel framework of Prophet Inequalities for combinatorial valuation functions. For a (non-monotone) submodular objective function over an arbitrary matroid feasibility constraint, we give an $O(1)$-competitive algorithm. For a monotone subadditive objective function over an arbitrary downward-closed feasibility constraint, we give an $O(\\log n \\log^2 r)$-competitive algorithm (where $r$ is the cardinality of the largest feasible subset).\n  Inspired by the proof of our subadditive prophet inequality, we also obtain an $O(\\log n \\cdot \\log^2 r)$-competitive algorithm for the Secre"},"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":"1611.00665","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-02T16:09:26Z","cross_cats_sorted":[],"title_canon_sha256":"d7488f240b82be0a418cc819aa8257ffdfb803a3844e637f3d3b3174875e6bfb","abstract_canon_sha256":"4ac19badc16026d197941501d5db2c782896f061cddbe295b02d717b3c8e0086"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:32.180894Z","signature_b64":"2nTrmT5e4B5TwfFUoguvjBkWYKFpL/f2Gus7zq/VVXCwYm64hcbjpYakkK+M8EdDnqPqvfbqGjkOw5vdJiy4Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73580ad59a16446d6e5431e0d7821ee8887d3ffd3a5df34696021a8b0ee019c7","last_reissued_at":"2026-05-18T01:00:32.180242Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:32.180242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial Prophet Inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aviad Rubinstein, Sahil Singla","submitted_at":"2016-11-02T16:09:26Z","abstract_excerpt":"We introduce a novel framework of Prophet Inequalities for combinatorial valuation functions. For a (non-monotone) submodular objective function over an arbitrary matroid feasibility constraint, we give an $O(1)$-competitive algorithm. For a monotone subadditive objective function over an arbitrary downward-closed feasibility constraint, we give an $O(\\log n \\log^2 r)$-competitive algorithm (where $r$ is the cardinality of the largest feasible subset).\n  Inspired by the proof of our subadditive prophet inequality, we also obtain an $O(\\log n \\cdot \\log^2 r)$-competitive algorithm for the Secre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00665","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":""},"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":"1611.00665","created_at":"2026-05-18T01:00:32.180340+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.00665v1","created_at":"2026-05-18T01:00:32.180340+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00665","created_at":"2026-05-18T01:00:32.180340+00:00"},{"alias_kind":"pith_short_12","alias_value":"ONMAVVM2CZCG","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"ONMAVVM2CZCG23SU","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"ONMAVVM2","created_at":"2026-05-18T12:30:36.002864+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/ONMAVVM2CZCG23SUGHQNPAQ65C","json":"https://pith.science/pith/ONMAVVM2CZCG23SUGHQNPAQ65C.json","graph_json":"https://pith.science/api/pith-number/ONMAVVM2CZCG23SUGHQNPAQ65C/graph.json","events_json":"https://pith.science/api/pith-number/ONMAVVM2CZCG23SUGHQNPAQ65C/events.json","paper":"https://pith.science/paper/ONMAVVM2"},"agent_actions":{"view_html":"https://pith.science/pith/ONMAVVM2CZCG23SUGHQNPAQ65C","download_json":"https://pith.science/pith/ONMAVVM2CZCG23SUGHQNPAQ65C.json","view_paper":"https://pith.science/paper/ONMAVVM2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.00665&json=true","fetch_graph":"https://pith.science/api/pith-number/ONMAVVM2CZCG23SUGHQNPAQ65C/graph.json","fetch_events":"https://pith.science/api/pith-number/ONMAVVM2CZCG23SUGHQNPAQ65C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ONMAVVM2CZCG23SUGHQNPAQ65C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ONMAVVM2CZCG23SUGHQNPAQ65C/action/storage_attestation","attest_author":"https://pith.science/pith/ONMAVVM2CZCG23SUGHQNPAQ65C/action/author_attestation","sign_citation":"https://pith.science/pith/ONMAVVM2CZCG23SUGHQNPAQ65C/action/citation_signature","submit_replication":"https://pith.science/pith/ONMAVVM2CZCG23SUGHQNPAQ65C/action/replication_record"}},"created_at":"2026-05-18T01:00:32.180340+00:00","updated_at":"2026-05-18T01:00:32.180340+00:00"}