{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EXHGEIP45HK4BZAO36UFXG4AI3","short_pith_number":"pith:EXHGEIP4","schema_version":"1.0","canonical_sha256":"25ce6221fce9d5c0e40edfa85b9b8046fe7a73757181fdbd39c5bc30f58210f3","source":{"kind":"arxiv","id":"1404.4768","version":1},"attestation_state":"computed","paper":{"title":"Nearly Optimal Computations with Structured Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Elias Tsigaridas (LIP6, Inria Paris-Rocquencourt), Victor Y. Pan","submitted_at":"2014-04-18T12:43:34Z","abstract_excerpt":"We estimate the Boolean complexity of multiplication of structured matrices by a vector and the solution of nonsingular linear systems of equations with these matrices. We study four basic most popular classes, that is, Toeplitz, Hankel, Cauchy and Van-der-monde matrices, for which the cited computational problems are equivalent to the task of polynomial multiplication and division and polynomial and rational multipoint evaluation and interpolation. The Boolean cost estimates for the latter problems have been obtained by Kirrinnis in \\cite{kirrinnis-joc-1998}, except for rational interpolation"},"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":"1404.4768","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2014-04-18T12:43:34Z","cross_cats_sorted":[],"title_canon_sha256":"a9bd62db1f1111bf323930a118264ba03fc5b229346e9dcb85189e74cc4ae319","abstract_canon_sha256":"2f08cca0523eedaf88818814863f41c6648748d006f237ce76e66a3b8d396460"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:55.027943Z","signature_b64":"XdABSrnK1EN3WRuHBW/4MVfPZxhOeRqWmL8n4ZCEo5xRFN4FtcAW8MsRv0dTSi/QCItG9/+fJfu8PhYGGIjKCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25ce6221fce9d5c0e40edfa85b9b8046fe7a73757181fdbd39c5bc30f58210f3","last_reissued_at":"2026-05-18T02:53:55.027119Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:55.027119Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearly Optimal Computations with Structured Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Elias Tsigaridas (LIP6, Inria Paris-Rocquencourt), Victor Y. Pan","submitted_at":"2014-04-18T12:43:34Z","abstract_excerpt":"We estimate the Boolean complexity of multiplication of structured matrices by a vector and the solution of nonsingular linear systems of equations with these matrices. We study four basic most popular classes, that is, Toeplitz, Hankel, Cauchy and Van-der-monde matrices, for which the cited computational problems are equivalent to the task of polynomial multiplication and division and polynomial and rational multipoint evaluation and interpolation. The Boolean cost estimates for the latter problems have been obtained by Kirrinnis in \\cite{kirrinnis-joc-1998}, except for rational interpolation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4768","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":"1404.4768","created_at":"2026-05-18T02:53:55.027239+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.4768v1","created_at":"2026-05-18T02:53:55.027239+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4768","created_at":"2026-05-18T02:53:55.027239+00:00"},{"alias_kind":"pith_short_12","alias_value":"EXHGEIP45HK4","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"EXHGEIP45HK4BZAO","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"EXHGEIP4","created_at":"2026-05-18T12:28:28.263976+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/EXHGEIP45HK4BZAO36UFXG4AI3","json":"https://pith.science/pith/EXHGEIP45HK4BZAO36UFXG4AI3.json","graph_json":"https://pith.science/api/pith-number/EXHGEIP45HK4BZAO36UFXG4AI3/graph.json","events_json":"https://pith.science/api/pith-number/EXHGEIP45HK4BZAO36UFXG4AI3/events.json","paper":"https://pith.science/paper/EXHGEIP4"},"agent_actions":{"view_html":"https://pith.science/pith/EXHGEIP45HK4BZAO36UFXG4AI3","download_json":"https://pith.science/pith/EXHGEIP45HK4BZAO36UFXG4AI3.json","view_paper":"https://pith.science/paper/EXHGEIP4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.4768&json=true","fetch_graph":"https://pith.science/api/pith-number/EXHGEIP45HK4BZAO36UFXG4AI3/graph.json","fetch_events":"https://pith.science/api/pith-number/EXHGEIP45HK4BZAO36UFXG4AI3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EXHGEIP45HK4BZAO36UFXG4AI3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EXHGEIP45HK4BZAO36UFXG4AI3/action/storage_attestation","attest_author":"https://pith.science/pith/EXHGEIP45HK4BZAO36UFXG4AI3/action/author_attestation","sign_citation":"https://pith.science/pith/EXHGEIP45HK4BZAO36UFXG4AI3/action/citation_signature","submit_replication":"https://pith.science/pith/EXHGEIP45HK4BZAO36UFXG4AI3/action/replication_record"}},"created_at":"2026-05-18T02:53:55.027239+00:00","updated_at":"2026-05-18T02:53:55.027239+00:00"}