{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:IJ3HVJGSNTFCR6CUNV73YUNGYM","short_pith_number":"pith:IJ3HVJGS","canonical_record":{"source":{"id":"1111.3925","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2011-11-16T19:54:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"927ed945b67b0c592721ee9374aebd213d002a569f26fd9d2063d386b07c62d8","abstract_canon_sha256":"5279b6b8d953de521144b711a15c760bb5da6086f471d484cd25a4de84d67afe"},"schema_version":"1.0"},"canonical_sha256":"42767aa4d26cca28f8546d7fbc51a6c3037fb140b34f3e44652d8b588bd15212","source":{"kind":"arxiv","id":"1111.3925","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.3925","created_at":"2026-05-18T04:08:12Z"},{"alias_kind":"arxiv_version","alias_value":"1111.3925v1","created_at":"2026-05-18T04:08:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3925","created_at":"2026-05-18T04:08:12Z"},{"alias_kind":"pith_short_12","alias_value":"IJ3HVJGSNTFC","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"IJ3HVJGSNTFCR6CU","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"IJ3HVJGS","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:IJ3HVJGSNTFCR6CUNV73YUNGYM","target":"record","payload":{"canonical_record":{"source":{"id":"1111.3925","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2011-11-16T19:54:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"927ed945b67b0c592721ee9374aebd213d002a569f26fd9d2063d386b07c62d8","abstract_canon_sha256":"5279b6b8d953de521144b711a15c760bb5da6086f471d484cd25a4de84d67afe"},"schema_version":"1.0"},"canonical_sha256":"42767aa4d26cca28f8546d7fbc51a6c3037fb140b34f3e44652d8b588bd15212","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:12.851976Z","signature_b64":"mLKe/U+b/g7IV4ScDjmOq0tga1DFfm+d8WwzYz3NrPtD9xF7nvw6Pe02rDbinQFRrg5yKK3WV6ZEh0vkJ+VPBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42767aa4d26cca28f8546d7fbc51a6c3037fb140b34f3e44652d8b588bd15212","last_reissued_at":"2026-05-18T04:08:12.851453Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:12.851453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.3925","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-18T04:08:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VVDJ7Mc1cFWnCMkZMYP4PDUe6iv1PvEbXpTWdJOSAu+nvfE1tQDczQrHYdqT+nHWti2bY/Zfd91SzCt07efqAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:01:10.069535Z"},"content_sha256":"e495db4d048845068df888b0debca270dc69a49fdb8a270723b86457443c10a1","schema_version":"1.0","event_id":"sha256:e495db4d048845068df888b0debca270dc69a49fdb8a270723b86457443c10a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:IJ3HVJGSNTFCR6CUNV73YUNGYM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Low-Delay Low-Complexity EKF Design for Joint Channel and CFO Estimation in Multi-User Cognitive Communications","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cong Shen, Pengkai Zhao","submitted_at":"2011-11-16T19:54:22Z","abstract_excerpt":"Parameter estimation in cognitive communications can be formulated as a multi-user estimation problem, which is solvable under maximum likelihood solution but involves high computational complexity. This paper presents a time-sharing and interference mitigation based EKF (Extended Kalman Filter) design for joint CFO (carrier frequency offset) and channel estimation at multiple cognitive users. The key objective is to realize low implementation complexity by decomposing highdimensional parameters into multiple separate low-dimensional estimation problems, which can be solved in a time-shared ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3925","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-18T04:08:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NdRJtEffKF0J03n+Jr/RADjTqTpDP73Zak2sxuKAFLoiqu00v7oj1p5bcEOBkFPSAQDOX88qeFKdaEPAnL9zAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:01:10.070198Z"},"content_sha256":"b6bdb451ecf533adcca5ff10708021b690ed903e809c126b95da09a9492643f2","schema_version":"1.0","event_id":"sha256:b6bdb451ecf533adcca5ff10708021b690ed903e809c126b95da09a9492643f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IJ3HVJGSNTFCR6CUNV73YUNGYM/bundle.json","state_url":"https://pith.science/pith/IJ3HVJGSNTFCR6CUNV73YUNGYM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IJ3HVJGSNTFCR6CUNV73YUNGYM/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-05-25T17:01:10Z","links":{"resolver":"https://pith.science/pith/IJ3HVJGSNTFCR6CUNV73YUNGYM","bundle":"https://pith.science/pith/IJ3HVJGSNTFCR6CUNV73YUNGYM/bundle.json","state":"https://pith.science/pith/IJ3HVJGSNTFCR6CUNV73YUNGYM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IJ3HVJGSNTFCR6CUNV73YUNGYM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:IJ3HVJGSNTFCR6CUNV73YUNGYM","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":"5279b6b8d953de521144b711a15c760bb5da6086f471d484cd25a4de84d67afe","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2011-11-16T19:54:22Z","title_canon_sha256":"927ed945b67b0c592721ee9374aebd213d002a569f26fd9d2063d386b07c62d8"},"schema_version":"1.0","source":{"id":"1111.3925","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.3925","created_at":"2026-05-18T04:08:12Z"},{"alias_kind":"arxiv_version","alias_value":"1111.3925v1","created_at":"2026-05-18T04:08:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3925","created_at":"2026-05-18T04:08:12Z"},{"alias_kind":"pith_short_12","alias_value":"IJ3HVJGSNTFC","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"IJ3HVJGSNTFCR6CU","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"IJ3HVJGS","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:b6bdb451ecf533adcca5ff10708021b690ed903e809c126b95da09a9492643f2","target":"graph","created_at":"2026-05-18T04:08:12Z","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":"Parameter estimation in cognitive communications can be formulated as a multi-user estimation problem, which is solvable under maximum likelihood solution but involves high computational complexity. This paper presents a time-sharing and interference mitigation based EKF (Extended Kalman Filter) design for joint CFO (carrier frequency offset) and channel estimation at multiple cognitive users. The key objective is to realize low implementation complexity by decomposing highdimensional parameters into multiple separate low-dimensional estimation problems, which can be solved in a time-shared ma","authors_text":"Cong Shen, Pengkai Zhao","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2011-11-16T19:54:22Z","title":"A Low-Delay Low-Complexity EKF Design for Joint Channel and CFO Estimation in Multi-User Cognitive Communications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3925","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:e495db4d048845068df888b0debca270dc69a49fdb8a270723b86457443c10a1","target":"record","created_at":"2026-05-18T04:08:12Z","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":"5279b6b8d953de521144b711a15c760bb5da6086f471d484cd25a4de84d67afe","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2011-11-16T19:54:22Z","title_canon_sha256":"927ed945b67b0c592721ee9374aebd213d002a569f26fd9d2063d386b07c62d8"},"schema_version":"1.0","source":{"id":"1111.3925","kind":"arxiv","version":1}},"canonical_sha256":"42767aa4d26cca28f8546d7fbc51a6c3037fb140b34f3e44652d8b588bd15212","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42767aa4d26cca28f8546d7fbc51a6c3037fb140b34f3e44652d8b588bd15212","first_computed_at":"2026-05-18T04:08:12.851453Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:08:12.851453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mLKe/U+b/g7IV4ScDjmOq0tga1DFfm+d8WwzYz3NrPtD9xF7nvw6Pe02rDbinQFRrg5yKK3WV6ZEh0vkJ+VPBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:08:12.851976Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.3925","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e495db4d048845068df888b0debca270dc69a49fdb8a270723b86457443c10a1","sha256:b6bdb451ecf533adcca5ff10708021b690ed903e809c126b95da09a9492643f2"],"state_sha256":"0b58ad93b7f9210e5349246d8778786ce141bcac40759c6b86b37af2367ab5d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oIV4cNU484erxsCXdMCnxA0Z3XUsNiHwxCrrA1dg9rpBPYA/FlG1xKOORQmPIWatB3iOO8ZB42b0hjmiA/0UBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:01:10.074122Z","bundle_sha256":"65e9978bdf83844dfebdd6a22080784d8ecee652082bd882422906c7cf8fd2eb"}}