{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TRU7N6YKA7LMDBOZ7KHJWKZ467","short_pith_number":"pith:TRU7N6YK","schema_version":"1.0","canonical_sha256":"9c69f6fb0a07d6c185d9fa8e9b2b3cf7c69faa216796b7bc28c15be88b0557ad","source":{"kind":"arxiv","id":"2411.01974","version":2},"attestation_state":"computed","paper":{"title":"On the phase diagram of extensive-rank symmetric matrix denoising beyond rotational invariance","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"cond-mat.dis-nn","authors_text":"Francesco Camilli, Jean Barbier, Justin Ko, Koki Okajima","submitted_at":"2024-11-04T10:50:37Z","abstract_excerpt":"Matrix denoising is central to signal processing and machine learning. Its statistical analysis when the matrix to infer has a factorised structure with a rank growing proportionally to its dimension remains a challenge, except when it is rotationally invariant. In this case the information theoretic limits and an efficient Bayes-optimal denoising algorithm, called rotational invariant estimator [1,2], are known. Beyond this setting few results can be found. The reason is that the model is not a usual spin system because of the growing rank dimension, nor a matrix model (as appearing in high-e"},"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":"2411.01974","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2024-11-04T10:50:37Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"135dad317e8d451d1d213927d9cee9a97064f868a91d0cb3182761148868be45","abstract_canon_sha256":"2c1f3986a82c7b5b7af7fa9442f271196752dfd557ef535e2febc441a91c0303"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:31:25.439426Z","signature_b64":"m/j/E8YTOQWb7RlgDPh35YrykfxTJhY8bqj7+rXZXSEHRLXAh+xPGvunGkDgvWngecH0j/HFPoavyWccG66iDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c69f6fb0a07d6c185d9fa8e9b2b3cf7c69faa216796b7bc28c15be88b0557ad","last_reissued_at":"2026-07-05T10:31:25.438737Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:31:25.438737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the phase diagram of extensive-rank symmetric matrix denoising beyond rotational invariance","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"cond-mat.dis-nn","authors_text":"Francesco Camilli, Jean Barbier, Justin Ko, Koki Okajima","submitted_at":"2024-11-04T10:50:37Z","abstract_excerpt":"Matrix denoising is central to signal processing and machine learning. Its statistical analysis when the matrix to infer has a factorised structure with a rank growing proportionally to its dimension remains a challenge, except when it is rotationally invariant. In this case the information theoretic limits and an efficient Bayes-optimal denoising algorithm, called rotational invariant estimator [1,2], are known. Beyond this setting few results can be found. The reason is that the model is not a usual spin system because of the growing rank dimension, nor a matrix model (as appearing in high-e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.01974","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.01974/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2411.01974","created_at":"2026-07-05T10:31:25.438811+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.01974v2","created_at":"2026-07-05T10:31:25.438811+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.01974","created_at":"2026-07-05T10:31:25.438811+00:00"},{"alias_kind":"pith_short_12","alias_value":"TRU7N6YKA7LM","created_at":"2026-07-05T10:31:25.438811+00:00"},{"alias_kind":"pith_short_16","alias_value":"TRU7N6YKA7LMDBOZ","created_at":"2026-07-05T10:31:25.438811+00:00"},{"alias_kind":"pith_short_8","alias_value":"TRU7N6YK","created_at":"2026-07-05T10:31:25.438811+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2510.17886","citing_title":"Graphical model for factorization and completion of relatively high rank tensors by sparse sampling","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TRU7N6YKA7LMDBOZ7KHJWKZ467","json":"https://pith.science/pith/TRU7N6YKA7LMDBOZ7KHJWKZ467.json","graph_json":"https://pith.science/api/pith-number/TRU7N6YKA7LMDBOZ7KHJWKZ467/graph.json","events_json":"https://pith.science/api/pith-number/TRU7N6YKA7LMDBOZ7KHJWKZ467/events.json","paper":"https://pith.science/paper/TRU7N6YK"},"agent_actions":{"view_html":"https://pith.science/pith/TRU7N6YKA7LMDBOZ7KHJWKZ467","download_json":"https://pith.science/pith/TRU7N6YKA7LMDBOZ7KHJWKZ467.json","view_paper":"https://pith.science/paper/TRU7N6YK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.01974&json=true","fetch_graph":"https://pith.science/api/pith-number/TRU7N6YKA7LMDBOZ7KHJWKZ467/graph.json","fetch_events":"https://pith.science/api/pith-number/TRU7N6YKA7LMDBOZ7KHJWKZ467/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TRU7N6YKA7LMDBOZ7KHJWKZ467/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TRU7N6YKA7LMDBOZ7KHJWKZ467/action/storage_attestation","attest_author":"https://pith.science/pith/TRU7N6YKA7LMDBOZ7KHJWKZ467/action/author_attestation","sign_citation":"https://pith.science/pith/TRU7N6YKA7LMDBOZ7KHJWKZ467/action/citation_signature","submit_replication":"https://pith.science/pith/TRU7N6YKA7LMDBOZ7KHJWKZ467/action/replication_record"}},"created_at":"2026-07-05T10:31:25.438811+00:00","updated_at":"2026-07-05T10:31:25.438811+00:00"}