{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GCAKYXZJ7WLBBR34WUCKLFM2DJ","short_pith_number":"pith:GCAKYXZJ","schema_version":"1.0","canonical_sha256":"3080ac5f29fd9610c77cb504a5959a1a4c459a4e8737d360707505641e5a133c","source":{"kind":"arxiv","id":"1510.01041","version":1},"attestation_state":"computed","paper":{"title":"GPU-Based Computation of 2D Least Median of Squares with Applications to Fast and Robust Line Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Gil Shapira, Tal Hassner","submitted_at":"2015-10-05T06:38:03Z","abstract_excerpt":"The 2D Least Median of Squares (LMS) is a popular tool in robust regression because of its high breakdown point: up to half of the input data can be contaminated with outliers without affecting the accuracy of the LMS estimator. The complexity of 2D LMS estimation has been shown to be $\\Omega(n^2)$ where $n$ is the total number of points. This high theoretical complexity along with the availability of graphics processing units (GPU) motivates the development of a fast, parallel, GPU-based algorithm for LMS computation. We present a CUDA based algorithm for LMS computation and show it to be muc"},"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":"1510.01041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-10-05T06:38:03Z","cross_cats_sorted":[],"title_canon_sha256":"02fd9f621eb1e26e4708195a63c486e9fd7c82c0771a33ada368548dd772ef2d","abstract_canon_sha256":"322cd2ec8d36f5c713e63b3d3528178517719d04eb8d9073c1db74b28430ebef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:04.926168Z","signature_b64":"6o5tW3jK2wHsDDTjT8wqRT7lGxvTif0krUtufiyQiXiPieXXudz9sr60xBXYu9wKoey3Y+YaDlf1oC9fwobYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3080ac5f29fd9610c77cb504a5959a1a4c459a4e8737d360707505641e5a133c","last_reissued_at":"2026-05-18T01:31:04.925475Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:04.925475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GPU-Based Computation of 2D Least Median of Squares with Applications to Fast and Robust Line Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Gil Shapira, Tal Hassner","submitted_at":"2015-10-05T06:38:03Z","abstract_excerpt":"The 2D Least Median of Squares (LMS) is a popular tool in robust regression because of its high breakdown point: up to half of the input data can be contaminated with outliers without affecting the accuracy of the LMS estimator. The complexity of 2D LMS estimation has been shown to be $\\Omega(n^2)$ where $n$ is the total number of points. This high theoretical complexity along with the availability of graphics processing units (GPU) motivates the development of a fast, parallel, GPU-based algorithm for LMS computation. We present a CUDA based algorithm for LMS computation and show it to be muc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.01041","kind":"arxiv","version":1},"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":"1510.01041","created_at":"2026-05-18T01:31:04.925584+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.01041v1","created_at":"2026-05-18T01:31:04.925584+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.01041","created_at":"2026-05-18T01:31:04.925584+00:00"},{"alias_kind":"pith_short_12","alias_value":"GCAKYXZJ7WLB","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GCAKYXZJ7WLBBR34","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GCAKYXZJ","created_at":"2026-05-18T12:29:22.688609+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/GCAKYXZJ7WLBBR34WUCKLFM2DJ","json":"https://pith.science/pith/GCAKYXZJ7WLBBR34WUCKLFM2DJ.json","graph_json":"https://pith.science/api/pith-number/GCAKYXZJ7WLBBR34WUCKLFM2DJ/graph.json","events_json":"https://pith.science/api/pith-number/GCAKYXZJ7WLBBR34WUCKLFM2DJ/events.json","paper":"https://pith.science/paper/GCAKYXZJ"},"agent_actions":{"view_html":"https://pith.science/pith/GCAKYXZJ7WLBBR34WUCKLFM2DJ","download_json":"https://pith.science/pith/GCAKYXZJ7WLBBR34WUCKLFM2DJ.json","view_paper":"https://pith.science/paper/GCAKYXZJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.01041&json=true","fetch_graph":"https://pith.science/api/pith-number/GCAKYXZJ7WLBBR34WUCKLFM2DJ/graph.json","fetch_events":"https://pith.science/api/pith-number/GCAKYXZJ7WLBBR34WUCKLFM2DJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GCAKYXZJ7WLBBR34WUCKLFM2DJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GCAKYXZJ7WLBBR34WUCKLFM2DJ/action/storage_attestation","attest_author":"https://pith.science/pith/GCAKYXZJ7WLBBR34WUCKLFM2DJ/action/author_attestation","sign_citation":"https://pith.science/pith/GCAKYXZJ7WLBBR34WUCKLFM2DJ/action/citation_signature","submit_replication":"https://pith.science/pith/GCAKYXZJ7WLBBR34WUCKLFM2DJ/action/replication_record"}},"created_at":"2026-05-18T01:31:04.925584+00:00","updated_at":"2026-05-18T01:31:04.925584+00:00"}