{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FQDPIQBXSU7DPEOUPGZRHOA3P4","short_pith_number":"pith:FQDPIQBX","canonical_record":{"source":{"id":"1706.08672","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-27T05:12:39Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"26a3745bccca6c61f9e094300f76c85182130f9faa7cfbd04076e54ffde5c471","abstract_canon_sha256":"e236e8c506e92ae687041c87c5aa805511b428a56298e27358897c1d44826311"},"schema_version":"1.0"},"canonical_sha256":"2c06f44037953e3791d479b313b81b7f001a975e2424738cb3bae32041420a7d","source":{"kind":"arxiv","id":"1706.08672","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08672","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08672v1","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08672","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"pith_short_12","alias_value":"FQDPIQBXSU7D","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FQDPIQBXSU7DPEOU","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FQDPIQBX","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FQDPIQBXSU7DPEOUPGZRHOA3P4","target":"record","payload":{"canonical_record":{"source":{"id":"1706.08672","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-27T05:12:39Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"26a3745bccca6c61f9e094300f76c85182130f9faa7cfbd04076e54ffde5c471","abstract_canon_sha256":"e236e8c506e92ae687041c87c5aa805511b428a56298e27358897c1d44826311"},"schema_version":"1.0"},"canonical_sha256":"2c06f44037953e3791d479b313b81b7f001a975e2424738cb3bae32041420a7d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:31.400233Z","signature_b64":"t0CHvt/Jd5r6SvDvImaHyT2pIulBKO0BaKVduZtFqTwGLK9rZIFZyy6hV6tVr4Ji00kks4nlsNd7UCY0Mi8HBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c06f44037953e3791d479b313b81b7f001a975e2424738cb3bae32041420a7d","last_reissued_at":"2026-05-18T00:41:31.399540Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:31.399540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.08672","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-18T00:41:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ficm9eT7ZJ7KKnZ3+AgenBek0RIl/YBWtxqoAUJk7PMyhqTrFlNYbPSfyXlPJcy2Q5cniKiZAOchIRwe8bQYBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:33:54.101573Z"},"content_sha256":"b7e6ad0399cfd55cfd0d227f626908287b2cdc09daac41f7b2932025e064631d","schema_version":"1.0","event_id":"sha256:b7e6ad0399cfd55cfd0d227f626908287b2cdc09daac41f7b2932025e064631d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FQDPIQBXSU7DPEOUPGZRHOA3P4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast and robust tensor decomposition with applications to dictionary learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"David Steurer, Tselil Schramm","submitted_at":"2017-06-27T05:12:39Z","abstract_excerpt":"We develop fast spectral algorithms for tensor decomposition that match the robustness guarantees of the best known polynomial-time algorithms for this problem based on the sum-of-squares (SOS) semidefinite programming hierarchy.\n  Our algorithms can decompose a 4-tensor with $n$-dimensional orthonormal components in the presence of error with constant spectral norm (when viewed as an $n^2$-by-$n^2$ matrix). The running time is $n^5$ which is close to linear in the input size $n^4$.\n  We also obtain algorithms with similar running time to learn sparsely-used orthogonal dictionaries even when f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08672","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-18T00:41:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sjz2LXuV0QOJCdMJ1jcYnN5n+CHdFhmMG2d3OL8X06kOYiV7OjjjWhVGygkJgPuaMQVCGT6/z72G/yfZgU5PBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:33:54.102124Z"},"content_sha256":"c32efd93707f1f5d4e0ea6f98455e8e7546ed57ccea2080e6e0cfbd75e9c6f0b","schema_version":"1.0","event_id":"sha256:c32efd93707f1f5d4e0ea6f98455e8e7546ed57ccea2080e6e0cfbd75e9c6f0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FQDPIQBXSU7DPEOUPGZRHOA3P4/bundle.json","state_url":"https://pith.science/pith/FQDPIQBXSU7DPEOUPGZRHOA3P4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FQDPIQBXSU7DPEOUPGZRHOA3P4/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-04T23:33:54Z","links":{"resolver":"https://pith.science/pith/FQDPIQBXSU7DPEOUPGZRHOA3P4","bundle":"https://pith.science/pith/FQDPIQBXSU7DPEOUPGZRHOA3P4/bundle.json","state":"https://pith.science/pith/FQDPIQBXSU7DPEOUPGZRHOA3P4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FQDPIQBXSU7DPEOUPGZRHOA3P4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FQDPIQBXSU7DPEOUPGZRHOA3P4","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":"e236e8c506e92ae687041c87c5aa805511b428a56298e27358897c1d44826311","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-27T05:12:39Z","title_canon_sha256":"26a3745bccca6c61f9e094300f76c85182130f9faa7cfbd04076e54ffde5c471"},"schema_version":"1.0","source":{"id":"1706.08672","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08672","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08672v1","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08672","created_at":"2026-05-18T00:41:31Z"},{"alias_kind":"pith_short_12","alias_value":"FQDPIQBXSU7D","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FQDPIQBXSU7DPEOU","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FQDPIQBX","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:c32efd93707f1f5d4e0ea6f98455e8e7546ed57ccea2080e6e0cfbd75e9c6f0b","target":"graph","created_at":"2026-05-18T00:41:31Z","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 develop fast spectral algorithms for tensor decomposition that match the robustness guarantees of the best known polynomial-time algorithms for this problem based on the sum-of-squares (SOS) semidefinite programming hierarchy.\n  Our algorithms can decompose a 4-tensor with $n$-dimensional orthonormal components in the presence of error with constant spectral norm (when viewed as an $n^2$-by-$n^2$ matrix). The running time is $n^5$ which is close to linear in the input size $n^4$.\n  We also obtain algorithms with similar running time to learn sparsely-used orthogonal dictionaries even when f","authors_text":"David Steurer, Tselil Schramm","cross_cats":["cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-27T05:12:39Z","title":"Fast and robust tensor decomposition with applications to dictionary learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08672","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:b7e6ad0399cfd55cfd0d227f626908287b2cdc09daac41f7b2932025e064631d","target":"record","created_at":"2026-05-18T00:41:31Z","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":"e236e8c506e92ae687041c87c5aa805511b428a56298e27358897c1d44826311","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-27T05:12:39Z","title_canon_sha256":"26a3745bccca6c61f9e094300f76c85182130f9faa7cfbd04076e54ffde5c471"},"schema_version":"1.0","source":{"id":"1706.08672","kind":"arxiv","version":1}},"canonical_sha256":"2c06f44037953e3791d479b313b81b7f001a975e2424738cb3bae32041420a7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c06f44037953e3791d479b313b81b7f001a975e2424738cb3bae32041420a7d","first_computed_at":"2026-05-18T00:41:31.399540Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:31.399540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t0CHvt/Jd5r6SvDvImaHyT2pIulBKO0BaKVduZtFqTwGLK9rZIFZyy6hV6tVr4Ji00kks4nlsNd7UCY0Mi8HBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:31.400233Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.08672","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7e6ad0399cfd55cfd0d227f626908287b2cdc09daac41f7b2932025e064631d","sha256:c32efd93707f1f5d4e0ea6f98455e8e7546ed57ccea2080e6e0cfbd75e9c6f0b"],"state_sha256":"2fd51ad8958939860ee5389fa6664e5d0773b5e2388f9255fa8740617fb2ac7a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j/KQUQ4XwD/e2Jx+PrVdZj1Oai4pxTQIjqnV5sqeiPUjntsmpIxfo6A+y2JytJ5ssVFap0RtWmc5EDtyBUrkCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T23:33:54.104973Z","bundle_sha256":"895baec0b57f454541162d2de891b48499ee5afe732b26b3e1845231e6c74f2e"}}