{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:QEAAZMLDMNDZ46IJD75EJKELY4","short_pith_number":"pith:QEAAZMLD","canonical_record":{"source":{"id":"1101.3214","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-17T14:01:13Z","cross_cats_sorted":["math.IT","stat.CO"],"title_canon_sha256":"95dc000ecebf3269f44d2605daca9c1593ec8a231d5e1b0d06188dd921160434","abstract_canon_sha256":"a99b84cb2b377cb9392dfec06087403e87a723ecdda3d3483b932f7f0f7d5517"},"schema_version":"1.0"},"canonical_sha256":"81000cb16363479e79091ffa44a88bc72e8b1337db1b6d92830a39ebe21584c0","source":{"kind":"arxiv","id":"1101.3214","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.3214","created_at":"2026-05-18T03:54:49Z"},{"alias_kind":"arxiv_version","alias_value":"1101.3214v2","created_at":"2026-05-18T03:54:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3214","created_at":"2026-05-18T03:54:49Z"},{"alias_kind":"pith_short_12","alias_value":"QEAAZMLDMNDZ","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QEAAZMLDMNDZ46IJ","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QEAAZMLD","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:QEAAZMLDMNDZ46IJD75EJKELY4","target":"record","payload":{"canonical_record":{"source":{"id":"1101.3214","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-17T14:01:13Z","cross_cats_sorted":["math.IT","stat.CO"],"title_canon_sha256":"95dc000ecebf3269f44d2605daca9c1593ec8a231d5e1b0d06188dd921160434","abstract_canon_sha256":"a99b84cb2b377cb9392dfec06087403e87a723ecdda3d3483b932f7f0f7d5517"},"schema_version":"1.0"},"canonical_sha256":"81000cb16363479e79091ffa44a88bc72e8b1337db1b6d92830a39ebe21584c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:49.525548Z","signature_b64":"paAI1nYGTiHhmqmc9spVusjLZVtuASmT6fL2FddmjvfZCzzD1GFfjTUZ4PTMgLf3RggS7Sj3bL0UyEY23jcQDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81000cb16363479e79091ffa44a88bc72e8b1337db1b6d92830a39ebe21584c0","last_reissued_at":"2026-05-18T03:54:49.524667Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:49.524667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.3214","source_version":2,"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-18T03:54:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TIpVQ4MDeSyRI2ogWz2YR/EvOkvYMsb4mK6XN4a1uCFMOxHGLI++X/9x9ypIqal55CeluHQyxL2aQqNRRQg+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T16:58:32.575047Z"},"content_sha256":"7ea1ddbd56abd698c32ca8cdb1dd23bcce9bbc0df288c29f639df49d6bb7eb01","schema_version":"1.0","event_id":"sha256:7ea1ddbd56abd698c32ca8cdb1dd23bcce9bbc0df288c29f639df49d6bb7eb01"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:QEAAZMLDMNDZ46IJD75EJKELY4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Belief Propagation for the Noiseless Capacity and Information Rates of Run-Length Limited Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.CO"],"primary_cat":"cs.IT","authors_text":"Giovanni Sabato, Mehdi Molkaraie","submitted_at":"2011-01-17T14:01:13Z","abstract_excerpt":"The performance of the generalized belief propagation algorithm for computing the noiseless capacity and mutual information rates of finite-size two-dimensional and three-dimensional run-length limited constraints is investigated. For each constraint, a method is proposed to choose the basic regions and to construct the region graph. Simulation results for the capacity of different constraints as a function of the size of the channel and mutual information rates of different constraints as a function of signal-to-noise ratio are reported. Convergence to the Shannon capacity is also discussed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3214","kind":"arxiv","version":2},"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-18T03:54:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aN2+qmolm2h7Kjxh32ttuIBR1n/2o4uJLPPCP93ZE1T9ssRdJNWANwExa2AOgz2kU5pfcbO3xGDL7cvC1qJJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T16:58:32.575514Z"},"content_sha256":"172091563e81e4dc24529050fc3c51f31bd3d149b7688ca9620c0b7acb9ad798","schema_version":"1.0","event_id":"sha256:172091563e81e4dc24529050fc3c51f31bd3d149b7688ca9620c0b7acb9ad798"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QEAAZMLDMNDZ46IJD75EJKELY4/bundle.json","state_url":"https://pith.science/pith/QEAAZMLDMNDZ46IJD75EJKELY4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QEAAZMLDMNDZ46IJD75EJKELY4/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-30T16:58:32Z","links":{"resolver":"https://pith.science/pith/QEAAZMLDMNDZ46IJD75EJKELY4","bundle":"https://pith.science/pith/QEAAZMLDMNDZ46IJD75EJKELY4/bundle.json","state":"https://pith.science/pith/QEAAZMLDMNDZ46IJD75EJKELY4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QEAAZMLDMNDZ46IJD75EJKELY4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:QEAAZMLDMNDZ46IJD75EJKELY4","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":"a99b84cb2b377cb9392dfec06087403e87a723ecdda3d3483b932f7f0f7d5517","cross_cats_sorted":["math.IT","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-17T14:01:13Z","title_canon_sha256":"95dc000ecebf3269f44d2605daca9c1593ec8a231d5e1b0d06188dd921160434"},"schema_version":"1.0","source":{"id":"1101.3214","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.3214","created_at":"2026-05-18T03:54:49Z"},{"alias_kind":"arxiv_version","alias_value":"1101.3214v2","created_at":"2026-05-18T03:54:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3214","created_at":"2026-05-18T03:54:49Z"},{"alias_kind":"pith_short_12","alias_value":"QEAAZMLDMNDZ","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QEAAZMLDMNDZ46IJ","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QEAAZMLD","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:172091563e81e4dc24529050fc3c51f31bd3d149b7688ca9620c0b7acb9ad798","target":"graph","created_at":"2026-05-18T03:54:49Z","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":"The performance of the generalized belief propagation algorithm for computing the noiseless capacity and mutual information rates of finite-size two-dimensional and three-dimensional run-length limited constraints is investigated. For each constraint, a method is proposed to choose the basic regions and to construct the region graph. Simulation results for the capacity of different constraints as a function of the size of the channel and mutual information rates of different constraints as a function of signal-to-noise ratio are reported. Convergence to the Shannon capacity is also discussed.","authors_text":"Giovanni Sabato, Mehdi Molkaraie","cross_cats":["math.IT","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-17T14:01:13Z","title":"Generalized Belief Propagation for the Noiseless Capacity and Information Rates of Run-Length Limited Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3214","kind":"arxiv","version":2},"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:7ea1ddbd56abd698c32ca8cdb1dd23bcce9bbc0df288c29f639df49d6bb7eb01","target":"record","created_at":"2026-05-18T03:54:49Z","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":"a99b84cb2b377cb9392dfec06087403e87a723ecdda3d3483b932f7f0f7d5517","cross_cats_sorted":["math.IT","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-17T14:01:13Z","title_canon_sha256":"95dc000ecebf3269f44d2605daca9c1593ec8a231d5e1b0d06188dd921160434"},"schema_version":"1.0","source":{"id":"1101.3214","kind":"arxiv","version":2}},"canonical_sha256":"81000cb16363479e79091ffa44a88bc72e8b1337db1b6d92830a39ebe21584c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81000cb16363479e79091ffa44a88bc72e8b1337db1b6d92830a39ebe21584c0","first_computed_at":"2026-05-18T03:54:49.524667Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:54:49.524667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"paAI1nYGTiHhmqmc9spVusjLZVtuASmT6fL2FddmjvfZCzzD1GFfjTUZ4PTMgLf3RggS7Sj3bL0UyEY23jcQDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:54:49.525548Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.3214","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ea1ddbd56abd698c32ca8cdb1dd23bcce9bbc0df288c29f639df49d6bb7eb01","sha256:172091563e81e4dc24529050fc3c51f31bd3d149b7688ca9620c0b7acb9ad798"],"state_sha256":"7f0643a5fde63c8b48a99b9e32de88dcb5bd1a47091d3ca732bc88a367350b9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oWWvPpMYBz5if7VkzL7CYy6SIu9tIRBqzzb9GF7jdZzJmjgROtkIpYj7yPHVMc0K9U+YasceY3SdMppwkBixBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T16:58:32.579229Z","bundle_sha256":"e85f6481d76e8d15456b915b060ea31feeab9f993f85b7b6825220730ae69b57"}}