{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:XQ2J3ZQK3WGXMNFIWVBINGCGAR","short_pith_number":"pith:XQ2J3ZQK","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"},"canonical_sha256":"bc349de60add8d7634a8b5428698460456bdb638febbb3cc94d660b899d65763","source":{"kind":"arxiv","id":"1007.4531","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.4531","created_at":"2026-05-18T01:02:22Z"},{"alias_kind":"arxiv_version","alias_value":"1007.4531v2","created_at":"2026-05-18T01:02:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.4531","created_at":"2026-05-18T01:02:22Z"},{"alias_kind":"pith_short_12","alias_value":"XQ2J3ZQK3WGX","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"XQ2J3ZQK3WGXMNFI","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"XQ2J3ZQK","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:XQ2J3ZQK3WGXMNFIWVBINGCGAR","target":"record","payload":{"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"},"canonical_sha256":"bc349de60add8d7634a8b5428698460456bdb638febbb3cc94d660b899d65763","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"},"source_kind":"arxiv","source_id":"1007.4531","source_version":2,"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-18T01:02:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d5T5bu/g6jmt9DAuLQwPG0ukwbQGJ+StEJ21nC5KHMIh5I0euhRmKdgA0M5j9Gs/rKIhwrQp1v7wuy6PKvAJAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T19:01:40.266418Z"},"content_sha256":"7d6b5bf9c1eb5929cd375abed4db4f889f4abf0a320cb962e58cc8695395a097","schema_version":"1.0","event_id":"sha256:7d6b5bf9c1eb5929cd375abed4db4f889f4abf0a320cb962e58cc8695395a097"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:XQ2J3ZQK3WGXMNFIWVBINGCGAR","target":"graph","payload":{"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"},"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-18T01:02:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CorO00s2+XDdr9JWJTmDYOy22Z0umTTCI4nfqXphuHwJj8rivWOT7LE8md3HNcnDhn7jNNcjNuqk6LlpXGJSAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T19:01:40.266777Z"},"content_sha256":"498378003f98dd0b649836f65d36e0667947008d94aaabea3e772b6c9ebfd54d","schema_version":"1.0","event_id":"sha256:498378003f98dd0b649836f65d36e0667947008d94aaabea3e772b6c9ebfd54d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XQ2J3ZQK3WGXMNFIWVBINGCGAR/bundle.json","state_url":"https://pith.science/pith/XQ2J3ZQK3WGXMNFIWVBINGCGAR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XQ2J3ZQK3WGXMNFIWVBINGCGAR/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-05-20T19:01:40Z","links":{"resolver":"https://pith.science/pith/XQ2J3ZQK3WGXMNFIWVBINGCGAR","bundle":"https://pith.science/pith/XQ2J3ZQK3WGXMNFIWVBINGCGAR/bundle.json","state":"https://pith.science/pith/XQ2J3ZQK3WGXMNFIWVBINGCGAR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XQ2J3ZQK3WGXMNFIWVBINGCGAR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:XQ2J3ZQK3WGXMNFIWVBINGCGAR","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":"7309099572565ad9055689027c0289ff2e951d33cd98f0ad75aa1efc59c217c0","cross_cats_sorted":["cs.DM","math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2010-07-26T18:58:32Z","title_canon_sha256":"18bd2fad5987a73f900647918e6b763799e37f5a0397beabdc4ac1320c01fc1a"},"schema_version":"1.0","source":{"id":"1007.4531","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.4531","created_at":"2026-05-18T01:02:22Z"},{"alias_kind":"arxiv_version","alias_value":"1007.4531v2","created_at":"2026-05-18T01:02:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.4531","created_at":"2026-05-18T01:02:22Z"},{"alias_kind":"pith_short_12","alias_value":"XQ2J3ZQK3WGX","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"XQ2J3ZQK3WGXMNFI","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"XQ2J3ZQK","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:498378003f98dd0b649836f65d36e0667947008d94aaabea3e772b6c9ebfd54d","target":"graph","created_at":"2026-05-18T01:02:22Z","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":"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","authors_text":"Barak Fishbain, Dorit S. Hochbaum, Stefan Mueller","cross_cats":["cs.DM","math.CO","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2010-07-26T18:58:32Z","title":"Competitive Analysis of Minimum-Cut Maximum Flow Algorithms in Vision Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.4531","kind":"arxiv","version":2},"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:7d6b5bf9c1eb5929cd375abed4db4f889f4abf0a320cb962e58cc8695395a097","target":"record","created_at":"2026-05-18T01:02:22Z","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":"7309099572565ad9055689027c0289ff2e951d33cd98f0ad75aa1efc59c217c0","cross_cats_sorted":["cs.DM","math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2010-07-26T18:58:32Z","title_canon_sha256":"18bd2fad5987a73f900647918e6b763799e37f5a0397beabdc4ac1320c01fc1a"},"schema_version":"1.0","source":{"id":"1007.4531","kind":"arxiv","version":2}},"canonical_sha256":"bc349de60add8d7634a8b5428698460456bdb638febbb3cc94d660b899d65763","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc349de60add8d7634a8b5428698460456bdb638febbb3cc94d660b899d65763","first_computed_at":"2026-05-18T01:02:22.275438Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:22.275438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yyFCvoVAActWubv6HJPQVetgNg3to4keqbpmnUgaj7yt3fv3ULRjIJTRq+apV4jNpcrqs5OPLcBg7KnYVkZUAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:22.276129Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.4531","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d6b5bf9c1eb5929cd375abed4db4f889f4abf0a320cb962e58cc8695395a097","sha256:498378003f98dd0b649836f65d36e0667947008d94aaabea3e772b6c9ebfd54d"],"state_sha256":"87a139e2a2c67d9894f7310e8d25609329d8bf4b6964a5a3104b835f3786611e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cb30LgJk/L4/J4hXpbIwksP5kztkEBVT1OafjNa6QXyV1glmWM6y/mDGKMDlPfQ1IKTUoTXZ12v/DCJsDivmBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T19:01:40.268777Z","bundle_sha256":"794a2b5bc538f0adc14b014eccf3b1d4b91573f84c4435ae0af0d879f32870c0"}}