{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:74QDBEOCSCUS74LSRBN4TF7R6I","short_pith_number":"pith:74QDBEOC","schema_version":"1.0","canonical_sha256":"ff203091c290a92ff172885bc997f1f21d93e285c8c1cee9764ccfceab714dcd","source":{"kind":"arxiv","id":"1401.6238","version":1},"attestation_state":"computed","paper":{"title":"Fast Hankel Tensor-Vector Products and Application to Exponential Data Fitting","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Liqun Qi, Weiyang Ding, Yimin Wei","submitted_at":"2014-01-24T01:43:20Z","abstract_excerpt":"This paper is contributed to a fast algorithm for Hankel tensor-vector products. For this purpose, we first discuss a special class of Hankel tensors that can be diagonalized by the Fourier matrix, which is called \\emph{anti-circulant} tensors. Then we obtain a fast algorithm for Hankel tensor-vector products by embedding a Hankel tensor into a larger anti-circulant tensor. The computational complexity is about $\\mathcal{O}(m^2 n \\log mn)$ for a square Hankel tensor of order $m$ and dimension $n$, and the numerical examples also show the efficiency of this scheme. Moreover, the block version f"},"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":"1401.6238","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.NA","submitted_at":"2014-01-24T01:43:20Z","cross_cats_sorted":[],"title_canon_sha256":"23f69ed0d91db953194e505fa760d3baeb4907db3147289d87c0fe75756cc94d","abstract_canon_sha256":"d8eae7144b699578ec2fd736d236ba225f211a501a4661e75155dcc6f6536cbc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:12.775137Z","signature_b64":"Y/XLzPWGu+qKwehXh/TbNbfZllTr1zYsXeRQijEW0E3zBWJI27niWVAVwZ0hL6B67iT5HNrspA1xHug6dG73BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff203091c290a92ff172885bc997f1f21d93e285c8c1cee9764ccfceab714dcd","last_reissued_at":"2026-05-18T03:01:12.774327Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:12.774327Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Hankel Tensor-Vector Products and Application to Exponential Data Fitting","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Liqun Qi, Weiyang Ding, Yimin Wei","submitted_at":"2014-01-24T01:43:20Z","abstract_excerpt":"This paper is contributed to a fast algorithm for Hankel tensor-vector products. For this purpose, we first discuss a special class of Hankel tensors that can be diagonalized by the Fourier matrix, which is called \\emph{anti-circulant} tensors. Then we obtain a fast algorithm for Hankel tensor-vector products by embedding a Hankel tensor into a larger anti-circulant tensor. The computational complexity is about $\\mathcal{O}(m^2 n \\log mn)$ for a square Hankel tensor of order $m$ and dimension $n$, and the numerical examples also show the efficiency of this scheme. Moreover, the block version f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6238","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":"1401.6238","created_at":"2026-05-18T03:01:12.774499+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.6238v1","created_at":"2026-05-18T03:01:12.774499+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6238","created_at":"2026-05-18T03:01:12.774499+00:00"},{"alias_kind":"pith_short_12","alias_value":"74QDBEOCSCUS","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"74QDBEOCSCUS74LS","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"74QDBEOC","created_at":"2026-05-18T12:28:16.859392+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/74QDBEOCSCUS74LSRBN4TF7R6I","json":"https://pith.science/pith/74QDBEOCSCUS74LSRBN4TF7R6I.json","graph_json":"https://pith.science/api/pith-number/74QDBEOCSCUS74LSRBN4TF7R6I/graph.json","events_json":"https://pith.science/api/pith-number/74QDBEOCSCUS74LSRBN4TF7R6I/events.json","paper":"https://pith.science/paper/74QDBEOC"},"agent_actions":{"view_html":"https://pith.science/pith/74QDBEOCSCUS74LSRBN4TF7R6I","download_json":"https://pith.science/pith/74QDBEOCSCUS74LSRBN4TF7R6I.json","view_paper":"https://pith.science/paper/74QDBEOC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.6238&json=true","fetch_graph":"https://pith.science/api/pith-number/74QDBEOCSCUS74LSRBN4TF7R6I/graph.json","fetch_events":"https://pith.science/api/pith-number/74QDBEOCSCUS74LSRBN4TF7R6I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/74QDBEOCSCUS74LSRBN4TF7R6I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/74QDBEOCSCUS74LSRBN4TF7R6I/action/storage_attestation","attest_author":"https://pith.science/pith/74QDBEOCSCUS74LSRBN4TF7R6I/action/author_attestation","sign_citation":"https://pith.science/pith/74QDBEOCSCUS74LSRBN4TF7R6I/action/citation_signature","submit_replication":"https://pith.science/pith/74QDBEOCSCUS74LSRBN4TF7R6I/action/replication_record"}},"created_at":"2026-05-18T03:01:12.774499+00:00","updated_at":"2026-05-18T03:01:12.774499+00:00"}