{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JQ743WZCVCYRNYBNC4ABE5WNA3","short_pith_number":"pith:JQ743WZC","canonical_record":{"source":{"id":"1905.11327","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-27T16:24:54Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1d8dd1278d5b002284bd7e41253ad5c2b269ff21b02bb0bcfbda9d47b108fb48","abstract_canon_sha256":"97888172bc90610570e89f3deae1e6b1cdcdea9995b6a633293eac0fa0f05e44"},"schema_version":"1.0"},"canonical_sha256":"4c3fcddb22a8b116e02d17001276cd06c07fe616ce99ea655f6abd75cbe8982f","source":{"kind":"arxiv","id":"1905.11327","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11327","created_at":"2026-05-17T23:45:00Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11327v1","created_at":"2026-05-17T23:45:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11327","created_at":"2026-05-17T23:45:00Z"},{"alias_kind":"pith_short_12","alias_value":"JQ743WZCVCYR","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JQ743WZCVCYRNYBN","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JQ743WZC","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JQ743WZCVCYRNYBNC4ABE5WNA3","target":"record","payload":{"canonical_record":{"source":{"id":"1905.11327","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-27T16:24:54Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1d8dd1278d5b002284bd7e41253ad5c2b269ff21b02bb0bcfbda9d47b108fb48","abstract_canon_sha256":"97888172bc90610570e89f3deae1e6b1cdcdea9995b6a633293eac0fa0f05e44"},"schema_version":"1.0"},"canonical_sha256":"4c3fcddb22a8b116e02d17001276cd06c07fe616ce99ea655f6abd75cbe8982f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:00.684009Z","signature_b64":"UiAd92VpFEH/V4newIgI6L2CpkJrVevmlth0nVLT9gIyIBw00MyWQLIQQ+Xj6rd7KWY1qy4G1uj6rxO+DnmBDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c3fcddb22a8b116e02d17001276cd06c07fe616ce99ea655f6abd75cbe8982f","last_reissued_at":"2026-05-17T23:45:00.683502Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:00.683502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.11327","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-17T23:45:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QHpyA4iqirldJRpuj2EcGO+y0A9WtW2mFXOd1Zqvly4PWPaZfcIydwuRrT1muA6ufylakqFU9Jfj/1pjbZcaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:18:59.502057Z"},"content_sha256":"754e6555bba922e42689606679d69f64c60246b1505b6cabac2069746f2874da","schema_version":"1.0","event_id":"sha256:754e6555bba922e42689606679d69f64c60246b1505b6cabac2069746f2874da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JQ743WZCVCYRNYBNC4ABE5WNA3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Decomposable Submodular Function Minimization using Constrained Total Variation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Francis Bach, K S Sesh Kumar, Thomas Pock","submitted_at":"2019-05-27T16:24:54Z","abstract_excerpt":"We consider the problem of minimizing the sum of submodular set functions assuming minimization oracles of each summand function. Most existing approaches reformulate the problem as the convex minimization of the sum of the corresponding Lov\\'asz extensions and the squared Euclidean norm, leading to algorithms requiring total variation oracles of the summand functions; without further assumptions, these more complex oracles require many calls to the simpler minimization oracles often available in practice. In this paper, we consider a modified convex problem requiring constrained version of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11327","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-17T23:45:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k0eEOsy6/1z76Nk0MK7UMvHVWKGvo/yCYSK2JTuht+qJtfz26isaZmBQy1JoTZx0V/wOsAsLJVgHu0HiAe/8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:18:59.502433Z"},"content_sha256":"fd86b5c20f3db6afeee2159d746b385ceb346f4d4a1d79778fd473c39f449319","schema_version":"1.0","event_id":"sha256:fd86b5c20f3db6afeee2159d746b385ceb346f4d4a1d79778fd473c39f449319"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JQ743WZCVCYRNYBNC4ABE5WNA3/bundle.json","state_url":"https://pith.science/pith/JQ743WZCVCYRNYBNC4ABE5WNA3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JQ743WZCVCYRNYBNC4ABE5WNA3/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-05-30T16:18:59Z","links":{"resolver":"https://pith.science/pith/JQ743WZCVCYRNYBNC4ABE5WNA3","bundle":"https://pith.science/pith/JQ743WZCVCYRNYBNC4ABE5WNA3/bundle.json","state":"https://pith.science/pith/JQ743WZCVCYRNYBNC4ABE5WNA3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JQ743WZCVCYRNYBNC4ABE5WNA3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JQ743WZCVCYRNYBNC4ABE5WNA3","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":"97888172bc90610570e89f3deae1e6b1cdcdea9995b6a633293eac0fa0f05e44","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-27T16:24:54Z","title_canon_sha256":"1d8dd1278d5b002284bd7e41253ad5c2b269ff21b02bb0bcfbda9d47b108fb48"},"schema_version":"1.0","source":{"id":"1905.11327","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11327","created_at":"2026-05-17T23:45:00Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11327v1","created_at":"2026-05-17T23:45:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11327","created_at":"2026-05-17T23:45:00Z"},{"alias_kind":"pith_short_12","alias_value":"JQ743WZCVCYR","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JQ743WZCVCYRNYBN","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JQ743WZC","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:fd86b5c20f3db6afeee2159d746b385ceb346f4d4a1d79778fd473c39f449319","target":"graph","created_at":"2026-05-17T23:45:00Z","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 minimizing the sum of submodular set functions assuming minimization oracles of each summand function. Most existing approaches reformulate the problem as the convex minimization of the sum of the corresponding Lov\\'asz extensions and the squared Euclidean norm, leading to algorithms requiring total variation oracles of the summand functions; without further assumptions, these more complex oracles require many calls to the simpler minimization oracles often available in practice. In this paper, we consider a modified convex problem requiring constrained version of th","authors_text":"Francis Bach, K S Sesh Kumar, Thomas Pock","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-27T16:24:54Z","title":"Fast Decomposable Submodular Function Minimization using Constrained Total Variation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11327","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:754e6555bba922e42689606679d69f64c60246b1505b6cabac2069746f2874da","target":"record","created_at":"2026-05-17T23:45:00Z","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":"97888172bc90610570e89f3deae1e6b1cdcdea9995b6a633293eac0fa0f05e44","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-27T16:24:54Z","title_canon_sha256":"1d8dd1278d5b002284bd7e41253ad5c2b269ff21b02bb0bcfbda9d47b108fb48"},"schema_version":"1.0","source":{"id":"1905.11327","kind":"arxiv","version":1}},"canonical_sha256":"4c3fcddb22a8b116e02d17001276cd06c07fe616ce99ea655f6abd75cbe8982f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c3fcddb22a8b116e02d17001276cd06c07fe616ce99ea655f6abd75cbe8982f","first_computed_at":"2026-05-17T23:45:00.683502Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:00.683502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UiAd92VpFEH/V4newIgI6L2CpkJrVevmlth0nVLT9gIyIBw00MyWQLIQQ+Xj6rd7KWY1qy4G1uj6rxO+DnmBDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:00.684009Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.11327","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:754e6555bba922e42689606679d69f64c60246b1505b6cabac2069746f2874da","sha256:fd86b5c20f3db6afeee2159d746b385ceb346f4d4a1d79778fd473c39f449319"],"state_sha256":"07dc6062619b9f3ce84bb2ac8ac6d677ce5421aa862f856c1608f6d3d20f9b9f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hVk3S60ch7FJLp/uOJmpUZAQnzjYc4vh+GXCnTzZoHDndTsVgfeOOHe1yV+Uz7Oq+g7sqhQcXmc3+l9wzDaYDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:18:59.504644Z","bundle_sha256":"d8f80847582a8d9a8be3778ad5d98d8824a6e17d07c33ce013035aad55054f5a"}}