{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:7VAD5ANCL6LXX2L7RLHTQYO7M6","short_pith_number":"pith:7VAD5ANC","schema_version":"1.0","canonical_sha256":"fd403e81a25f977be97f8acf3861df67b907d0a04d463c20adaa6e8585a588a4","source":{"kind":"arxiv","id":"1112.4883","version":1},"attestation_state":"computed","paper":{"title":"Computing the Matched Filter in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Akbar Sayeed, Alexander Fish, Oded Schwartz, Ronny Hadani, Shamgar Gurevich","submitted_at":"2011-12-20T23:28:18Z","abstract_excerpt":"A fundamental problem in wireless communication is the time-frequency shift (TFS) problem: Find the time-frequency shift of a signal in a noisy environment. The shift is the result of time asynchronization of a sender with a receiver, and of non-zero speed of a sender with respect to a receiver. A classical solution of a discrete analog of the TFS problem is called the matched filter algorithm. It uses a pseudo-random waveform S(t) of the length p, and its arithmetic complexity is O(p^{2} \\cdot log (p)), using fast Fourier transform. In these notes we introduce a novel approach of designing ne"},"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":"1112.4883","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-20T23:28:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"90460c4bbfd902292ec758fdc79f8c867524bc42249d5a7779f888141e2968e3","abstract_canon_sha256":"22d05dbecdc197c4ffcc17f431a894b15664fb11f05d56fe6486ecb59bac6569"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:56.988679Z","signature_b64":"06X6N7PyAe9bS/Fo3TScq17ZAWxZDAuqKwRsM8IoAhhRpotKeBrZZlCKOS9pB/vIm9rED4TIX9mmbbZQcXQUAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd403e81a25f977be97f8acf3861df67b907d0a04d463c20adaa6e8585a588a4","last_reissued_at":"2026-05-18T04:05:56.988018Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:56.988018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the Matched Filter in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Akbar Sayeed, Alexander Fish, Oded Schwartz, Ronny Hadani, Shamgar Gurevich","submitted_at":"2011-12-20T23:28:18Z","abstract_excerpt":"A fundamental problem in wireless communication is the time-frequency shift (TFS) problem: Find the time-frequency shift of a signal in a noisy environment. The shift is the result of time asynchronization of a sender with a receiver, and of non-zero speed of a sender with respect to a receiver. A classical solution of a discrete analog of the TFS problem is called the matched filter algorithm. It uses a pseudo-random waveform S(t) of the length p, and its arithmetic complexity is O(p^{2} \\cdot log (p)), using fast Fourier transform. In these notes we introduce a novel approach of designing ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.4883","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":"1112.4883","created_at":"2026-05-18T04:05:56.988103+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.4883v1","created_at":"2026-05-18T04:05:56.988103+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.4883","created_at":"2026-05-18T04:05:56.988103+00:00"},{"alias_kind":"pith_short_12","alias_value":"7VAD5ANCL6LX","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"7VAD5ANCL6LXX2L7","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"7VAD5ANC","created_at":"2026-05-18T12:26:22.705136+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/7VAD5ANCL6LXX2L7RLHTQYO7M6","json":"https://pith.science/pith/7VAD5ANCL6LXX2L7RLHTQYO7M6.json","graph_json":"https://pith.science/api/pith-number/7VAD5ANCL6LXX2L7RLHTQYO7M6/graph.json","events_json":"https://pith.science/api/pith-number/7VAD5ANCL6LXX2L7RLHTQYO7M6/events.json","paper":"https://pith.science/paper/7VAD5ANC"},"agent_actions":{"view_html":"https://pith.science/pith/7VAD5ANCL6LXX2L7RLHTQYO7M6","download_json":"https://pith.science/pith/7VAD5ANCL6LXX2L7RLHTQYO7M6.json","view_paper":"https://pith.science/paper/7VAD5ANC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.4883&json=true","fetch_graph":"https://pith.science/api/pith-number/7VAD5ANCL6LXX2L7RLHTQYO7M6/graph.json","fetch_events":"https://pith.science/api/pith-number/7VAD5ANCL6LXX2L7RLHTQYO7M6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7VAD5ANCL6LXX2L7RLHTQYO7M6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7VAD5ANCL6LXX2L7RLHTQYO7M6/action/storage_attestation","attest_author":"https://pith.science/pith/7VAD5ANCL6LXX2L7RLHTQYO7M6/action/author_attestation","sign_citation":"https://pith.science/pith/7VAD5ANCL6LXX2L7RLHTQYO7M6/action/citation_signature","submit_replication":"https://pith.science/pith/7VAD5ANCL6LXX2L7RLHTQYO7M6/action/replication_record"}},"created_at":"2026-05-18T04:05:56.988103+00:00","updated_at":"2026-05-18T04:05:56.988103+00:00"}