{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:W5VY3J3S7FI25GONOCOB2E5PA5","short_pith_number":"pith:W5VY3J3S","schema_version":"1.0","canonical_sha256":"b76b8da772f951ae99cd709c1d13af077905ae5ff23eab1c7225362b0d871f69","source":{"kind":"arxiv","id":"2207.07417","version":3},"attestation_state":"computed","paper":{"title":"Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Arvind V. Mahankali, David P. Woodruff, Ziyu Zhang","submitted_at":"2022-07-15T11:55:09Z","abstract_excerpt":"We study low rank approximation of tensors, focusing on the tensor train and Tucker decompositions, as well as approximations with tree tensor networks and more general tensor networks. For tensor train decomposition, we give a bicriteria $(1 + \\eps)$-approximation algorithm with a small bicriteria rank and $O(q \\cdot \\nnz(A))$ running time, up to lower order terms, which improves over the additive error algorithm of \\cite{huber2017randomized}. We also show how to convert the algorithm of \\cite{huber2017randomized} into a relative error algorithm, but their algorithm necessarily has a running "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2207.07417","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-07-15T11:55:09Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"141d7fa7f58c2ee11f62f6c2701ade5fa834b0fee5a91024dd92b9414ae3319b","abstract_canon_sha256":"17083cf1fc5bedc56f16b9c9e8b189ad0e389536dec6494e6b735cfc21c4e70a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:16:32.675146Z","signature_b64":"CMcIzrcpUyOyAx1PONKyMOpjZYV5LQtvXYgZhTHxuNpJTskQqfhLGfLeVTJU+e7XqvpqiwC1dMDnxZ2hiijbDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b76b8da772f951ae99cd709c1d13af077905ae5ff23eab1c7225362b0d871f69","last_reissued_at":"2026-07-05T07:16:32.674629Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:16:32.674629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Arvind V. Mahankali, David P. Woodruff, Ziyu Zhang","submitted_at":"2022-07-15T11:55:09Z","abstract_excerpt":"We study low rank approximation of tensors, focusing on the tensor train and Tucker decompositions, as well as approximations with tree tensor networks and more general tensor networks. For tensor train decomposition, we give a bicriteria $(1 + \\eps)$-approximation algorithm with a small bicriteria rank and $O(q \\cdot \\nnz(A))$ running time, up to lower order terms, which improves over the additive error algorithm of \\cite{huber2017randomized}. We also show how to convert the algorithm of \\cite{huber2017randomized} into a relative error algorithm, but their algorithm necessarily has a running "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.07417","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2207.07417/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2207.07417","created_at":"2026-07-05T07:16:32.674695+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.07417v3","created_at":"2026-07-05T07:16:32.674695+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.07417","created_at":"2026-07-05T07:16:32.674695+00:00"},{"alias_kind":"pith_short_12","alias_value":"W5VY3J3S7FI2","created_at":"2026-07-05T07:16:32.674695+00:00"},{"alias_kind":"pith_short_16","alias_value":"W5VY3J3S7FI25GON","created_at":"2026-07-05T07:16:32.674695+00:00"},{"alias_kind":"pith_short_8","alias_value":"W5VY3J3S","created_at":"2026-07-05T07:16:32.674695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.06111","citing_title":"Randomized algorithms for streaming low-rank approximation in tree tensor network format","ref_index":40,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W5VY3J3S7FI25GONOCOB2E5PA5","json":"https://pith.science/pith/W5VY3J3S7FI25GONOCOB2E5PA5.json","graph_json":"https://pith.science/api/pith-number/W5VY3J3S7FI25GONOCOB2E5PA5/graph.json","events_json":"https://pith.science/api/pith-number/W5VY3J3S7FI25GONOCOB2E5PA5/events.json","paper":"https://pith.science/paper/W5VY3J3S"},"agent_actions":{"view_html":"https://pith.science/pith/W5VY3J3S7FI25GONOCOB2E5PA5","download_json":"https://pith.science/pith/W5VY3J3S7FI25GONOCOB2E5PA5.json","view_paper":"https://pith.science/paper/W5VY3J3S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.07417&json=true","fetch_graph":"https://pith.science/api/pith-number/W5VY3J3S7FI25GONOCOB2E5PA5/graph.json","fetch_events":"https://pith.science/api/pith-number/W5VY3J3S7FI25GONOCOB2E5PA5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W5VY3J3S7FI25GONOCOB2E5PA5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W5VY3J3S7FI25GONOCOB2E5PA5/action/storage_attestation","attest_author":"https://pith.science/pith/W5VY3J3S7FI25GONOCOB2E5PA5/action/author_attestation","sign_citation":"https://pith.science/pith/W5VY3J3S7FI25GONOCOB2E5PA5/action/citation_signature","submit_replication":"https://pith.science/pith/W5VY3J3S7FI25GONOCOB2E5PA5/action/replication_record"}},"created_at":"2026-07-05T07:16:32.674695+00:00","updated_at":"2026-07-05T07:16:32.674695+00:00"}