{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:5ZCVWFLRPISGFXIBDSUXJNEUV5","short_pith_number":"pith:5ZCVWFLR","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"},"canonical_sha256":"ee455b15717a2462dd011ca974b494af69e686bd95aef813ff1757ad3b5c32f7","source":{"kind":"arxiv","id":"1010.5511","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.5511","created_at":"2026-05-18T02:23:38Z"},{"alias_kind":"arxiv_version","alias_value":"1010.5511v1","created_at":"2026-05-18T02:23:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5511","created_at":"2026-05-18T02:23:38Z"},{"alias_kind":"pith_short_12","alias_value":"5ZCVWFLRPISG","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"5ZCVWFLRPISGFXIB","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"5ZCVWFLR","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:5ZCVWFLRPISGFXIBDSUXJNEUV5","target":"record","payload":{"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"},"canonical_sha256":"ee455b15717a2462dd011ca974b494af69e686bd95aef813ff1757ad3b5c32f7","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"},"source_kind":"arxiv","source_id":"1010.5511","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-18T02:23:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LmP8R1F3ORGDAxBAnvyI2DMyZWsq8L/jImNbP0SuZETcsojKb8Msrf3XQo1kfdIsS5DoYwvMzRvHMiJzevi0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:31:21.245759Z"},"content_sha256":"e9eaa531dc28fc454a149d70c10934d26aa89501edb4ab3c6bc7371da0457321","schema_version":"1.0","event_id":"sha256:e9eaa531dc28fc454a149d70c10934d26aa89501edb4ab3c6bc7371da0457321"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:5ZCVWFLRPISGFXIBDSUXJNEUV5","target":"graph","payload":{"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"},"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:23:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8fjMeJzCg2TjuzslP11s1wTre0K1Hfx9L+oYlTtclIvOMzBdUBzmkEjQ5mvtf1E9g1onOmA6CdVj0YhLVZ9bBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:31:21.246109Z"},"content_sha256":"4afe33130afba00b44030e024800f33b24bf8b36afa8f825143009c2bb7fd075","schema_version":"1.0","event_id":"sha256:4afe33130afba00b44030e024800f33b24bf8b36afa8f825143009c2bb7fd075"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ZCVWFLRPISGFXIBDSUXJNEUV5/bundle.json","state_url":"https://pith.science/pith/5ZCVWFLRPISGFXIBDSUXJNEUV5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ZCVWFLRPISGFXIBDSUXJNEUV5/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-03T07:31:21Z","links":{"resolver":"https://pith.science/pith/5ZCVWFLRPISGFXIBDSUXJNEUV5","bundle":"https://pith.science/pith/5ZCVWFLRPISGFXIBDSUXJNEUV5/bundle.json","state":"https://pith.science/pith/5ZCVWFLRPISGFXIBDSUXJNEUV5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ZCVWFLRPISGFXIBDSUXJNEUV5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:5ZCVWFLRPISGFXIBDSUXJNEUV5","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":"d76ff349e5da55dd1793f6d9d2aa2ce16b2943321cbb8b4a94a76b455f69f0d8","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-10-26T20:23:39Z","title_canon_sha256":"553cd30e1012f9196fbf6eda42a9012405eb6e34e0244806113b2f827bf2b1a6"},"schema_version":"1.0","source":{"id":"1010.5511","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.5511","created_at":"2026-05-18T02:23:38Z"},{"alias_kind":"arxiv_version","alias_value":"1010.5511v1","created_at":"2026-05-18T02:23:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5511","created_at":"2026-05-18T02:23:38Z"},{"alias_kind":"pith_short_12","alias_value":"5ZCVWFLRPISG","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"5ZCVWFLRPISGFXIB","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"5ZCVWFLR","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:4afe33130afba00b44030e024800f33b24bf8b36afa8f825143009c2bb7fd075","target":"graph","created_at":"2026-05-18T02:23:38Z","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":"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","authors_text":"Andreas Krause, Peter Stobbe","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-10-26T20:23:39Z","title":"Efficient Minimization of Decomposable Submodular Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5511","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:e9eaa531dc28fc454a149d70c10934d26aa89501edb4ab3c6bc7371da0457321","target":"record","created_at":"2026-05-18T02:23:38Z","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":"d76ff349e5da55dd1793f6d9d2aa2ce16b2943321cbb8b4a94a76b455f69f0d8","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-10-26T20:23:39Z","title_canon_sha256":"553cd30e1012f9196fbf6eda42a9012405eb6e34e0244806113b2f827bf2b1a6"},"schema_version":"1.0","source":{"id":"1010.5511","kind":"arxiv","version":1}},"canonical_sha256":"ee455b15717a2462dd011ca974b494af69e686bd95aef813ff1757ad3b5c32f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee455b15717a2462dd011ca974b494af69e686bd95aef813ff1757ad3b5c32f7","first_computed_at":"2026-05-18T02:23:38.538025Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:38.538025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B01uBK5l1VHZNhflRuZa1SLpveDrbU0HwaH+V5gne2MhygXWsDrfM0UVJQ6CmC65tOpnlUwjDSY00jBIXAdnAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:38.538520Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.5511","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9eaa531dc28fc454a149d70c10934d26aa89501edb4ab3c6bc7371da0457321","sha256:4afe33130afba00b44030e024800f33b24bf8b36afa8f825143009c2bb7fd075"],"state_sha256":"277a0489596b152c53355b6d81aff2c2d6c002eeb9755ed73cc47183952c3782"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ChJ4JMyuTcpN8YbyLVnq67fgwr5kGW5XikyPR1e/lkalAfsPVk8R6Ua7Fk1KkyTmAIP7s/spN7NJFRjTVTRRDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:31:21.248054Z","bundle_sha256":"88ed6744725c41fe10b1e57175d9ad612472f9dc102ff6e18af031e57a9a13d1"}}