{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JT5SIRXKDL4IHB7WURTCDRJRKQ","short_pith_number":"pith:JT5SIRXK","schema_version":"1.0","canonical_sha256":"4cfb2446ea1af88387f6a46621c531543c23d1acff4fa7ff2e7875c2a87a77c6","source":{"kind":"arxiv","id":"1811.06287","version":1},"attestation_state":"computed","paper":{"title":"Sketch based Reduced Memory Hough Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Levi Offen, Michael Werman","submitted_at":"2018-11-15T10:44:35Z","abstract_excerpt":"This paper proposes using sketch algorithms to represent the votes in Hough transforms. Replacing the accumulator array with a sketch (Sketch Hough Transform - SHT) significantly reduces the memory needed to compute a Hough transform. We also present a new sketch, Count Median Update, which works better than known sketch methods for replacing the accumulator array in the Hough Transform."},"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":"1811.06287","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-11-15T10:44:35Z","cross_cats_sorted":[],"title_canon_sha256":"e727baf4d06b11d468f5c048b33342bcff3808ef3e744cb82933702a63ef964d","abstract_canon_sha256":"68409a1d008675d90e97897ceaad9da8f4b5f3ab4f4e9d95caf9f864b932146e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:38.104449Z","signature_b64":"pfqr9GUSgEnVyNyOXcJY9O50L8f1MJIZcDHxSMUo6kCMjw3tym4wMASBbkrbDWLVZydju0JKSvkEf5M6tK6vCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4cfb2446ea1af88387f6a46621c531543c23d1acff4fa7ff2e7875c2a87a77c6","last_reissued_at":"2026-05-18T00:00:38.103831Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:38.103831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sketch based Reduced Memory Hough Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Levi Offen, Michael Werman","submitted_at":"2018-11-15T10:44:35Z","abstract_excerpt":"This paper proposes using sketch algorithms to represent the votes in Hough transforms. Replacing the accumulator array with a sketch (Sketch Hough Transform - SHT) significantly reduces the memory needed to compute a Hough transform. We also present a new sketch, Count Median Update, which works better than known sketch methods for replacing the accumulator array in the Hough Transform."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06287","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":"1811.06287","created_at":"2026-05-18T00:00:38.103938+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.06287v1","created_at":"2026-05-18T00:00:38.103938+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06287","created_at":"2026-05-18T00:00:38.103938+00:00"},{"alias_kind":"pith_short_12","alias_value":"JT5SIRXKDL4I","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JT5SIRXKDL4IHB7W","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JT5SIRXK","created_at":"2026-05-18T12:32:31.084164+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/JT5SIRXKDL4IHB7WURTCDRJRKQ","json":"https://pith.science/pith/JT5SIRXKDL4IHB7WURTCDRJRKQ.json","graph_json":"https://pith.science/api/pith-number/JT5SIRXKDL4IHB7WURTCDRJRKQ/graph.json","events_json":"https://pith.science/api/pith-number/JT5SIRXKDL4IHB7WURTCDRJRKQ/events.json","paper":"https://pith.science/paper/JT5SIRXK"},"agent_actions":{"view_html":"https://pith.science/pith/JT5SIRXKDL4IHB7WURTCDRJRKQ","download_json":"https://pith.science/pith/JT5SIRXKDL4IHB7WURTCDRJRKQ.json","view_paper":"https://pith.science/paper/JT5SIRXK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.06287&json=true","fetch_graph":"https://pith.science/api/pith-number/JT5SIRXKDL4IHB7WURTCDRJRKQ/graph.json","fetch_events":"https://pith.science/api/pith-number/JT5SIRXKDL4IHB7WURTCDRJRKQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JT5SIRXKDL4IHB7WURTCDRJRKQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JT5SIRXKDL4IHB7WURTCDRJRKQ/action/storage_attestation","attest_author":"https://pith.science/pith/JT5SIRXKDL4IHB7WURTCDRJRKQ/action/author_attestation","sign_citation":"https://pith.science/pith/JT5SIRXKDL4IHB7WURTCDRJRKQ/action/citation_signature","submit_replication":"https://pith.science/pith/JT5SIRXKDL4IHB7WURTCDRJRKQ/action/replication_record"}},"created_at":"2026-05-18T00:00:38.103938+00:00","updated_at":"2026-05-18T00:00:38.103938+00:00"}