{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EHEEJLUSXIJESNHJQDP3LEHLXU","short_pith_number":"pith:EHEEJLUS","schema_version":"1.0","canonical_sha256":"21c844ae92ba124934e980dfb590ebbd116306ae27a5671abc71a6102fd58c0a","source":{"kind":"arxiv","id":"1411.0095","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1411.0095","created_at":"2026-05-18T02:38:52.559882+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.0095v1","created_at":"2026-05-18T02:38:52.559882+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.0095","created_at":"2026-05-18T02:38:52.559882+00:00"},{"alias_kind":"pith_short_12","alias_value":"EHEEJLUSXIJE","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"EHEEJLUSXIJESNHJ","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"EHEEJLUS","created_at":"2026-05-18T12:28:25.294606+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/EHEEJLUSXIJESNHJQDP3LEHLXU","json":"https://pith.science/pith/EHEEJLUSXIJESNHJQDP3LEHLXU.json","graph_json":"https://pith.science/api/pith-number/EHEEJLUSXIJESNHJQDP3LEHLXU/graph.json","events_json":"https://pith.science/api/pith-number/EHEEJLUSXIJESNHJQDP3LEHLXU/events.json","paper":"https://pith.science/paper/EHEEJLUS"},"agent_actions":{"view_html":"https://pith.science/pith/EHEEJLUSXIJESNHJQDP3LEHLXU","download_json":"https://pith.science/pith/EHEEJLUSXIJESNHJQDP3LEHLXU.json","view_paper":"https://pith.science/paper/EHEEJLUS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.0095&json=true","fetch_graph":"https://pith.science/api/pith-number/EHEEJLUSXIJESNHJQDP3LEHLXU/graph.json","fetch_events":"https://pith.science/api/pith-number/EHEEJLUSXIJESNHJQDP3LEHLXU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EHEEJLUSXIJESNHJQDP3LEHLXU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EHEEJLUSXIJESNHJQDP3LEHLXU/action/storage_attestation","attest_author":"https://pith.science/pith/EHEEJLUSXIJESNHJQDP3LEHLXU/action/author_attestation","sign_citation":"https://pith.science/pith/EHEEJLUSXIJESNHJQDP3LEHLXU/action/citation_signature","submit_replication":"https://pith.science/pith/EHEEJLUSXIJESNHJQDP3LEHLXU/action/replication_record"}},"created_at":"2026-05-18T02:38:52.559882+00:00","updated_at":"2026-05-18T02:38:52.559882+00:00"}