{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JH6QVHE7CF2HFFNFB25LJ4W32B","short_pith_number":"pith:JH6QVHE7","schema_version":"1.0","canonical_sha256":"49fd0a9c9f11747295a50ebab4f2dbd042f82bad30282c79298a8fd25a157951","source":{"kind":"arxiv","id":"1608.00673","version":1},"attestation_state":"computed","paper":{"title":"Adaptivity Gaps for Stochastic Probing: Submodular and XOS Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anupam Gupta, Sahil Singla, Viswanath Nagarajan","submitted_at":"2016-08-02T02:07:51Z","abstract_excerpt":"Suppose we are given a submodular function $f$ over a set of elements, and we want to maximize its value subject to certain constraints. Good approximation algorithms are known for such problems under both monotone and non-monotone submodular functions. We consider these problems in a stochastic setting, where elements are not all active and we can only get value from active elements. Each element $e$ is active independently with some known probability $p_e$, but we don't know the element's status \\emph{a priori}. We find it out only when we \\emph{probe} the element $e$---probing reveals wheth"},"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":"1608.00673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-02T02:07:51Z","cross_cats_sorted":[],"title_canon_sha256":"95c50eb5db6f583c1050bb71a0afc43be546d655c1241eba0e16c8d5cde1cbf7","abstract_canon_sha256":"66a24f37d244e5a23285ffb4a6611f4d043fe4c1c6cfa6fbae5d428813734ad7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:01.349980Z","signature_b64":"m0LJ6ZPJhBOlR1uQ0GYD6wanBy5V1jRu5S36RfsuD/OsN8X7NsNXyp+wm95LzEEUuFVi95wr4VuqEoJ8QpR1DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49fd0a9c9f11747295a50ebab4f2dbd042f82bad30282c79298a8fd25a157951","last_reissued_at":"2026-05-18T01:10:01.349414Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:01.349414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptivity Gaps for Stochastic Probing: Submodular and XOS Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anupam Gupta, Sahil Singla, Viswanath Nagarajan","submitted_at":"2016-08-02T02:07:51Z","abstract_excerpt":"Suppose we are given a submodular function $f$ over a set of elements, and we want to maximize its value subject to certain constraints. Good approximation algorithms are known for such problems under both monotone and non-monotone submodular functions. We consider these problems in a stochastic setting, where elements are not all active and we can only get value from active elements. Each element $e$ is active independently with some known probability $p_e$, but we don't know the element's status \\emph{a priori}. We find it out only when we \\emph{probe} the element $e$---probing reveals wheth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00673","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":"1608.00673","created_at":"2026-05-18T01:10:01.349510+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.00673v1","created_at":"2026-05-18T01:10:01.349510+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00673","created_at":"2026-05-18T01:10:01.349510+00:00"},{"alias_kind":"pith_short_12","alias_value":"JH6QVHE7CF2H","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JH6QVHE7CF2HFFNF","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JH6QVHE7","created_at":"2026-05-18T12:30:25.849896+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/JH6QVHE7CF2HFFNFB25LJ4W32B","json":"https://pith.science/pith/JH6QVHE7CF2HFFNFB25LJ4W32B.json","graph_json":"https://pith.science/api/pith-number/JH6QVHE7CF2HFFNFB25LJ4W32B/graph.json","events_json":"https://pith.science/api/pith-number/JH6QVHE7CF2HFFNFB25LJ4W32B/events.json","paper":"https://pith.science/paper/JH6QVHE7"},"agent_actions":{"view_html":"https://pith.science/pith/JH6QVHE7CF2HFFNFB25LJ4W32B","download_json":"https://pith.science/pith/JH6QVHE7CF2HFFNFB25LJ4W32B.json","view_paper":"https://pith.science/paper/JH6QVHE7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.00673&json=true","fetch_graph":"https://pith.science/api/pith-number/JH6QVHE7CF2HFFNFB25LJ4W32B/graph.json","fetch_events":"https://pith.science/api/pith-number/JH6QVHE7CF2HFFNFB25LJ4W32B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JH6QVHE7CF2HFFNFB25LJ4W32B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JH6QVHE7CF2HFFNFB25LJ4W32B/action/storage_attestation","attest_author":"https://pith.science/pith/JH6QVHE7CF2HFFNFB25LJ4W32B/action/author_attestation","sign_citation":"https://pith.science/pith/JH6QVHE7CF2HFFNFB25LJ4W32B/action/citation_signature","submit_replication":"https://pith.science/pith/JH6QVHE7CF2HFFNFB25LJ4W32B/action/replication_record"}},"created_at":"2026-05-18T01:10:01.349510+00:00","updated_at":"2026-05-18T01:10:01.349510+00:00"}