{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KYD22VDBHWZ3CDUBSQYHFF6EB5","short_pith_number":"pith:KYD22VDB","schema_version":"1.0","canonical_sha256":"5607ad54613db3b10e8194307297c40f5956491020d791dd2cc92c59e45c4269","source":{"kind":"arxiv","id":"1607.02335","version":2},"attestation_state":"computed","paper":{"title":"The Mutual Information in Random Linear Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.IT","math.MP"],"primary_cat":"cs.IT","authors_text":"Florent Krzakala, Jean Barbier, Mohamad Dia, Nicolas Macris","submitted_at":"2016-07-08T12:20:26Z","abstract_excerpt":"We consider the estimation of a signal from the knowledge of its noisy linear random Gaussian projections, a problem relevant in compressed sensing, sparse superposition codes or code division multiple access just to cite few. There has been a number of works considering the mutual information for this problem using the heuristic replica method from statistical physics. Here we put these considerations on a firm rigorous basis. First, we show, using a Guerra-type interpolation, that the replica formula yields an upper bound to the exact mutual information. Secondly, for many relevant practical"},"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":"1607.02335","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-08T12:20:26Z","cross_cats_sorted":["math-ph","math.IT","math.MP"],"title_canon_sha256":"1d3574b9909d36ce5b91508cd71fd165a3b756307c9630d79d3669ae3ad29801","abstract_canon_sha256":"631d99eb4854456df5d4c24717d46b4bbd17e22a4e28c57e3ac6d449a99db802"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:05.562660Z","signature_b64":"G73+GH/59i4pNKBF3cC51brB1+WZAIRHO1MhTsnDJMhi4M/xVpbwd/IIxPdj05NqMBT64ouS3mv1d+CbOz8ADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5607ad54613db3b10e8194307297c40f5956491020d791dd2cc92c59e45c4269","last_reissued_at":"2026-05-18T00:48:05.562240Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:05.562240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Mutual Information in Random Linear Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.IT","math.MP"],"primary_cat":"cs.IT","authors_text":"Florent Krzakala, Jean Barbier, Mohamad Dia, Nicolas Macris","submitted_at":"2016-07-08T12:20:26Z","abstract_excerpt":"We consider the estimation of a signal from the knowledge of its noisy linear random Gaussian projections, a problem relevant in compressed sensing, sparse superposition codes or code division multiple access just to cite few. There has been a number of works considering the mutual information for this problem using the heuristic replica method from statistical physics. Here we put these considerations on a firm rigorous basis. First, we show, using a Guerra-type interpolation, that the replica formula yields an upper bound to the exact mutual information. Secondly, for many relevant practical"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02335","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":"1607.02335","created_at":"2026-05-18T00:48:05.562293+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.02335v2","created_at":"2026-05-18T00:48:05.562293+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02335","created_at":"2026-05-18T00:48:05.562293+00:00"},{"alias_kind":"pith_short_12","alias_value":"KYD22VDBHWZ3","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"KYD22VDBHWZ3CDUB","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"KYD22VDB","created_at":"2026-05-18T12:30:29.479603+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/KYD22VDBHWZ3CDUBSQYHFF6EB5","json":"https://pith.science/pith/KYD22VDBHWZ3CDUBSQYHFF6EB5.json","graph_json":"https://pith.science/api/pith-number/KYD22VDBHWZ3CDUBSQYHFF6EB5/graph.json","events_json":"https://pith.science/api/pith-number/KYD22VDBHWZ3CDUBSQYHFF6EB5/events.json","paper":"https://pith.science/paper/KYD22VDB"},"agent_actions":{"view_html":"https://pith.science/pith/KYD22VDBHWZ3CDUBSQYHFF6EB5","download_json":"https://pith.science/pith/KYD22VDBHWZ3CDUBSQYHFF6EB5.json","view_paper":"https://pith.science/paper/KYD22VDB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.02335&json=true","fetch_graph":"https://pith.science/api/pith-number/KYD22VDBHWZ3CDUBSQYHFF6EB5/graph.json","fetch_events":"https://pith.science/api/pith-number/KYD22VDBHWZ3CDUBSQYHFF6EB5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KYD22VDBHWZ3CDUBSQYHFF6EB5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KYD22VDBHWZ3CDUBSQYHFF6EB5/action/storage_attestation","attest_author":"https://pith.science/pith/KYD22VDBHWZ3CDUBSQYHFF6EB5/action/author_attestation","sign_citation":"https://pith.science/pith/KYD22VDBHWZ3CDUBSQYHFF6EB5/action/citation_signature","submit_replication":"https://pith.science/pith/KYD22VDBHWZ3CDUBSQYHFF6EB5/action/replication_record"}},"created_at":"2026-05-18T00:48:05.562293+00:00","updated_at":"2026-05-18T00:48:05.562293+00:00"}