{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LUNZHV32FF3LNESQB74S7YKOYV","short_pith_number":"pith:LUNZHV32","schema_version":"1.0","canonical_sha256":"5d1b93d77a2976b692500ff92fe14ec57646aec0733eaadb3a1734b7683eb05f","source":{"kind":"arxiv","id":"1711.08453","version":1},"attestation_state":"computed","paper":{"title":"Fast and Stable Pascal Matrix Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"Ramani Duraiswami, Samuel F. Potter","submitted_at":"2017-11-22T18:55:48Z","abstract_excerpt":"In this paper, we derive a family of fast and stable algorithms for multiplying and inverting $n \\times n$ Pascal matrices that run in $O(n log^2 n)$ time and are closely related to De Casteljau's algorithm for B\\'ezier curve evaluation. These algorithms use a recursive factorization of the triangular Pascal matrices and improve upon the cripplingly unstable $O(n log n)$ fast Fourier transform-based algorithms which involve a Toeplitz matrix factorization. We conduct numerical experiments which establish the speed and stability of our algorithm, as well as the poor performance of the Toeplitz "},"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":"1711.08453","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-11-22T18:55:48Z","cross_cats_sorted":[],"title_canon_sha256":"cce8c9ba2fa4068e2b600957d3d20b922ca9e33c2f5b6d3bb1adb9afd99e4207","abstract_canon_sha256":"87b03e390226d9541207feb22612d88dc822a1f86860ff26059cbe909a905ab0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:49.746991Z","signature_b64":"sppa/hmHzvEHZQcKGK9zDMcqpkCzJS7A/RNcPLnHPXgpBK8Myq/NszXdyKyzWk7YHHm0818w0iQbJSJwIGMoCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d1b93d77a2976b692500ff92fe14ec57646aec0733eaadb3a1734b7683eb05f","last_reissued_at":"2026-05-18T00:29:49.746435Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:49.746435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and Stable Pascal Matrix Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"Ramani Duraiswami, Samuel F. Potter","submitted_at":"2017-11-22T18:55:48Z","abstract_excerpt":"In this paper, we derive a family of fast and stable algorithms for multiplying and inverting $n \\times n$ Pascal matrices that run in $O(n log^2 n)$ time and are closely related to De Casteljau's algorithm for B\\'ezier curve evaluation. These algorithms use a recursive factorization of the triangular Pascal matrices and improve upon the cripplingly unstable $O(n log n)$ fast Fourier transform-based algorithms which involve a Toeplitz matrix factorization. We conduct numerical experiments which establish the speed and stability of our algorithm, as well as the poor performance of the Toeplitz "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08453","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":"1711.08453","created_at":"2026-05-18T00:29:49.746512+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.08453v1","created_at":"2026-05-18T00:29:49.746512+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08453","created_at":"2026-05-18T00:29:49.746512+00:00"},{"alias_kind":"pith_short_12","alias_value":"LUNZHV32FF3L","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LUNZHV32FF3LNESQ","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LUNZHV32","created_at":"2026-05-18T12:31:28.150371+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/LUNZHV32FF3LNESQB74S7YKOYV","json":"https://pith.science/pith/LUNZHV32FF3LNESQB74S7YKOYV.json","graph_json":"https://pith.science/api/pith-number/LUNZHV32FF3LNESQB74S7YKOYV/graph.json","events_json":"https://pith.science/api/pith-number/LUNZHV32FF3LNESQB74S7YKOYV/events.json","paper":"https://pith.science/paper/LUNZHV32"},"agent_actions":{"view_html":"https://pith.science/pith/LUNZHV32FF3LNESQB74S7YKOYV","download_json":"https://pith.science/pith/LUNZHV32FF3LNESQB74S7YKOYV.json","view_paper":"https://pith.science/paper/LUNZHV32","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.08453&json=true","fetch_graph":"https://pith.science/api/pith-number/LUNZHV32FF3LNESQB74S7YKOYV/graph.json","fetch_events":"https://pith.science/api/pith-number/LUNZHV32FF3LNESQB74S7YKOYV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LUNZHV32FF3LNESQB74S7YKOYV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LUNZHV32FF3LNESQB74S7YKOYV/action/storage_attestation","attest_author":"https://pith.science/pith/LUNZHV32FF3LNESQB74S7YKOYV/action/author_attestation","sign_citation":"https://pith.science/pith/LUNZHV32FF3LNESQB74S7YKOYV/action/citation_signature","submit_replication":"https://pith.science/pith/LUNZHV32FF3LNESQB74S7YKOYV/action/replication_record"}},"created_at":"2026-05-18T00:29:49.746512+00:00","updated_at":"2026-05-18T00:29:49.746512+00:00"}