{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UPPMCZB4LCMGQ3LRTIUL6CTS3C","short_pith_number":"pith:UPPMCZB4","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"},"canonical_sha256":"a3dec1643c5898686d719a28bf0a72d893645777d653b7916e166a781a9ec178","source":{"kind":"arxiv","id":"1412.4130","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4130","created_at":"2026-05-18T02:31:20Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4130v1","created_at":"2026-05-18T02:31:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4130","created_at":"2026-05-18T02:31:20Z"},{"alias_kind":"pith_short_12","alias_value":"UPPMCZB4LCMG","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UPPMCZB4LCMGQ3LR","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UPPMCZB4","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UPPMCZB4LCMGQ3LRTIUL6CTS3C","target":"record","payload":{"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"},"canonical_sha256":"a3dec1643c5898686d719a28bf0a72d893645777d653b7916e166a781a9ec178","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"},"source_kind":"arxiv","source_id":"1412.4130","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-18T02:31:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LWOZZt66uq/Mdg4K+zAfJLux9oqDOZbWLjD4e4i8TpAw7BaQtE9n1CG+mp3iO4KPAVFvbeO/2VdAcpr9pAR0Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:45:57.365485Z"},"content_sha256":"cc5b613cabb76d0fe5659d8f87dac2b0d1f994b54cae0898ae08ccdc26b59f27","schema_version":"1.0","event_id":"sha256:cc5b613cabb76d0fe5659d8f87dac2b0d1f994b54cae0898ae08ccdc26b59f27"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UPPMCZB4LCMGQ3LRTIUL6CTS3C","target":"graph","payload":{"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"},"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:31:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"58CX6Cplvtr5PmCQgJtBB4SdLRrgPvhwTokzLOv11s/OkH/4bD/cn9ftzwj5adPximzm3QVm8AmmG4NTH0h6Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:45:57.366088Z"},"content_sha256":"837b9a28c999aada50f54411f2a1be375f3cb8310de9ac96b4b20b4f8e22409f","schema_version":"1.0","event_id":"sha256:837b9a28c999aada50f54411f2a1be375f3cb8310de9ac96b4b20b4f8e22409f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UPPMCZB4LCMGQ3LRTIUL6CTS3C/bundle.json","state_url":"https://pith.science/pith/UPPMCZB4LCMGQ3LRTIUL6CTS3C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UPPMCZB4LCMGQ3LRTIUL6CTS3C/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-07T09:45:57Z","links":{"resolver":"https://pith.science/pith/UPPMCZB4LCMGQ3LRTIUL6CTS3C","bundle":"https://pith.science/pith/UPPMCZB4LCMGQ3LRTIUL6CTS3C/bundle.json","state":"https://pith.science/pith/UPPMCZB4LCMGQ3LRTIUL6CTS3C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UPPMCZB4LCMGQ3LRTIUL6CTS3C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UPPMCZB4LCMGQ3LRTIUL6CTS3C","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":"ed1a0ac91c8c40e18643def266f6ae0e62fd05976006eff7700d970a8fe4d4d4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-12T21:07:15Z","title_canon_sha256":"f4275ab7cee4807ac22ca958feacb6774e972cd3452f95d44b37e3d42820ceda"},"schema_version":"1.0","source":{"id":"1412.4130","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4130","created_at":"2026-05-18T02:31:20Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4130v1","created_at":"2026-05-18T02:31:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4130","created_at":"2026-05-18T02:31:20Z"},{"alias_kind":"pith_short_12","alias_value":"UPPMCZB4LCMG","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UPPMCZB4LCMGQ3LR","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UPPMCZB4","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:837b9a28c999aada50f54411f2a1be375f3cb8310de9ac96b4b20b4f8e22409f","target":"graph","created_at":"2026-05-18T02:31:20Z","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":"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","authors_text":"Christopher Blake, Frank R. Kschischang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-12T21:07:15Z","title":"Energy Consumption of VLSI Decoders"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4130","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:cc5b613cabb76d0fe5659d8f87dac2b0d1f994b54cae0898ae08ccdc26b59f27","target":"record","created_at":"2026-05-18T02:31:20Z","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":"ed1a0ac91c8c40e18643def266f6ae0e62fd05976006eff7700d970a8fe4d4d4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-12-12T21:07:15Z","title_canon_sha256":"f4275ab7cee4807ac22ca958feacb6774e972cd3452f95d44b37e3d42820ceda"},"schema_version":"1.0","source":{"id":"1412.4130","kind":"arxiv","version":1}},"canonical_sha256":"a3dec1643c5898686d719a28bf0a72d893645777d653b7916e166a781a9ec178","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3dec1643c5898686d719a28bf0a72d893645777d653b7916e166a781a9ec178","first_computed_at":"2026-05-18T02:31:20.111225Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:20.111225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A3WSJ/ChiUmbzcAyKM7bE0iiw861BNwUNQPp0Gv5sSJgBpnVZLnj23WBQtmW1/uX2tdramPFA+2kO3/E+F3UAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:20.111895Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.4130","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc5b613cabb76d0fe5659d8f87dac2b0d1f994b54cae0898ae08ccdc26b59f27","sha256:837b9a28c999aada50f54411f2a1be375f3cb8310de9ac96b4b20b4f8e22409f"],"state_sha256":"47c32721e076b66965a1c1e3bf4f0f1a000667cd48f7d37b5e2c8693496720a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MjXh6FmfS7egpAbKwavP1xcTfFtUi1mjZfS1XvMKvh7xRoAI5zSD8QG7JDhIyvNQ/DtVOv7sKGwtFyBFwfbXCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T09:45:57.369871Z","bundle_sha256":"130ef62ce32c88dbaaf0fbe5cee2ad82c348e3178039d2a30a64f6426e92ac18"}}