{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EKA2IMQRINBPE2OZWWV74WTAGV","short_pith_number":"pith:EKA2IMQR","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"},"canonical_sha256":"2281a432114342f269d9b5abfe5a60355c8ff3730ca3212aa7fd5a85db890cf1","source":{"kind":"arxiv","id":"1707.04413","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04413","created_at":"2026-05-18T00:39:25Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04413v2","created_at":"2026-05-18T00:39:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04413","created_at":"2026-05-18T00:39:25Z"},{"alias_kind":"pith_short_12","alias_value":"EKA2IMQRINBP","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EKA2IMQRINBPE2OZ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EKA2IMQR","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EKA2IMQRINBPE2OZWWV74WTAGV","target":"record","payload":{"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"},"canonical_sha256":"2281a432114342f269d9b5abfe5a60355c8ff3730ca3212aa7fd5a85db890cf1","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"},"source_kind":"arxiv","source_id":"1707.04413","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-18T00:39:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gk92hfHqX/HKYR8VtnQl5L0eHwbKa4Apaxc2uRhUpq7jxeZnGg7qkRsiv0GAhjwly475T1NuPaDbM323eRY5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:24:45.232820Z"},"content_sha256":"e24f1ea72002e7e7c5bd1cdeb762aef181ada2b6e96b36619fd363329c87926c","schema_version":"1.0","event_id":"sha256:e24f1ea72002e7e7c5bd1cdeb762aef181ada2b6e96b36619fd363329c87926c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EKA2IMQRINBPE2OZWWV74WTAGV","target":"graph","payload":{"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"},"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:39:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tF/y5cFBjMXfJ/s48oradH8Us0CxxvJgzii6rQVrjWMXDiGRL7s7f9ZCGfAvfV8eVz5+bt8pYpdmrH/Hg2C/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:24:45.233159Z"},"content_sha256":"6ba3bb88b05a3c4165f58176c15d20b5dc2b245da9eeb1b7fb3822e68d635ca5","schema_version":"1.0","event_id":"sha256:6ba3bb88b05a3c4165f58176c15d20b5dc2b245da9eeb1b7fb3822e68d635ca5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EKA2IMQRINBPE2OZWWV74WTAGV/bundle.json","state_url":"https://pith.science/pith/EKA2IMQRINBPE2OZWWV74WTAGV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EKA2IMQRINBPE2OZWWV74WTAGV/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-02T05:24:45Z","links":{"resolver":"https://pith.science/pith/EKA2IMQRINBPE2OZWWV74WTAGV","bundle":"https://pith.science/pith/EKA2IMQRINBPE2OZWWV74WTAGV/bundle.json","state":"https://pith.science/pith/EKA2IMQRINBPE2OZWWV74WTAGV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EKA2IMQRINBPE2OZWWV74WTAGV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EKA2IMQRINBPE2OZWWV74WTAGV","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":"2d0d2882fd4dcd0609c4c4eb1c580e865818be94f8a8a74cc5b023b1586f2933","cross_cats_sorted":["math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-14T08:37:50Z","title_canon_sha256":"e16a04511a8fc1a956bdd3cf27d7262a06f1501f50dcab4456ca218926f14062"},"schema_version":"1.0","source":{"id":"1707.04413","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04413","created_at":"2026-05-18T00:39:25Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04413v2","created_at":"2026-05-18T00:39:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04413","created_at":"2026-05-18T00:39:25Z"},{"alias_kind":"pith_short_12","alias_value":"EKA2IMQRINBP","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EKA2IMQRINBPE2OZ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EKA2IMQR","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:6ba3bb88b05a3c4165f58176c15d20b5dc2b245da9eeb1b7fb3822e68d635ca5","target":"graph","created_at":"2026-05-18T00:39:25Z","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":"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.","authors_text":"Jan van den Brand, Nor Jaafari","cross_cats":["math.IT","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-14T08:37:50Z","title":"The Mutual information of LDGM codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04413","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:e24f1ea72002e7e7c5bd1cdeb762aef181ada2b6e96b36619fd363329c87926c","target":"record","created_at":"2026-05-18T00:39:25Z","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":"2d0d2882fd4dcd0609c4c4eb1c580e865818be94f8a8a74cc5b023b1586f2933","cross_cats_sorted":["math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-07-14T08:37:50Z","title_canon_sha256":"e16a04511a8fc1a956bdd3cf27d7262a06f1501f50dcab4456ca218926f14062"},"schema_version":"1.0","source":{"id":"1707.04413","kind":"arxiv","version":2}},"canonical_sha256":"2281a432114342f269d9b5abfe5a60355c8ff3730ca3212aa7fd5a85db890cf1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2281a432114342f269d9b5abfe5a60355c8ff3730ca3212aa7fd5a85db890cf1","first_computed_at":"2026-05-18T00:39:25.424644Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:25.424644Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YFzcWwBduyXmIris+Vcxs2o78td7QLVi0CguNeAcen2Dm1XLg+0l9b6qzonkbI8N7G01es5moVWJkq9hw4pLDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:25.425356Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.04413","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e24f1ea72002e7e7c5bd1cdeb762aef181ada2b6e96b36619fd363329c87926c","sha256:6ba3bb88b05a3c4165f58176c15d20b5dc2b245da9eeb1b7fb3822e68d635ca5"],"state_sha256":"4247b9115ab4dd33c4e944b665de82ba4ef11bd734aa4f9828fe0003ea92ba2f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8yTOQjTs3uNupTIJ1eb9bCfEKLww6seoZhtBgMVgr8xGL8cW/nw8860YS4bRP611QJXkhGSrcTEZdiSDwSuUAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T05:24:45.235552Z","bundle_sha256":"1479c3d8f6c04ff8f915652dcd76016d3a31655102b5bae8bac09230f08b91c5"}}