{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:A2NH7HWDEOCA4373T4OM4CDXYH","short_pith_number":"pith:A2NH7HWD","schema_version":"1.0","canonical_sha256":"069a7f9ec323840e6ffb9f1cce0877c1c5be2b656785069c54061a9501df84ee","source":{"kind":"arxiv","id":"1810.12054","version":1},"attestation_state":"computed","paper":{"title":"Energy-Efficient Soft-Assisted Product Decoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Alireza Sheikh, Christoffer Fougstedt, Gianluigi Liva, Per Larsson-Edefors","submitted_at":"2018-10-29T11:02:02Z","abstract_excerpt":"We implement a 1-Tb/s 0.63-pJ/bit soft-assisted product decoder in a 28-nm technology. The decoder uses one bit of soft information to improve its net coding gain by 0.2 dB, reaching 10.3-10.4 dB, which is similar to that of more complex hard-decision staircase decoders."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1810.12054","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-10-29T11:02:02Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"459412c081ec0b178cd972e9597bd11b5e69e595f1974a985cfc69a50994b427","abstract_canon_sha256":"b527f83b9fe903b7235475c3ed4a4508c6707878c7e40c1a0b10137c1d10c91a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:06.567404Z","signature_b64":"yEn5h3fr3+IVo8XmUAfterVCw/wmDM7BsnExAIT6fS3e/WtTb6busI8/SYWjHKw6fCpuIDHjr4tdxEiT3ke9Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"069a7f9ec323840e6ffb9f1cce0877c1c5be2b656785069c54061a9501df84ee","last_reissued_at":"2026-05-18T00:02:06.566684Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:06.566684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Energy-Efficient Soft-Assisted Product Decoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alexandre Graell i Amat, Alireza Sheikh, Christoffer Fougstedt, Gianluigi Liva, Per Larsson-Edefors","submitted_at":"2018-10-29T11:02:02Z","abstract_excerpt":"We implement a 1-Tb/s 0.63-pJ/bit soft-assisted product decoder in a 28-nm technology. The decoder uses one bit of soft information to improve its net coding gain by 0.2 dB, reaching 10.3-10.4 dB, which is similar to that of more complex hard-decision staircase decoders."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.12054","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.12054","created_at":"2026-05-18T00:02:06.566794+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.12054v1","created_at":"2026-05-18T00:02:06.566794+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.12054","created_at":"2026-05-18T00:02:06.566794+00:00"},{"alias_kind":"pith_short_12","alias_value":"A2NH7HWDEOCA","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"A2NH7HWDEOCA4373","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"A2NH7HWD","created_at":"2026-05-18T12:32:13.499390+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A2NH7HWDEOCA4373T4OM4CDXYH","json":"https://pith.science/pith/A2NH7HWDEOCA4373T4OM4CDXYH.json","graph_json":"https://pith.science/api/pith-number/A2NH7HWDEOCA4373T4OM4CDXYH/graph.json","events_json":"https://pith.science/api/pith-number/A2NH7HWDEOCA4373T4OM4CDXYH/events.json","paper":"https://pith.science/paper/A2NH7HWD"},"agent_actions":{"view_html":"https://pith.science/pith/A2NH7HWDEOCA4373T4OM4CDXYH","download_json":"https://pith.science/pith/A2NH7HWDEOCA4373T4OM4CDXYH.json","view_paper":"https://pith.science/paper/A2NH7HWD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.12054&json=true","fetch_graph":"https://pith.science/api/pith-number/A2NH7HWDEOCA4373T4OM4CDXYH/graph.json","fetch_events":"https://pith.science/api/pith-number/A2NH7HWDEOCA4373T4OM4CDXYH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A2NH7HWDEOCA4373T4OM4CDXYH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A2NH7HWDEOCA4373T4OM4CDXYH/action/storage_attestation","attest_author":"https://pith.science/pith/A2NH7HWDEOCA4373T4OM4CDXYH/action/author_attestation","sign_citation":"https://pith.science/pith/A2NH7HWDEOCA4373T4OM4CDXYH/action/citation_signature","submit_replication":"https://pith.science/pith/A2NH7HWDEOCA4373T4OM4CDXYH/action/replication_record"}},"created_at":"2026-05-18T00:02:06.566794+00:00","updated_at":"2026-05-18T00:02:06.566794+00:00"}