{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NLWLSQNEERD3L77AGH7YOOTI6W","short_pith_number":"pith:NLWLSQNE","canonical_record":{"source":{"id":"1806.05121","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-13T15:54:36Z","cross_cats_sorted":["cond-mat.dis-nn","math-ph","math.IT","math.MP"],"title_canon_sha256":"97d2d2af746b8494cd17042c3d33d948b7be1df2c8f757408b58f1b3c6b706a6","abstract_canon_sha256":"64b18069a5706de0678d526b9a784ab1f5cc344373e85e6307360a336c5875f3"},"schema_version":"1.0"},"canonical_sha256":"6aecb941a42447b5ffe031ff873a68f59bb57d3902f45bff578c62c550a8f19d","source":{"kind":"arxiv","id":"1806.05121","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.05121","created_at":"2026-05-17T23:40:20Z"},{"alias_kind":"arxiv_version","alias_value":"1806.05121v2","created_at":"2026-05-17T23:40:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.05121","created_at":"2026-05-17T23:40:20Z"},{"alias_kind":"pith_short_12","alias_value":"NLWLSQNEERD3","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NLWLSQNEERD3L77A","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NLWLSQNE","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NLWLSQNEERD3L77AGH7YOOTI6W","target":"record","payload":{"canonical_record":{"source":{"id":"1806.05121","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-13T15:54:36Z","cross_cats_sorted":["cond-mat.dis-nn","math-ph","math.IT","math.MP"],"title_canon_sha256":"97d2d2af746b8494cd17042c3d33d948b7be1df2c8f757408b58f1b3c6b706a6","abstract_canon_sha256":"64b18069a5706de0678d526b9a784ab1f5cc344373e85e6307360a336c5875f3"},"schema_version":"1.0"},"canonical_sha256":"6aecb941a42447b5ffe031ff873a68f59bb57d3902f45bff578c62c550a8f19d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:20.733420Z","signature_b64":"rVJOnZsXmQCE6TaT1oMhc+7n9ip09fuGcHOHoSw0vApmVPLK5v+NoApe5TuhfFsz70cxnKhjQVkbAK30wQcYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6aecb941a42447b5ffe031ff873a68f59bb57d3902f45bff578c62c550a8f19d","last_reissued_at":"2026-05-17T23:40:20.732672Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:20.732672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.05121","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-17T23:40:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DpZBlpu/FY7YHn5DG2+p3nL1tHikcFkSiuQ/kiUOWQPjSz96TKoRr4arRUx+InrfagA1aJ8gVwn0k0rC/ywLBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:11:51.538451Z"},"content_sha256":"adbc494903c97377ae7b27e4e3d57b9e8e8aaad7866e6fda21c3aace874a3d90","schema_version":"1.0","event_id":"sha256:adbc494903c97377ae7b27e4e3d57b9e8e8aaad7866e6fda21c3aace874a3d90"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NLWLSQNEERD3L77AGH7YOOTI6W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Path Interpolation for Sparse Systems: Application to a Simple Censored Block Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","math-ph","math.IT","math.MP"],"primary_cat":"cs.IT","authors_text":"Chun Lam Chan, Jean Barbier, Nicolas Macris","submitted_at":"2018-06-13T15:54:36Z","abstract_excerpt":"Recently a new adaptive path interpolation method has been developed as a simple and versatile scheme to calculate exactly the asymptotic mutual information of Bayesian inference problems defined on dense factor graphs. These include random linear and generalized estimation, sparse superposition codes, or low-rank matrix and tensor estimation. For all these systems, the adaptive interpolation method directly proves that the replica symmetric prediction is exact, in a simple and unified manner. When the underlying factor graph of the inference problem is sparse the replica prediction is conside"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.05121","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-17T23:40:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mFzd5bVF03SpDeg7C77CGqWied4sCsKtNBGj0jq9C2yxKfVSjvIj2Y6LWs3gtClUFsjWVRtMJesa9gzCsZQUCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:11:51.538795Z"},"content_sha256":"152f0059fdcd3b84bef18d638e02adc04fce3a7dcf8b54f0c12cc83bbb68f69c","schema_version":"1.0","event_id":"sha256:152f0059fdcd3b84bef18d638e02adc04fce3a7dcf8b54f0c12cc83bbb68f69c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NLWLSQNEERD3L77AGH7YOOTI6W/bundle.json","state_url":"https://pith.science/pith/NLWLSQNEERD3L77AGH7YOOTI6W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NLWLSQNEERD3L77AGH7YOOTI6W/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-03T03:11:51Z","links":{"resolver":"https://pith.science/pith/NLWLSQNEERD3L77AGH7YOOTI6W","bundle":"https://pith.science/pith/NLWLSQNEERD3L77AGH7YOOTI6W/bundle.json","state":"https://pith.science/pith/NLWLSQNEERD3L77AGH7YOOTI6W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NLWLSQNEERD3L77AGH7YOOTI6W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NLWLSQNEERD3L77AGH7YOOTI6W","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":"64b18069a5706de0678d526b9a784ab1f5cc344373e85e6307360a336c5875f3","cross_cats_sorted":["cond-mat.dis-nn","math-ph","math.IT","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-13T15:54:36Z","title_canon_sha256":"97d2d2af746b8494cd17042c3d33d948b7be1df2c8f757408b58f1b3c6b706a6"},"schema_version":"1.0","source":{"id":"1806.05121","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.05121","created_at":"2026-05-17T23:40:20Z"},{"alias_kind":"arxiv_version","alias_value":"1806.05121v2","created_at":"2026-05-17T23:40:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.05121","created_at":"2026-05-17T23:40:20Z"},{"alias_kind":"pith_short_12","alias_value":"NLWLSQNEERD3","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NLWLSQNEERD3L77A","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NLWLSQNE","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:152f0059fdcd3b84bef18d638e02adc04fce3a7dcf8b54f0c12cc83bbb68f69c","target":"graph","created_at":"2026-05-17T23:40:20Z","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":"Recently a new adaptive path interpolation method has been developed as a simple and versatile scheme to calculate exactly the asymptotic mutual information of Bayesian inference problems defined on dense factor graphs. These include random linear and generalized estimation, sparse superposition codes, or low-rank matrix and tensor estimation. For all these systems, the adaptive interpolation method directly proves that the replica symmetric prediction is exact, in a simple and unified manner. When the underlying factor graph of the inference problem is sparse the replica prediction is conside","authors_text":"Chun Lam Chan, Jean Barbier, Nicolas Macris","cross_cats":["cond-mat.dis-nn","math-ph","math.IT","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-13T15:54:36Z","title":"Adaptive Path Interpolation for Sparse Systems: Application to a Simple Censored Block Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.05121","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:adbc494903c97377ae7b27e4e3d57b9e8e8aaad7866e6fda21c3aace874a3d90","target":"record","created_at":"2026-05-17T23:40:20Z","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":"64b18069a5706de0678d526b9a784ab1f5cc344373e85e6307360a336c5875f3","cross_cats_sorted":["cond-mat.dis-nn","math-ph","math.IT","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-13T15:54:36Z","title_canon_sha256":"97d2d2af746b8494cd17042c3d33d948b7be1df2c8f757408b58f1b3c6b706a6"},"schema_version":"1.0","source":{"id":"1806.05121","kind":"arxiv","version":2}},"canonical_sha256":"6aecb941a42447b5ffe031ff873a68f59bb57d3902f45bff578c62c550a8f19d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6aecb941a42447b5ffe031ff873a68f59bb57d3902f45bff578c62c550a8f19d","first_computed_at":"2026-05-17T23:40:20.732672Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:20.732672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rVJOnZsXmQCE6TaT1oMhc+7n9ip09fuGcHOHoSw0vApmVPLK5v+NoApe5TuhfFsz70cxnKhjQVkbAK30wQcYCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:20.733420Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.05121","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:adbc494903c97377ae7b27e4e3d57b9e8e8aaad7866e6fda21c3aace874a3d90","sha256:152f0059fdcd3b84bef18d638e02adc04fce3a7dcf8b54f0c12cc83bbb68f69c"],"state_sha256":"faceccf323d6ba18cd0e26e0e66f8430bc6dbc1d9fe5644f47708cccb25cf533"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LPAdOOANag8YIzczTCU/FKGcNFeZMdzDZDqow+RM0R65Y7aB5i/VrhFdM0BiUrqtJjSttEucBF7B2PJxW78BCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T03:11:51.540627Z","bundle_sha256":"8553267e1552ccc76a29c18299c02875c130d88e71092fc762ce259a4e12f3ca"}}