{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:RYVLWHJSVSRK6XZGE2CL7YCQ3Q","short_pith_number":"pith:RYVLWHJS","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"},"canonical_sha256":"8e2abb1d32aca2af5f262684bfe050dc2a19b042cb1cb63ac6cb8903dd015dee","source":{"kind":"arxiv","id":"1402.5649","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5649","created_at":"2026-05-18T01:05:46Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5649v4","created_at":"2026-05-18T01:05:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5649","created_at":"2026-05-18T01:05:46Z"},{"alias_kind":"pith_short_12","alias_value":"RYVLWHJSVSRK","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RYVLWHJSVSRK6XZG","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RYVLWHJS","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:RYVLWHJSVSRK6XZGE2CL7YCQ3Q","target":"record","payload":{"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"},"canonical_sha256":"8e2abb1d32aca2af5f262684bfe050dc2a19b042cb1cb63ac6cb8903dd015dee","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"},"source_kind":"arxiv","source_id":"1402.5649","source_version":4,"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-05-18T01:05:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8klqKJ6S3UsJ7DDRmsWMquUkB+GvP9pRFTVLlWvAfv/Yk7PEo3UpQa8q5yTPaaU0AE2/EJG9033VS9URdpedAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:37:03.735194Z"},"content_sha256":"2cf07cdd166e426310ac7bc061440ce7d2d3d0c340f2a526574d3786b27988be","schema_version":"1.0","event_id":"sha256:2cf07cdd166e426310ac7bc061440ce7d2d3d0c340f2a526574d3786b27988be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:RYVLWHJSVSRK6XZGE2CL7YCQ3Q","target":"graph","payload":{"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"},"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-05-18T01:05:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GFoMst9q1leGwa19x0LiucRvSL8k/I6qAVVKjmxHFtrYpVQmn/+nMAmaqaqoJz6bxo2wLv92U1I6KAQwYLXrCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:37:03.735558Z"},"content_sha256":"b79fb3b0b0537b96f8e7f50ea21662bbd08de071c54d7a01751a4fab78dc57ca","schema_version":"1.0","event_id":"sha256:b79fb3b0b0537b96f8e7f50ea21662bbd08de071c54d7a01751a4fab78dc57ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RYVLWHJSVSRK6XZGE2CL7YCQ3Q/bundle.json","state_url":"https://pith.science/pith/RYVLWHJSVSRK6XZGE2CL7YCQ3Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RYVLWHJSVSRK6XZGE2CL7YCQ3Q/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-06-27T18:37:03Z","links":{"resolver":"https://pith.science/pith/RYVLWHJSVSRK6XZGE2CL7YCQ3Q","bundle":"https://pith.science/pith/RYVLWHJSVSRK6XZGE2CL7YCQ3Q/bundle.json","state":"https://pith.science/pith/RYVLWHJSVSRK6XZGE2CL7YCQ3Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RYVLWHJSVSRK6XZGE2CL7YCQ3Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RYVLWHJSVSRK6XZGE2CL7YCQ3Q","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":"16492408159f949ed4dd2b9e09a55aa764824610f29fe9770aaee46b17f49838","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-02-23T18:41:36Z","title_canon_sha256":"f8d53ee72f31adef77c66b239f126d5582a550c10e39b3f96ca9aa3ffbadf00d"},"schema_version":"1.0","source":{"id":"1402.5649","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.5649","created_at":"2026-05-18T01:05:46Z"},{"alias_kind":"arxiv_version","alias_value":"1402.5649v4","created_at":"2026-05-18T01:05:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5649","created_at":"2026-05-18T01:05:46Z"},{"alias_kind":"pith_short_12","alias_value":"RYVLWHJSVSRK","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RYVLWHJSVSRK6XZG","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RYVLWHJS","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:b79fb3b0b0537b96f8e7f50ea21662bbd08de071c54d7a01751a4fab78dc57ca","target":"graph","created_at":"2026-05-18T01:05:46Z","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"},"paper":{"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","authors_text":"I. V. Oseledets, M. V. Rakhuba","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-02-23T18:41:36Z","title":"Fast multidimensional convolution in low-rank formats via cross approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5649","kind":"arxiv","version":4},"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:2cf07cdd166e426310ac7bc061440ce7d2d3d0c340f2a526574d3786b27988be","target":"record","created_at":"2026-05-18T01:05:46Z","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":"16492408159f949ed4dd2b9e09a55aa764824610f29fe9770aaee46b17f49838","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-02-23T18:41:36Z","title_canon_sha256":"f8d53ee72f31adef77c66b239f126d5582a550c10e39b3f96ca9aa3ffbadf00d"},"schema_version":"1.0","source":{"id":"1402.5649","kind":"arxiv","version":4}},"canonical_sha256":"8e2abb1d32aca2af5f262684bfe050dc2a19b042cb1cb63ac6cb8903dd015dee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e2abb1d32aca2af5f262684bfe050dc2a19b042cb1cb63ac6cb8903dd015dee","first_computed_at":"2026-05-18T01:05:46.637294Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:05:46.637294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o8LlIQAwp3yA4weVfRIwVSywgnfqeuXwXgqYwn8FLJP+mRTsvzHGlCPReilhlXpl5YeivGwK83b6xYMV/OwbDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:05:46.637834Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.5649","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2cf07cdd166e426310ac7bc061440ce7d2d3d0c340f2a526574d3786b27988be","sha256:b79fb3b0b0537b96f8e7f50ea21662bbd08de071c54d7a01751a4fab78dc57ca"],"state_sha256":"bed85ad9d75684271aab60274ff8fed77bd81b930ef22d6a3205beaffc5819f8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fzYyGwKtxxWeiJCBHKQURTF/iHvIQ8P0MiPSIIFVNtSGVpUYOupsRaPYCS74/l/YZ60BiMFCDdVikNP5FGQkCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T18:37:03.737344Z","bundle_sha256":"3281e616f6a217ccf0899276ac77adea2a80a3e63a314fe25bc6385416a44a8d"}}