{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:5ZCVWFLRPISGFXIBDSUXJNEUV5","short_pith_number":"pith:5ZCVWFLR","schema_version":"1.0","canonical_sha256":"ee455b15717a2462dd011ca974b494af69e686bd95aef813ff1757ad3b5c32f7","source":{"kind":"arxiv","id":"1010.5511","version":1},"attestation_state":"computed","paper":{"title":"Efficient Minimization of Decomposable Submodular Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Andreas Krause, Peter Stobbe","submitted_at":"2010-10-26T20:23:39Z","abstract_excerpt":"Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of convex functions, and can be minimized in strongly polynomial time. Unfortunately, state-of-the-art algorithms for general submodular minimization are intractable for larger problems. In this paper, we introduce a novel subclass of submodular minimization problems that we call decomposable. Decomposable submodular functions are those that can be represented as sums of concave functions applied to modular functions. We d"},"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":"1010.5511","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-10-26T20:23:39Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"553cd30e1012f9196fbf6eda42a9012405eb6e34e0244806113b2f827bf2b1a6","abstract_canon_sha256":"d76ff349e5da55dd1793f6d9d2aa2ce16b2943321cbb8b4a94a76b455f69f0d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:38.538520Z","signature_b64":"B01uBK5l1VHZNhflRuZa1SLpveDrbU0HwaH+V5gne2MhygXWsDrfM0UVJQ6CmC65tOpnlUwjDSY00jBIXAdnAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee455b15717a2462dd011ca974b494af69e686bd95aef813ff1757ad3b5c32f7","last_reissued_at":"2026-05-18T02:23:38.538025Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:38.538025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Minimization of Decomposable Submodular Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Andreas Krause, Peter Stobbe","submitted_at":"2010-10-26T20:23:39Z","abstract_excerpt":"Many combinatorial problems arising in machine learning can be reduced to the problem of minimizing a submodular function. Submodular functions are a natural discrete analog of convex functions, and can be minimized in strongly polynomial time. Unfortunately, state-of-the-art algorithms for general submodular minimization are intractable for larger problems. In this paper, we introduce a novel subclass of submodular minimization problems that we call decomposable. Decomposable submodular functions are those that can be represented as sums of concave functions applied to modular functions. We d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5511","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":"1010.5511","created_at":"2026-05-18T02:23:38.538095+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.5511v1","created_at":"2026-05-18T02:23:38.538095+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5511","created_at":"2026-05-18T02:23:38.538095+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ZCVWFLRPISG","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ZCVWFLRPISGFXIB","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ZCVWFLR","created_at":"2026-05-18T12:26:04.259169+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/5ZCVWFLRPISGFXIBDSUXJNEUV5","json":"https://pith.science/pith/5ZCVWFLRPISGFXIBDSUXJNEUV5.json","graph_json":"https://pith.science/api/pith-number/5ZCVWFLRPISGFXIBDSUXJNEUV5/graph.json","events_json":"https://pith.science/api/pith-number/5ZCVWFLRPISGFXIBDSUXJNEUV5/events.json","paper":"https://pith.science/paper/5ZCVWFLR"},"agent_actions":{"view_html":"https://pith.science/pith/5ZCVWFLRPISGFXIBDSUXJNEUV5","download_json":"https://pith.science/pith/5ZCVWFLRPISGFXIBDSUXJNEUV5.json","view_paper":"https://pith.science/paper/5ZCVWFLR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.5511&json=true","fetch_graph":"https://pith.science/api/pith-number/5ZCVWFLRPISGFXIBDSUXJNEUV5/graph.json","fetch_events":"https://pith.science/api/pith-number/5ZCVWFLRPISGFXIBDSUXJNEUV5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ZCVWFLRPISGFXIBDSUXJNEUV5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ZCVWFLRPISGFXIBDSUXJNEUV5/action/storage_attestation","attest_author":"https://pith.science/pith/5ZCVWFLRPISGFXIBDSUXJNEUV5/action/author_attestation","sign_citation":"https://pith.science/pith/5ZCVWFLRPISGFXIBDSUXJNEUV5/action/citation_signature","submit_replication":"https://pith.science/pith/5ZCVWFLRPISGFXIBDSUXJNEUV5/action/replication_record"}},"created_at":"2026-05-18T02:23:38.538095+00:00","updated_at":"2026-05-18T02:23:38.538095+00:00"}