{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:X7TL73QV5N4CGTUK2KTE3KPBYP","short_pith_number":"pith:X7TL73QV","canonical_record":{"source":{"id":"1210.5292","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-19T01:43:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e41160397f45fd9f759d1caae084ed1f871b3161b368e947d865baef78caaa91","abstract_canon_sha256":"cc3c1a43a2533b7ae2f6ccf867874343be015558fe337283ae32097c3508803a"},"schema_version":"1.0"},"canonical_sha256":"bfe6bfee15eb78234e8ad2a64da9e1c3f655fb499440c158b5d143a10c330092","source":{"kind":"arxiv","id":"1210.5292","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.5292","created_at":"2026-05-18T02:51:49Z"},{"alias_kind":"arxiv_version","alias_value":"1210.5292v2","created_at":"2026-05-18T02:51:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.5292","created_at":"2026-05-18T02:51:49Z"},{"alias_kind":"pith_short_12","alias_value":"X7TL73QV5N4C","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"X7TL73QV5N4CGTUK","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"X7TL73QV","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:X7TL73QV5N4CGTUK2KTE3KPBYP","target":"record","payload":{"canonical_record":{"source":{"id":"1210.5292","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-19T01:43:48Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e41160397f45fd9f759d1caae084ed1f871b3161b368e947d865baef78caaa91","abstract_canon_sha256":"cc3c1a43a2533b7ae2f6ccf867874343be015558fe337283ae32097c3508803a"},"schema_version":"1.0"},"canonical_sha256":"bfe6bfee15eb78234e8ad2a64da9e1c3f655fb499440c158b5d143a10c330092","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:49.737771Z","signature_b64":"dLWdAOcIstMuupBkMwH1Q/olbWXt45msDAFA2q2A8E+jFIH9DhDRHxEAemgKlLx+eev50UAYu0oL/i25fXvoDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfe6bfee15eb78234e8ad2a64da9e1c3f655fb499440c158b5d143a10c330092","last_reissued_at":"2026-05-18T02:51:49.733607Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:49.733607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1210.5292","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:51:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tOpxcKiu8RuP9bMGZ8sLTJGMsaqlmhsC5ggiusn7vLH5eF6ISTvQAIRZ+1DuZJ+ys8u1U3x+8mLuYKcZJ+t2Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:20:47.377612Z"},"content_sha256":"e274239bc4a65483d7802011eac4a61b1b78a97f89dd7f2f2e65bf00649f293a","schema_version":"1.0","event_id":"sha256:e274239bc4a65483d7802011eac4a61b1b78a97f89dd7f2f2e65bf00649f293a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:X7TL73QV5N4CGTUK2KTE3KPBYP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-Complexity Demodulation for Interleaved OFDMA Downlink System Using Circular Convolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dong-Joon Shin, Hyun-Seung Joo, Jong-Seon No, Kee-Hoon Kim","submitted_at":"2012-10-19T01:43:48Z","abstract_excerpt":"In this paper, a new low-complexity demodulation scheme is proposed for interleaved orthogonal frequency division multiple access (OFDMA) downlink system with N subcarriers and M users using circular convolution. In the proposed scheme, each user's signal is extracted from the received interleaved OFDMA signal of M users by using circular convolution in the time domain and then fast Fourier transformed in the reduced size N over M. It is shown that the computational complexity of the proposed scheme for the interleaved OFDMA downlink system is much less than that of the conventional one."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.5292","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:51:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jl88unl7rcI3ucQzrw3+Ch6N4gY07P/6E89PvLA/WukakF04AaU5j6SR5bkGgy2wkKJmd5KF/UC6yzRM5d4fDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:20:47.378201Z"},"content_sha256":"de923888fa373fbfec74dbeabdb1ff31d3e5005599feebea31579a3783f97a47","schema_version":"1.0","event_id":"sha256:de923888fa373fbfec74dbeabdb1ff31d3e5005599feebea31579a3783f97a47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X7TL73QV5N4CGTUK2KTE3KPBYP/bundle.json","state_url":"https://pith.science/pith/X7TL73QV5N4CGTUK2KTE3KPBYP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X7TL73QV5N4CGTUK2KTE3KPBYP/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-07T17:20:47Z","links":{"resolver":"https://pith.science/pith/X7TL73QV5N4CGTUK2KTE3KPBYP","bundle":"https://pith.science/pith/X7TL73QV5N4CGTUK2KTE3KPBYP/bundle.json","state":"https://pith.science/pith/X7TL73QV5N4CGTUK2KTE3KPBYP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X7TL73QV5N4CGTUK2KTE3KPBYP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:X7TL73QV5N4CGTUK2KTE3KPBYP","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":"cc3c1a43a2533b7ae2f6ccf867874343be015558fe337283ae32097c3508803a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-19T01:43:48Z","title_canon_sha256":"e41160397f45fd9f759d1caae084ed1f871b3161b368e947d865baef78caaa91"},"schema_version":"1.0","source":{"id":"1210.5292","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.5292","created_at":"2026-05-18T02:51:49Z"},{"alias_kind":"arxiv_version","alias_value":"1210.5292v2","created_at":"2026-05-18T02:51:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.5292","created_at":"2026-05-18T02:51:49Z"},{"alias_kind":"pith_short_12","alias_value":"X7TL73QV5N4C","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"X7TL73QV5N4CGTUK","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"X7TL73QV","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:de923888fa373fbfec74dbeabdb1ff31d3e5005599feebea31579a3783f97a47","target":"graph","created_at":"2026-05-18T02:51:49Z","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":"In this paper, a new low-complexity demodulation scheme is proposed for interleaved orthogonal frequency division multiple access (OFDMA) downlink system with N subcarriers and M users using circular convolution. In the proposed scheme, each user's signal is extracted from the received interleaved OFDMA signal of M users by using circular convolution in the time domain and then fast Fourier transformed in the reduced size N over M. It is shown that the computational complexity of the proposed scheme for the interleaved OFDMA downlink system is much less than that of the conventional one.","authors_text":"Dong-Joon Shin, Hyun-Seung Joo, Jong-Seon No, Kee-Hoon Kim","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-19T01:43:48Z","title":"Low-Complexity Demodulation for Interleaved OFDMA Downlink System Using Circular Convolution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.5292","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:e274239bc4a65483d7802011eac4a61b1b78a97f89dd7f2f2e65bf00649f293a","target":"record","created_at":"2026-05-18T02:51:49Z","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":"cc3c1a43a2533b7ae2f6ccf867874343be015558fe337283ae32097c3508803a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-19T01:43:48Z","title_canon_sha256":"e41160397f45fd9f759d1caae084ed1f871b3161b368e947d865baef78caaa91"},"schema_version":"1.0","source":{"id":"1210.5292","kind":"arxiv","version":2}},"canonical_sha256":"bfe6bfee15eb78234e8ad2a64da9e1c3f655fb499440c158b5d143a10c330092","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bfe6bfee15eb78234e8ad2a64da9e1c3f655fb499440c158b5d143a10c330092","first_computed_at":"2026-05-18T02:51:49.733607Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:49.733607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dLWdAOcIstMuupBkMwH1Q/olbWXt45msDAFA2q2A8E+jFIH9DhDRHxEAemgKlLx+eev50UAYu0oL/i25fXvoDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:49.737771Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.5292","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e274239bc4a65483d7802011eac4a61b1b78a97f89dd7f2f2e65bf00649f293a","sha256:de923888fa373fbfec74dbeabdb1ff31d3e5005599feebea31579a3783f97a47"],"state_sha256":"fc0bbb7ba0076e057b2ba7b10e6cd8472d0a144471aaf089e6310a159315d57c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eAs1uULMgqjtWsQ/xKUeLP5A38pXwz9wRSc2/duN/bXSUARW/ER24flu0x4/iB4+MCSpm/nQhurKTMxKOzWiCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T17:20:47.381276Z","bundle_sha256":"ff394c26c5f76da4a8844df0853cebde3851df8ff5f73c7e75cd26e7eb2a7c80"}}