{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LUNZHV32FF3LNESQB74S7YKOYV","short_pith_number":"pith:LUNZHV32","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"},"canonical_sha256":"5d1b93d77a2976b692500ff92fe14ec57646aec0733eaadb3a1734b7683eb05f","source":{"kind":"arxiv","id":"1711.08453","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08453","created_at":"2026-05-18T00:29:49Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08453v1","created_at":"2026-05-18T00:29:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08453","created_at":"2026-05-18T00:29:49Z"},{"alias_kind":"pith_short_12","alias_value":"LUNZHV32FF3L","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LUNZHV32FF3LNESQ","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LUNZHV32","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LUNZHV32FF3LNESQB74S7YKOYV","target":"record","payload":{"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"},"canonical_sha256":"5d1b93d77a2976b692500ff92fe14ec57646aec0733eaadb3a1734b7683eb05f","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"},"source_kind":"arxiv","source_id":"1711.08453","source_version":1,"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-18T00:29:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J9sUdg9O7zgbRd5BKZJsXaXFX8T20stNlTUZy7QuFI7XfI/2CP4SkLP0/4o+1PcjwUcMDuLYttAkp1tVMAIuCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T15:16:30.640070Z"},"content_sha256":"8a34c8e606178de07dd6bc4850013a26d849874dd8c1059c43f950464ea90ca9","schema_version":"1.0","event_id":"sha256:8a34c8e606178de07dd6bc4850013a26d849874dd8c1059c43f950464ea90ca9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LUNZHV32FF3LNESQB74S7YKOYV","target":"graph","payload":{"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"},"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-18T00:29:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HLr12w7MGzGqtU2lORVQvtT0dJC5TzxF21MYj5zPf2RiNKQWQAboecObuApm7DP9iO9hLKAintDRmy62f6h+DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T15:16:30.640480Z"},"content_sha256":"3a0ac9289b1c4a1c49d15edd0404db2e2feddfc0d67d4a4ef924c79d5e600ad6","schema_version":"1.0","event_id":"sha256:3a0ac9289b1c4a1c49d15edd0404db2e2feddfc0d67d4a4ef924c79d5e600ad6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LUNZHV32FF3LNESQB74S7YKOYV/bundle.json","state_url":"https://pith.science/pith/LUNZHV32FF3LNESQB74S7YKOYV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LUNZHV32FF3LNESQB74S7YKOYV/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-05-24T15:16:30Z","links":{"resolver":"https://pith.science/pith/LUNZHV32FF3LNESQB74S7YKOYV","bundle":"https://pith.science/pith/LUNZHV32FF3LNESQB74S7YKOYV/bundle.json","state":"https://pith.science/pith/LUNZHV32FF3LNESQB74S7YKOYV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LUNZHV32FF3LNESQB74S7YKOYV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LUNZHV32FF3LNESQB74S7YKOYV","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":"87b03e390226d9541207feb22612d88dc822a1f86860ff26059cbe909a905ab0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-11-22T18:55:48Z","title_canon_sha256":"cce8c9ba2fa4068e2b600957d3d20b922ca9e33c2f5b6d3bb1adb9afd99e4207"},"schema_version":"1.0","source":{"id":"1711.08453","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08453","created_at":"2026-05-18T00:29:49Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08453v1","created_at":"2026-05-18T00:29:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08453","created_at":"2026-05-18T00:29:49Z"},{"alias_kind":"pith_short_12","alias_value":"LUNZHV32FF3L","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LUNZHV32FF3LNESQ","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LUNZHV32","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:3a0ac9289b1c4a1c49d15edd0404db2e2feddfc0d67d4a4ef924c79d5e600ad6","target":"graph","created_at":"2026-05-18T00:29:49Z","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":"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 ","authors_text":"Ramani Duraiswami, Samuel F. Potter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-11-22T18:55:48Z","title":"Fast and Stable Pascal Matrix Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08453","kind":"arxiv","version":1},"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:8a34c8e606178de07dd6bc4850013a26d849874dd8c1059c43f950464ea90ca9","target":"record","created_at":"2026-05-18T00:29:49Z","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":"87b03e390226d9541207feb22612d88dc822a1f86860ff26059cbe909a905ab0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-11-22T18:55:48Z","title_canon_sha256":"cce8c9ba2fa4068e2b600957d3d20b922ca9e33c2f5b6d3bb1adb9afd99e4207"},"schema_version":"1.0","source":{"id":"1711.08453","kind":"arxiv","version":1}},"canonical_sha256":"5d1b93d77a2976b692500ff92fe14ec57646aec0733eaadb3a1734b7683eb05f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d1b93d77a2976b692500ff92fe14ec57646aec0733eaadb3a1734b7683eb05f","first_computed_at":"2026-05-18T00:29:49.746435Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:49.746435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sppa/hmHzvEHZQcKGK9zDMcqpkCzJS7A/RNcPLnHPXgpBK8Myq/NszXdyKyzWk7YHHm0818w0iQbJSJwIGMoCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:49.746991Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.08453","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a34c8e606178de07dd6bc4850013a26d849874dd8c1059c43f950464ea90ca9","sha256:3a0ac9289b1c4a1c49d15edd0404db2e2feddfc0d67d4a4ef924c79d5e600ad6"],"state_sha256":"57e63f20ea978e4cd1f593bf4b6f723c4a18c2553fbc460d9c7fc2b982c44dc7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"39NwF4Ur9YqsotVzBbX3S3SyPhpQHwrH2h8Hbg3AJ1dS8Mw4mpLqprUkwOfCH9pkDh2wq+sVwIBqXh19TuQjBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T15:16:30.642881Z","bundle_sha256":"c996e0475f94d3bacbc10bdbd54b0d8efa8ee738cda0d26c63593c2494210071"}}