{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JS6KEHSFYJARRGJK5N6G536YM6","short_pith_number":"pith:JS6KEHSF","canonical_record":{"source":{"id":"1504.05287","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-21T03:21:53Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"6caba22ac7269fbf3f7c40f953e7c169bed0ef344192230118515835f328b6ef","abstract_canon_sha256":"2197a95014cbcd2ec569f2292bb4c995898b91db8fa16726fa6beb06cdf5d9f4"},"schema_version":"1.0"},"canonical_sha256":"4cbca21e45c24118992aeb7c6eefd867884e46c7afc56bf82c4a200d14abbc1d","source":{"kind":"arxiv","id":"1504.05287","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05287","created_at":"2026-05-18T02:18:13Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05287v1","created_at":"2026-05-18T02:18:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05287","created_at":"2026-05-18T02:18:13Z"},{"alias_kind":"pith_short_12","alias_value":"JS6KEHSFYJAR","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JS6KEHSFYJARRGJK","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JS6KEHSF","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JS6KEHSFYJARRGJK5N6G536YM6","target":"record","payload":{"canonical_record":{"source":{"id":"1504.05287","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-21T03:21:53Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"6caba22ac7269fbf3f7c40f953e7c169bed0ef344192230118515835f328b6ef","abstract_canon_sha256":"2197a95014cbcd2ec569f2292bb4c995898b91db8fa16726fa6beb06cdf5d9f4"},"schema_version":"1.0"},"canonical_sha256":"4cbca21e45c24118992aeb7c6eefd867884e46c7afc56bf82c4a200d14abbc1d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:13.191420Z","signature_b64":"sZd0nLNOzZqdfSzRjBak8HpRo3OrKxN2nTkcYgXO3ArdoOE3f0F/vh+TIt5L8TRAL2lHIlPy3aHyh2JMar3UAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4cbca21e45c24118992aeb7c6eefd867884e46c7afc56bf82c4a200d14abbc1d","last_reissued_at":"2026-05-18T02:18:13.190895Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:13.190895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.05287","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-18T02:18:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tm23fJXZuSG/I5WrryHg5ocjSD6HzksD5S8Zlk/GDz1hujXXJPv9456z9GXjzDdFztmOr3eqE+Ow/DkCO/SSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T23:28:50.569046Z"},"content_sha256":"45f7f35705a88ae8293dff2cbe4ea977e5f2bf2a518dfe6d3d7d3a34e0338e7c","schema_version":"1.0","event_id":"sha256:45f7f35705a88ae8293dff2cbe4ea977e5f2bf2a518dfe6d3d7d3a34e0338e7c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JS6KEHSFYJARRGJK5N6G536YM6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decomposing Overcomplete 3rd Order Tensors using Sum-of-Squares Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Rong Ge, Tengyu Ma","submitted_at":"2015-04-21T03:21:53Z","abstract_excerpt":"Tensor rank and low-rank tensor decompositions have many applications in learning and complexity theory. Most known algorithms use unfoldings of tensors and can only handle rank up to $n^{\\lfloor p/2 \\rfloor}$ for a $p$-th order tensor in $\\mathbb{R}^{n^p}$. Previously no efficient algorithm can decompose 3rd order tensors when the rank is super-linear in the dimension. Using ideas from sum-of-squares hierarchy, we give the first quasi-polynomial time algorithm that can decompose a random 3rd order tensor decomposition when the rank is as large as $n^{3/2}/\\textrm{polylog} n$.\n  We also give a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05287","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-18T02:18:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qYuHc078UPX9+B394Ytx23H0pHYpb00avZJx+V506SKhPCYuiCwDUtD7wWSkeSPIFEOe1ULAtWls9wW74lzgDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T23:28:50.569656Z"},"content_sha256":"7b4353c8098565f88e36e4db56e038ab3d9a94dd129088a6df634993fdac2aa7","schema_version":"1.0","event_id":"sha256:7b4353c8098565f88e36e4db56e038ab3d9a94dd129088a6df634993fdac2aa7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JS6KEHSFYJARRGJK5N6G536YM6/bundle.json","state_url":"https://pith.science/pith/JS6KEHSFYJARRGJK5N6G536YM6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JS6KEHSFYJARRGJK5N6G536YM6/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-01T23:28:50Z","links":{"resolver":"https://pith.science/pith/JS6KEHSFYJARRGJK5N6G536YM6","bundle":"https://pith.science/pith/JS6KEHSFYJARRGJK5N6G536YM6/bundle.json","state":"https://pith.science/pith/JS6KEHSFYJARRGJK5N6G536YM6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JS6KEHSFYJARRGJK5N6G536YM6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JS6KEHSFYJARRGJK5N6G536YM6","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":"2197a95014cbcd2ec569f2292bb4c995898b91db8fa16726fa6beb06cdf5d9f4","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-21T03:21:53Z","title_canon_sha256":"6caba22ac7269fbf3f7c40f953e7c169bed0ef344192230118515835f328b6ef"},"schema_version":"1.0","source":{"id":"1504.05287","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05287","created_at":"2026-05-18T02:18:13Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05287v1","created_at":"2026-05-18T02:18:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05287","created_at":"2026-05-18T02:18:13Z"},{"alias_kind":"pith_short_12","alias_value":"JS6KEHSFYJAR","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JS6KEHSFYJARRGJK","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JS6KEHSF","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:7b4353c8098565f88e36e4db56e038ab3d9a94dd129088a6df634993fdac2aa7","target":"graph","created_at":"2026-05-18T02:18:13Z","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":"Tensor rank and low-rank tensor decompositions have many applications in learning and complexity theory. Most known algorithms use unfoldings of tensors and can only handle rank up to $n^{\\lfloor p/2 \\rfloor}$ for a $p$-th order tensor in $\\mathbb{R}^{n^p}$. Previously no efficient algorithm can decompose 3rd order tensors when the rank is super-linear in the dimension. Using ideas from sum-of-squares hierarchy, we give the first quasi-polynomial time algorithm that can decompose a random 3rd order tensor decomposition when the rank is as large as $n^{3/2}/\\textrm{polylog} n$.\n  We also give a","authors_text":"Rong Ge, Tengyu Ma","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-21T03:21:53Z","title":"Decomposing Overcomplete 3rd Order Tensors using Sum-of-Squares Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05287","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:45f7f35705a88ae8293dff2cbe4ea977e5f2bf2a518dfe6d3d7d3a34e0338e7c","target":"record","created_at":"2026-05-18T02:18:13Z","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":"2197a95014cbcd2ec569f2292bb4c995898b91db8fa16726fa6beb06cdf5d9f4","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-21T03:21:53Z","title_canon_sha256":"6caba22ac7269fbf3f7c40f953e7c169bed0ef344192230118515835f328b6ef"},"schema_version":"1.0","source":{"id":"1504.05287","kind":"arxiv","version":1}},"canonical_sha256":"4cbca21e45c24118992aeb7c6eefd867884e46c7afc56bf82c4a200d14abbc1d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4cbca21e45c24118992aeb7c6eefd867884e46c7afc56bf82c4a200d14abbc1d","first_computed_at":"2026-05-18T02:18:13.190895Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:13.190895Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sZd0nLNOzZqdfSzRjBak8HpRo3OrKxN2nTkcYgXO3ArdoOE3f0F/vh+TIt5L8TRAL2lHIlPy3aHyh2JMar3UAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:13.191420Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.05287","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45f7f35705a88ae8293dff2cbe4ea977e5f2bf2a518dfe6d3d7d3a34e0338e7c","sha256:7b4353c8098565f88e36e4db56e038ab3d9a94dd129088a6df634993fdac2aa7"],"state_sha256":"d536e35e9f14e6879a8ffe8a55ff91775c6fc5737b853be72accc246c92ecea8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8GhqMFdL9k6776u8cCcNtuh4qOY5A+CUjBmPp3AOR+UaJpM3waeeCMgOwUp+mGqBFFc1ySf8pVzMLeO51gqQAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T23:28:50.572816Z","bundle_sha256":"d149735415127b2163a52b55e1b9c2b70997102f0b21ae686eb6014962b479ac"}}