{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:EMDONMNJ7YF4NW2UZXZT4JQYLK","short_pith_number":"pith:EMDONMNJ","schema_version":"1.0","canonical_sha256":"2306e6b1a9fe0bc6db54cdf33e26185aa9a4b4a3281d48055a464f562646775a","source":{"kind":"arxiv","id":"1107.2085","version":1},"attestation_state":"computed","paper":{"title":"Kunchenko's Polynomials for Template Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Oleg Chertov, Taras Slipets","submitted_at":"2011-07-11T18:44:17Z","abstract_excerpt":"This paper reviews Kunchenko's polynomials using as template matching method to recognize template in one-dimensional input signal. Kunchenko's polynomials method is compared with classical methods - cross-correlation and sum of squared differences according to numerical statistical example."},"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":"1107.2085","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2011-07-11T18:44:17Z","cross_cats_sorted":[],"title_canon_sha256":"8fc1a04cb5f7195125b9c7300f69ce896ab69783e3df52c9a7ecb03a00d3ba31","abstract_canon_sha256":"9583e3a975b05978d8de90bab82db924c459b20297bfa7e27d62e1a3ebed843c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:33.533602Z","signature_b64":"ECtE0MwFwtaAos7T6ro+EK0sWIsd4D72DL9jp6iUJgVtWQ2pYGJ60viF7wZoXU4THGswRw5pezibBLVIvzwYAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2306e6b1a9fe0bc6db54cdf33e26185aa9a4b4a3281d48055a464f562646775a","last_reissued_at":"2026-05-18T04:18:33.532985Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:33.532985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Kunchenko's Polynomials for Template Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Oleg Chertov, Taras Slipets","submitted_at":"2011-07-11T18:44:17Z","abstract_excerpt":"This paper reviews Kunchenko's polynomials using as template matching method to recognize template in one-dimensional input signal. Kunchenko's polynomials method is compared with classical methods - cross-correlation and sum of squared differences according to numerical statistical example."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2085","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":"1107.2085","created_at":"2026-05-18T04:18:33.533067+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.2085v1","created_at":"2026-05-18T04:18:33.533067+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2085","created_at":"2026-05-18T04:18:33.533067+00:00"},{"alias_kind":"pith_short_12","alias_value":"EMDONMNJ7YF4","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"EMDONMNJ7YF4NW2U","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"EMDONMNJ","created_at":"2026-05-18T12:26:28.662955+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.23419","citing_title":"Generalized Stochastic Approximation of the Log-Likelihood Ratio for Robust Sequential Change-Point Detection","ref_index":36,"is_internal_anchor":true},{"citing_arxiv_id":"2605.22354","citing_title":"From Volterra Series to Kunchenko Stochastic Polynomials: Half a Century of Non-Gaussian Estimation Methodology","ref_index":93,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EMDONMNJ7YF4NW2UZXZT4JQYLK","json":"https://pith.science/pith/EMDONMNJ7YF4NW2UZXZT4JQYLK.json","graph_json":"https://pith.science/api/pith-number/EMDONMNJ7YF4NW2UZXZT4JQYLK/graph.json","events_json":"https://pith.science/api/pith-number/EMDONMNJ7YF4NW2UZXZT4JQYLK/events.json","paper":"https://pith.science/paper/EMDONMNJ"},"agent_actions":{"view_html":"https://pith.science/pith/EMDONMNJ7YF4NW2UZXZT4JQYLK","download_json":"https://pith.science/pith/EMDONMNJ7YF4NW2UZXZT4JQYLK.json","view_paper":"https://pith.science/paper/EMDONMNJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.2085&json=true","fetch_graph":"https://pith.science/api/pith-number/EMDONMNJ7YF4NW2UZXZT4JQYLK/graph.json","fetch_events":"https://pith.science/api/pith-number/EMDONMNJ7YF4NW2UZXZT4JQYLK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EMDONMNJ7YF4NW2UZXZT4JQYLK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EMDONMNJ7YF4NW2UZXZT4JQYLK/action/storage_attestation","attest_author":"https://pith.science/pith/EMDONMNJ7YF4NW2UZXZT4JQYLK/action/author_attestation","sign_citation":"https://pith.science/pith/EMDONMNJ7YF4NW2UZXZT4JQYLK/action/citation_signature","submit_replication":"https://pith.science/pith/EMDONMNJ7YF4NW2UZXZT4JQYLK/action/replication_record"}},"created_at":"2026-05-18T04:18:33.533067+00:00","updated_at":"2026-05-18T04:18:33.533067+00:00"}