{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:LOIPSQYMT6WERIIEAGOGBHU745","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":"1de79f518ee993c203203cdf9179db9f7891f28538721e7133ae98804a3fc00d","cross_cats_sorted":["cs.CC","cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-03-01T16:22:39Z","title_canon_sha256":"733feaf812e7d8d054659f1d6e2801e62c6cc125b52ade649deebf6642d7b735"},"schema_version":"1.0","source":{"id":"2403.00643","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.00643","created_at":"2026-07-05T10:28:14Z"},{"alias_kind":"arxiv_version","alias_value":"2403.00643v2","created_at":"2026-07-05T10:28:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.00643","created_at":"2026-07-05T10:28:14Z"},{"alias_kind":"pith_short_12","alias_value":"LOIPSQYMT6WE","created_at":"2026-07-05T10:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"LOIPSQYMT6WERIIE","created_at":"2026-07-05T10:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"LOIPSQYM","created_at":"2026-07-05T10:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:48ca15f3542d7cbb000c365e9142161b33c509c76bdc5e2a0eb4fda24045608e","target":"graph","created_at":"2026-07-05T10:28:14Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2403.00643/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study symmetric tensor decompositions, i.e., decompositions of the form $T = \\sum_{i=1}^r u_i^{\\otimes 3}$ where $T$ is a symmetric tensor of order 3 and $u_i \\in \\mathbb{C}^n$.In order to obtain efficient decomposition algorithms, it is necessary to require additional properties from $u_i$. In this paper we assume that the $u_i$ are linearly independent.This implies $r \\leq n$,that is, the decomposition of T is undercomplete.\n  We give a randomized algorithm for the following problem in the exact arithmetic model of computation: Let $T$ be an order-3 symmetric tensor that has an undercompl","authors_text":"Pascal Koiran, Subhayan Saha","cross_cats":["cs.CC","cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-03-01T16:22:39Z","title":"Undercomplete Decomposition of Symmetric Tensors in Linear Time, and Smoothed Analysis of the Condition Number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.00643","kind":"arxiv","version":2},"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:9fe123356d70f3b517f5b20f5c2f19f5531993a8ec76c90144f4258fc2839662","target":"record","created_at":"2026-07-05T10:28:14Z","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":"1de79f518ee993c203203cdf9179db9f7891f28538721e7133ae98804a3fc00d","cross_cats_sorted":["cs.CC","cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-03-01T16:22:39Z","title_canon_sha256":"733feaf812e7d8d054659f1d6e2801e62c6cc125b52ade649deebf6642d7b735"},"schema_version":"1.0","source":{"id":"2403.00643","kind":"arxiv","version":2}},"canonical_sha256":"5b90f9430c9fac48a104019c609e9fe74fde11604a225c4270e3fe47c7eae137","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b90f9430c9fac48a104019c609e9fe74fde11604a225c4270e3fe47c7eae137","first_computed_at":"2026-07-05T10:28:14.757421Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:28:14.757421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BXQB0aWrlpyAQk5HuySlq14TQXYvfdWdnx21ggsITV+nsjSTJ9OMZA4EFrb9os74H9Tad9K1LRWmitQ4MqELCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:28:14.758026Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.00643","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9fe123356d70f3b517f5b20f5c2f19f5531993a8ec76c90144f4258fc2839662","sha256:48ca15f3542d7cbb000c365e9142161b33c509c76bdc5e2a0eb4fda24045608e"],"state_sha256":"4aea9c75550cc07346c661e89dde83c03a71d6b1e4b4e91612d86922bd32613a"}