{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IT3XGYGCKAX2KWXL4RAJEX7QPL","short_pith_number":"pith:IT3XGYGC","schema_version":"1.0","canonical_sha256":"44f77360c2502fa55aebe440925ff07accbe51d2ed3fb9c182d495606e6e2ed1","source":{"kind":"arxiv","id":"1606.00399","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.00399","created_at":"2026-05-18T01:13:05.408766+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.00399v1","created_at":"2026-05-18T01:13:05.408766+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00399","created_at":"2026-05-18T01:13:05.408766+00:00"},{"alias_kind":"pith_short_12","alias_value":"IT3XGYGCKAX2","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IT3XGYGCKAX2KWXL","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IT3XGYGC","created_at":"2026-05-18T12:30:22.444734+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.04428","citing_title":"Submodular Ground-Set Pruning: Monotone Tightness and a Non-Monotone Separation","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IT3XGYGCKAX2KWXL4RAJEX7QPL","json":"https://pith.science/pith/IT3XGYGCKAX2KWXL4RAJEX7QPL.json","graph_json":"https://pith.science/api/pith-number/IT3XGYGCKAX2KWXL4RAJEX7QPL/graph.json","events_json":"https://pith.science/api/pith-number/IT3XGYGCKAX2KWXL4RAJEX7QPL/events.json","paper":"https://pith.science/paper/IT3XGYGC"},"agent_actions":{"view_html":"https://pith.science/pith/IT3XGYGCKAX2KWXL4RAJEX7QPL","download_json":"https://pith.science/pith/IT3XGYGCKAX2KWXL4RAJEX7QPL.json","view_paper":"https://pith.science/paper/IT3XGYGC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.00399&json=true","fetch_graph":"https://pith.science/api/pith-number/IT3XGYGCKAX2KWXL4RAJEX7QPL/graph.json","fetch_events":"https://pith.science/api/pith-number/IT3XGYGCKAX2KWXL4RAJEX7QPL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IT3XGYGCKAX2KWXL4RAJEX7QPL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IT3XGYGCKAX2KWXL4RAJEX7QPL/action/storage_attestation","attest_author":"https://pith.science/pith/IT3XGYGCKAX2KWXL4RAJEX7QPL/action/author_attestation","sign_citation":"https://pith.science/pith/IT3XGYGCKAX2KWXL4RAJEX7QPL/action/citation_signature","submit_replication":"https://pith.science/pith/IT3XGYGCKAX2KWXL4RAJEX7QPL/action/replication_record"}},"created_at":"2026-05-18T01:13:05.408766+00:00","updated_at":"2026-05-18T01:13:05.408766+00:00"}