{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6GN5YNUHL7LJX5LQ7KJKU2VOZH","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":"58fb523f9390f358cf8fbd243e0428d47f5b9d8e393538076080d86c82eed549","cross_cats_sorted":["cs.CV"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-01T00:19:50Z","title_canon_sha256":"95ad918a3bec1e1b3027b9872f2d8b75726a8c78ad8eb490077d8dab11ee76f1"},"schema_version":"1.0","source":{"id":"1512.00101","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.00101","created_at":"2026-05-18T01:00:40Z"},{"alias_kind":"arxiv_version","alias_value":"1512.00101v2","created_at":"2026-05-18T01:00:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00101","created_at":"2026-05-18T01:00:40Z"},{"alias_kind":"pith_short_12","alias_value":"6GN5YNUHL7LJ","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6GN5YNUHL7LJX5LQ","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6GN5YNUH","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:74076d759f117ef013aaf70719cf8e1e3a5893b31b6a9e3313edaf76161ccfeb","target":"graph","created_at":"2026-05-18T01:00:40Z","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":"Graph-cuts are widely used in computer vision. In order to speed up the optimization process and improve the scalability for large graphs, Strandmark and Kahl introduced a splitting method to split a graph into multiple subgraphs for parallel computation in both shared and distributed memory models. However, this parallel algorithm (parallel BK-algorithm) does not have a polynomial bound on the number of iterations and is found non-convergent in some cases due to the possible multiple optimal solutions of its sub-problems.\n  To remedy this non-convergence problem, in this work we first introdu","authors_text":"Miao Yu, Shuhan Shen, Zhanyi Hu","cross_cats":["cs.CV"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-01T00:19:50Z","title":"Dynamic Parallel and Distributed Graph Cuts"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00101","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:d3c8225266388cf226ec4eb5d1c0552b33121df3541f3872de44db2a72fea732","target":"record","created_at":"2026-05-18T01:00:40Z","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":"58fb523f9390f358cf8fbd243e0428d47f5b9d8e393538076080d86c82eed549","cross_cats_sorted":["cs.CV"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-01T00:19:50Z","title_canon_sha256":"95ad918a3bec1e1b3027b9872f2d8b75726a8c78ad8eb490077d8dab11ee76f1"},"schema_version":"1.0","source":{"id":"1512.00101","kind":"arxiv","version":2}},"canonical_sha256":"f19bdc36875fd69bf570fa92aa6aaec9efbd0ae4015fec28b5961409d6031be5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f19bdc36875fd69bf570fa92aa6aaec9efbd0ae4015fec28b5961409d6031be5","first_computed_at":"2026-05-18T01:00:40.077992Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:40.077992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kQn6pYfqdtbu6jwVoImndohMZ2Y5lKv+4pJw1QPt3kRyW6KaEqUyDuKhs0lr0ReAISyUcwis34Sd98OPzZW1AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:40.078527Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.00101","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3c8225266388cf226ec4eb5d1c0552b33121df3541f3872de44db2a72fea732","sha256:74076d759f117ef013aaf70719cf8e1e3a5893b31b6a9e3313edaf76161ccfeb"],"state_sha256":"642df668b17ab78f8b2d982944880befa73e9b221d388612129dc95f6f5bf10b"}