{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7V6Q2MQ2VPQQTCXQO4QF4ISSLV","short_pith_number":"pith:7V6Q2MQ2","canonical_record":{"source":{"id":"1504.01019","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-04T16:43:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"10bc9069f165cd5a0facd5c389ccb045dbb19ece7d3553b1d2886321ac36a4bb","abstract_canon_sha256":"9fff3508f93dd2369d28d22a5e14b64771fe85a80d09ec5d62f34dfd07f2b06e"},"schema_version":"1.0"},"canonical_sha256":"fd7d0d321aabe1098af077205e22525d57304373426dc9e31a7c929f26641606","source":{"kind":"arxiv","id":"1504.01019","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01019","created_at":"2026-05-18T00:19:47Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01019v3","created_at":"2026-05-18T00:19:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01019","created_at":"2026-05-18T00:19:47Z"},{"alias_kind":"pith_short_12","alias_value":"7V6Q2MQ2VPQQ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7V6Q2MQ2VPQQTCXQ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7V6Q2MQ2","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7V6Q2MQ2VPQQTCXQO4QF4ISSLV","target":"record","payload":{"canonical_record":{"source":{"id":"1504.01019","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-04T16:43:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"10bc9069f165cd5a0facd5c389ccb045dbb19ece7d3553b1d2886321ac36a4bb","abstract_canon_sha256":"9fff3508f93dd2369d28d22a5e14b64771fe85a80d09ec5d62f34dfd07f2b06e"},"schema_version":"1.0"},"canonical_sha256":"fd7d0d321aabe1098af077205e22525d57304373426dc9e31a7c929f26641606","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:47.987008Z","signature_b64":"W0kewgEf96WgGrEEl9sS34jx/lrZ9fLLAM9Bu2oGH995Y7z3+xM5AzTLp6ILUD2yr+6WrqGqRu82dnEWKy7mCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd7d0d321aabe1098af077205e22525d57304373426dc9e31a7c929f26641606","last_reissued_at":"2026-05-18T00:19:47.986277Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:47.986277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.01019","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-18T00:19:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ra/vcGECxqKvnpa+4IbTdflh500SDAjmX839g+Fun1aX7NJM2NVbgzCgrDIpnDKnO2AGb+wI3Zy2O+LkbN47DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:38:49.729122Z"},"content_sha256":"62c440f6d421817d69fd20f31c3d833076486fa1c331d83d1a019f5e4ea4c9bc","schema_version":"1.0","event_id":"sha256:62c440f6d421817d69fd20f31c3d833076486fa1c331d83d1a019f5e4ea4c9bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7V6Q2MQ2VPQQTCXQO4QF4ISSLV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Total-Power Capacity of Regular-LDPC Codes with Iterative Message-Passing Decoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrea Goldsmith, Jan Rabaey, Karthik Ganesan, Pulkit Grover","submitted_at":"2015-04-04T16:43:04Z","abstract_excerpt":"Motivated by recently derived fundamental limits on total (transmit + decoding) power for coded communication with VLSI decoders, this paper investigates the scaling behavior of the minimum total power needed to communicate over AWGN channels as the target bit-error-probability tends to zero. We focus on regular-LDPC codes and iterative message-passing decoders. We analyze scaling behavior under two VLSI complexity models of decoding. One model abstracts power consumed in processing elements (\"node model\"), and another abstracts power consumed in wires which connect the processing elements (\"w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01019","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-18T00:19:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LyaMEcDnvq+mkYeEAwN7QAPL98BPE49ANyXYbgyxkjgEkW63yohhKbliS2rkYCB9jaPhCC8o+NC0fLHPQZeaDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:38:49.729899Z"},"content_sha256":"49f63f7d3b6b3e568521937a950926270231a1decb00724a6bd142b139bf73bc","schema_version":"1.0","event_id":"sha256:49f63f7d3b6b3e568521937a950926270231a1decb00724a6bd142b139bf73bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7V6Q2MQ2VPQQTCXQO4QF4ISSLV/bundle.json","state_url":"https://pith.science/pith/7V6Q2MQ2VPQQTCXQO4QF4ISSLV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7V6Q2MQ2VPQQTCXQO4QF4ISSLV/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-26T03:38:49Z","links":{"resolver":"https://pith.science/pith/7V6Q2MQ2VPQQTCXQO4QF4ISSLV","bundle":"https://pith.science/pith/7V6Q2MQ2VPQQTCXQO4QF4ISSLV/bundle.json","state":"https://pith.science/pith/7V6Q2MQ2VPQQTCXQO4QF4ISSLV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7V6Q2MQ2VPQQTCXQO4QF4ISSLV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7V6Q2MQ2VPQQTCXQO4QF4ISSLV","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":"9fff3508f93dd2369d28d22a5e14b64771fe85a80d09ec5d62f34dfd07f2b06e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-04T16:43:04Z","title_canon_sha256":"10bc9069f165cd5a0facd5c389ccb045dbb19ece7d3553b1d2886321ac36a4bb"},"schema_version":"1.0","source":{"id":"1504.01019","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.01019","created_at":"2026-05-18T00:19:47Z"},{"alias_kind":"arxiv_version","alias_value":"1504.01019v3","created_at":"2026-05-18T00:19:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01019","created_at":"2026-05-18T00:19:47Z"},{"alias_kind":"pith_short_12","alias_value":"7V6Q2MQ2VPQQ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7V6Q2MQ2VPQQTCXQ","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7V6Q2MQ2","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:49f63f7d3b6b3e568521937a950926270231a1decb00724a6bd142b139bf73bc","target":"graph","created_at":"2026-05-18T00:19:47Z","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":"Motivated by recently derived fundamental limits on total (transmit + decoding) power for coded communication with VLSI decoders, this paper investigates the scaling behavior of the minimum total power needed to communicate over AWGN channels as the target bit-error-probability tends to zero. We focus on regular-LDPC codes and iterative message-passing decoders. We analyze scaling behavior under two VLSI complexity models of decoding. One model abstracts power consumed in processing elements (\"node model\"), and another abstracts power consumed in wires which connect the processing elements (\"w","authors_text":"Andrea Goldsmith, Jan Rabaey, Karthik Ganesan, Pulkit Grover","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-04T16:43:04Z","title":"On the Total-Power Capacity of Regular-LDPC Codes with Iterative Message-Passing Decoders"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01019","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:62c440f6d421817d69fd20f31c3d833076486fa1c331d83d1a019f5e4ea4c9bc","target":"record","created_at":"2026-05-18T00:19:47Z","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":"9fff3508f93dd2369d28d22a5e14b64771fe85a80d09ec5d62f34dfd07f2b06e","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-04T16:43:04Z","title_canon_sha256":"10bc9069f165cd5a0facd5c389ccb045dbb19ece7d3553b1d2886321ac36a4bb"},"schema_version":"1.0","source":{"id":"1504.01019","kind":"arxiv","version":3}},"canonical_sha256":"fd7d0d321aabe1098af077205e22525d57304373426dc9e31a7c929f26641606","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd7d0d321aabe1098af077205e22525d57304373426dc9e31a7c929f26641606","first_computed_at":"2026-05-18T00:19:47.986277Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:47.986277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W0kewgEf96WgGrEEl9sS34jx/lrZ9fLLAM9Bu2oGH995Y7z3+xM5AzTLp6ILUD2yr+6WrqGqRu82dnEWKy7mCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:47.987008Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.01019","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:62c440f6d421817d69fd20f31c3d833076486fa1c331d83d1a019f5e4ea4c9bc","sha256:49f63f7d3b6b3e568521937a950926270231a1decb00724a6bd142b139bf73bc"],"state_sha256":"38df93aaf99f43da1907fdedda9087140fe0fd96b9b4accb71a5f05b6484c328"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"skjWqhtEV9XV6owD+ukRrErPHFVP0D2rU0Zsn/P93CJwFHTARlyn30hhtL9wNb83NGissSvyA4pS2QFLye0iDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:38:49.734183Z","bundle_sha256":"987cc6dba1c39db389b1318ba5cacb8e1c2ec577a7527a808dc748314e1e6baa"}}