{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:MNAO4EF7NXBO3M37OUMUORLAMS","short_pith_number":"pith:MNAO4EF7","canonical_record":{"source":{"id":"1010.2733","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2010-10-13T19:08:02Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"a3d091a657a31fdf5a6083c42c4de13f9a5897e322d909a01bdfe305c1f5acea","abstract_canon_sha256":"ab5bdb3ef2da861ed911e72bd2c7857e6560c421a77010f8cd8e06fe080b700d"},"schema_version":"1.0"},"canonical_sha256":"6340ee10bf6dc2edb37f751947456064a72851e5b2bb4f84409c539d486312d1","source":{"kind":"arxiv","id":"1010.2733","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.2733","created_at":"2026-05-18T04:05:45Z"},{"alias_kind":"arxiv_version","alias_value":"1010.2733v2","created_at":"2026-05-18T04:05:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2733","created_at":"2026-05-18T04:05:45Z"},{"alias_kind":"pith_short_12","alias_value":"MNAO4EF7NXBO","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MNAO4EF7NXBO3M37","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MNAO4EF7","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:MNAO4EF7NXBO3M37OUMUORLAMS","target":"record","payload":{"canonical_record":{"source":{"id":"1010.2733","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2010-10-13T19:08:02Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"a3d091a657a31fdf5a6083c42c4de13f9a5897e322d909a01bdfe305c1f5acea","abstract_canon_sha256":"ab5bdb3ef2da861ed911e72bd2c7857e6560c421a77010f8cd8e06fe080b700d"},"schema_version":"1.0"},"canonical_sha256":"6340ee10bf6dc2edb37f751947456064a72851e5b2bb4f84409c539d486312d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:45.911855Z","signature_b64":"2BcZaYiHSOtSrEz9fOGuhJODVgv9yjpyupkYE7ShoREFVy+l9nuSQeGtBBe0j+C8lNtLbjBT8cmZOfVcOyNHCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6340ee10bf6dc2edb37f751947456064a72851e5b2bb4f84409c539d486312d1","last_reissued_at":"2026-05-18T04:05:45.911428Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:45.911428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.2733","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-18T04:05:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fgeYPukd/ytMJUxi31mnW5FXWAke3Vo1ATmeJS1xaR9z8x/E6E7DxWC4TxBFrhLG/LRuUOKZQd2sXoYfApidCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T16:56:58.509398Z"},"content_sha256":"367b2543dd633f42e0d3de63d3ba5a98354ace2fd9c5c5eeb6fd756fe23856b7","schema_version":"1.0","event_id":"sha256:367b2543dd633f42e0d3de63d3ba5a98354ace2fd9c5c5eeb6fd756fe23856b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:MNAO4EF7NXBO3M37OUMUORLAMS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combinatorial Continuous Maximal Flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.CV","authors_text":"Camille Couprie (LIGM), Hugues Talbot (LIGM), Laurent Najman (LIGM), Leo Grady","submitted_at":"2010-10-13T19:08:02Z","abstract_excerpt":"Maximum flow (and minimum cut) algorithms have had a strong impact on computer vision. In particular, graph cuts algorithms provide a mechanism for the discrete optimization of an energy functional which has been used in a variety of applications such as image segmentation, stereo, image stitching and texture synthesis. Algorithms based on the classical formulation of max-flow defined on a graph are known to exhibit metrication artefacts in the solution. Therefore, a recent trend has been to instead employ a spatially continuous maximum flow (or the dual min-cut problem) in these same applicat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2733","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-18T04:05:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WBUO2Z6ct++ICI7RXDY+uyXg7Q82dEC9AtblHKBzAOTpAJoMonz7wFJzjuYTtyUyJ2M1285mNtuUKmGrkAeSDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T16:56:58.509760Z"},"content_sha256":"c4cf9c536b8c11816a771c7867f12984ac7dc6f0dc58ea977df9b93ddd9259c8","schema_version":"1.0","event_id":"sha256:c4cf9c536b8c11816a771c7867f12984ac7dc6f0dc58ea977df9b93ddd9259c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MNAO4EF7NXBO3M37OUMUORLAMS/bundle.json","state_url":"https://pith.science/pith/MNAO4EF7NXBO3M37OUMUORLAMS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MNAO4EF7NXBO3M37OUMUORLAMS/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-26T16:56:58Z","links":{"resolver":"https://pith.science/pith/MNAO4EF7NXBO3M37OUMUORLAMS","bundle":"https://pith.science/pith/MNAO4EF7NXBO3M37OUMUORLAMS/bundle.json","state":"https://pith.science/pith/MNAO4EF7NXBO3M37OUMUORLAMS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MNAO4EF7NXBO3M37OUMUORLAMS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:MNAO4EF7NXBO3M37OUMUORLAMS","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":"ab5bdb3ef2da861ed911e72bd2c7857e6560c421a77010f8cd8e06fe080b700d","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2010-10-13T19:08:02Z","title_canon_sha256":"a3d091a657a31fdf5a6083c42c4de13f9a5897e322d909a01bdfe305c1f5acea"},"schema_version":"1.0","source":{"id":"1010.2733","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.2733","created_at":"2026-05-18T04:05:45Z"},{"alias_kind":"arxiv_version","alias_value":"1010.2733v2","created_at":"2026-05-18T04:05:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2733","created_at":"2026-05-18T04:05:45Z"},{"alias_kind":"pith_short_12","alias_value":"MNAO4EF7NXBO","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"MNAO4EF7NXBO3M37","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"MNAO4EF7","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:c4cf9c536b8c11816a771c7867f12984ac7dc6f0dc58ea977df9b93ddd9259c8","target":"graph","created_at":"2026-05-18T04:05:45Z","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":"Maximum flow (and minimum cut) algorithms have had a strong impact on computer vision. In particular, graph cuts algorithms provide a mechanism for the discrete optimization of an energy functional which has been used in a variety of applications such as image segmentation, stereo, image stitching and texture synthesis. Algorithms based on the classical formulation of max-flow defined on a graph are known to exhibit metrication artefacts in the solution. Therefore, a recent trend has been to instead employ a spatially continuous maximum flow (or the dual min-cut problem) in these same applicat","authors_text":"Camille Couprie (LIGM), Hugues Talbot (LIGM), Laurent Najman (LIGM), Leo Grady","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2010-10-13T19:08:02Z","title":"Combinatorial Continuous Maximal Flows"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2733","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:367b2543dd633f42e0d3de63d3ba5a98354ace2fd9c5c5eeb6fd756fe23856b7","target":"record","created_at":"2026-05-18T04:05:45Z","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":"ab5bdb3ef2da861ed911e72bd2c7857e6560c421a77010f8cd8e06fe080b700d","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2010-10-13T19:08:02Z","title_canon_sha256":"a3d091a657a31fdf5a6083c42c4de13f9a5897e322d909a01bdfe305c1f5acea"},"schema_version":"1.0","source":{"id":"1010.2733","kind":"arxiv","version":2}},"canonical_sha256":"6340ee10bf6dc2edb37f751947456064a72851e5b2bb4f84409c539d486312d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6340ee10bf6dc2edb37f751947456064a72851e5b2bb4f84409c539d486312d1","first_computed_at":"2026-05-18T04:05:45.911428Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:45.911428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2BcZaYiHSOtSrEz9fOGuhJODVgv9yjpyupkYE7ShoREFVy+l9nuSQeGtBBe0j+C8lNtLbjBT8cmZOfVcOyNHCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:45.911855Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.2733","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:367b2543dd633f42e0d3de63d3ba5a98354ace2fd9c5c5eeb6fd756fe23856b7","sha256:c4cf9c536b8c11816a771c7867f12984ac7dc6f0dc58ea977df9b93ddd9259c8"],"state_sha256":"8ae424170b12bdb9fa503e1c80929035f75aa7ac79635f1286dff2861a295ffe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IXI5np4gtiefuA1XXb5ri0oY7YuHK+e5M8t8ypqIdkPUu8kUGW6fQlEn9yHaQO+OvZG9wVXY/mVYyHLQqwxVBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T16:56:58.511723Z","bundle_sha256":"d1268d7116a9dc3ad2babe0af1fe780b19719958459beb74ef3f808cf86485ee"}}