{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RYVLWHJSVSRK6XZGE2CL7YCQ3Q","short_pith_number":"pith:RYVLWHJS","schema_version":"1.0","canonical_sha256":"8e2abb1d32aca2af5f262684bfe050dc2a19b042cb1cb63ac6cb8903dd015dee","source":{"kind":"arxiv","id":"1402.5649","version":4},"attestation_state":"computed","paper":{"title":"Fast multidimensional convolution in low-rank formats via cross approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"I. V. Oseledets, M. V. Rakhuba","submitted_at":"2014-02-23T18:41:36Z","abstract_excerpt":"We propose a new cross-conv algorithm for approximate computation of convolution in different low-rank tensor formats (tensor train, Tucker, Hierarchical Tucker). It has better complexity with respect to the tensor rank than previous approaches. The new algorithm has a high potential impact in different applications. The key idea is based on applying cross approximation in the \"frequency domain\", where convolution becomes a simple elementwise product. We illustrate efficiency of our algorithm by computing the three-dimensional Newton potential and by presenting preliminary results for solution"},"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":"1402.5649","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-02-23T18:41:36Z","cross_cats_sorted":[],"title_canon_sha256":"f8d53ee72f31adef77c66b239f126d5582a550c10e39b3f96ca9aa3ffbadf00d","abstract_canon_sha256":"16492408159f949ed4dd2b9e09a55aa764824610f29fe9770aaee46b17f49838"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:46.637834Z","signature_b64":"o8LlIQAwp3yA4weVfRIwVSywgnfqeuXwXgqYwn8FLJP+mRTsvzHGlCPReilhlXpl5YeivGwK83b6xYMV/OwbDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e2abb1d32aca2af5f262684bfe050dc2a19b042cb1cb63ac6cb8903dd015dee","last_reissued_at":"2026-05-18T01:05:46.637294Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:46.637294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast multidimensional convolution in low-rank formats via cross approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"I. V. Oseledets, M. V. Rakhuba","submitted_at":"2014-02-23T18:41:36Z","abstract_excerpt":"We propose a new cross-conv algorithm for approximate computation of convolution in different low-rank tensor formats (tensor train, Tucker, Hierarchical Tucker). It has better complexity with respect to the tensor rank than previous approaches. The new algorithm has a high potential impact in different applications. The key idea is based on applying cross approximation in the \"frequency domain\", where convolution becomes a simple elementwise product. We illustrate efficiency of our algorithm by computing the three-dimensional Newton potential and by presenting preliminary results for solution"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5649","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1402.5649","created_at":"2026-05-18T01:05:46.637400+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.5649v4","created_at":"2026-05-18T01:05:46.637400+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5649","created_at":"2026-05-18T01:05:46.637400+00:00"},{"alias_kind":"pith_short_12","alias_value":"RYVLWHJSVSRK","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RYVLWHJSVSRK6XZG","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RYVLWHJS","created_at":"2026-05-18T12:28:46.137349+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/RYVLWHJSVSRK6XZGE2CL7YCQ3Q","json":"https://pith.science/pith/RYVLWHJSVSRK6XZGE2CL7YCQ3Q.json","graph_json":"https://pith.science/api/pith-number/RYVLWHJSVSRK6XZGE2CL7YCQ3Q/graph.json","events_json":"https://pith.science/api/pith-number/RYVLWHJSVSRK6XZGE2CL7YCQ3Q/events.json","paper":"https://pith.science/paper/RYVLWHJS"},"agent_actions":{"view_html":"https://pith.science/pith/RYVLWHJSVSRK6XZGE2CL7YCQ3Q","download_json":"https://pith.science/pith/RYVLWHJSVSRK6XZGE2CL7YCQ3Q.json","view_paper":"https://pith.science/paper/RYVLWHJS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.5649&json=true","fetch_graph":"https://pith.science/api/pith-number/RYVLWHJSVSRK6XZGE2CL7YCQ3Q/graph.json","fetch_events":"https://pith.science/api/pith-number/RYVLWHJSVSRK6XZGE2CL7YCQ3Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RYVLWHJSVSRK6XZGE2CL7YCQ3Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RYVLWHJSVSRK6XZGE2CL7YCQ3Q/action/storage_attestation","attest_author":"https://pith.science/pith/RYVLWHJSVSRK6XZGE2CL7YCQ3Q/action/author_attestation","sign_citation":"https://pith.science/pith/RYVLWHJSVSRK6XZGE2CL7YCQ3Q/action/citation_signature","submit_replication":"https://pith.science/pith/RYVLWHJSVSRK6XZGE2CL7YCQ3Q/action/replication_record"}},"created_at":"2026-05-18T01:05:46.637400+00:00","updated_at":"2026-05-18T01:05:46.637400+00:00"}