{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UIUNYJ3E5IHBBOCKZAJS6RKVAI","short_pith_number":"pith:UIUNYJ3E","canonical_record":{"source":{"id":"1504.02146","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-08T22:26:28Z","cross_cats_sorted":["cs.CC","math.OC"],"title_canon_sha256":"2390932b896974943ad1a2237b0e6ccb09bbecd52c707fec4bc0f673d591c01a","abstract_canon_sha256":"249a6ead0f88a8b22a2dbeb8b27b404833d654f90e6d1903b03fedc98275698e"},"schema_version":"1.0"},"canonical_sha256":"a228dc2764ea0e10b84ac8132f45550216de459821a4043f2ce4d45f239a6866","source":{"kind":"arxiv","id":"1504.02146","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02146","created_at":"2026-05-18T02:17:52Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02146v2","created_at":"2026-05-18T02:17:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02146","created_at":"2026-05-18T02:17:52Z"},{"alias_kind":"pith_short_12","alias_value":"UIUNYJ3E5IHB","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UIUNYJ3E5IHBBOCK","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UIUNYJ3E","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UIUNYJ3E5IHBBOCKZAJS6RKVAI","target":"record","payload":{"canonical_record":{"source":{"id":"1504.02146","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-08T22:26:28Z","cross_cats_sorted":["cs.CC","math.OC"],"title_canon_sha256":"2390932b896974943ad1a2237b0e6ccb09bbecd52c707fec4bc0f673d591c01a","abstract_canon_sha256":"249a6ead0f88a8b22a2dbeb8b27b404833d654f90e6d1903b03fedc98275698e"},"schema_version":"1.0"},"canonical_sha256":"a228dc2764ea0e10b84ac8132f45550216de459821a4043f2ce4d45f239a6866","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:52.974244Z","signature_b64":"AabjCXmzCvQnAFemEN1r0JngoTWZ4xkBHwW0fhoP0NpOFdaMiEV/worW4xyzRGGyzQXHSi+H+A90Y2haNNmkDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a228dc2764ea0e10b84ac8132f45550216de459821a4043f2ce4d45f239a6866","last_reissued_at":"2026-05-18T02:17:52.973500Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:52.973500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.02146","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:17:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JTWhwMjX6zCSokmdgfB+tGxPmSah2e83SnGNmXDlpjr7vNBZeeFuPLYPvWBK6MiqfVYqNYHxu68k19oG3lVBDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T19:28:13.865978Z"},"content_sha256":"3d0ec35c0662be19750343d4894d35ab413cc666ea89087a5f3b0f5e571eb486","schema_version":"1.0","event_id":"sha256:3d0ec35c0662be19750343d4894d35ab413cc666ea89087a5f3b0f5e571eb486"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UIUNYJ3E5IHBBOCKZAJS6RKVAI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Discrete Stochastic Submodular Maximization: Adaptive vs. Non-Adaptive vs. Offline","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.OC"],"primary_cat":"cs.DS","authors_text":"Devorah Kletenik, Lisa Hellerstein, Patrick Lin","submitted_at":"2015-04-08T22:26:28Z","abstract_excerpt":"We consider the problem of stochastic monotone submodular function maximization, subject to constraints. We give results on adaptivity gaps, and on the gap between the optimal offline and online solutions. We present a procedure that transforms a decision tree (adaptive algorithm) into a non-adaptive chain. We prove that this chain achieves at least ${\\tau}$ times the utility of the decision tree, over a product distribution and binary state space, where ${\\tau} = \\min_{i,j} \\Pr[x_i=j]$. This proves an adaptivity gap of $1/{\\tau}$ (which is $2$ in the case of a uniform distribution) for the pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02146","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:17:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o+tO1r/fI5ddi0203gnhbBH4OWODdhgaf8BLU/85NMonUwJPPAG6ogIOTsxTEqFIL9wdWJvKNlV22q37jBqqBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T19:28:13.866340Z"},"content_sha256":"6340f15383b76dde328212210a129301e361b80b2a430c102332494f42536492","schema_version":"1.0","event_id":"sha256:6340f15383b76dde328212210a129301e361b80b2a430c102332494f42536492"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UIUNYJ3E5IHBBOCKZAJS6RKVAI/bundle.json","state_url":"https://pith.science/pith/UIUNYJ3E5IHBBOCKZAJS6RKVAI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UIUNYJ3E5IHBBOCKZAJS6RKVAI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T19:28:13Z","links":{"resolver":"https://pith.science/pith/UIUNYJ3E5IHBBOCKZAJS6RKVAI","bundle":"https://pith.science/pith/UIUNYJ3E5IHBBOCKZAJS6RKVAI/bundle.json","state":"https://pith.science/pith/UIUNYJ3E5IHBBOCKZAJS6RKVAI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UIUNYJ3E5IHBBOCKZAJS6RKVAI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UIUNYJ3E5IHBBOCKZAJS6RKVAI","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"249a6ead0f88a8b22a2dbeb8b27b404833d654f90e6d1903b03fedc98275698e","cross_cats_sorted":["cs.CC","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-08T22:26:28Z","title_canon_sha256":"2390932b896974943ad1a2237b0e6ccb09bbecd52c707fec4bc0f673d591c01a"},"schema_version":"1.0","source":{"id":"1504.02146","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02146","created_at":"2026-05-18T02:17:52Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02146v2","created_at":"2026-05-18T02:17:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02146","created_at":"2026-05-18T02:17:52Z"},{"alias_kind":"pith_short_12","alias_value":"UIUNYJ3E5IHB","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UIUNYJ3E5IHBBOCK","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UIUNYJ3E","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:6340f15383b76dde328212210a129301e361b80b2a430c102332494f42536492","target":"graph","created_at":"2026-05-18T02:17:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We consider the problem of stochastic monotone submodular function maximization, subject to constraints. We give results on adaptivity gaps, and on the gap between the optimal offline and online solutions. We present a procedure that transforms a decision tree (adaptive algorithm) into a non-adaptive chain. We prove that this chain achieves at least ${\\tau}$ times the utility of the decision tree, over a product distribution and binary state space, where ${\\tau} = \\min_{i,j} \\Pr[x_i=j]$. This proves an adaptivity gap of $1/{\\tau}$ (which is $2$ in the case of a uniform distribution) for the pr","authors_text":"Devorah Kletenik, Lisa Hellerstein, Patrick Lin","cross_cats":["cs.CC","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-08T22:26:28Z","title":"Discrete Stochastic Submodular Maximization: Adaptive vs. Non-Adaptive vs. Offline"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02146","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3d0ec35c0662be19750343d4894d35ab413cc666ea89087a5f3b0f5e571eb486","target":"record","created_at":"2026-05-18T02:17:52Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"249a6ead0f88a8b22a2dbeb8b27b404833d654f90e6d1903b03fedc98275698e","cross_cats_sorted":["cs.CC","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-08T22:26:28Z","title_canon_sha256":"2390932b896974943ad1a2237b0e6ccb09bbecd52c707fec4bc0f673d591c01a"},"schema_version":"1.0","source":{"id":"1504.02146","kind":"arxiv","version":2}},"canonical_sha256":"a228dc2764ea0e10b84ac8132f45550216de459821a4043f2ce4d45f239a6866","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a228dc2764ea0e10b84ac8132f45550216de459821a4043f2ce4d45f239a6866","first_computed_at":"2026-05-18T02:17:52.973500Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:52.973500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AabjCXmzCvQnAFemEN1r0JngoTWZ4xkBHwW0fhoP0NpOFdaMiEV/worW4xyzRGGyzQXHSi+H+A90Y2haNNmkDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:52.974244Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.02146","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d0ec35c0662be19750343d4894d35ab413cc666ea89087a5f3b0f5e571eb486","sha256:6340f15383b76dde328212210a129301e361b80b2a430c102332494f42536492"],"state_sha256":"b62406495f43391896516432f00ec6776fa01b1c5dadf3a95c517759c2a5046c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IIzOMyngVhhnXtq1Cu9jxlRVsRDAnm2lvrNcdQBwlD7dGlXED/+NASDxJZTkhpiUZN9mM/sVEtXppcWkcxLRCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T19:28:13.868339Z","bundle_sha256":"aa7fa50c3af408fc48abd1b818c4c9e09266068cc4c2ff931cf7315e56aff01f"}}