{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:XQ2J3ZQK3WGXMNFIWVBINGCGAR","short_pith_number":"pith:XQ2J3ZQK","schema_version":"1.0","canonical_sha256":"bc349de60add8d7634a8b5428698460456bdb638febbb3cc94d660b899d65763","source":{"kind":"arxiv","id":"1007.4531","version":2},"attestation_state":"computed","paper":{"title":"Competitive Analysis of Minimum-Cut Maximum Flow Algorithms in Vision Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.OC"],"primary_cat":"cs.CV","authors_text":"Barak Fishbain, Dorit S. Hochbaum, Stefan Mueller","submitted_at":"2010-07-26T18:58:32Z","abstract_excerpt":"Rapid advances in image acquisition and storage technology underline the need for algorithms that are capable of solving large scale image processing and computer-vision problems. The minimum cut problem plays an important role in processing many of these imaging problems such as, image and video segmentation, stereo vision, multi-view reconstruction and surface fitting. While several min-cut/max-flow algorithms can be found in the literature, their performance in practice has been studied primarily outside the scope of computer vision. We present here the results of a comprehensive computatio"},"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":"1007.4531","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2010-07-26T18:58:32Z","cross_cats_sorted":["cs.DM","math.CO","math.OC"],"title_canon_sha256":"18bd2fad5987a73f900647918e6b763799e37f5a0397beabdc4ac1320c01fc1a","abstract_canon_sha256":"7309099572565ad9055689027c0289ff2e951d33cd98f0ad75aa1efc59c217c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:22.276129Z","signature_b64":"yyFCvoVAActWubv6HJPQVetgNg3to4keqbpmnUgaj7yt3fv3ULRjIJTRq+apV4jNpcrqs5OPLcBg7KnYVkZUAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc349de60add8d7634a8b5428698460456bdb638febbb3cc94d660b899d65763","last_reissued_at":"2026-05-18T01:02:22.275438Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:22.275438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Competitive Analysis of Minimum-Cut Maximum Flow Algorithms in Vision Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.OC"],"primary_cat":"cs.CV","authors_text":"Barak Fishbain, Dorit S. Hochbaum, Stefan Mueller","submitted_at":"2010-07-26T18:58:32Z","abstract_excerpt":"Rapid advances in image acquisition and storage technology underline the need for algorithms that are capable of solving large scale image processing and computer-vision problems. The minimum cut problem plays an important role in processing many of these imaging problems such as, image and video segmentation, stereo vision, multi-view reconstruction and surface fitting. While several min-cut/max-flow algorithms can be found in the literature, their performance in practice has been studied primarily outside the scope of computer vision. We present here the results of a comprehensive computatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.4531","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":"1007.4531","created_at":"2026-05-18T01:02:22.275566+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.4531v2","created_at":"2026-05-18T01:02:22.275566+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.4531","created_at":"2026-05-18T01:02:22.275566+00:00"},{"alias_kind":"pith_short_12","alias_value":"XQ2J3ZQK3WGX","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"XQ2J3ZQK3WGXMNFI","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"XQ2J3ZQK","created_at":"2026-05-18T12:26:17.028572+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/XQ2J3ZQK3WGXMNFIWVBINGCGAR","json":"https://pith.science/pith/XQ2J3ZQK3WGXMNFIWVBINGCGAR.json","graph_json":"https://pith.science/api/pith-number/XQ2J3ZQK3WGXMNFIWVBINGCGAR/graph.json","events_json":"https://pith.science/api/pith-number/XQ2J3ZQK3WGXMNFIWVBINGCGAR/events.json","paper":"https://pith.science/paper/XQ2J3ZQK"},"agent_actions":{"view_html":"https://pith.science/pith/XQ2J3ZQK3WGXMNFIWVBINGCGAR","download_json":"https://pith.science/pith/XQ2J3ZQK3WGXMNFIWVBINGCGAR.json","view_paper":"https://pith.science/paper/XQ2J3ZQK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.4531&json=true","fetch_graph":"https://pith.science/api/pith-number/XQ2J3ZQK3WGXMNFIWVBINGCGAR/graph.json","fetch_events":"https://pith.science/api/pith-number/XQ2J3ZQK3WGXMNFIWVBINGCGAR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XQ2J3ZQK3WGXMNFIWVBINGCGAR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XQ2J3ZQK3WGXMNFIWVBINGCGAR/action/storage_attestation","attest_author":"https://pith.science/pith/XQ2J3ZQK3WGXMNFIWVBINGCGAR/action/author_attestation","sign_citation":"https://pith.science/pith/XQ2J3ZQK3WGXMNFIWVBINGCGAR/action/citation_signature","submit_replication":"https://pith.science/pith/XQ2J3ZQK3WGXMNFIWVBINGCGAR/action/replication_record"}},"created_at":"2026-05-18T01:02:22.275566+00:00","updated_at":"2026-05-18T01:02:22.275566+00:00"}