{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JEEBM2TXGLI2ULH6RX5DSVC4CZ","short_pith_number":"pith:JEEBM2TX","canonical_record":{"source":{"id":"1408.2051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-09T05:48:31Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c02257e7711b2a4f828185f79444859829ac4edc704fc4e008a4c18047476b02","abstract_canon_sha256":"b5366eb02c8aad9afb5e14b9c80516e841a4a43953a233c53628d8b6599b145e"},"schema_version":"1.0"},"canonical_sha256":"4908166a7732d1aa2cfe8dfa39545c165923011af5dafa78e77d5c82cd58cfe7","source":{"kind":"arxiv","id":"1408.2051","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2051","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2051v1","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2051","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"pith_short_12","alias_value":"JEEBM2TXGLI2","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JEEBM2TXGLI2ULH6","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JEEBM2TX","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JEEBM2TXGLI2ULH6RX5DSVC4CZ","target":"record","payload":{"canonical_record":{"source":{"id":"1408.2051","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-09T05:48:31Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c02257e7711b2a4f828185f79444859829ac4edc704fc4e008a4c18047476b02","abstract_canon_sha256":"b5366eb02c8aad9afb5e14b9c80516e841a4a43953a233c53628d8b6599b145e"},"schema_version":"1.0"},"canonical_sha256":"4908166a7732d1aa2cfe8dfa39545c165923011af5dafa78e77d5c82cd58cfe7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:30.539748Z","signature_b64":"2Qym32uMMqRMfkDFWvhDMm7yxEh9tUFBcJipwtGE3iToQVOFK6Yl6F3dU7BWIQ2OvwC8IwzR5vlpwDKPAHZYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4908166a7732d1aa2cfe8dfa39545c165923011af5dafa78e77d5c82cd58cfe7","last_reissued_at":"2026-05-18T02:45:30.539157Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:30.539157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.2051","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:45:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2GnoVUf0p9ViosatwVP6aPCPUbTgggfLfW4HSSPMIj0uw+mGckAODPasvkDGY6eVWPCXk9/rZ9MeEsuF3F/nCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T07:01:36.965084Z"},"content_sha256":"2720b08674d8fba5e6a845f6c5fa1a3555707bdfc914f1abbf0285d0e0455c6f","schema_version":"1.0","event_id":"sha256:2720b08674d8fba5e6a845f6c5fa1a3555707bdfc914f1abbf0285d0e0455c6f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JEEBM2TXGLI2ULH6RX5DSVC4CZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms for Approximate Minimization of the Difference Between Submodular Functions, with Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jeff A. Bilmes, Rishabh Iyer","submitted_at":"2014-08-09T05:48:31Z","abstract_excerpt":"We extend the work of Narasimhan and Bilmes [30] for minimizing set functions representable as a dierence 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 dierence between submodular functions under various combinatorial constraints, a problem not previously addressed. We provide computational bounds and a hardness result on the multiplica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2051","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:45:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nyG8wK3sUmKcqooL5tZQeB2+ORuqqwUQLiD+f5tuWlaTFROQAekDaZogBHeHTs+i6PRP95/lWCfAqjJ4XU9xDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T07:01:36.965440Z"},"content_sha256":"930c957b4c688b8c3d1e7cb682c5b61dc7c2456c424a4af1ff79bf2f2fba697a","schema_version":"1.0","event_id":"sha256:930c957b4c688b8c3d1e7cb682c5b61dc7c2456c424a4af1ff79bf2f2fba697a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JEEBM2TXGLI2ULH6RX5DSVC4CZ/bundle.json","state_url":"https://pith.science/pith/JEEBM2TXGLI2ULH6RX5DSVC4CZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JEEBM2TXGLI2ULH6RX5DSVC4CZ/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-20T07:01:36Z","links":{"resolver":"https://pith.science/pith/JEEBM2TXGLI2ULH6RX5DSVC4CZ","bundle":"https://pith.science/pith/JEEBM2TXGLI2ULH6RX5DSVC4CZ/bundle.json","state":"https://pith.science/pith/JEEBM2TXGLI2ULH6RX5DSVC4CZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JEEBM2TXGLI2ULH6RX5DSVC4CZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JEEBM2TXGLI2ULH6RX5DSVC4CZ","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":"b5366eb02c8aad9afb5e14b9c80516e841a4a43953a233c53628d8b6599b145e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-09T05:48:31Z","title_canon_sha256":"c02257e7711b2a4f828185f79444859829ac4edc704fc4e008a4c18047476b02"},"schema_version":"1.0","source":{"id":"1408.2051","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.2051","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"arxiv_version","alias_value":"1408.2051v1","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2051","created_at":"2026-05-18T02:45:30Z"},{"alias_kind":"pith_short_12","alias_value":"JEEBM2TXGLI2","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JEEBM2TXGLI2ULH6","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JEEBM2TX","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:930c957b4c688b8c3d1e7cb682c5b61dc7c2456c424a4af1ff79bf2f2fba697a","target":"graph","created_at":"2026-05-18T02:45:30Z","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 dierence 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 dierence between submodular functions under various combinatorial constraints, a problem not previously addressed. We provide computational bounds and a hardness result on the multiplica","authors_text":"Jeff A. Bilmes, Rishabh Iyer","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-09T05:48:31Z","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":"1408.2051","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:2720b08674d8fba5e6a845f6c5fa1a3555707bdfc914f1abbf0285d0e0455c6f","target":"record","created_at":"2026-05-18T02:45:30Z","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":"b5366eb02c8aad9afb5e14b9c80516e841a4a43953a233c53628d8b6599b145e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-08-09T05:48:31Z","title_canon_sha256":"c02257e7711b2a4f828185f79444859829ac4edc704fc4e008a4c18047476b02"},"schema_version":"1.0","source":{"id":"1408.2051","kind":"arxiv","version":1}},"canonical_sha256":"4908166a7732d1aa2cfe8dfa39545c165923011af5dafa78e77d5c82cd58cfe7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4908166a7732d1aa2cfe8dfa39545c165923011af5dafa78e77d5c82cd58cfe7","first_computed_at":"2026-05-18T02:45:30.539157Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:30.539157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2Qym32uMMqRMfkDFWvhDMm7yxEh9tUFBcJipwtGE3iToQVOFK6Yl6F3dU7BWIQ2OvwC8IwzR5vlpwDKPAHZYCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:30.539748Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.2051","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2720b08674d8fba5e6a845f6c5fa1a3555707bdfc914f1abbf0285d0e0455c6f","sha256:930c957b4c688b8c3d1e7cb682c5b61dc7c2456c424a4af1ff79bf2f2fba697a"],"state_sha256":"6b60096e86cddfa7993134f0052f587e5fbd3bc6a220c451ce38727241095325"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l2/rnrctmeDdg9bt/VxxJ4VgGxx4u1wiXH3LK91FNPK/hYOkJT7aKR5ydDOojZ+8rcGKmHF5lXlru5+uJRwPCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T07:01:36.967360Z","bundle_sha256":"d040ecfa3fc061de802fb00de5bc6c368fbf618bebcd134f4a139c01a0ca8d6d"}}