{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:DO3Z2XAS3Q3V5G3K4ZOQ5GJLXB","short_pith_number":"pith:DO3Z2XAS","canonical_record":{"source":{"id":"1207.0560","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.DS","submitted_at":"2012-07-03T01:25:10Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c02257e7711b2a4f828185f79444859829ac4edc704fc4e008a4c18047476b02","abstract_canon_sha256":"fb383e7ca852827c4c46311599cd626901c27ca3e126d31e34e6178f6df64d96"},"schema_version":"1.0"},"canonical_sha256":"1bb79d5c12dc375e9b6ae65d0e992bb859ef07ffb55707ef73a0630565d93227","source":{"kind":"arxiv","id":"1207.0560","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0560","created_at":"2026-05-18T03:15:07Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0560v4","created_at":"2026-05-18T03:15:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0560","created_at":"2026-05-18T03:15:07Z"},{"alias_kind":"pith_short_12","alias_value":"DO3Z2XAS3Q3V","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DO3Z2XAS3Q3V5G3K","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DO3Z2XAS","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:DO3Z2XAS3Q3V5G3K4ZOQ5GJLXB","target":"record","payload":{"canonical_record":{"source":{"id":"1207.0560","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.DS","submitted_at":"2012-07-03T01:25:10Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c02257e7711b2a4f828185f79444859829ac4edc704fc4e008a4c18047476b02","abstract_canon_sha256":"fb383e7ca852827c4c46311599cd626901c27ca3e126d31e34e6178f6df64d96"},"schema_version":"1.0"},"canonical_sha256":"1bb79d5c12dc375e9b6ae65d0e992bb859ef07ffb55707ef73a0630565d93227","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:07.653896Z","signature_b64":"hhiJOI9g0cDqu5H9fAq9vE+VMSTEpwE6pjYfWdjF01nbHdr1CEEhDROUUBpPQ8gbZ+qxVyAa9gHlYFpHeuELCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bb79d5c12dc375e9b6ae65d0e992bb859ef07ffb55707ef73a0630565d93227","last_reissued_at":"2026-05-18T03:15:07.653014Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:07.653014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.0560","source_version":4,"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-18T03:15:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j0y1VHnvKdE8y85mCEYRRvLcEqYeVXIZaJVrO7m0q6jqZOevsPjJF/UmA+p6DVwS2JEBwL9/T3ZTrWgV1KZ2Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T17:20:00.298416Z"},"content_sha256":"2c66ba77574e3a22cb89d0b73488e97942bfc4acb07d76d9d03e9698f96aff09","schema_version":"1.0","event_id":"sha256:2c66ba77574e3a22cb89d0b73488e97942bfc4acb07d76d9d03e9698f96aff09"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:DO3Z2XAS3Q3V5G3K4ZOQ5GJLXB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms for Approximate Minimization of the Difference Between Submodular Functions, with Applications","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Jeff Bilmes, Rishabh Iyer","submitted_at":"2012-07-03T01:25:10Z","abstract_excerpt":"We extend the work of Narasimhan and Bilmes [30] for minimizing set functions representable as a difference between submodular functions. Similar to [30], our new algorithms are guaranteed to monotonically reduce the objective function at every step. We empirically and theoretically show that the per-iteration cost of our algorithms is much less than [30], and our algorithms can be used to efficiently minimize a difference between submodular functions under various combinatorial constraints, a problem not previously addressed. We provide computational bounds and a hardness result on the mul- t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0560","kind":"arxiv","version":4},"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-18T03:15:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tmp2t0u8nLr8fi/J+rzPxSsSDorw3AhuRa9Tw6bTNToAsK+auLNIjqbohn6WslZs8EfxZ2P+kdeMmmgFp7GmCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T17:20:00.299010Z"},"content_sha256":"3cb5f60feaf5541c7c31de8dee2bcf4f8eb1e66bdb0b9138e277680b2f10d2ce","schema_version":"1.0","event_id":"sha256:3cb5f60feaf5541c7c31de8dee2bcf4f8eb1e66bdb0b9138e277680b2f10d2ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DO3Z2XAS3Q3V5G3K4ZOQ5GJLXB/bundle.json","state_url":"https://pith.science/pith/DO3Z2XAS3Q3V5G3K4ZOQ5GJLXB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DO3Z2XAS3Q3V5G3K4ZOQ5GJLXB/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-08-18T17:20:00Z","links":{"resolver":"https://pith.science/pith/DO3Z2XAS3Q3V5G3K4ZOQ5GJLXB","bundle":"https://pith.science/pith/DO3Z2XAS3Q3V5G3K4ZOQ5GJLXB/bundle.json","state":"https://pith.science/pith/DO3Z2XAS3Q3V5G3K4ZOQ5GJLXB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DO3Z2XAS3Q3V5G3K4ZOQ5GJLXB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:DO3Z2XAS3Q3V5G3K4ZOQ5GJLXB","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":"fb383e7ca852827c4c46311599cd626901c27ca3e126d31e34e6178f6df64d96","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.DS","submitted_at":"2012-07-03T01:25:10Z","title_canon_sha256":"c02257e7711b2a4f828185f79444859829ac4edc704fc4e008a4c18047476b02"},"schema_version":"1.0","source":{"id":"1207.0560","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0560","created_at":"2026-05-18T03:15:07Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0560v4","created_at":"2026-05-18T03:15:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0560","created_at":"2026-05-18T03:15:07Z"},{"alias_kind":"pith_short_12","alias_value":"DO3Z2XAS3Q3V","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DO3Z2XAS3Q3V5G3K","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DO3Z2XAS","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:3cb5f60feaf5541c7c31de8dee2bcf4f8eb1e66bdb0b9138e277680b2f10d2ce","target":"graph","created_at":"2026-05-18T03:15:07Z","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 extend the work of Narasimhan and Bilmes [30] for minimizing set functions representable as a difference between submodular functions. Similar to [30], our new algorithms are guaranteed to monotonically reduce the objective function at every step. We empirically and theoretically show that the per-iteration cost of our algorithms is much less than [30], and our algorithms can be used to efficiently minimize a difference between submodular functions under various combinatorial constraints, a problem not previously addressed. We provide computational bounds and a hardness result on the mul- t","authors_text":"Jeff Bilmes, Rishabh Iyer","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.DS","submitted_at":"2012-07-03T01:25:10Z","title":"Algorithms for Approximate Minimization of the Difference Between Submodular Functions, with Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0560","kind":"arxiv","version":4},"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:2c66ba77574e3a22cb89d0b73488e97942bfc4acb07d76d9d03e9698f96aff09","target":"record","created_at":"2026-05-18T03:15:07Z","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":"fb383e7ca852827c4c46311599cd626901c27ca3e126d31e34e6178f6df64d96","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"cs.DS","submitted_at":"2012-07-03T01:25:10Z","title_canon_sha256":"c02257e7711b2a4f828185f79444859829ac4edc704fc4e008a4c18047476b02"},"schema_version":"1.0","source":{"id":"1207.0560","kind":"arxiv","version":4}},"canonical_sha256":"1bb79d5c12dc375e9b6ae65d0e992bb859ef07ffb55707ef73a0630565d93227","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1bb79d5c12dc375e9b6ae65d0e992bb859ef07ffb55707ef73a0630565d93227","first_computed_at":"2026-05-18T03:15:07.653014Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:07.653014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hhiJOI9g0cDqu5H9fAq9vE+VMSTEpwE6pjYfWdjF01nbHdr1CEEhDROUUBpPQ8gbZ+qxVyAa9gHlYFpHeuELCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:07.653896Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.0560","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c66ba77574e3a22cb89d0b73488e97942bfc4acb07d76d9d03e9698f96aff09","sha256:3cb5f60feaf5541c7c31de8dee2bcf4f8eb1e66bdb0b9138e277680b2f10d2ce"],"state_sha256":"024d637e26e372fc7bb162a2bc1c71b0564abbe7cc4a84c68be1c0e533af0560"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YC7c3xwuXjUUYTMmfwji71bqacGTuY1IoTUj3q1f4ln4LCCVNTZIIDMlsepSSRrFpwzqNaK+4HbfRefqJR9cDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T17:20:00.309582Z","bundle_sha256":"bfeecb856008dece89c8d17fc24a0199932ecd090355b990dfa0121f921116e6"}}