{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:W5VY3J3S7FI25GONOCOB2E5PA5","short_pith_number":"pith:W5VY3J3S","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"},"canonical_sha256":"b76b8da772f951ae99cd709c1d13af077905ae5ff23eab1c7225362b0d871f69","source":{"kind":"arxiv","id":"2207.07417","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.07417","created_at":"2026-07-05T07:16:32Z"},{"alias_kind":"arxiv_version","alias_value":"2207.07417v3","created_at":"2026-07-05T07:16:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.07417","created_at":"2026-07-05T07:16:32Z"},{"alias_kind":"pith_short_12","alias_value":"W5VY3J3S7FI2","created_at":"2026-07-05T07:16:32Z"},{"alias_kind":"pith_short_16","alias_value":"W5VY3J3S7FI25GON","created_at":"2026-07-05T07:16:32Z"},{"alias_kind":"pith_short_8","alias_value":"W5VY3J3S","created_at":"2026-07-05T07:16:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:W5VY3J3S7FI25GONOCOB2E5PA5","target":"record","payload":{"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"},"canonical_sha256":"b76b8da772f951ae99cd709c1d13af077905ae5ff23eab1c7225362b0d871f69","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"},"source_kind":"arxiv","source_id":"2207.07417","source_version":3,"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-07-05T07:16:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NJcVOl0LLuPd9mZNsR09fCowFbx5mgAVvH/e5TL7/woAfx5OI8HqOnw0EqWG3pAFZpRVhpxO2v4+xiQWZbYGAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T02:57:12.482883Z"},"content_sha256":"81ab84cea372ea2b5d35de41bb0cef62fd8ea4cb0cb76b095689ae15b9f09e61","schema_version":"1.0","event_id":"sha256:81ab84cea372ea2b5d35de41bb0cef62fd8ea4cb0cb76b095689ae15b9f09e61"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:W5VY3J3S7FI25GONOCOB2E5PA5","target":"graph","payload":{"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"},"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-07-05T07:16:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BkRAoS1/8QdjdE41Mt5KjUDoGberjzp90QRFtEyURJY9KPHe7pxsMYN678D77AuqJkl1Wi0MimHejsJWjOToCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T02:57:12.483267Z"},"content_sha256":"109d8d74b2941b92f7d9d84368b098759cb57e8767e06f268be29cf83671808b","schema_version":"1.0","event_id":"sha256:109d8d74b2941b92f7d9d84368b098759cb57e8767e06f268be29cf83671808b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W5VY3J3S7FI25GONOCOB2E5PA5/bundle.json","state_url":"https://pith.science/pith/W5VY3J3S7FI25GONOCOB2E5PA5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W5VY3J3S7FI25GONOCOB2E5PA5/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-08-23T02:57:12Z","links":{"resolver":"https://pith.science/pith/W5VY3J3S7FI25GONOCOB2E5PA5","bundle":"https://pith.science/pith/W5VY3J3S7FI25GONOCOB2E5PA5/bundle.json","state":"https://pith.science/pith/W5VY3J3S7FI25GONOCOB2E5PA5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W5VY3J3S7FI25GONOCOB2E5PA5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:W5VY3J3S7FI25GONOCOB2E5PA5","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":"17083cf1fc5bedc56f16b9c9e8b189ad0e389536dec6494e6b735cfc21c4e70a","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-07-15T11:55:09Z","title_canon_sha256":"141d7fa7f58c2ee11f62f6c2701ade5fa834b0fee5a91024dd92b9414ae3319b"},"schema_version":"1.0","source":{"id":"2207.07417","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.07417","created_at":"2026-07-05T07:16:32Z"},{"alias_kind":"arxiv_version","alias_value":"2207.07417v3","created_at":"2026-07-05T07:16:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.07417","created_at":"2026-07-05T07:16:32Z"},{"alias_kind":"pith_short_12","alias_value":"W5VY3J3S7FI2","created_at":"2026-07-05T07:16:32Z"},{"alias_kind":"pith_short_16","alias_value":"W5VY3J3S7FI25GON","created_at":"2026-07-05T07:16:32Z"},{"alias_kind":"pith_short_8","alias_value":"W5VY3J3S","created_at":"2026-07-05T07:16:32Z"}],"graph_snapshots":[{"event_id":"sha256:109d8d74b2941b92f7d9d84368b098759cb57e8767e06f268be29cf83671808b","target":"graph","created_at":"2026-07-05T07:16:32Z","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/2207.07417/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Arvind V. Mahankali, David P. Woodruff, Ziyu Zhang","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-07-15T11:55:09Z","title":"Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.07417","kind":"arxiv","version":3},"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:81ab84cea372ea2b5d35de41bb0cef62fd8ea4cb0cb76b095689ae15b9f09e61","target":"record","created_at":"2026-07-05T07:16:32Z","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":"17083cf1fc5bedc56f16b9c9e8b189ad0e389536dec6494e6b735cfc21c4e70a","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-07-15T11:55:09Z","title_canon_sha256":"141d7fa7f58c2ee11f62f6c2701ade5fa834b0fee5a91024dd92b9414ae3319b"},"schema_version":"1.0","source":{"id":"2207.07417","kind":"arxiv","version":3}},"canonical_sha256":"b76b8da772f951ae99cd709c1d13af077905ae5ff23eab1c7225362b0d871f69","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b76b8da772f951ae99cd709c1d13af077905ae5ff23eab1c7225362b0d871f69","first_computed_at":"2026-07-05T07:16:32.674629Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:16:32.674629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CMcIzrcpUyOyAx1PONKyMOpjZYV5LQtvXYgZhTHxuNpJTskQqfhLGfLeVTJU+e7XqvpqiwC1dMDnxZ2hiijbDw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:16:32.675146Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.07417","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81ab84cea372ea2b5d35de41bb0cef62fd8ea4cb0cb76b095689ae15b9f09e61","sha256:109d8d74b2941b92f7d9d84368b098759cb57e8767e06f268be29cf83671808b"],"state_sha256":"9c6bad710ad083fa948ed00b0e9baa5ca1bc21e9322de32e7a9ae88386b5e109"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zz5o2QgoXuR94bJHdgH0ezHeZ6G3mbnvN7Sf9WhObCKiZzCHlssnUaNM+hhunkjkpdWNze0pqNpS/k6D47qDBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T02:57:12.486751Z","bundle_sha256":"371269bc9bc56ff616b10a91732c6bb7be78a82926cd996ef7231143b96b09c5"}}