{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FCBM66P762N2TNNY7HPSPIEJRX","short_pith_number":"pith:FCBM66P7","canonical_record":{"source":{"id":"1509.04863","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-16T09:38:29Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"c3709f59720591ac127b512187f2dcbc0606fade7f06e182bb79558f8ede1872","abstract_canon_sha256":"3e4a412ea02d42a205e17523aa7985c3ba2fea1792850c05460f599c819a993a"},"schema_version":"1.0"},"canonical_sha256":"2882cf79fff69ba9b5b8f9df27a0898dcdd7b477aba12788dc280200b03d6409","source":{"kind":"arxiv","id":"1509.04863","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.04863","created_at":"2026-05-18T01:32:51Z"},{"alias_kind":"arxiv_version","alias_value":"1509.04863v1","created_at":"2026-05-18T01:32:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04863","created_at":"2026-05-18T01:32:51Z"},{"alias_kind":"pith_short_12","alias_value":"FCBM66P762N2","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FCBM66P762N2TNNY","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FCBM66P7","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FCBM66P762N2TNNY7HPSPIEJRX","target":"record","payload":{"canonical_record":{"source":{"id":"1509.04863","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-16T09:38:29Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"c3709f59720591ac127b512187f2dcbc0606fade7f06e182bb79558f8ede1872","abstract_canon_sha256":"3e4a412ea02d42a205e17523aa7985c3ba2fea1792850c05460f599c819a993a"},"schema_version":"1.0"},"canonical_sha256":"2882cf79fff69ba9b5b8f9df27a0898dcdd7b477aba12788dc280200b03d6409","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:51.459468Z","signature_b64":"YYYOWQIgCOaWx8Q0jmKxpSzkbnwiF059ym8ubRycVfcsUV9BHWJNUVriiZbyPG9NoMELR05kidaVeDfGmLU3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2882cf79fff69ba9b5b8f9df27a0898dcdd7b477aba12788dc280200b03d6409","last_reissued_at":"2026-05-18T01:32:51.459026Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:51.459026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.04863","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:32:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vTOQRO0+euPP2C3yIAUdMTj1akIwpVxefbCFK2Iqsmzn/P37Ybn7lUxWW6OnzFwUBRXU9iJGIiruKs3jEKxYBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:23:53.928474Z"},"content_sha256":"9ab98cbcbdf8af7f5c6a9e8b7f97bfda24fffa4f654a39411dfaac5393fe627c","schema_version":"1.0","event_id":"sha256:9ab98cbcbdf8af7f5c6a9e8b7f97bfda24fffa4f654a39411dfaac5393fe627c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FCBM66P762N2TNNY7HPSPIEJRX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Template Matching by Subsampled Circulant Matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.DS","authors_text":"and Soo-Chang Pei, Chun-Shien Lu, Sung-Hsien Hsieh","submitted_at":"2015-09-16T09:38:29Z","abstract_excerpt":"Template matching is widely used for many applications in image and signal processing and usually is time-critical. Traditional methods usually focus on how to reduce the search locations by coarse-to-fine strategy or full search combined with pruning strategy. However, the computation cost of those methods is easily dominated by the size of signal N instead of that of template K. This paper proposes a probabilistic and fast matching scheme, which computation costs requires O(N) additions and O(K \\log K) multiplications, based on cross-correlation. The nuclear idea is to first downsample signa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04863","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:32:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o48BuWvS+bYQsId5bb0wCX0CcACZNLdThj0M0i4WIXCZ0+voMsIyJQxwdPX7tTTLuuHboZ7rkhP1nmhl2Mf1AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:23:53.928821Z"},"content_sha256":"4fd58b1c5db1522903de2b2902a461d3ad02fbec5e70f5e9cace19cb7c7b9edc","schema_version":"1.0","event_id":"sha256:4fd58b1c5db1522903de2b2902a461d3ad02fbec5e70f5e9cace19cb7c7b9edc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FCBM66P762N2TNNY7HPSPIEJRX/bundle.json","state_url":"https://pith.science/pith/FCBM66P762N2TNNY7HPSPIEJRX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FCBM66P762N2TNNY7HPSPIEJRX/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-06-26T13:23:53Z","links":{"resolver":"https://pith.science/pith/FCBM66P762N2TNNY7HPSPIEJRX","bundle":"https://pith.science/pith/FCBM66P762N2TNNY7HPSPIEJRX/bundle.json","state":"https://pith.science/pith/FCBM66P762N2TNNY7HPSPIEJRX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FCBM66P762N2TNNY7HPSPIEJRX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FCBM66P762N2TNNY7HPSPIEJRX","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":"3e4a412ea02d42a205e17523aa7985c3ba2fea1792850c05460f599c819a993a","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-16T09:38:29Z","title_canon_sha256":"c3709f59720591ac127b512187f2dcbc0606fade7f06e182bb79558f8ede1872"},"schema_version":"1.0","source":{"id":"1509.04863","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.04863","created_at":"2026-05-18T01:32:51Z"},{"alias_kind":"arxiv_version","alias_value":"1509.04863v1","created_at":"2026-05-18T01:32:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04863","created_at":"2026-05-18T01:32:51Z"},{"alias_kind":"pith_short_12","alias_value":"FCBM66P762N2","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FCBM66P762N2TNNY","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FCBM66P7","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:4fd58b1c5db1522903de2b2902a461d3ad02fbec5e70f5e9cace19cb7c7b9edc","target":"graph","created_at":"2026-05-18T01:32:51Z","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":"Template matching is widely used for many applications in image and signal processing and usually is time-critical. Traditional methods usually focus on how to reduce the search locations by coarse-to-fine strategy or full search combined with pruning strategy. However, the computation cost of those methods is easily dominated by the size of signal N instead of that of template K. This paper proposes a probabilistic and fast matching scheme, which computation costs requires O(N) additions and O(K \\log K) multiplications, based on cross-correlation. The nuclear idea is to first downsample signa","authors_text":"and Soo-Chang Pei, Chun-Shien Lu, Sung-Hsien Hsieh","cross_cats":["cs.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-16T09:38:29Z","title":"Fast Template Matching by Subsampled Circulant Matrix"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04863","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:9ab98cbcbdf8af7f5c6a9e8b7f97bfda24fffa4f654a39411dfaac5393fe627c","target":"record","created_at":"2026-05-18T01:32:51Z","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":"3e4a412ea02d42a205e17523aa7985c3ba2fea1792850c05460f599c819a993a","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-16T09:38:29Z","title_canon_sha256":"c3709f59720591ac127b512187f2dcbc0606fade7f06e182bb79558f8ede1872"},"schema_version":"1.0","source":{"id":"1509.04863","kind":"arxiv","version":1}},"canonical_sha256":"2882cf79fff69ba9b5b8f9df27a0898dcdd7b477aba12788dc280200b03d6409","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2882cf79fff69ba9b5b8f9df27a0898dcdd7b477aba12788dc280200b03d6409","first_computed_at":"2026-05-18T01:32:51.459026Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:51.459026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YYYOWQIgCOaWx8Q0jmKxpSzkbnwiF059ym8ubRycVfcsUV9BHWJNUVriiZbyPG9NoMELR05kidaVeDfGmLU3DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:51.459468Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.04863","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ab98cbcbdf8af7f5c6a9e8b7f97bfda24fffa4f654a39411dfaac5393fe627c","sha256:4fd58b1c5db1522903de2b2902a461d3ad02fbec5e70f5e9cace19cb7c7b9edc"],"state_sha256":"2c11aa2e4ad4d493e97915e81ba39ca3eec2afd2204227776576176ea03f661b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H1IhdYLU27H5WeWLs6jfv98Ffka9YNyE1nIWADAo6G6UGR5yn7VDxWgEo9Um8yOKcmgrviBOAZHOkhK+OKhLDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T13:23:53.930781Z","bundle_sha256":"78e84bc5eb756fd4167c0c77d2fd94c2cdfb2e4025129c051c4670ed9c4cdf23"}}