{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ALZLR56IJ6LC52LLKSI6UPHMCU","short_pith_number":"pith:ALZLR56I","schema_version":"1.0","canonical_sha256":"02f2b8f7c84f962ee96b5491ea3cec15250393a4d98fe174d9828fad6c9b340d","source":{"kind":"arxiv","id":"2302.03886","version":1},"attestation_state":"computed","paper":{"title":"Approximately Optimal Core Shapes for Tensor Decompositions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.CO"],"primary_cat":"cs.DS","authors_text":"Gang Fu, Matthew Fahrbach, Mehrdad Ghadiri, Vahab Mirrokni","submitted_at":"2023-02-08T05:24:01Z","abstract_excerpt":"This work studies the combinatorial optimization problem of finding an optimal core tensor shape, also called multilinear rank, for a size-constrained Tucker decomposition. We give an algorithm with provable approximation guarantees for its reconstruction error via connections to higher-order singular values. Specifically, we introduce a novel Tucker packing problem, which we prove is NP-hard, and give a polynomial-time approximation scheme based on a reduction to the 2-dimensional knapsack problem with a matroid constraint. We also generalize our techniques to tree tensor network decompositio"},"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":"2302.03886","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-02-08T05:24:01Z","cross_cats_sorted":["cs.LG","math.CO"],"title_canon_sha256":"c3b52410141e3ffb33b7b911d0429572dc85be892035a9be6d95de8fa468bac0","abstract_canon_sha256":"fb1587c030c6f2dfab20da610d0dbbf0d888d142d9f656eae27affe67979f772"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:32:58.893894Z","signature_b64":"JD1a4dVWBrwoQJ8wDkfPSLEx9lUbNUZY2EWxjPVnCALscC/J9ODYE/+W1a8NBsCU4rNzlga8LSykhg4cZ7zQDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02f2b8f7c84f962ee96b5491ea3cec15250393a4d98fe174d9828fad6c9b340d","last_reissued_at":"2026-07-05T08:32:58.893436Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:32:58.893436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximately Optimal Core Shapes for Tensor Decompositions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.CO"],"primary_cat":"cs.DS","authors_text":"Gang Fu, Matthew Fahrbach, Mehrdad Ghadiri, Vahab Mirrokni","submitted_at":"2023-02-08T05:24:01Z","abstract_excerpt":"This work studies the combinatorial optimization problem of finding an optimal core tensor shape, also called multilinear rank, for a size-constrained Tucker decomposition. We give an algorithm with provable approximation guarantees for its reconstruction error via connections to higher-order singular values. Specifically, we introduce a novel Tucker packing problem, which we prove is NP-hard, and give a polynomial-time approximation scheme based on a reduction to the 2-dimensional knapsack problem with a matroid constraint. We also generalize our techniques to tree tensor network decompositio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.03886","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2302.03886/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":"2302.03886","created_at":"2026-07-05T08:32:58.893492+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.03886v1","created_at":"2026-07-05T08:32:58.893492+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.03886","created_at":"2026-07-05T08:32:58.893492+00:00"},{"alias_kind":"pith_short_12","alias_value":"ALZLR56IJ6LC","created_at":"2026-07-05T08:32:58.893492+00:00"},{"alias_kind":"pith_short_16","alias_value":"ALZLR56IJ6LC52LL","created_at":"2026-07-05T08:32:58.893492+00:00"},{"alias_kind":"pith_short_8","alias_value":"ALZLR56I","created_at":"2026-07-05T08:32:58.893492+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ALZLR56IJ6LC52LLKSI6UPHMCU","json":"https://pith.science/pith/ALZLR56IJ6LC52LLKSI6UPHMCU.json","graph_json":"https://pith.science/api/pith-number/ALZLR56IJ6LC52LLKSI6UPHMCU/graph.json","events_json":"https://pith.science/api/pith-number/ALZLR56IJ6LC52LLKSI6UPHMCU/events.json","paper":"https://pith.science/paper/ALZLR56I"},"agent_actions":{"view_html":"https://pith.science/pith/ALZLR56IJ6LC52LLKSI6UPHMCU","download_json":"https://pith.science/pith/ALZLR56IJ6LC52LLKSI6UPHMCU.json","view_paper":"https://pith.science/paper/ALZLR56I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.03886&json=true","fetch_graph":"https://pith.science/api/pith-number/ALZLR56IJ6LC52LLKSI6UPHMCU/graph.json","fetch_events":"https://pith.science/api/pith-number/ALZLR56IJ6LC52LLKSI6UPHMCU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ALZLR56IJ6LC52LLKSI6UPHMCU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ALZLR56IJ6LC52LLKSI6UPHMCU/action/storage_attestation","attest_author":"https://pith.science/pith/ALZLR56IJ6LC52LLKSI6UPHMCU/action/author_attestation","sign_citation":"https://pith.science/pith/ALZLR56IJ6LC52LLKSI6UPHMCU/action/citation_signature","submit_replication":"https://pith.science/pith/ALZLR56IJ6LC52LLKSI6UPHMCU/action/replication_record"}},"created_at":"2026-07-05T08:32:58.893492+00:00","updated_at":"2026-07-05T08:32:58.893492+00:00"}