{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:TQGHBLR6TI7QIFTESD7K2YEGIK","short_pith_number":"pith:TQGHBLR6","canonical_record":{"source":{"id":"1108.4217","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-21T22:09:21Z","cross_cats_sorted":[],"title_canon_sha256":"8fb854c0279b8fcbf4148308c6c8c8e322217268707007c8415e9ab430661420","abstract_canon_sha256":"2e5beea65c9b31a4a1c21012569a5db85f13c9ad2d4fae0875e79f704c385651"},"schema_version":"1.0"},"canonical_sha256":"9c0c70ae3e9a3f04166490fead608642a1b8e421e0a4accd76073f6f6c162456","source":{"kind":"arxiv","id":"1108.4217","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.4217","created_at":"2026-05-18T04:14:55Z"},{"alias_kind":"arxiv_version","alias_value":"1108.4217v1","created_at":"2026-05-18T04:14:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4217","created_at":"2026-05-18T04:14:55Z"},{"alias_kind":"pith_short_12","alias_value":"TQGHBLR6TI7Q","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TQGHBLR6TI7QIFTE","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TQGHBLR6","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:TQGHBLR6TI7QIFTESD7K2YEGIK","target":"record","payload":{"canonical_record":{"source":{"id":"1108.4217","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-21T22:09:21Z","cross_cats_sorted":[],"title_canon_sha256":"8fb854c0279b8fcbf4148308c6c8c8e322217268707007c8415e9ab430661420","abstract_canon_sha256":"2e5beea65c9b31a4a1c21012569a5db85f13c9ad2d4fae0875e79f704c385651"},"schema_version":"1.0"},"canonical_sha256":"9c0c70ae3e9a3f04166490fead608642a1b8e421e0a4accd76073f6f6c162456","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:55.930597Z","signature_b64":"daJDKfJXOdOq0ztKuq0Lf6Yk/c0tAGRgIgH+HWWFWjBbqnisovHmKk710u8NAPW7/cgrpCN4BBVohem8ZfRNAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c0c70ae3e9a3f04166490fead608642a1b8e421e0a4accd76073f6f6c162456","last_reissued_at":"2026-05-18T04:14:55.929891Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:55.929891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.4217","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-18T04:14:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QOc9+N15qUs9ZgFfrU0ljFH8JD7rnY/f3Zie77hzsj4AC55at2yB3rxdvS6KsrlBSgE/0bb7fav9z7pKrdgDBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:55:50.730641Z"},"content_sha256":"7cb4a1836947fbe1b45e6773864335015d25ce2c04cdfc5eff78075fb61cf61b","schema_version":"1.0","event_id":"sha256:7cb4a1836947fbe1b45e6773864335015d25ce2c04cdfc5eff78075fb61cf61b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:TQGHBLR6TI7QIFTESD7K2YEGIK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Prismatic Algorithm for Discrete D.C. Programming Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Takashi Washio, Yoshinobu Kawahara","submitted_at":"2011-08-21T22:09:21Z","abstract_excerpt":"In this paper, we propose the first exact algorithm for minimizing the difference of two submodular functions (D.S.), i.e., the discrete version of the D.C. programming problem. The developed algorithm is a branch-and-bound-based algorithm which responds to the structure of this problem through the relationship between submodularity and convexity. The D.S. programming problem covers a broad range of applications in machine learning because this generalizes the optimization of a wide class of set functions. We empirically investigate the performance of our algorithm, and illustrate the differen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4217","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-18T04:14:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vszcGJdla09pNZo+NL8/1HvqU8nddhcUAce2FoJG0LVdFmECtOuhCmO3SqtV8ER73sKcJB9ydG0nq3z992TeDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:55:50.730969Z"},"content_sha256":"d21da7531cb48e19c25af728d222ed2e41888304fbe8e54a267e9f6649ddd9d2","schema_version":"1.0","event_id":"sha256:d21da7531cb48e19c25af728d222ed2e41888304fbe8e54a267e9f6649ddd9d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TQGHBLR6TI7QIFTESD7K2YEGIK/bundle.json","state_url":"https://pith.science/pith/TQGHBLR6TI7QIFTESD7K2YEGIK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TQGHBLR6TI7QIFTESD7K2YEGIK/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-04T19:55:50Z","links":{"resolver":"https://pith.science/pith/TQGHBLR6TI7QIFTESD7K2YEGIK","bundle":"https://pith.science/pith/TQGHBLR6TI7QIFTESD7K2YEGIK/bundle.json","state":"https://pith.science/pith/TQGHBLR6TI7QIFTESD7K2YEGIK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TQGHBLR6TI7QIFTESD7K2YEGIK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:TQGHBLR6TI7QIFTESD7K2YEGIK","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":"2e5beea65c9b31a4a1c21012569a5db85f13c9ad2d4fae0875e79f704c385651","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-21T22:09:21Z","title_canon_sha256":"8fb854c0279b8fcbf4148308c6c8c8e322217268707007c8415e9ab430661420"},"schema_version":"1.0","source":{"id":"1108.4217","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.4217","created_at":"2026-05-18T04:14:55Z"},{"alias_kind":"arxiv_version","alias_value":"1108.4217v1","created_at":"2026-05-18T04:14:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4217","created_at":"2026-05-18T04:14:55Z"},{"alias_kind":"pith_short_12","alias_value":"TQGHBLR6TI7Q","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"TQGHBLR6TI7QIFTE","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"TQGHBLR6","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:d21da7531cb48e19c25af728d222ed2e41888304fbe8e54a267e9f6649ddd9d2","target":"graph","created_at":"2026-05-18T04:14:55Z","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":"In this paper, we propose the first exact algorithm for minimizing the difference of two submodular functions (D.S.), i.e., the discrete version of the D.C. programming problem. The developed algorithm is a branch-and-bound-based algorithm which responds to the structure of this problem through the relationship between submodularity and convexity. The D.S. programming problem covers a broad range of applications in machine learning because this generalizes the optimization of a wide class of set functions. We empirically investigate the performance of our algorithm, and illustrate the differen","authors_text":"Takashi Washio, Yoshinobu Kawahara","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-21T22:09:21Z","title":"Prismatic Algorithm for Discrete D.C. Programming Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4217","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:7cb4a1836947fbe1b45e6773864335015d25ce2c04cdfc5eff78075fb61cf61b","target":"record","created_at":"2026-05-18T04:14:55Z","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":"2e5beea65c9b31a4a1c21012569a5db85f13c9ad2d4fae0875e79f704c385651","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-21T22:09:21Z","title_canon_sha256":"8fb854c0279b8fcbf4148308c6c8c8e322217268707007c8415e9ab430661420"},"schema_version":"1.0","source":{"id":"1108.4217","kind":"arxiv","version":1}},"canonical_sha256":"9c0c70ae3e9a3f04166490fead608642a1b8e421e0a4accd76073f6f6c162456","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c0c70ae3e9a3f04166490fead608642a1b8e421e0a4accd76073f6f6c162456","first_computed_at":"2026-05-18T04:14:55.929891Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:55.929891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"daJDKfJXOdOq0ztKuq0Lf6Yk/c0tAGRgIgH+HWWFWjBbqnisovHmKk710u8NAPW7/cgrpCN4BBVohem8ZfRNAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:55.930597Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.4217","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7cb4a1836947fbe1b45e6773864335015d25ce2c04cdfc5eff78075fb61cf61b","sha256:d21da7531cb48e19c25af728d222ed2e41888304fbe8e54a267e9f6649ddd9d2"],"state_sha256":"e5466644b720bd5157233f51f9ac889e94e96e7600ab90b2a7a943d4d5df8771"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4kKOFE94MGQLJxUHGOqsCpG0nvkD6HiXsWBIJuMY/W/l8ZB45ylN/kjCWpLY8ICoNRa/oaFE7MYxNFwFCfJCAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T19:55:50.732785Z","bundle_sha256":"273c3173de439463547a6338be9a1ba78fca89a811d6dd228d330fdab06d6a8b"}}