{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AAWCHLBHKWTOGG2REAUHT564T7","short_pith_number":"pith:AAWCHLBH","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"},"canonical_sha256":"002c23ac2755a6e31b51202879f7dc9fd4cf6f9b1c1a42b6441a2200aaed3050","source":{"kind":"arxiv","id":"1804.02638","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.02638","created_at":"2026-05-18T00:18:58Z"},{"alias_kind":"arxiv_version","alias_value":"1804.02638v1","created_at":"2026-05-18T00:18:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02638","created_at":"2026-05-18T00:18:58Z"},{"alias_kind":"pith_short_12","alias_value":"AAWCHLBHKWTO","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AAWCHLBHKWTOGG2R","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AAWCHLBH","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AAWCHLBHKWTOGG2REAUHT564T7","target":"record","payload":{"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"},"canonical_sha256":"002c23ac2755a6e31b51202879f7dc9fd4cf6f9b1c1a42b6441a2200aaed3050","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"},"source_kind":"arxiv","source_id":"1804.02638","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-18T00:18:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DkQ2Vf3sIml0P29HjaDDXsIt+Jk+VYhm1//ld519ZH1ynticuMr0OYNMRknZNwBpoQhRG12wsqTWykx6kP+pDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:14:27.165844Z"},"content_sha256":"ccdd40bcdd53a27a0eca8c278f19d842006cce513da9af3b7133f6dda59c8cb5","schema_version":"1.0","event_id":"sha256:ccdd40bcdd53a27a0eca8c278f19d842006cce513da9af3b7133f6dda59c8cb5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AAWCHLBHKWTOGG2REAUHT564T7","target":"graph","payload":{"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"},"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-18T00:18:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lhUzsphfHf0u5I9b1LN+AGzWPPTeChP8PrZU/twiuwhQWtfJ7Mpw8uKeoFNSf0To9YnxVxwnCl8LrM4kelRlBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:14:27.166200Z"},"content_sha256":"95dbf0c181449ad8e9a4a74ea50e0ebc469009b0581c481bab9fce8caf8083c7","schema_version":"1.0","event_id":"sha256:95dbf0c181449ad8e9a4a74ea50e0ebc469009b0581c481bab9fce8caf8083c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AAWCHLBHKWTOGG2REAUHT564T7/bundle.json","state_url":"https://pith.science/pith/AAWCHLBHKWTOGG2REAUHT564T7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AAWCHLBHKWTOGG2REAUHT564T7/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-31T18:14:27Z","links":{"resolver":"https://pith.science/pith/AAWCHLBHKWTOGG2REAUHT564T7","bundle":"https://pith.science/pith/AAWCHLBHKWTOGG2REAUHT564T7/bundle.json","state":"https://pith.science/pith/AAWCHLBHKWTOGG2REAUHT564T7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AAWCHLBHKWTOGG2REAUHT564T7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AAWCHLBHKWTOGG2REAUHT564T7","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":"df3cf1ad5112c77aeaf608612e43250351f19a8ecff6a7578e8894a9ee330802","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-08T07:19:55Z","title_canon_sha256":"505a3f5d65bbf08b99ec30fe5d6e58afd854677bbb6afe11e65e36d512cf936f"},"schema_version":"1.0","source":{"id":"1804.02638","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.02638","created_at":"2026-05-18T00:18:58Z"},{"alias_kind":"arxiv_version","alias_value":"1804.02638v1","created_at":"2026-05-18T00:18:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02638","created_at":"2026-05-18T00:18:58Z"},{"alias_kind":"pith_short_12","alias_value":"AAWCHLBHKWTO","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AAWCHLBHKWTOGG2R","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AAWCHLBH","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:95dbf0c181449ad8e9a4a74ea50e0ebc469009b0581c481bab9fce8caf8083c7","target":"graph","created_at":"2026-05-18T00:18:58Z","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":"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","authors_text":"Mark Milam, Simon Korman, Stefano Soatto","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-08T07:19:55Z","title":"OATM: Occlusion Aware Template Matching by Consensus Set Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02638","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:ccdd40bcdd53a27a0eca8c278f19d842006cce513da9af3b7133f6dda59c8cb5","target":"record","created_at":"2026-05-18T00:18:58Z","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":"df3cf1ad5112c77aeaf608612e43250351f19a8ecff6a7578e8894a9ee330802","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-08T07:19:55Z","title_canon_sha256":"505a3f5d65bbf08b99ec30fe5d6e58afd854677bbb6afe11e65e36d512cf936f"},"schema_version":"1.0","source":{"id":"1804.02638","kind":"arxiv","version":1}},"canonical_sha256":"002c23ac2755a6e31b51202879f7dc9fd4cf6f9b1c1a42b6441a2200aaed3050","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"002c23ac2755a6e31b51202879f7dc9fd4cf6f9b1c1a42b6441a2200aaed3050","first_computed_at":"2026-05-18T00:18:58.877182Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:58.877182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xTLsMzghPptuBEL3PLCIifwOOYVbz8yS8ObZjXzuo/mdjOzSgTBMnKSQoXaftuuUPkMKMtyoUKKwcMsZv4URCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:58.877673Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.02638","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ccdd40bcdd53a27a0eca8c278f19d842006cce513da9af3b7133f6dda59c8cb5","sha256:95dbf0c181449ad8e9a4a74ea50e0ebc469009b0581c481bab9fce8caf8083c7"],"state_sha256":"e21c2acd18e7bf7c006afee48309cd416ea7915b5891fafb7b4a32aa9a7c2b05"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vxfhe5hVVuNyWX8VUF236HJa16l7b6aRzugi1tJdzoGpZcsfMpxiQg2efH/C3bxDRokejzcEAXruL9ogigDpAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:14:27.168702Z","bundle_sha256":"76b0215c8e05905265d6f1ee87c7d7fcaa900b23ca91796f17d4a3ea28b14ea3"}}