{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:LMCPULYSS4PYNMGDKG2WRCGTF5","short_pith_number":"pith:LMCPULYS","canonical_record":{"source":{"id":"0909.1876","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2009-09-10T07:29:52Z","cross_cats_sorted":[],"title_canon_sha256":"77fdbb4651c1410547efda203e9f184e7c81e229451b7d2c2c2c31aa6ac5a0c7","abstract_canon_sha256":"88c5fe44d136133eed9ff1f68a60c364748c125d944090dc369b07bc536ccd9f"},"schema_version":"1.0"},"canonical_sha256":"5b04fa2f12971f86b0c351b56888d32f48243b15c342b29a6d0138072a523168","source":{"kind":"arxiv","id":"0909.1876","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.1876","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0909.1876v1","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.1876","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"LMCPULYSS4PY","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"LMCPULYSS4PYNMGD","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"LMCPULYS","created_at":"2026-05-18T12:26:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:LMCPULYSS4PYNMGDKG2WRCGTF5","target":"record","payload":{"canonical_record":{"source":{"id":"0909.1876","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2009-09-10T07:29:52Z","cross_cats_sorted":[],"title_canon_sha256":"77fdbb4651c1410547efda203e9f184e7c81e229451b7d2c2c2c31aa6ac5a0c7","abstract_canon_sha256":"88c5fe44d136133eed9ff1f68a60c364748c125d944090dc369b07bc536ccd9f"},"schema_version":"1.0"},"canonical_sha256":"5b04fa2f12971f86b0c351b56888d32f48243b15c342b29a6d0138072a523168","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:58.005177Z","signature_b64":"z7pcA2Qy/r9k0yKW0Xqqe5vwMFFJ+YFC3Wg1i0b3IEiqd/SQaq74Ow4Jh6uXy6e6eCL1eBiYyAmopM3ui0MDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b04fa2f12971f86b0c351b56888d32f48243b15c342b29a6d0138072a523168","last_reissued_at":"2026-05-18T00:57:58.004648Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:58.004648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0909.1876","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-18T00:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mSfuS+j8gr1+RffK/bvElXscRIWfhd+vgZY3Ydu4GBwHF8gmxtGbiZQH+qaAyLd4C0kp6PWuml+ydQAky1uWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:12:14.117908Z"},"content_sha256":"30b300f8301ea8de6329eb74ab1e81838e6b3fd92fc002bb435bbd47648660ee","schema_version":"1.0","event_id":"sha256:30b300f8301ea8de6329eb74ab1e81838e6b3fd92fc002bb435bbd47648660ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:LMCPULYSS4PYNMGDKG2WRCGTF5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Turbo NOC: a framework for the design of Network On Chip based turbo decoder architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Guido Masera, Maurizio Martina","submitted_at":"2009-09-10T07:29:52Z","abstract_excerpt":"This work proposes a general framework for the design and simulation of network on chip based turbo decoder architectures. Several parameters in the design space are investigated, namely the network topology, the parallelism degree, the rate at which messages are sent by processing nodes over the network and the routing strategy. The main results of this analysis are: i) the most suited topologies to achieve high throughput with a limited complexity overhead are generalized de-Bruijn and generalized Kautz topologies; ii) depending on the throughput requirements different parallelism degrees, m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.1876","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-18T00:57:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Djo4ui/xVB+VIP2G5DFuyZ9Uxsqs2QvUuSR6h3kIHudwYOI1b/D9E0N+1pLs9wfunEdliUFzAoHiNAy3fIwHDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:12:14.118254Z"},"content_sha256":"52439638524bf7feb62cc484b6b6e7057917a2d7aea2164c2381e6980deedbbf","schema_version":"1.0","event_id":"sha256:52439638524bf7feb62cc484b6b6e7057917a2d7aea2164c2381e6980deedbbf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LMCPULYSS4PYNMGDKG2WRCGTF5/bundle.json","state_url":"https://pith.science/pith/LMCPULYSS4PYNMGDKG2WRCGTF5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LMCPULYSS4PYNMGDKG2WRCGTF5/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-03T20:12:14Z","links":{"resolver":"https://pith.science/pith/LMCPULYSS4PYNMGDKG2WRCGTF5","bundle":"https://pith.science/pith/LMCPULYSS4PYNMGDKG2WRCGTF5/bundle.json","state":"https://pith.science/pith/LMCPULYSS4PYNMGDKG2WRCGTF5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LMCPULYSS4PYNMGDKG2WRCGTF5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:LMCPULYSS4PYNMGDKG2WRCGTF5","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":"88c5fe44d136133eed9ff1f68a60c364748c125d944090dc369b07bc536ccd9f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2009-09-10T07:29:52Z","title_canon_sha256":"77fdbb4651c1410547efda203e9f184e7c81e229451b7d2c2c2c31aa6ac5a0c7"},"schema_version":"1.0","source":{"id":"0909.1876","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0909.1876","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"arxiv_version","alias_value":"0909.1876v1","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.1876","created_at":"2026-05-18T00:57:58Z"},{"alias_kind":"pith_short_12","alias_value":"LMCPULYSS4PY","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"LMCPULYSS4PYNMGD","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"LMCPULYS","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:52439638524bf7feb62cc484b6b6e7057917a2d7aea2164c2381e6980deedbbf","target":"graph","created_at":"2026-05-18T00:57:58Z","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":"This work proposes a general framework for the design and simulation of network on chip based turbo decoder architectures. Several parameters in the design space are investigated, namely the network topology, the parallelism degree, the rate at which messages are sent by processing nodes over the network and the routing strategy. The main results of this analysis are: i) the most suited topologies to achieve high throughput with a limited complexity overhead are generalized de-Bruijn and generalized Kautz topologies; ii) depending on the throughput requirements different parallelism degrees, m","authors_text":"Guido Masera, Maurizio Martina","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2009-09-10T07:29:52Z","title":"Turbo NOC: a framework for the design of Network On Chip based turbo decoder architectures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.1876","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:30b300f8301ea8de6329eb74ab1e81838e6b3fd92fc002bb435bbd47648660ee","target":"record","created_at":"2026-05-18T00:57:58Z","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":"88c5fe44d136133eed9ff1f68a60c364748c125d944090dc369b07bc536ccd9f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2009-09-10T07:29:52Z","title_canon_sha256":"77fdbb4651c1410547efda203e9f184e7c81e229451b7d2c2c2c31aa6ac5a0c7"},"schema_version":"1.0","source":{"id":"0909.1876","kind":"arxiv","version":1}},"canonical_sha256":"5b04fa2f12971f86b0c351b56888d32f48243b15c342b29a6d0138072a523168","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b04fa2f12971f86b0c351b56888d32f48243b15c342b29a6d0138072a523168","first_computed_at":"2026-05-18T00:57:58.004648Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:58.004648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z7pcA2Qy/r9k0yKW0Xqqe5vwMFFJ+YFC3Wg1i0b3IEiqd/SQaq74Ow4Jh6uXy6e6eCL1eBiYyAmopM3ui0MDDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:58.005177Z","signed_message":"canonical_sha256_bytes"},"source_id":"0909.1876","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30b300f8301ea8de6329eb74ab1e81838e6b3fd92fc002bb435bbd47648660ee","sha256:52439638524bf7feb62cc484b6b6e7057917a2d7aea2164c2381e6980deedbbf"],"state_sha256":"1cbe5efecee52acc432570ec097280f597efdcbe2c49308aff134783eab8d2b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ff0/cYwanEb0BUDJvS6n+T4c2v1qLsknHnYuvfVawQ9WpvPwKvISLBvs8CAiRiLr8t/CgPkFDXtj3oPp+XaDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T20:12:14.120331Z","bundle_sha256":"3279d14b0da35d5f4a1f9e371c2b93790ce5dc1c14b6243c9001d3a2b70a7ac5"}}