{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:JJQFTUY3IGUGHHIZCXS7R7I7PP","short_pith_number":"pith:JJQFTUY3","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"},"canonical_sha256":"4a6059d31b41a8639d1915e5f8fd1f7bfbe832ff86f1a29fd22ea63c8e863177","source":{"kind":"arxiv","id":"1208.4405","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.4405","created_at":"2026-05-18T02:21:00Z"},{"alias_kind":"arxiv_version","alias_value":"1208.4405v2","created_at":"2026-05-18T02:21:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.4405","created_at":"2026-05-18T02:21:00Z"},{"alias_kind":"pith_short_12","alias_value":"JJQFTUY3IGUG","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JJQFTUY3IGUGHHIZ","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JJQFTUY3","created_at":"2026-05-18T12:27:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:JJQFTUY3IGUGHHIZCXS7R7I7PP","target":"record","payload":{"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"},"canonical_sha256":"4a6059d31b41a8639d1915e5f8fd1f7bfbe832ff86f1a29fd22ea63c8e863177","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"},"source_kind":"arxiv","source_id":"1208.4405","source_version":2,"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-18T02:21:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OE6tejkJPLf5mjslho/zDahXP8YUfp2GwrbaTxNxhlRRlCRUGMQOZcOh941QRzW/vVyeFq3gSucHdI2svx4XAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T14:32:28.620325Z"},"content_sha256":"100a8b065bb2229157660681caa02db4a4cb3cdc6eeb74c897b2388ac6399091","schema_version":"1.0","event_id":"sha256:100a8b065bb2229157660681caa02db4a4cb3cdc6eeb74c897b2388ac6399091"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:JJQFTUY3IGUGHHIZCXS7R7I7PP","target":"graph","payload":{"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"},"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-18T02:21:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5ZAr4f2Bl5OlwTcvQiXKP/7of2S8up2sj21B1h0Pt170MH4UsqElKEXHz0Z9KbKADqiokg6ZOo4wkcv/ZzVsDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T14:32:28.620705Z"},"content_sha256":"2a58ab7b95867eaa17499ff817804968f48f0f09b06b44e2cfc3b99e96fe327e","schema_version":"1.0","event_id":"sha256:2a58ab7b95867eaa17499ff817804968f48f0f09b06b44e2cfc3b99e96fe327e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JJQFTUY3IGUGHHIZCXS7R7I7PP/bundle.json","state_url":"https://pith.science/pith/JJQFTUY3IGUGHHIZCXS7R7I7PP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JJQFTUY3IGUGHHIZCXS7R7I7PP/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-04T14:32:28Z","links":{"resolver":"https://pith.science/pith/JJQFTUY3IGUGHHIZCXS7R7I7PP","bundle":"https://pith.science/pith/JJQFTUY3IGUGHHIZCXS7R7I7PP/bundle.json","state":"https://pith.science/pith/JJQFTUY3IGUGHHIZCXS7R7I7PP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JJQFTUY3IGUGHHIZCXS7R7I7PP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:JJQFTUY3IGUGHHIZCXS7R7I7PP","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":"17f793616c21a6a38c56c98a8a2ad9a84a88fc700c3c25d5ab0b5bcbb652d38b","cross_cats_sorted":["math.IT","math.NT","math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-22T00:10:18Z","title_canon_sha256":"e79c0a2fb9f3a540401d9588a9cf5d3aec430724b3d53cc02e1a85d8df5256ec"},"schema_version":"1.0","source":{"id":"1208.4405","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.4405","created_at":"2026-05-18T02:21:00Z"},{"alias_kind":"arxiv_version","alias_value":"1208.4405v2","created_at":"2026-05-18T02:21:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.4405","created_at":"2026-05-18T02:21:00Z"},{"alias_kind":"pith_short_12","alias_value":"JJQFTUY3IGUG","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_16","alias_value":"JJQFTUY3IGUGHHIZ","created_at":"2026-05-18T12:27:11Z"},{"alias_kind":"pith_short_8","alias_value":"JJQFTUY3","created_at":"2026-05-18T12:27:11Z"}],"graph_snapshots":[{"event_id":"sha256:2a58ab7b95867eaa17499ff817804968f48f0f09b06b44e2cfc3b99e96fe327e","target":"graph","created_at":"2026-05-18T02:21:00Z","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":"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,","authors_text":"Akbar Sayeed, Alexander Fish, Oded Schwartz, Ronny Hadani, Shamgar Gurevich","cross_cats":["math.IT","math.NT","math.RT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-22T00:10:18Z","title":"Delay-Doppler Channel Estimation with Almost Linear Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.4405","kind":"arxiv","version":2},"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:100a8b065bb2229157660681caa02db4a4cb3cdc6eeb74c897b2388ac6399091","target":"record","created_at":"2026-05-18T02:21:00Z","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":"17f793616c21a6a38c56c98a8a2ad9a84a88fc700c3c25d5ab0b5bcbb652d38b","cross_cats_sorted":["math.IT","math.NT","math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-08-22T00:10:18Z","title_canon_sha256":"e79c0a2fb9f3a540401d9588a9cf5d3aec430724b3d53cc02e1a85d8df5256ec"},"schema_version":"1.0","source":{"id":"1208.4405","kind":"arxiv","version":2}},"canonical_sha256":"4a6059d31b41a8639d1915e5f8fd1f7bfbe832ff86f1a29fd22ea63c8e863177","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a6059d31b41a8639d1915e5f8fd1f7bfbe832ff86f1a29fd22ea63c8e863177","first_computed_at":"2026-05-18T02:21:00.804919Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:00.804919Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v979jEAqfqiRMN5JeB+Ntbhj4267MJFYiJEQQbS5HtDTIOz6OAxmNM1m6TvTdUwkvxUSNbcowfUqu89IfwOtBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:00.805439Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.4405","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:100a8b065bb2229157660681caa02db4a4cb3cdc6eeb74c897b2388ac6399091","sha256:2a58ab7b95867eaa17499ff817804968f48f0f09b06b44e2cfc3b99e96fe327e"],"state_sha256":"7ccd2a0b9b7aee4ec77941ae882d654e91acfe956ca0859825c3cdb5a487835a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kP0gx3LBgOqlLuPt9sM5tm9DitrPGgXlBm3Qkp/M3J5e/kVi7wkcJrZEry1voVtkyuI7k0gZMWvJaSxlz2WmDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T14:32:28.623030Z","bundle_sha256":"504835f7e67b5869bbc3094eefa05b5d2503ab7ded2e12a5c40b1fce09cd7a37"}}