{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6GN5YNUHL7LJX5LQ7KJKU2VOZH","short_pith_number":"pith:6GN5YNUH","schema_version":"1.0","canonical_sha256":"f19bdc36875fd69bf570fa92aa6aaec9efbd0ae4015fec28b5961409d6031be5","source":{"kind":"arxiv","id":"1512.00101","version":2},"attestation_state":"computed","paper":{"title":"Dynamic Parallel and Distributed Graph Cuts","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.DS","authors_text":"Miao Yu, Shuhan Shen, Zhanyi Hu","submitted_at":"2015-12-01T00:19:50Z","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"},"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":"1512.00101","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-01T00:19:50Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"95ad918a3bec1e1b3027b9872f2d8b75726a8c78ad8eb490077d8dab11ee76f1","abstract_canon_sha256":"58fb523f9390f358cf8fbd243e0428d47f5b9d8e393538076080d86c82eed549"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:40.078527Z","signature_b64":"kQn6pYfqdtbu6jwVoImndohMZ2Y5lKv+4pJw1QPt3kRyW6KaEqUyDuKhs0lr0ReAISyUcwis34Sd98OPzZW1AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f19bdc36875fd69bf570fa92aa6aaec9efbd0ae4015fec28b5961409d6031be5","last_reissued_at":"2026-05-18T01:00:40.077992Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:40.077992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Parallel and Distributed Graph Cuts","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.DS","authors_text":"Miao Yu, Shuhan Shen, Zhanyi Hu","submitted_at":"2015-12-01T00:19:50Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00101","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":"1512.00101","created_at":"2026-05-18T01:00:40.078058+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.00101v2","created_at":"2026-05-18T01:00:40.078058+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00101","created_at":"2026-05-18T01:00:40.078058+00:00"},{"alias_kind":"pith_short_12","alias_value":"6GN5YNUHL7LJ","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6GN5YNUHL7LJX5LQ","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6GN5YNUH","created_at":"2026-05-18T12:29:07.941421+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/6GN5YNUHL7LJX5LQ7KJKU2VOZH","json":"https://pith.science/pith/6GN5YNUHL7LJX5LQ7KJKU2VOZH.json","graph_json":"https://pith.science/api/pith-number/6GN5YNUHL7LJX5LQ7KJKU2VOZH/graph.json","events_json":"https://pith.science/api/pith-number/6GN5YNUHL7LJX5LQ7KJKU2VOZH/events.json","paper":"https://pith.science/paper/6GN5YNUH"},"agent_actions":{"view_html":"https://pith.science/pith/6GN5YNUHL7LJX5LQ7KJKU2VOZH","download_json":"https://pith.science/pith/6GN5YNUHL7LJX5LQ7KJKU2VOZH.json","view_paper":"https://pith.science/paper/6GN5YNUH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.00101&json=true","fetch_graph":"https://pith.science/api/pith-number/6GN5YNUHL7LJX5LQ7KJKU2VOZH/graph.json","fetch_events":"https://pith.science/api/pith-number/6GN5YNUHL7LJX5LQ7KJKU2VOZH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6GN5YNUHL7LJX5LQ7KJKU2VOZH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6GN5YNUHL7LJX5LQ7KJKU2VOZH/action/storage_attestation","attest_author":"https://pith.science/pith/6GN5YNUHL7LJX5LQ7KJKU2VOZH/action/author_attestation","sign_citation":"https://pith.science/pith/6GN5YNUHL7LJX5LQ7KJKU2VOZH/action/citation_signature","submit_replication":"https://pith.science/pith/6GN5YNUHL7LJX5LQ7KJKU2VOZH/action/replication_record"}},"created_at":"2026-05-18T01:00:40.078058+00:00","updated_at":"2026-05-18T01:00:40.078058+00:00"}