{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:DO3Z2XAS3Q3V5G3K4ZOQ5GJLXB","short_pith_number":"pith:DO3Z2XAS","schema_version":"1.0","canonical_sha256":"1bb79d5c12dc375e9b6ae65d0e992bb859ef07ffb55707ef73a0630565d93227","source":{"kind":"arxiv","id":"1207.0560","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1207.0560","created_at":"2026-05-18T03:15:07.653127+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.0560v4","created_at":"2026-05-18T03:15:07.653127+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0560","created_at":"2026-05-18T03:15:07.653127+00:00"},{"alias_kind":"pith_short_12","alias_value":"DO3Z2XAS3Q3V","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"DO3Z2XAS3Q3V5G3K","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"DO3Z2XAS","created_at":"2026-05-18T12:27:04.183437+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/DO3Z2XAS3Q3V5G3K4ZOQ5GJLXB","json":"https://pith.science/pith/DO3Z2XAS3Q3V5G3K4ZOQ5GJLXB.json","graph_json":"https://pith.science/api/pith-number/DO3Z2XAS3Q3V5G3K4ZOQ5GJLXB/graph.json","events_json":"https://pith.science/api/pith-number/DO3Z2XAS3Q3V5G3K4ZOQ5GJLXB/events.json","paper":"https://pith.science/paper/DO3Z2XAS"},"agent_actions":{"view_html":"https://pith.science/pith/DO3Z2XAS3Q3V5G3K4ZOQ5GJLXB","download_json":"https://pith.science/pith/DO3Z2XAS3Q3V5G3K4ZOQ5GJLXB.json","view_paper":"https://pith.science/paper/DO3Z2XAS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.0560&json=true","fetch_graph":"https://pith.science/api/pith-number/DO3Z2XAS3Q3V5G3K4ZOQ5GJLXB/graph.json","fetch_events":"https://pith.science/api/pith-number/DO3Z2XAS3Q3V5G3K4ZOQ5GJLXB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DO3Z2XAS3Q3V5G3K4ZOQ5GJLXB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DO3Z2XAS3Q3V5G3K4ZOQ5GJLXB/action/storage_attestation","attest_author":"https://pith.science/pith/DO3Z2XAS3Q3V5G3K4ZOQ5GJLXB/action/author_attestation","sign_citation":"https://pith.science/pith/DO3Z2XAS3Q3V5G3K4ZOQ5GJLXB/action/citation_signature","submit_replication":"https://pith.science/pith/DO3Z2XAS3Q3V5G3K4ZOQ5GJLXB/action/replication_record"}},"created_at":"2026-05-18T03:15:07.653127+00:00","updated_at":"2026-05-18T03:15:07.653127+00:00"}