{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:CWUIMBCPWZVCE45AHKQQN5X4Q5","short_pith_number":"pith:CWUIMBCP","schema_version":"1.0","canonical_sha256":"15a886044fb66a2273a03aa106f6fc875c8ac4ae308696a4f8f6c9396c196626","source":{"kind":"arxiv","id":"2003.05101","version":1},"attestation_state":"computed","paper":{"title":"Tensorized Random Projections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Beheshteh T. Rakhshan, Guillaume Rabusseau","submitted_at":"2020-03-11T03:56:44Z","abstract_excerpt":"We introduce a novel random projection technique for efficiently reducing the dimension of very high-dimensional tensors. Building upon classical results on Gaussian random projections and Johnson-Lindenstrauss transforms~(JLT), we propose two tensorized random projection maps relying on the tensor train~(TT) and CP decomposition format, respectively. The two maps offer very low memory requirements and can be applied efficiently when the inputs are low rank tensors given in the CP or TT format. Our theoretical analysis shows that the dense Gaussian matrix in JLT can be replaced by a low-rank t"},"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":"2003.05101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-11T03:56:44Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"f4a8ce75f4abd96fa474daf7e362735588bc710f1538fd5897824c4ee1821358","abstract_canon_sha256":"7b07f17d00588f317240be57199c2098fe26cd937ed47dc5d646c531cc327ac2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:47:21.460187Z","signature_b64":"dkiiBr5DZjUX6ER/ZxtwePYM93NR4kNIofbVoX9encFbtvRHr6IF6eAN8aXucSEthuRQBN7iqUg4Xf0vxzP7DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15a886044fb66a2273a03aa106f6fc875c8ac4ae308696a4f8f6c9396c196626","last_reissued_at":"2026-07-05T00:47:21.459689Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:47:21.459689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tensorized Random Projections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Beheshteh T. Rakhshan, Guillaume Rabusseau","submitted_at":"2020-03-11T03:56:44Z","abstract_excerpt":"We introduce a novel random projection technique for efficiently reducing the dimension of very high-dimensional tensors. Building upon classical results on Gaussian random projections and Johnson-Lindenstrauss transforms~(JLT), we propose two tensorized random projection maps relying on the tensor train~(TT) and CP decomposition format, respectively. The two maps offer very low memory requirements and can be applied efficiently when the inputs are low rank tensors given in the CP or TT format. Our theoretical analysis shows that the dense Gaussian matrix in JLT can be replaced by a low-rank t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.05101","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/2003.05101/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":"2003.05101","created_at":"2026-07-05T00:47:21.459750+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.05101v1","created_at":"2026-07-05T00:47:21.459750+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.05101","created_at":"2026-07-05T00:47:21.459750+00:00"},{"alias_kind":"pith_short_12","alias_value":"CWUIMBCPWZVC","created_at":"2026-07-05T00:47:21.459750+00:00"},{"alias_kind":"pith_short_16","alias_value":"CWUIMBCPWZVCE45A","created_at":"2026-07-05T00:47:21.459750+00:00"},{"alias_kind":"pith_short_8","alias_value":"CWUIMBCP","created_at":"2026-07-05T00:47:21.459750+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.20161","citing_title":"Prismatic Synthesis: Gradient-based Data Diversification Boosts Generalization in LLM Reasoning","ref_index":50,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CWUIMBCPWZVCE45AHKQQN5X4Q5","json":"https://pith.science/pith/CWUIMBCPWZVCE45AHKQQN5X4Q5.json","graph_json":"https://pith.science/api/pith-number/CWUIMBCPWZVCE45AHKQQN5X4Q5/graph.json","events_json":"https://pith.science/api/pith-number/CWUIMBCPWZVCE45AHKQQN5X4Q5/events.json","paper":"https://pith.science/paper/CWUIMBCP"},"agent_actions":{"view_html":"https://pith.science/pith/CWUIMBCPWZVCE45AHKQQN5X4Q5","download_json":"https://pith.science/pith/CWUIMBCPWZVCE45AHKQQN5X4Q5.json","view_paper":"https://pith.science/paper/CWUIMBCP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.05101&json=true","fetch_graph":"https://pith.science/api/pith-number/CWUIMBCPWZVCE45AHKQQN5X4Q5/graph.json","fetch_events":"https://pith.science/api/pith-number/CWUIMBCPWZVCE45AHKQQN5X4Q5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CWUIMBCPWZVCE45AHKQQN5X4Q5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CWUIMBCPWZVCE45AHKQQN5X4Q5/action/storage_attestation","attest_author":"https://pith.science/pith/CWUIMBCPWZVCE45AHKQQN5X4Q5/action/author_attestation","sign_citation":"https://pith.science/pith/CWUIMBCPWZVCE45AHKQQN5X4Q5/action/citation_signature","submit_replication":"https://pith.science/pith/CWUIMBCPWZVCE45AHKQQN5X4Q5/action/replication_record"}},"created_at":"2026-07-05T00:47:21.459750+00:00","updated_at":"2026-07-05T00:47:21.459750+00:00"}