{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:UPPMCZB4LCMGQ3LRTIUL6CTS3C","short_pith_number":"pith:UPPMCZB4","schema_version":"1.0","canonical_sha256":"a3dec1643c5898686d719a28bf0a72d893645777d653b7916e166a781a9ec178","source":{"kind":"arxiv","id":"1412.4130","version":1},"attestation_state":"computed","paper":{"title":"Energy Consumption of VLSI Decoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christopher Blake, Frank R. Kschischang","submitted_at":"2014-12-12T21:07:15Z","abstract_excerpt":"Thompson's model of VLSI computation relates the energy of a computation to the product of the circuit area and the number of clock cycles needed to carry out the computation. It is shown that for any family of circuits implemented according to this model, using any algorithm that performs decoding of a codeword passed through a binary erasure channel, as the block length approaches infinity either (a) the probability of block error is asymptotically lower bounded by 1/2 or (b) the energy of the computation scales at least as Omega(n(log n)^(1/2)), and so the energy of successful decoding, per"},"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":"1412.4130","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-12T21:07:15Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f4275ab7cee4807ac22ca958feacb6774e972cd3452f95d44b37e3d42820ceda","abstract_canon_sha256":"ed1a0ac91c8c40e18643def266f6ae0e62fd05976006eff7700d970a8fe4d4d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:20.111895Z","signature_b64":"A3WSJ/ChiUmbzcAyKM7bE0iiw861BNwUNQPp0Gv5sSJgBpnVZLnj23WBQtmW1/uX2tdramPFA+2kO3/E+F3UAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3dec1643c5898686d719a28bf0a72d893645777d653b7916e166a781a9ec178","last_reissued_at":"2026-05-18T02:31:20.111225Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:20.111225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Energy Consumption of VLSI Decoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christopher Blake, Frank R. Kschischang","submitted_at":"2014-12-12T21:07:15Z","abstract_excerpt":"Thompson's model of VLSI computation relates the energy of a computation to the product of the circuit area and the number of clock cycles needed to carry out the computation. It is shown that for any family of circuits implemented according to this model, using any algorithm that performs decoding of a codeword passed through a binary erasure channel, as the block length approaches infinity either (a) the probability of block error is asymptotically lower bounded by 1/2 or (b) the energy of the computation scales at least as Omega(n(log n)^(1/2)), and so the energy of successful decoding, per"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4130","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":"1412.4130","created_at":"2026-05-18T02:31:20.111329+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.4130v1","created_at":"2026-05-18T02:31:20.111329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4130","created_at":"2026-05-18T02:31:20.111329+00:00"},{"alias_kind":"pith_short_12","alias_value":"UPPMCZB4LCMG","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"UPPMCZB4LCMGQ3LR","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"UPPMCZB4","created_at":"2026-05-18T12:28:52.271510+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/UPPMCZB4LCMGQ3LRTIUL6CTS3C","json":"https://pith.science/pith/UPPMCZB4LCMGQ3LRTIUL6CTS3C.json","graph_json":"https://pith.science/api/pith-number/UPPMCZB4LCMGQ3LRTIUL6CTS3C/graph.json","events_json":"https://pith.science/api/pith-number/UPPMCZB4LCMGQ3LRTIUL6CTS3C/events.json","paper":"https://pith.science/paper/UPPMCZB4"},"agent_actions":{"view_html":"https://pith.science/pith/UPPMCZB4LCMGQ3LRTIUL6CTS3C","download_json":"https://pith.science/pith/UPPMCZB4LCMGQ3LRTIUL6CTS3C.json","view_paper":"https://pith.science/paper/UPPMCZB4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.4130&json=true","fetch_graph":"https://pith.science/api/pith-number/UPPMCZB4LCMGQ3LRTIUL6CTS3C/graph.json","fetch_events":"https://pith.science/api/pith-number/UPPMCZB4LCMGQ3LRTIUL6CTS3C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UPPMCZB4LCMGQ3LRTIUL6CTS3C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UPPMCZB4LCMGQ3LRTIUL6CTS3C/action/storage_attestation","attest_author":"https://pith.science/pith/UPPMCZB4LCMGQ3LRTIUL6CTS3C/action/author_attestation","sign_citation":"https://pith.science/pith/UPPMCZB4LCMGQ3LRTIUL6CTS3C/action/citation_signature","submit_replication":"https://pith.science/pith/UPPMCZB4LCMGQ3LRTIUL6CTS3C/action/replication_record"}},"created_at":"2026-05-18T02:31:20.111329+00:00","updated_at":"2026-05-18T02:31:20.111329+00:00"}