{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:KIFND36LX7GXYVB76DMYCOMHBC","short_pith_number":"pith:KIFND36L","canonical_record":{"source":{"id":"1403.3759","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-15T06:23:28Z","cross_cats_sorted":["cs.AR","cs.DC","math.IT"],"title_canon_sha256":"5bcaf1693d9b9e4a5809bcb626865aefff71aebfa6f45ad0e1a887869942466e","abstract_canon_sha256":"fa5289fcc8aa24bd3b6aa35dea6d6254c2438d4941beee1b0d40e5030d9aaf2c"},"schema_version":"1.0"},"canonical_sha256":"520ad1efcbbfcd7c543ff0d981398708b944dad17fd4aebf022a7cdace288245","source":{"kind":"arxiv","id":"1403.3759","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.3759","created_at":"2026-05-18T02:55:29Z"},{"alias_kind":"arxiv_version","alias_value":"1403.3759v3","created_at":"2026-05-18T02:55:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3759","created_at":"2026-05-18T02:55:29Z"},{"alias_kind":"pith_short_12","alias_value":"KIFND36LX7GX","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KIFND36LX7GXYVB7","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KIFND36L","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:KIFND36LX7GXYVB76DMYCOMHBC","target":"record","payload":{"canonical_record":{"source":{"id":"1403.3759","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-15T06:23:28Z","cross_cats_sorted":["cs.AR","cs.DC","math.IT"],"title_canon_sha256":"5bcaf1693d9b9e4a5809bcb626865aefff71aebfa6f45ad0e1a887869942466e","abstract_canon_sha256":"fa5289fcc8aa24bd3b6aa35dea6d6254c2438d4941beee1b0d40e5030d9aaf2c"},"schema_version":"1.0"},"canonical_sha256":"520ad1efcbbfcd7c543ff0d981398708b944dad17fd4aebf022a7cdace288245","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:29.925196Z","signature_b64":"YGXwo008Htzw80mzrMtIIno2KnNBLPPdNLhJsB1Qlq+2u8nhtH98rVa4qkUO93/Am1aEE3hWJkWWOt3k9vUtBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"520ad1efcbbfcd7c543ff0d981398708b944dad17fd4aebf022a7cdace288245","last_reissued_at":"2026-05-18T02:55:29.924631Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:29.924631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.3759","source_version":3,"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:55:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xC3eOsoICiuVCIbV2VIh3whzKbKsbx0+Blb/RsLUQRFpSBVUWQNH9zcSnJqfQXxR5CsIIfILQBqbaL0MOuN3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T02:45:55.609655Z"},"content_sha256":"44ebb5669f03ce70b3abe0d28a64e5451c9f5561a1ac705fd2f05f8d8faa9a09","schema_version":"1.0","event_id":"sha256:44ebb5669f03ce70b3abe0d28a64e5451c9f5561a1ac705fd2f05f8d8faa9a09"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:KIFND36LX7GXYVB76DMYCOMHBC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Interleaver Design for a High Throughput HSPA+/LTE Multi-Standard Turbo Decoder","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR","cs.DC","math.IT"],"primary_cat":"cs.IT","authors_text":"Aida Vosoughi, Guohui Wang, Hao Shen, Joseph R. Cavallaro, Yang Sun, Yuanbin Guo","submitted_at":"2014-03-15T06:23:28Z","abstract_excerpt":"To meet the evolving data rate requirements of emerging wireless communication technologies, many parallel architectures have been proposed to implement high throughput turbo decoders. However, concurrent memory reading/writing in parallel turbo decoding architectures leads to severe memory conflict problem, which has become a major bottleneck for high throughput turbo decoders. In this paper, we propose a flexible and efficient VLSI architecture to solve the memory conflict problem for highly parallel turbo decoders targeting multi-standard 3G/4G wireless communication systems. To demonstrate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.3759","kind":"arxiv","version":3},"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:55:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lUqPursj+JpM48HjuHvD9/260Dni43R1dGVMJi9mkL9PgaDr78bzF7Dl5c+XntHRsX1L3JJqEHIm1eN0LCAjAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T02:45:55.610008Z"},"content_sha256":"70f9f476b819a133e213b1ebec62ddf068cd221e38c21f36b2e330d3d85d7a1f","schema_version":"1.0","event_id":"sha256:70f9f476b819a133e213b1ebec62ddf068cd221e38c21f36b2e330d3d85d7a1f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KIFND36LX7GXYVB76DMYCOMHBC/bundle.json","state_url":"https://pith.science/pith/KIFND36LX7GXYVB76DMYCOMHBC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KIFND36LX7GXYVB76DMYCOMHBC/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-20T02:45:55Z","links":{"resolver":"https://pith.science/pith/KIFND36LX7GXYVB76DMYCOMHBC","bundle":"https://pith.science/pith/KIFND36LX7GXYVB76DMYCOMHBC/bundle.json","state":"https://pith.science/pith/KIFND36LX7GXYVB76DMYCOMHBC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KIFND36LX7GXYVB76DMYCOMHBC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KIFND36LX7GXYVB76DMYCOMHBC","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":"fa5289fcc8aa24bd3b6aa35dea6d6254c2438d4941beee1b0d40e5030d9aaf2c","cross_cats_sorted":["cs.AR","cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-15T06:23:28Z","title_canon_sha256":"5bcaf1693d9b9e4a5809bcb626865aefff71aebfa6f45ad0e1a887869942466e"},"schema_version":"1.0","source":{"id":"1403.3759","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.3759","created_at":"2026-05-18T02:55:29Z"},{"alias_kind":"arxiv_version","alias_value":"1403.3759v3","created_at":"2026-05-18T02:55:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.3759","created_at":"2026-05-18T02:55:29Z"},{"alias_kind":"pith_short_12","alias_value":"KIFND36LX7GX","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KIFND36LX7GXYVB7","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KIFND36L","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:70f9f476b819a133e213b1ebec62ddf068cd221e38c21f36b2e330d3d85d7a1f","target":"graph","created_at":"2026-05-18T02:55:29Z","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":"To meet the evolving data rate requirements of emerging wireless communication technologies, many parallel architectures have been proposed to implement high throughput turbo decoders. However, concurrent memory reading/writing in parallel turbo decoding architectures leads to severe memory conflict problem, which has become a major bottleneck for high throughput turbo decoders. In this paper, we propose a flexible and efficient VLSI architecture to solve the memory conflict problem for highly parallel turbo decoders targeting multi-standard 3G/4G wireless communication systems. To demonstrate","authors_text":"Aida Vosoughi, Guohui Wang, Hao Shen, Joseph R. Cavallaro, Yang Sun, Yuanbin Guo","cross_cats":["cs.AR","cs.DC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-15T06:23:28Z","title":"Parallel Interleaver Design for a High Throughput HSPA+/LTE Multi-Standard Turbo Decoder"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.3759","kind":"arxiv","version":3},"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:44ebb5669f03ce70b3abe0d28a64e5451c9f5561a1ac705fd2f05f8d8faa9a09","target":"record","created_at":"2026-05-18T02:55:29Z","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":"fa5289fcc8aa24bd3b6aa35dea6d6254c2438d4941beee1b0d40e5030d9aaf2c","cross_cats_sorted":["cs.AR","cs.DC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-03-15T06:23:28Z","title_canon_sha256":"5bcaf1693d9b9e4a5809bcb626865aefff71aebfa6f45ad0e1a887869942466e"},"schema_version":"1.0","source":{"id":"1403.3759","kind":"arxiv","version":3}},"canonical_sha256":"520ad1efcbbfcd7c543ff0d981398708b944dad17fd4aebf022a7cdace288245","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"520ad1efcbbfcd7c543ff0d981398708b944dad17fd4aebf022a7cdace288245","first_computed_at":"2026-05-18T02:55:29.924631Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:29.924631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YGXwo008Htzw80mzrMtIIno2KnNBLPPdNLhJsB1Qlq+2u8nhtH98rVa4qkUO93/Am1aEE3hWJkWWOt3k9vUtBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:29.925196Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.3759","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44ebb5669f03ce70b3abe0d28a64e5451c9f5561a1ac705fd2f05f8d8faa9a09","sha256:70f9f476b819a133e213b1ebec62ddf068cd221e38c21f36b2e330d3d85d7a1f"],"state_sha256":"37b17e26521a4afbafcfd877f746c6342768471acc2ae350453bf5c5ce0c48b1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4X+YLQO+EgK3ryy2M81ZZfH6VIOtTiuj9meYRYOUQaBNRfjd3oUHZueg36XfpXYCwmmWnn8w10OCMR+F4jSzBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T02:45:55.612203Z","bundle_sha256":"49e0d1122124885366708b64e43a3f9c0b0e98765bcc0fd98fb797a51bb959b1"}}