{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5AGPPJ5U6WPLY5FEKC442AF56O","short_pith_number":"pith:5AGPPJ5U","canonical_record":{"source":{"id":"1506.03498","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2015-06-10T22:46:02Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"fc09a05ae57e84a7e30111adf2c54c78e4453963e5ca1d9fba604aac5076fee1","abstract_canon_sha256":"26cb53cf108a09b0e972726b4882df1378a0aa00a0c11ffad48b9f6b837e0117"},"schema_version":"1.0"},"canonical_sha256":"e80cf7a7b4f59ebc74a450b9cd00bdf39562ebd232f06f7f586f32a3d7f25ea0","source":{"kind":"arxiv","id":"1506.03498","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.03498","created_at":"2026-05-18T01:21:01Z"},{"alias_kind":"arxiv_version","alias_value":"1506.03498v3","created_at":"2026-05-18T01:21:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03498","created_at":"2026-05-18T01:21:01Z"},{"alias_kind":"pith_short_12","alias_value":"5AGPPJ5U6WPL","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5AGPPJ5U6WPLY5FE","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5AGPPJ5U","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5AGPPJ5U6WPLY5FEKC442AF56O","target":"record","payload":{"canonical_record":{"source":{"id":"1506.03498","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2015-06-10T22:46:02Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"fc09a05ae57e84a7e30111adf2c54c78e4453963e5ca1d9fba604aac5076fee1","abstract_canon_sha256":"26cb53cf108a09b0e972726b4882df1378a0aa00a0c11ffad48b9f6b837e0117"},"schema_version":"1.0"},"canonical_sha256":"e80cf7a7b4f59ebc74a450b9cd00bdf39562ebd232f06f7f586f32a3d7f25ea0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:01.058690Z","signature_b64":"s/EpcHp0bzxYBmOPnSWjBIdxukXXc24LDifB9oNn+aOd/69yuKZzhoWrxpJpchlu4C9G/2j5CbrYJrhF9aBxDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e80cf7a7b4f59ebc74a450b9cd00bdf39562ebd232f06f7f586f32a3d7f25ea0","last_reissued_at":"2026-05-18T01:21:01.058307Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:01.058307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.03498","source_version":3,"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-18T01:21:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K5si90P49Rf5OYQHndKgZn1FQXSvTkOOP2lYo2wO6ax9FSDmfbvUtGk3DE5U3Dxlu5xiqqOcDGuYnA288uIKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T05:00:35.339055Z"},"content_sha256":"428926e44960c0b15e473afc8ece500c32c959e15c5e4e463fba00acb293ec7c","schema_version":"1.0","event_id":"sha256:428926e44960c0b15e473afc8ece500c32c959e15c5e4e463fba00acb293ec7c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5AGPPJ5U6WPLY5FEKC442AF56O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matrix Completion from Fewer Entries: Spectral Detectability and Rank Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cond-mat.dis-nn","authors_text":"Alaa Saade, Florent Krzakala, Lenka Zdeborov\\'a","submitted_at":"2015-06-10T22:46:02Z","abstract_excerpt":"The completion of low rank matrices from few entries is a task with many practical applications. We consider here two aspects of this problem: detectability, i.e. the ability to estimate the rank $r$ reliably from the fewest possible random entries, and performance in achieving small reconstruction error. We propose a spectral algorithm for these two tasks called MaCBetH (for Matrix Completion with the Bethe Hessian). The rank is estimated as the number of negative eigenvalues of the Bethe Hessian matrix, and the corresponding eigenvectors are used as initial condition for the minimization of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03498","kind":"arxiv","version":3},"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-18T01:21:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1PUrXPfNr4PtCCrCLmDRynUayDa9BtVQS8M5W2gL1gDgB9+kUE/YgnZEs+d7KcS5CKp1+49/kZ6ANF/OKuc9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T05:00:35.339413Z"},"content_sha256":"37ce8874086c54fdc6e37f6be46ce3905251166df963bf2f08f535477cf0e487","schema_version":"1.0","event_id":"sha256:37ce8874086c54fdc6e37f6be46ce3905251166df963bf2f08f535477cf0e487"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5AGPPJ5U6WPLY5FEKC442AF56O/bundle.json","state_url":"https://pith.science/pith/5AGPPJ5U6WPLY5FEKC442AF56O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5AGPPJ5U6WPLY5FEKC442AF56O/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-07-02T05:00:35Z","links":{"resolver":"https://pith.science/pith/5AGPPJ5U6WPLY5FEKC442AF56O","bundle":"https://pith.science/pith/5AGPPJ5U6WPLY5FEKC442AF56O/bundle.json","state":"https://pith.science/pith/5AGPPJ5U6WPLY5FEKC442AF56O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5AGPPJ5U6WPLY5FEKC442AF56O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5AGPPJ5U6WPLY5FEKC442AF56O","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":"26cb53cf108a09b0e972726b4882df1378a0aa00a0c11ffad48b9f6b837e0117","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2015-06-10T22:46:02Z","title_canon_sha256":"fc09a05ae57e84a7e30111adf2c54c78e4453963e5ca1d9fba604aac5076fee1"},"schema_version":"1.0","source":{"id":"1506.03498","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.03498","created_at":"2026-05-18T01:21:01Z"},{"alias_kind":"arxiv_version","alias_value":"1506.03498v3","created_at":"2026-05-18T01:21:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03498","created_at":"2026-05-18T01:21:01Z"},{"alias_kind":"pith_short_12","alias_value":"5AGPPJ5U6WPL","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5AGPPJ5U6WPLY5FE","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5AGPPJ5U","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:37ce8874086c54fdc6e37f6be46ce3905251166df963bf2f08f535477cf0e487","target":"graph","created_at":"2026-05-18T01:21:01Z","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":"The completion of low rank matrices from few entries is a task with many practical applications. We consider here two aspects of this problem: detectability, i.e. the ability to estimate the rank $r$ reliably from the fewest possible random entries, and performance in achieving small reconstruction error. We propose a spectral algorithm for these two tasks called MaCBetH (for Matrix Completion with the Bethe Hessian). The rank is estimated as the number of negative eigenvalues of the Bethe Hessian matrix, and the corresponding eigenvectors are used as initial condition for the minimization of ","authors_text":"Alaa Saade, Florent Krzakala, Lenka Zdeborov\\'a","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2015-06-10T22:46:02Z","title":"Matrix Completion from Fewer Entries: Spectral Detectability and Rank Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03498","kind":"arxiv","version":3},"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:428926e44960c0b15e473afc8ece500c32c959e15c5e4e463fba00acb293ec7c","target":"record","created_at":"2026-05-18T01:21:01Z","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":"26cb53cf108a09b0e972726b4882df1378a0aa00a0c11ffad48b9f6b837e0117","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2015-06-10T22:46:02Z","title_canon_sha256":"fc09a05ae57e84a7e30111adf2c54c78e4453963e5ca1d9fba604aac5076fee1"},"schema_version":"1.0","source":{"id":"1506.03498","kind":"arxiv","version":3}},"canonical_sha256":"e80cf7a7b4f59ebc74a450b9cd00bdf39562ebd232f06f7f586f32a3d7f25ea0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e80cf7a7b4f59ebc74a450b9cd00bdf39562ebd232f06f7f586f32a3d7f25ea0","first_computed_at":"2026-05-18T01:21:01.058307Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:01.058307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s/EpcHp0bzxYBmOPnSWjBIdxukXXc24LDifB9oNn+aOd/69yuKZzhoWrxpJpchlu4C9G/2j5CbrYJrhF9aBxDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:01.058690Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.03498","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:428926e44960c0b15e473afc8ece500c32c959e15c5e4e463fba00acb293ec7c","sha256:37ce8874086c54fdc6e37f6be46ce3905251166df963bf2f08f535477cf0e487"],"state_sha256":"a10f1950b5323d293dfe4971ace8c270a1a02eb9c00377e8c207366cdb92fc12"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zsc0SA7c6HUse7O8jFW7Z3WKUBiLJbIpNMkdJQdYUAr7i+QnUdfXS8JhCKRISC3DN67CRqgnW8egiuvmk0uiAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T05:00:35.341472Z","bundle_sha256":"278a8e71e3cd7ad6cf275d62e664e974fbe7e25b7dd5b56db0e8a2c0aa27e62b"}}