{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SXAY6OWDBMMXO4RI45SALKV6RP","short_pith_number":"pith:SXAY6OWD","canonical_record":{"source":{"id":"1311.3651","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-14T20:49:55Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"3242ababd3d492e6a77acccb614ca0fb2706377293cc4d27e2280fac2c51b63f","abstract_canon_sha256":"906b1ab8d38b506f4f408eda906993275f3d9af7dfb4ee79112d23c1cd6bc370"},"schema_version":"1.0"},"canonical_sha256":"95c18f3ac30b19777228e76405aabe8bec982e127ea92238947c4d5b802a71a4","source":{"kind":"arxiv","id":"1311.3651","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.3651","created_at":"2026-05-18T03:01:45Z"},{"alias_kind":"arxiv_version","alias_value":"1311.3651v4","created_at":"2026-05-18T03:01:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3651","created_at":"2026-05-18T03:01:45Z"},{"alias_kind":"pith_short_12","alias_value":"SXAY6OWDBMMX","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SXAY6OWDBMMXO4RI","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SXAY6OWD","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SXAY6OWDBMMXO4RI45SALKV6RP","target":"record","payload":{"canonical_record":{"source":{"id":"1311.3651","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-14T20:49:55Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"3242ababd3d492e6a77acccb614ca0fb2706377293cc4d27e2280fac2c51b63f","abstract_canon_sha256":"906b1ab8d38b506f4f408eda906993275f3d9af7dfb4ee79112d23c1cd6bc370"},"schema_version":"1.0"},"canonical_sha256":"95c18f3ac30b19777228e76405aabe8bec982e127ea92238947c4d5b802a71a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:45.893312Z","signature_b64":"RkVdbAQNkehJ5pRPQ9aDTrBNwDiLoMqHAxOB22b99O8k+qq6k7yPfsIpvf2RJerlDDJDCWGxkheEfuPcfwQ5DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95c18f3ac30b19777228e76405aabe8bec982e127ea92238947c4d5b802a71a4","last_reissued_at":"2026-05-18T03:01:45.892824Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:45.892824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.3651","source_version":4,"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-18T03:01:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mgi6GYVPQ8cuWKqXsmLOFevdb/Mihnrb/B1FSwzenAQyGUV/brTB8Kea9N5RmZDzMXuGS4cB0wt0/Rsmm0gLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T12:40:03.002187Z"},"content_sha256":"9ce4477168cd26c82e485659e23dcff9c86a3538a14ef82ac0f42752e22c8244","schema_version":"1.0","event_id":"sha256:9ce4477168cd26c82e485659e23dcff9c86a3538a14ef82ac0f42752e22c8244"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SXAY6OWDBMMXO4RI45SALKV6RP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Smoothed Analysis of Tensor Decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Aditya Bhaskara, Ankur Moitra, Aravindan Vijayaraghavan, Moses Charikar","submitted_at":"2013-11-14T20:49:55Z","abstract_excerpt":"Low rank tensor decompositions are a powerful tool for learning generative models, and uniqueness results give them a significant advantage over matrix decomposition methods. However, tensors pose significant algorithmic challenges and tensors analogs of much of the matrix algebra toolkit are unlikely to exist because of hardness results. Efficient decomposition in the overcomplete case (where rank exceeds dimension) is particularly challenging. We introduce a smoothed analysis model for studying these questions and develop an efficient algorithm for tensor decomposition in the highly overcomp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3651","kind":"arxiv","version":4},"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-18T03:01:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"82nQYoJHfmIq4o9snnZgPrgIxkGK3yp1VPNxjGVLg6PvBKToqUYvA2LzIl4U2QH+uqMU6H/+LjW+rGRPOFe+Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T12:40:03.002758Z"},"content_sha256":"ad520196a59cf95423e3a6b92694f206e62232758598fa6188ef994e1da1e1df","schema_version":"1.0","event_id":"sha256:ad520196a59cf95423e3a6b92694f206e62232758598fa6188ef994e1da1e1df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SXAY6OWDBMMXO4RI45SALKV6RP/bundle.json","state_url":"https://pith.science/pith/SXAY6OWDBMMXO4RI45SALKV6RP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SXAY6OWDBMMXO4RI45SALKV6RP/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-07T12:40:03Z","links":{"resolver":"https://pith.science/pith/SXAY6OWDBMMXO4RI45SALKV6RP","bundle":"https://pith.science/pith/SXAY6OWDBMMXO4RI45SALKV6RP/bundle.json","state":"https://pith.science/pith/SXAY6OWDBMMXO4RI45SALKV6RP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SXAY6OWDBMMXO4RI45SALKV6RP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SXAY6OWDBMMXO4RI45SALKV6RP","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":"906b1ab8d38b506f4f408eda906993275f3d9af7dfb4ee79112d23c1cd6bc370","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-14T20:49:55Z","title_canon_sha256":"3242ababd3d492e6a77acccb614ca0fb2706377293cc4d27e2280fac2c51b63f"},"schema_version":"1.0","source":{"id":"1311.3651","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.3651","created_at":"2026-05-18T03:01:45Z"},{"alias_kind":"arxiv_version","alias_value":"1311.3651v4","created_at":"2026-05-18T03:01:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3651","created_at":"2026-05-18T03:01:45Z"},{"alias_kind":"pith_short_12","alias_value":"SXAY6OWDBMMX","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SXAY6OWDBMMXO4RI","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SXAY6OWD","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:ad520196a59cf95423e3a6b92694f206e62232758598fa6188ef994e1da1e1df","target":"graph","created_at":"2026-05-18T03:01:45Z","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":"Low rank tensor decompositions are a powerful tool for learning generative models, and uniqueness results give them a significant advantage over matrix decomposition methods. However, tensors pose significant algorithmic challenges and tensors analogs of much of the matrix algebra toolkit are unlikely to exist because of hardness results. Efficient decomposition in the overcomplete case (where rank exceeds dimension) is particularly challenging. We introduce a smoothed analysis model for studying these questions and develop an efficient algorithm for tensor decomposition in the highly overcomp","authors_text":"Aditya Bhaskara, Ankur Moitra, Aravindan Vijayaraghavan, Moses Charikar","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-14T20:49:55Z","title":"Smoothed Analysis of Tensor Decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3651","kind":"arxiv","version":4},"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:9ce4477168cd26c82e485659e23dcff9c86a3538a14ef82ac0f42752e22c8244","target":"record","created_at":"2026-05-18T03:01:45Z","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":"906b1ab8d38b506f4f408eda906993275f3d9af7dfb4ee79112d23c1cd6bc370","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-14T20:49:55Z","title_canon_sha256":"3242ababd3d492e6a77acccb614ca0fb2706377293cc4d27e2280fac2c51b63f"},"schema_version":"1.0","source":{"id":"1311.3651","kind":"arxiv","version":4}},"canonical_sha256":"95c18f3ac30b19777228e76405aabe8bec982e127ea92238947c4d5b802a71a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95c18f3ac30b19777228e76405aabe8bec982e127ea92238947c4d5b802a71a4","first_computed_at":"2026-05-18T03:01:45.892824Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:45.892824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RkVdbAQNkehJ5pRPQ9aDTrBNwDiLoMqHAxOB22b99O8k+qq6k7yPfsIpvf2RJerlDDJDCWGxkheEfuPcfwQ5DA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:45.893312Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.3651","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9ce4477168cd26c82e485659e23dcff9c86a3538a14ef82ac0f42752e22c8244","sha256:ad520196a59cf95423e3a6b92694f206e62232758598fa6188ef994e1da1e1df"],"state_sha256":"1b5996f9cd17d88c45818b788af108709140f7f3e80730839431c7f01f98b3c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cwfmGCeqAY3b6GUcAQmXjAxPIVQbueSA2S9TAJ48pdEQOVxYyzBm5fZ+xeLHdjpOAaKYGd79wojr1ndBn+g7Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T12:40:03.005672Z","bundle_sha256":"e720c89b60dfc82d9fa55fb9fba986d7abb8f3a99a4fe9b6efde8d5414d25a53"}}