{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WYIE66HRL2JSILYNWBBSJTXBPU","short_pith_number":"pith:WYIE66HR","schema_version":"1.0","canonical_sha256":"b6104f78f15e93242f0db04324cee17d22ea7b2700bbac3fc0c54cb4bf4b6604","source":{"kind":"arxiv","id":"1602.07008","version":1},"attestation_state":"computed","paper":{"title":"Synthesis of fast multiplication algorithms for arbitrary tensors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Pavel Dourbal","submitted_at":"2016-02-23T01:27:54Z","abstract_excerpt":"A method of fast linear transform algorithm synthesis for an arbitrary tensor, matrix, or vector is proposed. The method is based on factorization of a tensor and using the factors for building computational structures performing fast tensor - vector multiplication on a computer or dedicated hardware platform."},"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":"1602.07008","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-23T01:27:54Z","cross_cats_sorted":[],"title_canon_sha256":"c67c5115648faf269a141f3933de65f96524db4d4a4c81171a552d1ae256e4ba","abstract_canon_sha256":"beb4a3499e08e3f0d8fd5953bb4e3bc32d0f1267f1fe40a689aaa3e200324a91"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:07.457948Z","signature_b64":"CjVRvSyzZQAGbZ0Dm0mo+RB2K8qttXVF70+JoCjn2c05jq7f1EU7FxuXqP9YwSFvgGoPliez0wyAXo59IgfpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6104f78f15e93242f0db04324cee17d22ea7b2700bbac3fc0c54cb4bf4b6604","last_reissued_at":"2026-05-18T01:20:07.457369Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:07.457369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Synthesis of fast multiplication algorithms for arbitrary tensors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Pavel Dourbal","submitted_at":"2016-02-23T01:27:54Z","abstract_excerpt":"A method of fast linear transform algorithm synthesis for an arbitrary tensor, matrix, or vector is proposed. The method is based on factorization of a tensor and using the factors for building computational structures performing fast tensor - vector multiplication on a computer or dedicated hardware platform."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07008","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":""},"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":"1602.07008","created_at":"2026-05-18T01:20:07.457450+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.07008v1","created_at":"2026-05-18T01:20:07.457450+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07008","created_at":"2026-05-18T01:20:07.457450+00:00"},{"alias_kind":"pith_short_12","alias_value":"WYIE66HRL2JS","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"WYIE66HRL2JSILYN","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"WYIE66HR","created_at":"2026-05-18T12:30:51.357362+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/WYIE66HRL2JSILYNWBBSJTXBPU","json":"https://pith.science/pith/WYIE66HRL2JSILYNWBBSJTXBPU.json","graph_json":"https://pith.science/api/pith-number/WYIE66HRL2JSILYNWBBSJTXBPU/graph.json","events_json":"https://pith.science/api/pith-number/WYIE66HRL2JSILYNWBBSJTXBPU/events.json","paper":"https://pith.science/paper/WYIE66HR"},"agent_actions":{"view_html":"https://pith.science/pith/WYIE66HRL2JSILYNWBBSJTXBPU","download_json":"https://pith.science/pith/WYIE66HRL2JSILYNWBBSJTXBPU.json","view_paper":"https://pith.science/paper/WYIE66HR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.07008&json=true","fetch_graph":"https://pith.science/api/pith-number/WYIE66HRL2JSILYNWBBSJTXBPU/graph.json","fetch_events":"https://pith.science/api/pith-number/WYIE66HRL2JSILYNWBBSJTXBPU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WYIE66HRL2JSILYNWBBSJTXBPU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WYIE66HRL2JSILYNWBBSJTXBPU/action/storage_attestation","attest_author":"https://pith.science/pith/WYIE66HRL2JSILYNWBBSJTXBPU/action/author_attestation","sign_citation":"https://pith.science/pith/WYIE66HRL2JSILYNWBBSJTXBPU/action/citation_signature","submit_replication":"https://pith.science/pith/WYIE66HRL2JSILYNWBBSJTXBPU/action/replication_record"}},"created_at":"2026-05-18T01:20:07.457450+00:00","updated_at":"2026-05-18T01:20:07.457450+00:00"}