{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AHIR4Y4V6J4Z6FTP6VUPOE4QH5","short_pith_number":"pith:AHIR4Y4V","schema_version":"1.0","canonical_sha256":"01d11e6395f2799f166ff568f713903f770613643c841f6c51a6fffe3789b39f","source":{"kind":"arxiv","id":"1705.06101","version":1},"attestation_state":"computed","paper":{"title":"High order fast algorithm for the Caputo fractional derivative","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Jizu Huang, Kun Wang","submitted_at":"2017-05-17T11:41:32Z","abstract_excerpt":"In the paper, we present a high order fast algorithm with almost optimum memory for the Caputo fractional derivative, which can be expressed as a convolution of $u'(t)$ with the kernel $(t_n-t)^{-\\alpha}$. In the fast algorithm, the interval $[0,t_{n-1}]$ is split into nonuniform subintervals. The number of the subintervals is in the order of $\\log n$ at the $n$-th time step. The fractional kernel function is approximated by a polynomial function of $K$-th degree with a uniform absolute error on each subinterval. We save $K+1$ integrals on each subinterval, which can be written as a convolutio"},"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":"1705.06101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-17T11:41:32Z","cross_cats_sorted":[],"title_canon_sha256":"c07c57415a65b3b353cb0924c9960f2f844c4dd25eea38e562a95f3373727116","abstract_canon_sha256":"e2aec8095b94f674503d7199bc92419672c2fd5594496b1c75f259cc111527dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:19.011602Z","signature_b64":"HKEDw6n8ff4kr9XUzY+m9KyYfuZgGdUXN1JBCpR5048dvHy/rkYuhirH9KYK7d+0WXP9qUUMIQ6P0RHhU7pHCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01d11e6395f2799f166ff568f713903f770613643c841f6c51a6fffe3789b39f","last_reissued_at":"2026-05-18T00:44:19.011155Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:19.011155Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High order fast algorithm for the Caputo fractional derivative","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Jizu Huang, Kun Wang","submitted_at":"2017-05-17T11:41:32Z","abstract_excerpt":"In the paper, we present a high order fast algorithm with almost optimum memory for the Caputo fractional derivative, which can be expressed as a convolution of $u'(t)$ with the kernel $(t_n-t)^{-\\alpha}$. In the fast algorithm, the interval $[0,t_{n-1}]$ is split into nonuniform subintervals. The number of the subintervals is in the order of $\\log n$ at the $n$-th time step. The fractional kernel function is approximated by a polynomial function of $K$-th degree with a uniform absolute error on each subinterval. We save $K+1$ integrals on each subinterval, which can be written as a convolutio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06101","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":"1705.06101","created_at":"2026-05-18T00:44:19.011223+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.06101v1","created_at":"2026-05-18T00:44:19.011223+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06101","created_at":"2026-05-18T00:44:19.011223+00:00"},{"alias_kind":"pith_short_12","alias_value":"AHIR4Y4V6J4Z","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AHIR4Y4V6J4Z6FTP","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AHIR4Y4V","created_at":"2026-05-18T12:31:05.417338+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/AHIR4Y4V6J4Z6FTP6VUPOE4QH5","json":"https://pith.science/pith/AHIR4Y4V6J4Z6FTP6VUPOE4QH5.json","graph_json":"https://pith.science/api/pith-number/AHIR4Y4V6J4Z6FTP6VUPOE4QH5/graph.json","events_json":"https://pith.science/api/pith-number/AHIR4Y4V6J4Z6FTP6VUPOE4QH5/events.json","paper":"https://pith.science/paper/AHIR4Y4V"},"agent_actions":{"view_html":"https://pith.science/pith/AHIR4Y4V6J4Z6FTP6VUPOE4QH5","download_json":"https://pith.science/pith/AHIR4Y4V6J4Z6FTP6VUPOE4QH5.json","view_paper":"https://pith.science/paper/AHIR4Y4V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.06101&json=true","fetch_graph":"https://pith.science/api/pith-number/AHIR4Y4V6J4Z6FTP6VUPOE4QH5/graph.json","fetch_events":"https://pith.science/api/pith-number/AHIR4Y4V6J4Z6FTP6VUPOE4QH5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AHIR4Y4V6J4Z6FTP6VUPOE4QH5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AHIR4Y4V6J4Z6FTP6VUPOE4QH5/action/storage_attestation","attest_author":"https://pith.science/pith/AHIR4Y4V6J4Z6FTP6VUPOE4QH5/action/author_attestation","sign_citation":"https://pith.science/pith/AHIR4Y4V6J4Z6FTP6VUPOE4QH5/action/citation_signature","submit_replication":"https://pith.science/pith/AHIR4Y4V6J4Z6FTP6VUPOE4QH5/action/replication_record"}},"created_at":"2026-05-18T00:44:19.011223+00:00","updated_at":"2026-05-18T00:44:19.011223+00:00"}