{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CTSBUG3UCSSCSHFZDYJEHFJMHP","short_pith_number":"pith:CTSBUG3U","schema_version":"1.0","canonical_sha256":"14e41a1b7414a4291cb91e1243952c3bd28adc1dd0fdc31bf175cc41a6aa27ea","source":{"kind":"arxiv","id":"1802.07045","version":2},"attestation_state":"computed","paper":{"title":"Latent RANSAC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Roee Litman, Simon Korman","submitted_at":"2018-02-20T10:16:11Z","abstract_excerpt":"We present a method that can evaluate a RANSAC hypothesis in constant time, i.e. independent of the size of the data. A key observation here is that correct hypotheses are tightly clustered together in the latent parameter domain. In a manner similar to the generalized Hough transform we seek to find this cluster, only that we need as few as two votes for a successful detection. Rapidly locating such pairs of similar hypotheses is made possible by adapting the recent \"Random Grids\" range-search technique. We only perform the usual (costly) hypothesis verification stage upon the discovery of a "},"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":"1802.07045","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-02-20T10:16:11Z","cross_cats_sorted":[],"title_canon_sha256":"a4e67d75586a3db7ae09702c368d246916ead8064194775e7c44bebe71429831","abstract_canon_sha256":"cffafaaac9475b53d123bac9f1df9e70621f264ae9a73c95bc7a7694312eec35"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:21.769566Z","signature_b64":"gg+7OUG2mQxDAdof4h4eC5A/0kudX0zpqgA3RhXcLLMHd1VAtIuJpoIUO0hJJC4I1GpvJ9qijv+Ik3oI6RpTCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14e41a1b7414a4291cb91e1243952c3bd28adc1dd0fdc31bf175cc41a6aa27ea","last_reissued_at":"2026-05-18T00:14:21.768879Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:21.768879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Latent RANSAC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Roee Litman, Simon Korman","submitted_at":"2018-02-20T10:16:11Z","abstract_excerpt":"We present a method that can evaluate a RANSAC hypothesis in constant time, i.e. independent of the size of the data. A key observation here is that correct hypotheses are tightly clustered together in the latent parameter domain. In a manner similar to the generalized Hough transform we seek to find this cluster, only that we need as few as two votes for a successful detection. Rapidly locating such pairs of similar hypotheses is made possible by adapting the recent \"Random Grids\" range-search technique. We only perform the usual (costly) hypothesis verification stage upon the discovery of a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07045","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":"1802.07045","created_at":"2026-05-18T00:14:21.768987+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.07045v2","created_at":"2026-05-18T00:14:21.768987+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07045","created_at":"2026-05-18T00:14:21.768987+00:00"},{"alias_kind":"pith_short_12","alias_value":"CTSBUG3UCSSC","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"CTSBUG3UCSSCSHFZ","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"CTSBUG3U","created_at":"2026-05-18T12:32:19.392346+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/CTSBUG3UCSSCSHFZDYJEHFJMHP","json":"https://pith.science/pith/CTSBUG3UCSSCSHFZDYJEHFJMHP.json","graph_json":"https://pith.science/api/pith-number/CTSBUG3UCSSCSHFZDYJEHFJMHP/graph.json","events_json":"https://pith.science/api/pith-number/CTSBUG3UCSSCSHFZDYJEHFJMHP/events.json","paper":"https://pith.science/paper/CTSBUG3U"},"agent_actions":{"view_html":"https://pith.science/pith/CTSBUG3UCSSCSHFZDYJEHFJMHP","download_json":"https://pith.science/pith/CTSBUG3UCSSCSHFZDYJEHFJMHP.json","view_paper":"https://pith.science/paper/CTSBUG3U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.07045&json=true","fetch_graph":"https://pith.science/api/pith-number/CTSBUG3UCSSCSHFZDYJEHFJMHP/graph.json","fetch_events":"https://pith.science/api/pith-number/CTSBUG3UCSSCSHFZDYJEHFJMHP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CTSBUG3UCSSCSHFZDYJEHFJMHP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CTSBUG3UCSSCSHFZDYJEHFJMHP/action/storage_attestation","attest_author":"https://pith.science/pith/CTSBUG3UCSSCSHFZDYJEHFJMHP/action/author_attestation","sign_citation":"https://pith.science/pith/CTSBUG3UCSSCSHFZDYJEHFJMHP/action/citation_signature","submit_replication":"https://pith.science/pith/CTSBUG3UCSSCSHFZDYJEHFJMHP/action/replication_record"}},"created_at":"2026-05-18T00:14:21.768987+00:00","updated_at":"2026-05-18T00:14:21.768987+00:00"}