{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IT3XGYGCKAX2KWXL4RAJEX7QPL","short_pith_number":"pith:IT3XGYGC","canonical_record":{"source":{"id":"1606.00399","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-01T18:58:36Z","cross_cats_sorted":["math.CO","stat.ML"],"title_canon_sha256":"937a10464a748257f59e5d28db36152fac10e4c9cfdf6a76d3bdcc23f368e744","abstract_canon_sha256":"4baf151a7e84d7734b611ddc33aa15357a94cff17ee3a3b8c714ee68cf5970a1"},"schema_version":"1.0"},"canonical_sha256":"44f77360c2502fa55aebe440925ff07accbe51d2ed3fb9c182d495606e6e2ed1","source":{"kind":"arxiv","id":"1606.00399","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00399","created_at":"2026-05-18T01:13:05Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00399v1","created_at":"2026-05-18T01:13:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00399","created_at":"2026-05-18T01:13:05Z"},{"alias_kind":"pith_short_12","alias_value":"IT3XGYGCKAX2","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IT3XGYGCKAX2KWXL","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IT3XGYGC","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IT3XGYGCKAX2KWXL4RAJEX7QPL","target":"record","payload":{"canonical_record":{"source":{"id":"1606.00399","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-01T18:58:36Z","cross_cats_sorted":["math.CO","stat.ML"],"title_canon_sha256":"937a10464a748257f59e5d28db36152fac10e4c9cfdf6a76d3bdcc23f368e744","abstract_canon_sha256":"4baf151a7e84d7734b611ddc33aa15357a94cff17ee3a3b8c714ee68cf5970a1"},"schema_version":"1.0"},"canonical_sha256":"44f77360c2502fa55aebe440925ff07accbe51d2ed3fb9c182d495606e6e2ed1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:05.409077Z","signature_b64":"REq1xBnkvLrHMoA+WwA8PB2lDHN1o1j3mx2s9ETUE/Xxek1T/dYWItJKa8OqLC6nrNv8wcJoZz29Xm1upUniAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44f77360c2502fa55aebe440925ff07accbe51d2ed3fb9c182d495606e6e2ed1","last_reissued_at":"2026-05-18T01:13:05.408713Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:05.408713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.00399","source_version":1,"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-18T01:13:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/EFjbgUEru8pAOkdcrEO3L0fCOupiTmQpv6PZhJnufLowskToNYSwE+4cm78+rVsFCMi2QrcGzIWY4o0uyo+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:40:52.670908Z"},"content_sha256":"588ef060d0da5ccfa529cbab122c5c777e6044f97ac15662a6c55e5e1e94ad04","schema_version":"1.0","event_id":"sha256:588ef060d0da5ccfa529cbab122c5c777e6044f97ac15662a6c55e5e1e94ad04"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IT3XGYGCKAX2KWXL4RAJEX7QPL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scaling Submodular Maximization via Pruned Submodularity Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Carlos Guestrin, Hua Ouyang, Jeff Bilmes, Tianyi Zhou, Yi Chang","submitted_at":"2016-06-01T18:58:36Z","abstract_excerpt":"We propose a new random pruning method (called \"submodular sparsification (SS)\") to reduce the cost of submodular maximization. The pruning is applied via a \"submodularity graph\" over the $n$ ground elements, where each directed edge is associated with a pairwise dependency defined by the submodular function. In each step, SS prunes a $1-1/\\sqrt{c}$ (for $c>1$) fraction of the nodes using weights on edges computed based on only a small number ($O(\\log n)$) of randomly sampled nodes. The algorithm requires $\\log_{\\sqrt{c}}n$ steps with a small and highly parallelizable per-step computation. An "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00399","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"},"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-18T01:13:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GQ3EWj+RnbNqALQa7VTWzQk6LzRccGiStysvBWtS6aThnKcKqY2kngK6UNIiKJq8HXPK99IFsqaFsetM+pzUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:40:52.671251Z"},"content_sha256":"456fa88a1f68de0a52176b6a67627974eb1afc4abc63a9768cc34c6ca521467a","schema_version":"1.0","event_id":"sha256:456fa88a1f68de0a52176b6a67627974eb1afc4abc63a9768cc34c6ca521467a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IT3XGYGCKAX2KWXL4RAJEX7QPL/bundle.json","state_url":"https://pith.science/pith/IT3XGYGCKAX2KWXL4RAJEX7QPL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IT3XGYGCKAX2KWXL4RAJEX7QPL/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-05T02:40:52Z","links":{"resolver":"https://pith.science/pith/IT3XGYGCKAX2KWXL4RAJEX7QPL","bundle":"https://pith.science/pith/IT3XGYGCKAX2KWXL4RAJEX7QPL/bundle.json","state":"https://pith.science/pith/IT3XGYGCKAX2KWXL4RAJEX7QPL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IT3XGYGCKAX2KWXL4RAJEX7QPL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IT3XGYGCKAX2KWXL4RAJEX7QPL","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":"4baf151a7e84d7734b611ddc33aa15357a94cff17ee3a3b8c714ee68cf5970a1","cross_cats_sorted":["math.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-01T18:58:36Z","title_canon_sha256":"937a10464a748257f59e5d28db36152fac10e4c9cfdf6a76d3bdcc23f368e744"},"schema_version":"1.0","source":{"id":"1606.00399","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00399","created_at":"2026-05-18T01:13:05Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00399v1","created_at":"2026-05-18T01:13:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00399","created_at":"2026-05-18T01:13:05Z"},{"alias_kind":"pith_short_12","alias_value":"IT3XGYGCKAX2","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IT3XGYGCKAX2KWXL","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IT3XGYGC","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:456fa88a1f68de0a52176b6a67627974eb1afc4abc63a9768cc34c6ca521467a","target":"graph","created_at":"2026-05-18T01:13:05Z","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 propose a new random pruning method (called \"submodular sparsification (SS)\") to reduce the cost of submodular maximization. The pruning is applied via a \"submodularity graph\" over the $n$ ground elements, where each directed edge is associated with a pairwise dependency defined by the submodular function. In each step, SS prunes a $1-1/\\sqrt{c}$ (for $c>1$) fraction of the nodes using weights on edges computed based on only a small number ($O(\\log n)$) of randomly sampled nodes. The algorithm requires $\\log_{\\sqrt{c}}n$ steps with a small and highly parallelizable per-step computation. An ","authors_text":"Carlos Guestrin, Hua Ouyang, Jeff Bilmes, Tianyi Zhou, Yi Chang","cross_cats":["math.CO","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-01T18:58:36Z","title":"Scaling Submodular Maximization via Pruned Submodularity Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00399","kind":"arxiv","version":1},"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:588ef060d0da5ccfa529cbab122c5c777e6044f97ac15662a6c55e5e1e94ad04","target":"record","created_at":"2026-05-18T01:13:05Z","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":"4baf151a7e84d7734b611ddc33aa15357a94cff17ee3a3b8c714ee68cf5970a1","cross_cats_sorted":["math.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-06-01T18:58:36Z","title_canon_sha256":"937a10464a748257f59e5d28db36152fac10e4c9cfdf6a76d3bdcc23f368e744"},"schema_version":"1.0","source":{"id":"1606.00399","kind":"arxiv","version":1}},"canonical_sha256":"44f77360c2502fa55aebe440925ff07accbe51d2ed3fb9c182d495606e6e2ed1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44f77360c2502fa55aebe440925ff07accbe51d2ed3fb9c182d495606e6e2ed1","first_computed_at":"2026-05-18T01:13:05.408713Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:05.408713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"REq1xBnkvLrHMoA+WwA8PB2lDHN1o1j3mx2s9ETUE/Xxek1T/dYWItJKa8OqLC6nrNv8wcJoZz29Xm1upUniAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:05.409077Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.00399","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:588ef060d0da5ccfa529cbab122c5c777e6044f97ac15662a6c55e5e1e94ad04","sha256:456fa88a1f68de0a52176b6a67627974eb1afc4abc63a9768cc34c6ca521467a"],"state_sha256":"810fd93e7be9e44112f81423f0f2a8f03ba9b767ab3bf82f9d21316f22ed8a10"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FPuzglNbn/V4n+p6SqZ9wFvo0MOv8XIZi/eDfoo5Ye8iO1K/gA8INNb2LHWKzxr9ZaRcY2KCBrwgUsRQmuVXDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T02:40:52.673214Z","bundle_sha256":"fc77826f25fbbc3b77b6540805890f79c4fb489b0c9e7add9afdc53fba19f983"}}