{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EKA2IMQRINBPE2OZWWV74WTAGV","short_pith_number":"pith:EKA2IMQR","schema_version":"1.0","canonical_sha256":"2281a432114342f269d9b5abfe5a60355c8ff3730ca3212aa7fd5a85db890cf1","source":{"kind":"arxiv","id":"1707.04413","version":2},"attestation_state":"computed","paper":{"title":"The Mutual information of LDGM codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Jan van den Brand, Nor Jaafari","submitted_at":"2017-07-14T08:37:50Z","abstract_excerpt":"We provide matching upper and lower bounds on the mutual information in noisy reconstruction of parity check codes and thereby prove a long-standing conjecture by Montanari [IEEE Transactions on Information Theory 2005]. Besides extending a prior concentration result of Abbe and Montanari [Theory of Computing 2015] to the case of odd check degrees, we precisely determine the conjectured formula for code ensembles of arbitrary degree distribution, thus capturing a broad class of capacity approaching codes."},"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":"1707.04413","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-14T08:37:50Z","cross_cats_sorted":["math.IT","math.PR"],"title_canon_sha256":"e16a04511a8fc1a956bdd3cf27d7262a06f1501f50dcab4456ca218926f14062","abstract_canon_sha256":"2d0d2882fd4dcd0609c4c4eb1c580e865818be94f8a8a74cc5b023b1586f2933"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:25.425356Z","signature_b64":"YFzcWwBduyXmIris+Vcxs2o78td7QLVi0CguNeAcen2Dm1XLg+0l9b6qzonkbI8N7G01es5moVWJkq9hw4pLDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2281a432114342f269d9b5abfe5a60355c8ff3730ca3212aa7fd5a85db890cf1","last_reissued_at":"2026-05-18T00:39:25.424644Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:25.424644Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Mutual information of LDGM codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Jan van den Brand, Nor Jaafari","submitted_at":"2017-07-14T08:37:50Z","abstract_excerpt":"We provide matching upper and lower bounds on the mutual information in noisy reconstruction of parity check codes and thereby prove a long-standing conjecture by Montanari [IEEE Transactions on Information Theory 2005]. Besides extending a prior concentration result of Abbe and Montanari [Theory of Computing 2015] to the case of odd check degrees, we precisely determine the conjectured formula for code ensembles of arbitrary degree distribution, thus capturing a broad class of capacity approaching codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04413","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":"1707.04413","created_at":"2026-05-18T00:39:25.424747+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.04413v2","created_at":"2026-05-18T00:39:25.424747+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04413","created_at":"2026-05-18T00:39:25.424747+00:00"},{"alias_kind":"pith_short_12","alias_value":"EKA2IMQRINBP","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EKA2IMQRINBPE2OZ","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EKA2IMQR","created_at":"2026-05-18T12:31:12.930513+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/EKA2IMQRINBPE2OZWWV74WTAGV","json":"https://pith.science/pith/EKA2IMQRINBPE2OZWWV74WTAGV.json","graph_json":"https://pith.science/api/pith-number/EKA2IMQRINBPE2OZWWV74WTAGV/graph.json","events_json":"https://pith.science/api/pith-number/EKA2IMQRINBPE2OZWWV74WTAGV/events.json","paper":"https://pith.science/paper/EKA2IMQR"},"agent_actions":{"view_html":"https://pith.science/pith/EKA2IMQRINBPE2OZWWV74WTAGV","download_json":"https://pith.science/pith/EKA2IMQRINBPE2OZWWV74WTAGV.json","view_paper":"https://pith.science/paper/EKA2IMQR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.04413&json=true","fetch_graph":"https://pith.science/api/pith-number/EKA2IMQRINBPE2OZWWV74WTAGV/graph.json","fetch_events":"https://pith.science/api/pith-number/EKA2IMQRINBPE2OZWWV74WTAGV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EKA2IMQRINBPE2OZWWV74WTAGV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EKA2IMQRINBPE2OZWWV74WTAGV/action/storage_attestation","attest_author":"https://pith.science/pith/EKA2IMQRINBPE2OZWWV74WTAGV/action/author_attestation","sign_citation":"https://pith.science/pith/EKA2IMQRINBPE2OZWWV74WTAGV/action/citation_signature","submit_replication":"https://pith.science/pith/EKA2IMQRINBPE2OZWWV74WTAGV/action/replication_record"}},"created_at":"2026-05-18T00:39:25.424747+00:00","updated_at":"2026-05-18T00:39:25.424747+00:00"}