{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JWAPWFWDKDKG4ZIDNCGNSZTUAZ","short_pith_number":"pith:JWAPWFWD","canonical_record":{"source":{"id":"1905.13283","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-30T20:05:13Z","cross_cats_sorted":["cs.DS","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"90b1518a929cd646ff901e19751752accb7e5d39523aeb61a13faf9119a8fca5","abstract_canon_sha256":"a45a29eaf837ee11ef0bedbbeb8eacd3248ab023b75282ec1c9027dcee26c9e5"},"schema_version":"1.0"},"canonical_sha256":"4d80fb16c350d46e6503688cd9667406564bd6e8fb9f51f8c6ccbcd3695b09c3","source":{"kind":"arxiv","id":"1905.13283","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JWAPWFWDKDKG4ZIDNCGNSZTUAZ","target":"record","payload":{"canonical_record":{"source":{"id":"1905.13283","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-30T20:05:13Z","cross_cats_sorted":["cs.DS","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"90b1518a929cd646ff901e19751752accb7e5d39523aeb61a13faf9119a8fca5","abstract_canon_sha256":"a45a29eaf837ee11ef0bedbbeb8eacd3248ab023b75282ec1c9027dcee26c9e5"},"schema_version":"1.0"},"canonical_sha256":"4d80fb16c350d46e6503688cd9667406564bd6e8fb9f51f8c6ccbcd3695b09c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:35.426026Z","signature_b64":"Ni9+GNwSsLnlzfUnsbpVv9lyDvFz5jDVPoQHUfzZk4n+Ymd05BCBohcYQm+CnjhV7ZlE5hjgHJXbD8dxGUsZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d80fb16c350d46e6503688cd9667406564bd6e8fb9f51f8c6ccbcd3695b09c3","last_reissued_at":"2026-05-17T23:44:35.425537Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:35.425537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.13283","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-17T23:44:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ECz587jud0kutQOlYDK4gGDocrIeirINEbMjqHM1JW0HCVazHYiADA0YC81TsXDv/S316a37qQgsDQ8eizGkBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:32:11.694864Z"},"content_sha256":"b89a862195bef6514f96e719f3275a010362cb2c2de25bb73d49f67d24219d00","schema_version":"1.0","event_id":"sha256:b89a862195bef6514f96e719f3275a010362cb2c2de25bb73d49f67d24219d00"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JWAPWFWDKDKG4ZIDNCGNSZTUAZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sum-of-squares meets square loss: Fast rates for agnostic tensor completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Andrej Risteski, Dylan J. Foster","submitted_at":"2019-05-30T20:05:13Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13283","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-17T23:44:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nR3K+1GnJiiFPJS/RPADq9qcawQvisutKIp0ZhrVzPIa8I5JFEcoopUAhjWmnlXcHUzE+ho5qqlwuWri3IUuCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:32:11.695207Z"},"content_sha256":"93e85dd64b4c2e4f8ee467bbe03a07cf7cff4ddb5e6b9eb59be4581d30013783","schema_version":"1.0","event_id":"sha256:93e85dd64b4c2e4f8ee467bbe03a07cf7cff4ddb5e6b9eb59be4581d30013783"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JWAPWFWDKDKG4ZIDNCGNSZTUAZ/bundle.json","state_url":"https://pith.science/pith/JWAPWFWDKDKG4ZIDNCGNSZTUAZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JWAPWFWDKDKG4ZIDNCGNSZTUAZ/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-06-27T16:32:11Z","links":{"resolver":"https://pith.science/pith/JWAPWFWDKDKG4ZIDNCGNSZTUAZ","bundle":"https://pith.science/pith/JWAPWFWDKDKG4ZIDNCGNSZTUAZ/bundle.json","state":"https://pith.science/pith/JWAPWFWDKDKG4ZIDNCGNSZTUAZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JWAPWFWDKDKG4ZIDNCGNSZTUAZ/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xswIoicPzABQqHBu3ZCiGtoCbG6bsrmCe1vWxqFRUzIbPRj9/hGgkgOBN9UZgIM+THmTXwVDjGg39v4NcgbdCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T16:32:11.697296Z","bundle_sha256":"81398e3db4a4586b493e36baf1fde9c8ac19c233265c0f6e2d8b37f20ca47646"}}