{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:JJQFTUY3IGUGHHIZCXS7R7I7PP","short_pith_number":"pith:JJQFTUY3","schema_version":"1.0","canonical_sha256":"4a6059d31b41a8639d1915e5f8fd1f7bfbe832ff86f1a29fd22ea63c8e863177","source":{"kind":"arxiv","id":"1208.4405","version":2},"attestation_state":"computed","paper":{"title":"Delay-Doppler Channel Estimation with Almost Linear Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NT","math.RT"],"primary_cat":"cs.IT","authors_text":"Akbar Sayeed, Alexander Fish, Oded Schwartz, Ronny Hadani, Shamgar Gurevich","submitted_at":"2012-08-22T00:10:18Z","abstract_excerpt":"A fundamental task in wireless communication is Channel Estimation: Compute the channel parameters a signal undergoes while traveling from a transmitter to a receiver. In the case of delay-Doppler channel, a widely used method is the Matched Filter algorithm. It uses a pseudo-random sequence of length N, and, in case of non-trivial relative velocity between transmitter and receiver, its computational complexity is O(N^{2}log(N)). In this paper we introduce a novel approach of designing sequences that allow faster channel estimation. Using group representation techniques we construct sequences,"},"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":"1208.4405","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-22T00:10:18Z","cross_cats_sorted":["math.IT","math.NT","math.RT"],"title_canon_sha256":"e79c0a2fb9f3a540401d9588a9cf5d3aec430724b3d53cc02e1a85d8df5256ec","abstract_canon_sha256":"17f793616c21a6a38c56c98a8a2ad9a84a88fc700c3c25d5ab0b5bcbb652d38b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:00.805439Z","signature_b64":"v979jEAqfqiRMN5JeB+Ntbhj4267MJFYiJEQQbS5HtDTIOz6OAxmNM1m6TvTdUwkvxUSNbcowfUqu89IfwOtBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a6059d31b41a8639d1915e5f8fd1f7bfbe832ff86f1a29fd22ea63c8e863177","last_reissued_at":"2026-05-18T02:21:00.804919Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:00.804919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Delay-Doppler Channel Estimation with Almost Linear Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.NT","math.RT"],"primary_cat":"cs.IT","authors_text":"Akbar Sayeed, Alexander Fish, Oded Schwartz, Ronny Hadani, Shamgar Gurevich","submitted_at":"2012-08-22T00:10:18Z","abstract_excerpt":"A fundamental task in wireless communication is Channel Estimation: Compute the channel parameters a signal undergoes while traveling from a transmitter to a receiver. In the case of delay-Doppler channel, a widely used method is the Matched Filter algorithm. It uses a pseudo-random sequence of length N, and, in case of non-trivial relative velocity between transmitter and receiver, its computational complexity is O(N^{2}log(N)). In this paper we introduce a novel approach of designing sequences that allow faster channel estimation. Using group representation techniques we construct sequences,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.4405","kind":"arxiv","version":2},"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":"1208.4405","created_at":"2026-05-18T02:21:00.804989+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.4405v2","created_at":"2026-05-18T02:21:00.804989+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.4405","created_at":"2026-05-18T02:21:00.804989+00:00"},{"alias_kind":"pith_short_12","alias_value":"JJQFTUY3IGUG","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"JJQFTUY3IGUGHHIZ","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"JJQFTUY3","created_at":"2026-05-18T12:27:11.947152+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/JJQFTUY3IGUGHHIZCXS7R7I7PP","json":"https://pith.science/pith/JJQFTUY3IGUGHHIZCXS7R7I7PP.json","graph_json":"https://pith.science/api/pith-number/JJQFTUY3IGUGHHIZCXS7R7I7PP/graph.json","events_json":"https://pith.science/api/pith-number/JJQFTUY3IGUGHHIZCXS7R7I7PP/events.json","paper":"https://pith.science/paper/JJQFTUY3"},"agent_actions":{"view_html":"https://pith.science/pith/JJQFTUY3IGUGHHIZCXS7R7I7PP","download_json":"https://pith.science/pith/JJQFTUY3IGUGHHIZCXS7R7I7PP.json","view_paper":"https://pith.science/paper/JJQFTUY3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.4405&json=true","fetch_graph":"https://pith.science/api/pith-number/JJQFTUY3IGUGHHIZCXS7R7I7PP/graph.json","fetch_events":"https://pith.science/api/pith-number/JJQFTUY3IGUGHHIZCXS7R7I7PP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JJQFTUY3IGUGHHIZCXS7R7I7PP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JJQFTUY3IGUGHHIZCXS7R7I7PP/action/storage_attestation","attest_author":"https://pith.science/pith/JJQFTUY3IGUGHHIZCXS7R7I7PP/action/author_attestation","sign_citation":"https://pith.science/pith/JJQFTUY3IGUGHHIZCXS7R7I7PP/action/citation_signature","submit_replication":"https://pith.science/pith/JJQFTUY3IGUGHHIZCXS7R7I7PP/action/replication_record"}},"created_at":"2026-05-18T02:21:00.804989+00:00","updated_at":"2026-05-18T02:21:00.804989+00:00"}