{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GCAKYXZJ7WLBBR34WUCKLFM2DJ","short_pith_number":"pith:GCAKYXZJ","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"},"canonical_sha256":"3080ac5f29fd9610c77cb504a5959a1a4c459a4e8737d360707505641e5a133c","source":{"kind":"arxiv","id":"1510.01041","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.01041","created_at":"2026-05-18T01:31:04Z"},{"alias_kind":"arxiv_version","alias_value":"1510.01041v1","created_at":"2026-05-18T01:31:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.01041","created_at":"2026-05-18T01:31:04Z"},{"alias_kind":"pith_short_12","alias_value":"GCAKYXZJ7WLB","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GCAKYXZJ7WLBBR34","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GCAKYXZJ","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GCAKYXZJ7WLBBR34WUCKLFM2DJ","target":"record","payload":{"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"},"canonical_sha256":"3080ac5f29fd9610c77cb504a5959a1a4c459a4e8737d360707505641e5a133c","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"},"source_kind":"arxiv","source_id":"1510.01041","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:31:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/EEbs7XhSlfc9GOxURqTVLP23vxUE0kbUt5plUx5xJA+0k1pMWk1TDjhMm1SeLRkx9en6IL21Mf1UEN2QuggDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:53:05.318227Z"},"content_sha256":"0369d46253d795858535d6782e161dd9772a9e73b22e84d8cafeb9d128781306","schema_version":"1.0","event_id":"sha256:0369d46253d795858535d6782e161dd9772a9e73b22e84d8cafeb9d128781306"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GCAKYXZJ7WLBBR34WUCKLFM2DJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:31:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yI6k3c6CcjregivUlaK90r0kG5PrRARdDOMEBBUWs+nrbwtx441/S4SolCNyGNX4v4X4D+8S4pJ9AByjMPFHBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T17:53:05.318894Z"},"content_sha256":"9fde95d2f34df2545d25249b1434e7d52b7ed03f78f7eb3e6a24aa657d57f54a","schema_version":"1.0","event_id":"sha256:9fde95d2f34df2545d25249b1434e7d52b7ed03f78f7eb3e6a24aa657d57f54a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GCAKYXZJ7WLBBR34WUCKLFM2DJ/bundle.json","state_url":"https://pith.science/pith/GCAKYXZJ7WLBBR34WUCKLFM2DJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GCAKYXZJ7WLBBR34WUCKLFM2DJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T17:53:05Z","links":{"resolver":"https://pith.science/pith/GCAKYXZJ7WLBBR34WUCKLFM2DJ","bundle":"https://pith.science/pith/GCAKYXZJ7WLBBR34WUCKLFM2DJ/bundle.json","state":"https://pith.science/pith/GCAKYXZJ7WLBBR34WUCKLFM2DJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GCAKYXZJ7WLBBR34WUCKLFM2DJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GCAKYXZJ7WLBBR34WUCKLFM2DJ","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":"322cd2ec8d36f5c713e63b3d3528178517719d04eb8d9073c1db74b28430ebef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-10-05T06:38:03Z","title_canon_sha256":"02fd9f621eb1e26e4708195a63c486e9fd7c82c0771a33ada368548dd772ef2d"},"schema_version":"1.0","source":{"id":"1510.01041","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.01041","created_at":"2026-05-18T01:31:04Z"},{"alias_kind":"arxiv_version","alias_value":"1510.01041v1","created_at":"2026-05-18T01:31:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.01041","created_at":"2026-05-18T01:31:04Z"},{"alias_kind":"pith_short_12","alias_value":"GCAKYXZJ7WLB","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GCAKYXZJ7WLBBR34","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GCAKYXZJ","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:9fde95d2f34df2545d25249b1434e7d52b7ed03f78f7eb3e6a24aa657d57f54a","target":"graph","created_at":"2026-05-18T01:31:04Z","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":"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","authors_text":"Gil Shapira, Tal Hassner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-10-05T06:38:03Z","title":"GPU-Based Computation of 2D Least Median of Squares with Applications to Fast and Robust Line Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.01041","kind":"arxiv","version":1},"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:0369d46253d795858535d6782e161dd9772a9e73b22e84d8cafeb9d128781306","target":"record","created_at":"2026-05-18T01:31:04Z","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":"322cd2ec8d36f5c713e63b3d3528178517719d04eb8d9073c1db74b28430ebef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-10-05T06:38:03Z","title_canon_sha256":"02fd9f621eb1e26e4708195a63c486e9fd7c82c0771a33ada368548dd772ef2d"},"schema_version":"1.0","source":{"id":"1510.01041","kind":"arxiv","version":1}},"canonical_sha256":"3080ac5f29fd9610c77cb504a5959a1a4c459a4e8737d360707505641e5a133c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3080ac5f29fd9610c77cb504a5959a1a4c459a4e8737d360707505641e5a133c","first_computed_at":"2026-05-18T01:31:04.925475Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:04.925475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6o5tW3jK2wHsDDTjT8wqRT7lGxvTif0krUtufiyQiXiPieXXudz9sr60xBXYu9wKoey3Y+YaDlf1oC9fwobYBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:04.926168Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.01041","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0369d46253d795858535d6782e161dd9772a9e73b22e84d8cafeb9d128781306","sha256:9fde95d2f34df2545d25249b1434e7d52b7ed03f78f7eb3e6a24aa657d57f54a"],"state_sha256":"ecad3ffa4360b7902269989116dd970b505266423328cedcdb25172c657d3c34"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sCuSchGCziVJgfLBLtP0tgp3U5clyIMNXHykM6UmZQ3zeYzR4bQ75CSKOPrN3NZ5xfZ0dmF3YUMcFLA1MHFMDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T17:53:05.322796Z","bundle_sha256":"0387b0b453686a3c7b89cf150e5b1276247c047be407ee6afa9d63918d560cb2"}}