{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AAWCHLBHKWTOGG2REAUHT564T7","short_pith_number":"pith:AAWCHLBH","schema_version":"1.0","canonical_sha256":"002c23ac2755a6e31b51202879f7dc9fd4cf6f9b1c1a42b6441a2200aaed3050","source":{"kind":"arxiv","id":"1804.02638","version":1},"attestation_state":"computed","paper":{"title":"OATM: Occlusion Aware Template Matching by Consensus Set Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Mark Milam, Simon Korman, Stefano Soatto","submitted_at":"2018-04-08T07:19:55Z","abstract_excerpt":"We present a novel approach to template matching that is efficient, can handle partial occlusions, and comes with provable performance guarantees. A key component of the method is a reduction that transforms the problem of searching a nearest neighbor among $N$ high-dimensional vectors, to searching neighbors among two sets of order $\\sqrt{N}$ vectors, which can be found efficiently using range search techniques. This allows for a quadratic improvement in search complexity, and makes the method scalable in handling large search spaces. The second contribution is a hashing scheme based on conse"},"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":"1804.02638","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-08T07:19:55Z","cross_cats_sorted":[],"title_canon_sha256":"505a3f5d65bbf08b99ec30fe5d6e58afd854677bbb6afe11e65e36d512cf936f","abstract_canon_sha256":"df3cf1ad5112c77aeaf608612e43250351f19a8ecff6a7578e8894a9ee330802"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:58.877673Z","signature_b64":"xTLsMzghPptuBEL3PLCIifwOOYVbz8yS8ObZjXzuo/mdjOzSgTBMnKSQoXaftuuUPkMKMtyoUKKwcMsZv4URCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"002c23ac2755a6e31b51202879f7dc9fd4cf6f9b1c1a42b6441a2200aaed3050","last_reissued_at":"2026-05-18T00:18:58.877182Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:58.877182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"OATM: Occlusion Aware Template Matching by Consensus Set Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Mark Milam, Simon Korman, Stefano Soatto","submitted_at":"2018-04-08T07:19:55Z","abstract_excerpt":"We present a novel approach to template matching that is efficient, can handle partial occlusions, and comes with provable performance guarantees. A key component of the method is a reduction that transforms the problem of searching a nearest neighbor among $N$ high-dimensional vectors, to searching neighbors among two sets of order $\\sqrt{N}$ vectors, which can be found efficiently using range search techniques. This allows for a quadratic improvement in search complexity, and makes the method scalable in handling large search spaces. The second contribution is a hashing scheme based on conse"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02638","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":"1804.02638","created_at":"2026-05-18T00:18:58.877281+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.02638v1","created_at":"2026-05-18T00:18:58.877281+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02638","created_at":"2026-05-18T00:18:58.877281+00:00"},{"alias_kind":"pith_short_12","alias_value":"AAWCHLBHKWTO","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AAWCHLBHKWTOGG2R","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AAWCHLBH","created_at":"2026-05-18T12:32:13.499390+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/AAWCHLBHKWTOGG2REAUHT564T7","json":"https://pith.science/pith/AAWCHLBHKWTOGG2REAUHT564T7.json","graph_json":"https://pith.science/api/pith-number/AAWCHLBHKWTOGG2REAUHT564T7/graph.json","events_json":"https://pith.science/api/pith-number/AAWCHLBHKWTOGG2REAUHT564T7/events.json","paper":"https://pith.science/paper/AAWCHLBH"},"agent_actions":{"view_html":"https://pith.science/pith/AAWCHLBHKWTOGG2REAUHT564T7","download_json":"https://pith.science/pith/AAWCHLBHKWTOGG2REAUHT564T7.json","view_paper":"https://pith.science/paper/AAWCHLBH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.02638&json=true","fetch_graph":"https://pith.science/api/pith-number/AAWCHLBHKWTOGG2REAUHT564T7/graph.json","fetch_events":"https://pith.science/api/pith-number/AAWCHLBHKWTOGG2REAUHT564T7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AAWCHLBHKWTOGG2REAUHT564T7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AAWCHLBHKWTOGG2REAUHT564T7/action/storage_attestation","attest_author":"https://pith.science/pith/AAWCHLBHKWTOGG2REAUHT564T7/action/author_attestation","sign_citation":"https://pith.science/pith/AAWCHLBHKWTOGG2REAUHT564T7/action/citation_signature","submit_replication":"https://pith.science/pith/AAWCHLBHKWTOGG2REAUHT564T7/action/replication_record"}},"created_at":"2026-05-18T00:18:58.877281+00:00","updated_at":"2026-05-18T00:18:58.877281+00:00"}