{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:QEAAZMLDMNDZ46IJD75EJKELY4","short_pith_number":"pith:QEAAZMLD","schema_version":"1.0","canonical_sha256":"81000cb16363479e79091ffa44a88bc72e8b1337db1b6d92830a39ebe21584c0","source":{"kind":"arxiv","id":"1101.3214","version":2},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1101.3214","created_at":"2026-05-18T03:54:49.524809+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.3214v2","created_at":"2026-05-18T03:54:49.524809+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3214","created_at":"2026-05-18T03:54:49.524809+00:00"},{"alias_kind":"pith_short_12","alias_value":"QEAAZMLDMNDZ","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"QEAAZMLDMNDZ46IJ","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"QEAAZMLD","created_at":"2026-05-18T12:26:39.201973+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/QEAAZMLDMNDZ46IJD75EJKELY4","json":"https://pith.science/pith/QEAAZMLDMNDZ46IJD75EJKELY4.json","graph_json":"https://pith.science/api/pith-number/QEAAZMLDMNDZ46IJD75EJKELY4/graph.json","events_json":"https://pith.science/api/pith-number/QEAAZMLDMNDZ46IJD75EJKELY4/events.json","paper":"https://pith.science/paper/QEAAZMLD"},"agent_actions":{"view_html":"https://pith.science/pith/QEAAZMLDMNDZ46IJD75EJKELY4","download_json":"https://pith.science/pith/QEAAZMLDMNDZ46IJD75EJKELY4.json","view_paper":"https://pith.science/paper/QEAAZMLD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.3214&json=true","fetch_graph":"https://pith.science/api/pith-number/QEAAZMLDMNDZ46IJD75EJKELY4/graph.json","fetch_events":"https://pith.science/api/pith-number/QEAAZMLDMNDZ46IJD75EJKELY4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QEAAZMLDMNDZ46IJD75EJKELY4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QEAAZMLDMNDZ46IJD75EJKELY4/action/storage_attestation","attest_author":"https://pith.science/pith/QEAAZMLDMNDZ46IJD75EJKELY4/action/author_attestation","sign_citation":"https://pith.science/pith/QEAAZMLDMNDZ46IJD75EJKELY4/action/citation_signature","submit_replication":"https://pith.science/pith/QEAAZMLDMNDZ46IJD75EJKELY4/action/replication_record"}},"created_at":"2026-05-18T03:54:49.524809+00:00","updated_at":"2026-05-18T03:54:49.524809+00:00"}