{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:ALZLR56IJ6LC52LLKSI6UPHMCU","short_pith_number":"pith:ALZLR56I","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"},"canonical_sha256":"02f2b8f7c84f962ee96b5491ea3cec15250393a4d98fe174d9828fad6c9b340d","source":{"kind":"arxiv","id":"2302.03886","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.03886","created_at":"2026-07-05T08:32:58Z"},{"alias_kind":"arxiv_version","alias_value":"2302.03886v1","created_at":"2026-07-05T08:32:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.03886","created_at":"2026-07-05T08:32:58Z"},{"alias_kind":"pith_short_12","alias_value":"ALZLR56IJ6LC","created_at":"2026-07-05T08:32:58Z"},{"alias_kind":"pith_short_16","alias_value":"ALZLR56IJ6LC52LL","created_at":"2026-07-05T08:32:58Z"},{"alias_kind":"pith_short_8","alias_value":"ALZLR56I","created_at":"2026-07-05T08:32:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:ALZLR56IJ6LC52LLKSI6UPHMCU","target":"record","payload":{"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"},"canonical_sha256":"02f2b8f7c84f962ee96b5491ea3cec15250393a4d98fe174d9828fad6c9b340d","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"},"source_kind":"arxiv","source_id":"2302.03886","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-07-05T08:32:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bCqEck6Mu3YDLrnj2i3cPO7jYbDnlWcoxNSBx8k3b1JpXDJW7PkBB0B8ovCn1QbcCPtMAMs2Odt+PZWJBcf5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:42:34.482493Z"},"content_sha256":"a052676a9d79ac5b1ed29d581603311148f351b27dace55ed318cf56272c6614","schema_version":"1.0","event_id":"sha256:a052676a9d79ac5b1ed29d581603311148f351b27dace55ed318cf56272c6614"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:ALZLR56IJ6LC52LLKSI6UPHMCU","target":"graph","payload":{"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"},"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-05T08:32:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qKnMjzrLjhR0y2dY7tV0PTbca8PyG3LhCZGVcgiw4bfpDhVW5WAcGr7SYc9N0BxQ0nCS1agJA5PuF2sj2vXJAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:42:34.482859Z"},"content_sha256":"2e8c92f511eeac17b295980875321028657089c3f35dcad54c5a87e31c2fd5aa","schema_version":"1.0","event_id":"sha256:2e8c92f511eeac17b295980875321028657089c3f35dcad54c5a87e31c2fd5aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ALZLR56IJ6LC52LLKSI6UPHMCU/bundle.json","state_url":"https://pith.science/pith/ALZLR56IJ6LC52LLKSI6UPHMCU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ALZLR56IJ6LC52LLKSI6UPHMCU/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-07-07T15:42:34Z","links":{"resolver":"https://pith.science/pith/ALZLR56IJ6LC52LLKSI6UPHMCU","bundle":"https://pith.science/pith/ALZLR56IJ6LC52LLKSI6UPHMCU/bundle.json","state":"https://pith.science/pith/ALZLR56IJ6LC52LLKSI6UPHMCU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ALZLR56IJ6LC52LLKSI6UPHMCU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:ALZLR56IJ6LC52LLKSI6UPHMCU","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":"fb1587c030c6f2dfab20da610d0dbbf0d888d142d9f656eae27affe67979f772","cross_cats_sorted":["cs.LG","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-02-08T05:24:01Z","title_canon_sha256":"c3b52410141e3ffb33b7b911d0429572dc85be892035a9be6d95de8fa468bac0"},"schema_version":"1.0","source":{"id":"2302.03886","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.03886","created_at":"2026-07-05T08:32:58Z"},{"alias_kind":"arxiv_version","alias_value":"2302.03886v1","created_at":"2026-07-05T08:32:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.03886","created_at":"2026-07-05T08:32:58Z"},{"alias_kind":"pith_short_12","alias_value":"ALZLR56IJ6LC","created_at":"2026-07-05T08:32:58Z"},{"alias_kind":"pith_short_16","alias_value":"ALZLR56IJ6LC52LL","created_at":"2026-07-05T08:32:58Z"},{"alias_kind":"pith_short_8","alias_value":"ALZLR56I","created_at":"2026-07-05T08:32:58Z"}],"graph_snapshots":[{"event_id":"sha256:2e8c92f511eeac17b295980875321028657089c3f35dcad54c5a87e31c2fd5aa","target":"graph","created_at":"2026-07-05T08:32:58Z","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/2302.03886/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Gang Fu, Matthew Fahrbach, Mehrdad Ghadiri, Vahab Mirrokni","cross_cats":["cs.LG","math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-02-08T05:24:01Z","title":"Approximately Optimal Core Shapes for Tensor Decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.03886","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:a052676a9d79ac5b1ed29d581603311148f351b27dace55ed318cf56272c6614","target":"record","created_at":"2026-07-05T08:32:58Z","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":"fb1587c030c6f2dfab20da610d0dbbf0d888d142d9f656eae27affe67979f772","cross_cats_sorted":["cs.LG","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-02-08T05:24:01Z","title_canon_sha256":"c3b52410141e3ffb33b7b911d0429572dc85be892035a9be6d95de8fa468bac0"},"schema_version":"1.0","source":{"id":"2302.03886","kind":"arxiv","version":1}},"canonical_sha256":"02f2b8f7c84f962ee96b5491ea3cec15250393a4d98fe174d9828fad6c9b340d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02f2b8f7c84f962ee96b5491ea3cec15250393a4d98fe174d9828fad6c9b340d","first_computed_at":"2026-07-05T08:32:58.893436Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:32:58.893436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JD1a4dVWBrwoQJ8wDkfPSLEx9lUbNUZY2EWxjPVnCALscC/J9ODYE/+W1a8NBsCU4rNzlga8LSykhg4cZ7zQDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:32:58.893894Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.03886","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a052676a9d79ac5b1ed29d581603311148f351b27dace55ed318cf56272c6614","sha256:2e8c92f511eeac17b295980875321028657089c3f35dcad54c5a87e31c2fd5aa"],"state_sha256":"e80ef477bfdb97bd2b2b3583a36a92ee17e229c84ba4352b046b4baf094c7115"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"38W5r9gT7QUJ8EqWqbLtWxUD+mDk+9WTNVsC0ecGUSOQqauMGjWyFVP0AHjW9myUzJ8u5Sxuum5ZWWSsTqGVBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T15:42:34.484808Z","bundle_sha256":"ab87819d29b9df30b2365eccd8200af33e87037c525424e982fef4dfe6707621"}}