{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:BVIZ2XFGATYUCEDM6FHOLITWCW","short_pith_number":"pith:BVIZ2XFG","schema_version":"1.0","canonical_sha256":"0d519d5ca604f141106cf14ee5a276158e208daa9ad62cc0301ab448f19f8e2f","source":{"kind":"arxiv","id":"1309.7512","version":2},"attestation_state":"computed","paper":{"title":"Structured learning of sum-of-submodular higher order energy functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"Alexander Fix, Ramin Zabih, Sam Park, Thorsten Joachims","submitted_at":"2013-09-28T23:55:01Z","abstract_excerpt":"Submodular functions can be exactly minimized in polynomial time, and the special case that graph cuts solve with max flow \\cite{KZ:PAMI04} has had significant impact in computer vision \\cite{BVZ:PAMI01,Kwatra:SIGGRAPH03,Rother:GrabCut04}. In this paper we address the important class of sum-of-submodular (SoS) functions \\cite{Arora:ECCV12,Kolmogorov:DAM12}, which can be efficiently minimized via a variant of max flow called submodular flow \\cite{Edmonds:ADM77}. SoS functions can naturally express higher order priors involving, e.g., local image patches; however, it is difficult to fully exploi"},"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":"1309.7512","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-09-28T23:55:01Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"e18e56ec6ddd0e2f048abd01b03d9a0d359d9e369db78202d5bd2d2b3d268c4a","abstract_canon_sha256":"cca708ab5e5446ca1955075f322d642e090471f6b122b040ade2c622c4d84db4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:45.968611Z","signature_b64":"OX7IP1h6itC39NbcvWaa839E1I1cqSkC/LPxw9rOqz/xrUa4c2x7FfMgO09xCv9PQKkM+u3HAZ0t9y2SlAwYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d519d5ca604f141106cf14ee5a276158e208daa9ad62cc0301ab448f19f8e2f","last_reissued_at":"2026-05-18T03:11:45.967640Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:45.967640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structured learning of sum-of-submodular higher order energy functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"Alexander Fix, Ramin Zabih, Sam Park, Thorsten Joachims","submitted_at":"2013-09-28T23:55:01Z","abstract_excerpt":"Submodular functions can be exactly minimized in polynomial time, and the special case that graph cuts solve with max flow \\cite{KZ:PAMI04} has had significant impact in computer vision \\cite{BVZ:PAMI01,Kwatra:SIGGRAPH03,Rother:GrabCut04}. In this paper we address the important class of sum-of-submodular (SoS) functions \\cite{Arora:ECCV12,Kolmogorov:DAM12}, which can be efficiently minimized via a variant of max flow called submodular flow \\cite{Edmonds:ADM77}. SoS functions can naturally express higher order priors involving, e.g., local image patches; however, it is difficult to fully exploi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7512","kind":"arxiv","version":2},"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":"1309.7512","created_at":"2026-05-18T03:11:45.967815+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.7512v2","created_at":"2026-05-18T03:11:45.967815+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7512","created_at":"2026-05-18T03:11:45.967815+00:00"},{"alias_kind":"pith_short_12","alias_value":"BVIZ2XFGATYU","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"BVIZ2XFGATYUCEDM","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"BVIZ2XFG","created_at":"2026-05-18T12:27:40.988391+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/BVIZ2XFGATYUCEDM6FHOLITWCW","json":"https://pith.science/pith/BVIZ2XFGATYUCEDM6FHOLITWCW.json","graph_json":"https://pith.science/api/pith-number/BVIZ2XFGATYUCEDM6FHOLITWCW/graph.json","events_json":"https://pith.science/api/pith-number/BVIZ2XFGATYUCEDM6FHOLITWCW/events.json","paper":"https://pith.science/paper/BVIZ2XFG"},"agent_actions":{"view_html":"https://pith.science/pith/BVIZ2XFGATYUCEDM6FHOLITWCW","download_json":"https://pith.science/pith/BVIZ2XFGATYUCEDM6FHOLITWCW.json","view_paper":"https://pith.science/paper/BVIZ2XFG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.7512&json=true","fetch_graph":"https://pith.science/api/pith-number/BVIZ2XFGATYUCEDM6FHOLITWCW/graph.json","fetch_events":"https://pith.science/api/pith-number/BVIZ2XFGATYUCEDM6FHOLITWCW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BVIZ2XFGATYUCEDM6FHOLITWCW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BVIZ2XFGATYUCEDM6FHOLITWCW/action/storage_attestation","attest_author":"https://pith.science/pith/BVIZ2XFGATYUCEDM6FHOLITWCW/action/author_attestation","sign_citation":"https://pith.science/pith/BVIZ2XFGATYUCEDM6FHOLITWCW/action/citation_signature","submit_replication":"https://pith.science/pith/BVIZ2XFGATYUCEDM6FHOLITWCW/action/replication_record"}},"created_at":"2026-05-18T03:11:45.967815+00:00","updated_at":"2026-05-18T03:11:45.967815+00:00"}