{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KJQRVVQGCVZWE3ZPKVOVIZFBOT","short_pith_number":"pith:KJQRVVQG","schema_version":"1.0","canonical_sha256":"52611ad6061573626f2f555d5464a174d5acdcd623cd7db75798268e6b6fac1e","source":{"kind":"arxiv","id":"1706.00984","version":2},"attestation_state":"computed","paper":{"title":"Graph-Cut RANSAC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Daniel Barath, Jiri Matas","submitted_at":"2017-06-03T17:52:53Z","abstract_excerpt":"A novel method for robust estimation, called Graph-Cut RANSAC, GC-RANSAC in short, is introduced. To separate inliers and outliers, it runs the graph-cut algorithm in the local optimization (LO) step which is applied when a so-far-the-best model is found. The proposed LO step is conceptually simple, easy to implement, globally optimal and efficient. GC-RANSAC is shown experimentally, both on synthesized tests and real image pairs, to be more geometrically accurate than state-of-the-art methods on a range of problems, e.g. line fitting, homography, affine transformation, fundamental and essenti"},"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":"1706.00984","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-06-03T17:52:53Z","cross_cats_sorted":[],"title_canon_sha256":"c25cbf1d400b3c6f3b08cc9adeed84329bdd7ce73158cd59673e93175104a6bf","abstract_canon_sha256":"5337e0b3ec3e6076486a4d4cdf3d54450c89a45757ebb099878dc256eb05ec54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:28.201901Z","signature_b64":"2qyKkxfpRfguAxvPKuyA9b6BljAE3p9p6scRhCPEaC+Gh6lLB8qNh2o7n+1XQBZBHAkoLoPPJCzWT7mPjbpJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52611ad6061573626f2f555d5464a174d5acdcd623cd7db75798268e6b6fac1e","last_reissued_at":"2026-05-18T00:30:28.201401Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:28.201401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph-Cut RANSAC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Daniel Barath, Jiri Matas","submitted_at":"2017-06-03T17:52:53Z","abstract_excerpt":"A novel method for robust estimation, called Graph-Cut RANSAC, GC-RANSAC in short, is introduced. To separate inliers and outliers, it runs the graph-cut algorithm in the local optimization (LO) step which is applied when a so-far-the-best model is found. The proposed LO step is conceptually simple, easy to implement, globally optimal and efficient. GC-RANSAC is shown experimentally, both on synthesized tests and real image pairs, to be more geometrically accurate than state-of-the-art methods on a range of problems, e.g. line fitting, homography, affine transformation, fundamental and essenti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00984","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":"1706.00984","created_at":"2026-05-18T00:30:28.201480+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.00984v2","created_at":"2026-05-18T00:30:28.201480+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00984","created_at":"2026-05-18T00:30:28.201480+00:00"},{"alias_kind":"pith_short_12","alias_value":"KJQRVVQGCVZW","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KJQRVVQGCVZWE3ZP","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KJQRVVQG","created_at":"2026-05-18T12:31:24.725408+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/KJQRVVQGCVZWE3ZPKVOVIZFBOT","json":"https://pith.science/pith/KJQRVVQGCVZWE3ZPKVOVIZFBOT.json","graph_json":"https://pith.science/api/pith-number/KJQRVVQGCVZWE3ZPKVOVIZFBOT/graph.json","events_json":"https://pith.science/api/pith-number/KJQRVVQGCVZWE3ZPKVOVIZFBOT/events.json","paper":"https://pith.science/paper/KJQRVVQG"},"agent_actions":{"view_html":"https://pith.science/pith/KJQRVVQGCVZWE3ZPKVOVIZFBOT","download_json":"https://pith.science/pith/KJQRVVQGCVZWE3ZPKVOVIZFBOT.json","view_paper":"https://pith.science/paper/KJQRVVQG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.00984&json=true","fetch_graph":"https://pith.science/api/pith-number/KJQRVVQGCVZWE3ZPKVOVIZFBOT/graph.json","fetch_events":"https://pith.science/api/pith-number/KJQRVVQGCVZWE3ZPKVOVIZFBOT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KJQRVVQGCVZWE3ZPKVOVIZFBOT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KJQRVVQGCVZWE3ZPKVOVIZFBOT/action/storage_attestation","attest_author":"https://pith.science/pith/KJQRVVQGCVZWE3ZPKVOVIZFBOT/action/author_attestation","sign_citation":"https://pith.science/pith/KJQRVVQGCVZWE3ZPKVOVIZFBOT/action/citation_signature","submit_replication":"https://pith.science/pith/KJQRVVQGCVZWE3ZPKVOVIZFBOT/action/replication_record"}},"created_at":"2026-05-18T00:30:28.201480+00:00","updated_at":"2026-05-18T00:30:28.201480+00:00"}