{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EHEEJLUSXIJESNHJQDP3LEHLXU","short_pith_number":"pith:EHEEJLUS","canonical_record":{"source":{"id":"1411.0095","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-01T10:09:49Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b67a9d6fd6d6b444de060f1ce56e1c8f94cc58e35847eca1e32eeeb4a0a0f0f3","abstract_canon_sha256":"cfd63059dcd9ad29fdd4a4600252a7ef30dada758a510960b94c04a7ef168543"},"schema_version":"1.0"},"canonical_sha256":"21c844ae92ba124934e980dfb590ebbd116306ae27a5671abc71a6102fd58c0a","source":{"kind":"arxiv","id":"1411.0095","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0095","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0095v1","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0095","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"pith_short_12","alias_value":"EHEEJLUSXIJE","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EHEEJLUSXIJESNHJ","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EHEEJLUS","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EHEEJLUSXIJESNHJQDP3LEHLXU","target":"record","payload":{"canonical_record":{"source":{"id":"1411.0095","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-01T10:09:49Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b67a9d6fd6d6b444de060f1ce56e1c8f94cc58e35847eca1e32eeeb4a0a0f0f3","abstract_canon_sha256":"cfd63059dcd9ad29fdd4a4600252a7ef30dada758a510960b94c04a7ef168543"},"schema_version":"1.0"},"canonical_sha256":"21c844ae92ba124934e980dfb590ebbd116306ae27a5671abc71a6102fd58c0a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:52.560201Z","signature_b64":"qaVbAh1P/A1zzo0o1CBDbg9FGc/Z8M9rO+ohGc2QtFudHKiQDGa6PxX3w7GDoCe+lULAWujmY6vsRlLvOC20CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21c844ae92ba124934e980dfb590ebbd116306ae27a5671abc71a6102fd58c0a","last_reissued_at":"2026-05-18T02:38:52.559834Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:52.559834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.0095","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:38:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AS6nBk0XPW5nsQioaq+UWFxU2/sEnC7t8n5W8CEiKeOsEewk54ci7pUJckZmqHEUHNJ5oCqggdn3GeV0cVujDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:19:37.094833Z"},"content_sha256":"1ef5152bef3eeab90b2f49472eb891957810f34ee105a7bb1a039dc93d118fdd","schema_version":"1.0","event_id":"sha256:1ef5152bef3eeab90b2f49472eb891957810f34ee105a7bb1a039dc93d118fdd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EHEEJLUSXIJESNHJQDP3LEHLXU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Provable Submodular Minimization using Wolfe's Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Deeparnab Chakrabarty, Prateek Jain, Pravesh Kothari","submitted_at":"2014-11-01T10:09:49Z","abstract_excerpt":"Owing to several applications in large scale learning and vision problems, fast submodular function minimization (SFM) has become a critical problem. Theoretically, unconstrained SFM can be performed in polynomial time [IFF 2001, IO 2009]. However, these algorithms are typically not practical. In 1976, Wolfe proposed an algorithm to find the minimum Euclidean norm point in a polytope, and in 1980, Fujishige showed how Wolfe's algorithm can be used for SFM. For general submodular functions, this Fujishige-Wolfe minimum norm algorithm seems to have the best empirical performance.\n  Despite its g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0095","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:38:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rPpmbLYoYF7sBiu2hJbMDijqnIxTjSAag1A/GowayJOFzsgjRg64N/Tt0y/VQYETvkQ45bGJ43mPCiFzCfq4Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:19:37.095184Z"},"content_sha256":"2cc7946493c232304cdf870d211574bbf249589e661ab260f6f1f0c7ee75312f","schema_version":"1.0","event_id":"sha256:2cc7946493c232304cdf870d211574bbf249589e661ab260f6f1f0c7ee75312f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EHEEJLUSXIJESNHJQDP3LEHLXU/bundle.json","state_url":"https://pith.science/pith/EHEEJLUSXIJESNHJQDP3LEHLXU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EHEEJLUSXIJESNHJQDP3LEHLXU/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-01T16:19:37Z","links":{"resolver":"https://pith.science/pith/EHEEJLUSXIJESNHJQDP3LEHLXU","bundle":"https://pith.science/pith/EHEEJLUSXIJESNHJQDP3LEHLXU/bundle.json","state":"https://pith.science/pith/EHEEJLUSXIJESNHJQDP3LEHLXU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EHEEJLUSXIJESNHJQDP3LEHLXU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EHEEJLUSXIJESNHJQDP3LEHLXU","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":"cfd63059dcd9ad29fdd4a4600252a7ef30dada758a510960b94c04a7ef168543","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-01T10:09:49Z","title_canon_sha256":"b67a9d6fd6d6b444de060f1ce56e1c8f94cc58e35847eca1e32eeeb4a0a0f0f3"},"schema_version":"1.0","source":{"id":"1411.0095","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.0095","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"arxiv_version","alias_value":"1411.0095v1","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0095","created_at":"2026-05-18T02:38:52Z"},{"alias_kind":"pith_short_12","alias_value":"EHEEJLUSXIJE","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EHEEJLUSXIJESNHJ","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EHEEJLUS","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:2cc7946493c232304cdf870d211574bbf249589e661ab260f6f1f0c7ee75312f","target":"graph","created_at":"2026-05-18T02:38:52Z","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":"Owing to several applications in large scale learning and vision problems, fast submodular function minimization (SFM) has become a critical problem. Theoretically, unconstrained SFM can be performed in polynomial time [IFF 2001, IO 2009]. However, these algorithms are typically not practical. In 1976, Wolfe proposed an algorithm to find the minimum Euclidean norm point in a polytope, and in 1980, Fujishige showed how Wolfe's algorithm can be used for SFM. For general submodular functions, this Fujishige-Wolfe minimum norm algorithm seems to have the best empirical performance.\n  Despite its g","authors_text":"Deeparnab Chakrabarty, Prateek Jain, Pravesh Kothari","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-01T10:09:49Z","title":"Provable Submodular Minimization using Wolfe's Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.0095","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:1ef5152bef3eeab90b2f49472eb891957810f34ee105a7bb1a039dc93d118fdd","target":"record","created_at":"2026-05-18T02:38:52Z","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":"cfd63059dcd9ad29fdd4a4600252a7ef30dada758a510960b94c04a7ef168543","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-01T10:09:49Z","title_canon_sha256":"b67a9d6fd6d6b444de060f1ce56e1c8f94cc58e35847eca1e32eeeb4a0a0f0f3"},"schema_version":"1.0","source":{"id":"1411.0095","kind":"arxiv","version":1}},"canonical_sha256":"21c844ae92ba124934e980dfb590ebbd116306ae27a5671abc71a6102fd58c0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21c844ae92ba124934e980dfb590ebbd116306ae27a5671abc71a6102fd58c0a","first_computed_at":"2026-05-18T02:38:52.559834Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:52.559834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qaVbAh1P/A1zzo0o1CBDbg9FGc/Z8M9rO+ohGc2QtFudHKiQDGa6PxX3w7GDoCe+lULAWujmY6vsRlLvOC20CA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:52.560201Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.0095","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ef5152bef3eeab90b2f49472eb891957810f34ee105a7bb1a039dc93d118fdd","sha256:2cc7946493c232304cdf870d211574bbf249589e661ab260f6f1f0c7ee75312f"],"state_sha256":"47d5cde23db4102b4ba3be47a17f859b7d32605a73ea4e42728f3c52035b99eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0upEORtpWzQONhmKoFfublmjiyMSKPU+nuhkkzLDK4VrRHT+VC13A5Bs5gCs6bESkpl86F2fU+TLu5FmcMb8BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:19:37.097214Z","bundle_sha256":"849d211996c2055fb85cfdbe237d256fbe6b3c53c1514f337737f447ef3b5d0c"}}