{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JWAPWFWDKDKG4ZIDNCGNSZTUAZ","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":"a45a29eaf837ee11ef0bedbbeb8eacd3248ab023b75282ec1c9027dcee26c9e5","cross_cats_sorted":["cs.DS","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-30T20:05:13Z","title_canon_sha256":"90b1518a929cd646ff901e19751752accb7e5d39523aeb61a13faf9119a8fca5"},"schema_version":"1.0","source":{"id":"1905.13283","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.13283","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"arxiv_version","alias_value":"1905.13283v1","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13283","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"pith_short_12","alias_value":"JWAPWFWDKDKG","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JWAPWFWDKDKG4ZID","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JWAPWFWD","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:93e85dd64b4c2e4f8ee467bbe03a07cf7cff4ddb5e6b9eb59be4581d30013783","target":"graph","created_at":"2026-05-17T23:44:35Z","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":"We study tensor completion in the agnostic setting. In the classical tensor completion problem, we receive $n$ entries of an unknown rank-$r$ tensor and wish to exactly complete the remaining entries. In agnostic tensor completion, we make no assumption on the rank of the unknown tensor, but attempt to predict unknown entries as well as the best rank-$r$ tensor.\n  For agnostic learning of third-order tensors with the square loss, we give the first polynomial time algorithm that obtains a \"fast\" (i.e., $O(1/n)$-type) rate improving over the rate obtained by reduction to matrix completion. Our p","authors_text":"Andrej Risteski, Dylan J. Foster","cross_cats":["cs.DS","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-30T20:05:13Z","title":"Sum-of-squares meets square loss: Fast rates for agnostic tensor completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13283","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:b89a862195bef6514f96e719f3275a010362cb2c2de25bb73d49f67d24219d00","target":"record","created_at":"2026-05-17T23:44:35Z","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":"a45a29eaf837ee11ef0bedbbeb8eacd3248ab023b75282ec1c9027dcee26c9e5","cross_cats_sorted":["cs.DS","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-30T20:05:13Z","title_canon_sha256":"90b1518a929cd646ff901e19751752accb7e5d39523aeb61a13faf9119a8fca5"},"schema_version":"1.0","source":{"id":"1905.13283","kind":"arxiv","version":1}},"canonical_sha256":"4d80fb16c350d46e6503688cd9667406564bd6e8fb9f51f8c6ccbcd3695b09c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d80fb16c350d46e6503688cd9667406564bd6e8fb9f51f8c6ccbcd3695b09c3","first_computed_at":"2026-05-17T23:44:35.425537Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:35.425537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ni9+GNwSsLnlzfUnsbpVv9lyDvFz5jDVPoQHUfzZk4n+Ymd05BCBohcYQm+CnjhV7ZlE5hjgHJXbD8dxGUsZCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:35.426026Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.13283","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b89a862195bef6514f96e719f3275a010362cb2c2de25bb73d49f67d24219d00","sha256:93e85dd64b4c2e4f8ee467bbe03a07cf7cff4ddb5e6b9eb59be4581d30013783"],"state_sha256":"774728c83d2f08881ba2e44f7b60c6c13f19cc4b0d5bde438005b636367c3495"}