{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:AS5R22T26Y2T5VNXOJSAAKCDTQ","short_pith_number":"pith:AS5R22T2","canonical_record":{"source":{"id":"1606.04142","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-13T21:17:15Z","cross_cats_sorted":["cond-mat.dis-nn","cs.LG","math-ph","math.IT","math.MP"],"title_canon_sha256":"45c1b826082f8cf7da6cd1c8c351b27fa07b3e3bbe9d9ccd50ff7b18bfc08e99","abstract_canon_sha256":"c8952b6c654874c1cda6e598de0d7c8498c64ea8fdba7a3404e480ed1f363c3d"},"schema_version":"1.0"},"canonical_sha256":"04bb1d6a7af6353ed5b772640028439c01c8df65881edbbe3dd2020ecd15a16d","source":{"kind":"arxiv","id":"1606.04142","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04142","created_at":"2026-05-18T00:48:05Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04142v1","created_at":"2026-05-18T00:48:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04142","created_at":"2026-05-18T00:48:05Z"},{"alias_kind":"pith_short_12","alias_value":"AS5R22T26Y2T","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AS5R22T26Y2T5VNX","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AS5R22T2","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:AS5R22T26Y2T5VNXOJSAAKCDTQ","target":"record","payload":{"canonical_record":{"source":{"id":"1606.04142","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-13T21:17:15Z","cross_cats_sorted":["cond-mat.dis-nn","cs.LG","math-ph","math.IT","math.MP"],"title_canon_sha256":"45c1b826082f8cf7da6cd1c8c351b27fa07b3e3bbe9d9ccd50ff7b18bfc08e99","abstract_canon_sha256":"c8952b6c654874c1cda6e598de0d7c8498c64ea8fdba7a3404e480ed1f363c3d"},"schema_version":"1.0"},"canonical_sha256":"04bb1d6a7af6353ed5b772640028439c01c8df65881edbbe3dd2020ecd15a16d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:05.598859Z","signature_b64":"JB2NYsrX+o31ABR9yMmM3WQs92bTY7jF9mEmEFYLo7jjAHt8wT3GdJcB0U7uX5kXj2cZp5IzrEPuhfl5kMghBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04bb1d6a7af6353ed5b772640028439c01c8df65881edbbe3dd2020ecd15a16d","last_reissued_at":"2026-05-18T00:48:05.598408Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:05.598408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.04142","source_version":1,"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:48:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ckX6Cijm6xqvRzZ+0e6c+ZunHG4VqaIUZYZic+riYbucgR9otFVEncpmQ0rO57ckRsOVGRVpONVAp6AQ7wZQAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:06:41.057851Z"},"content_sha256":"bfd1f47df24bcf82fa067228005a9df677d863d901d172b16dd71990333d1251","schema_version":"1.0","event_id":"sha256:bfd1f47df24bcf82fa067228005a9df677d863d901d172b16dd71990333d1251"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:AS5R22T26Y2T5VNXOJSAAKCDTQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mutual information for symmetric rank-one matrix estimation: A proof of the replica formula","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cs.LG","math-ph","math.IT","math.MP"],"primary_cat":"cs.IT","authors_text":"Florent Krzakala, Jean Barbier, Lenka Zdeborova, Mohamad Dia, Nicolas Macris, Thibault Lesieur","submitted_at":"2016-06-13T21:17:15Z","abstract_excerpt":"Factorizing low-rank matrices has many applications in machine learning and statistics. For probabilistic models in the Bayes optimal setting, a general expression for the mutual information has been proposed using heuristic statistical physics computations, and proven in few specific cases. Here, we show how to rigorously prove the conjectured formula for the symmetric rank-one case. This allows to express the minimal mean-square-error and to characterize the detectability phase transitions in a large set of estimation problems ranging from community detection to sparse PCA. We also show that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04142","kind":"arxiv","version":1},"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:48:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FHNEzuURWdrkRvWmMQB//fPAN+NKiu1Cl6G6lfCbTpAFR4FZl8xo4sNNGExCZZioXnWDZIKE1jByQlZFiKqoBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T19:06:41.058534Z"},"content_sha256":"da2f974371a2621233870d28e6967c0c8a1cc5db5419a7015205eb3520513026","schema_version":"1.0","event_id":"sha256:da2f974371a2621233870d28e6967c0c8a1cc5db5419a7015205eb3520513026"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AS5R22T26Y2T5VNXOJSAAKCDTQ/bundle.json","state_url":"https://pith.science/pith/AS5R22T26Y2T5VNXOJSAAKCDTQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AS5R22T26Y2T5VNXOJSAAKCDTQ/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-05-26T19:06:41Z","links":{"resolver":"https://pith.science/pith/AS5R22T26Y2T5VNXOJSAAKCDTQ","bundle":"https://pith.science/pith/AS5R22T26Y2T5VNXOJSAAKCDTQ/bundle.json","state":"https://pith.science/pith/AS5R22T26Y2T5VNXOJSAAKCDTQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AS5R22T26Y2T5VNXOJSAAKCDTQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:AS5R22T26Y2T5VNXOJSAAKCDTQ","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":"c8952b6c654874c1cda6e598de0d7c8498c64ea8fdba7a3404e480ed1f363c3d","cross_cats_sorted":["cond-mat.dis-nn","cs.LG","math-ph","math.IT","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-13T21:17:15Z","title_canon_sha256":"45c1b826082f8cf7da6cd1c8c351b27fa07b3e3bbe9d9ccd50ff7b18bfc08e99"},"schema_version":"1.0","source":{"id":"1606.04142","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04142","created_at":"2026-05-18T00:48:05Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04142v1","created_at":"2026-05-18T00:48:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04142","created_at":"2026-05-18T00:48:05Z"},{"alias_kind":"pith_short_12","alias_value":"AS5R22T26Y2T","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AS5R22T26Y2T5VNX","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AS5R22T2","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:da2f974371a2621233870d28e6967c0c8a1cc5db5419a7015205eb3520513026","target":"graph","created_at":"2026-05-18T00:48:05Z","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":"Factorizing low-rank matrices has many applications in machine learning and statistics. For probabilistic models in the Bayes optimal setting, a general expression for the mutual information has been proposed using heuristic statistical physics computations, and proven in few specific cases. Here, we show how to rigorously prove the conjectured formula for the symmetric rank-one case. This allows to express the minimal mean-square-error and to characterize the detectability phase transitions in a large set of estimation problems ranging from community detection to sparse PCA. We also show that","authors_text":"Florent Krzakala, Jean Barbier, Lenka Zdeborova, Mohamad Dia, Nicolas Macris, Thibault Lesieur","cross_cats":["cond-mat.dis-nn","cs.LG","math-ph","math.IT","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-13T21:17:15Z","title":"Mutual information for symmetric rank-one matrix estimation: A proof of the replica formula"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04142","kind":"arxiv","version":1},"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:bfd1f47df24bcf82fa067228005a9df677d863d901d172b16dd71990333d1251","target":"record","created_at":"2026-05-18T00:48:05Z","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":"c8952b6c654874c1cda6e598de0d7c8498c64ea8fdba7a3404e480ed1f363c3d","cross_cats_sorted":["cond-mat.dis-nn","cs.LG","math-ph","math.IT","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-06-13T21:17:15Z","title_canon_sha256":"45c1b826082f8cf7da6cd1c8c351b27fa07b3e3bbe9d9ccd50ff7b18bfc08e99"},"schema_version":"1.0","source":{"id":"1606.04142","kind":"arxiv","version":1}},"canonical_sha256":"04bb1d6a7af6353ed5b772640028439c01c8df65881edbbe3dd2020ecd15a16d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04bb1d6a7af6353ed5b772640028439c01c8df65881edbbe3dd2020ecd15a16d","first_computed_at":"2026-05-18T00:48:05.598408Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:05.598408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JB2NYsrX+o31ABR9yMmM3WQs92bTY7jF9mEmEFYLo7jjAHt8wT3GdJcB0U7uX5kXj2cZp5IzrEPuhfl5kMghBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:05.598859Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.04142","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bfd1f47df24bcf82fa067228005a9df677d863d901d172b16dd71990333d1251","sha256:da2f974371a2621233870d28e6967c0c8a1cc5db5419a7015205eb3520513026"],"state_sha256":"3b24ebcb1aef07e7eb4b38a504cff49ecba37875760e5bfe7ce7e2eb604234ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ukqbApbTNYkgxH/tf6OI0sWSo5nYqC6d9kEKk7HitMlHAOmgVdh0JcnEAEAOGKVIsjkJbwf5haBTcxJHPBU/AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T19:06:41.062075Z","bundle_sha256":"c07af66a8b77caa21b880e6f3243bf32cceb4531a50530ddd746fb93e3239aca"}}