{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5ZP2YXLBUMWK6P4LZVNALI66EQ","short_pith_number":"pith:5ZP2YXLB","schema_version":"1.0","canonical_sha256":"ee5fac5d61a32caf3f8bcd5a05a3de2421de696d00e776681bccd184c0b8ea3a","source":{"kind":"arxiv","id":"1512.01803","version":1},"attestation_state":"computed","paper":{"title":"Chopping a Chebyshev Series","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Jared L. Aurentz, Lloyd N. Trefethen","submitted_at":"2015-12-06T15:47:38Z","abstract_excerpt":"Chebfun and related software projects for numerical computing with functions are based on the idea that at each step of a computation, a function $f(x)$ defined on an interval $[a,b]$ is \"rounded\" to a prescribed precision by constructing a Chebyshev series and chopping it at an appropriate point. Designing a chopping algorithm with the right properties proves to be a surprisingly complex and interesting problem. We describe the chopping algorithm introduced in Chebfun Version 5.3 in 2015 after many years of discussion and the considerations that led to this design."},"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":"1512.01803","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-12-06T15:47:38Z","cross_cats_sorted":[],"title_canon_sha256":"59b10c1757771be59b65b2a6b0e7b17db992472dc86c34851e1a38008f236af6","abstract_canon_sha256":"2beeb52aa41a31fca9f6be6baf9b438e0b45c7340440a283260ca8d40a85d17f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:10.336637Z","signature_b64":"KE3JYnI544wZbtb1KFgQ/QVQf5MVNSc9rqvtuEbQCZqH+51LwbdwonW5n+O1m7sr2OlnbYh6kYWebonq+U9/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee5fac5d61a32caf3f8bcd5a05a3de2421de696d00e776681bccd184c0b8ea3a","last_reissued_at":"2026-05-18T01:25:10.335920Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:10.335920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chopping a Chebyshev Series","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Jared L. Aurentz, Lloyd N. Trefethen","submitted_at":"2015-12-06T15:47:38Z","abstract_excerpt":"Chebfun and related software projects for numerical computing with functions are based on the idea that at each step of a computation, a function $f(x)$ defined on an interval $[a,b]$ is \"rounded\" to a prescribed precision by constructing a Chebyshev series and chopping it at an appropriate point. Designing a chopping algorithm with the right properties proves to be a surprisingly complex and interesting problem. We describe the chopping algorithm introduced in Chebfun Version 5.3 in 2015 after many years of discussion and the considerations that led to this design."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01803","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":"1512.01803","created_at":"2026-05-18T01:25:10.336052+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.01803v1","created_at":"2026-05-18T01:25:10.336052+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01803","created_at":"2026-05-18T01:25:10.336052+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ZP2YXLBUMWK","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ZP2YXLBUMWK6P4L","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ZP2YXLB","created_at":"2026-05-18T12:29:07.941421+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/5ZP2YXLBUMWK6P4LZVNALI66EQ","json":"https://pith.science/pith/5ZP2YXLBUMWK6P4LZVNALI66EQ.json","graph_json":"https://pith.science/api/pith-number/5ZP2YXLBUMWK6P4LZVNALI66EQ/graph.json","events_json":"https://pith.science/api/pith-number/5ZP2YXLBUMWK6P4LZVNALI66EQ/events.json","paper":"https://pith.science/paper/5ZP2YXLB"},"agent_actions":{"view_html":"https://pith.science/pith/5ZP2YXLBUMWK6P4LZVNALI66EQ","download_json":"https://pith.science/pith/5ZP2YXLBUMWK6P4LZVNALI66EQ.json","view_paper":"https://pith.science/paper/5ZP2YXLB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.01803&json=true","fetch_graph":"https://pith.science/api/pith-number/5ZP2YXLBUMWK6P4LZVNALI66EQ/graph.json","fetch_events":"https://pith.science/api/pith-number/5ZP2YXLBUMWK6P4LZVNALI66EQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ZP2YXLBUMWK6P4LZVNALI66EQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ZP2YXLBUMWK6P4LZVNALI66EQ/action/storage_attestation","attest_author":"https://pith.science/pith/5ZP2YXLBUMWK6P4LZVNALI66EQ/action/author_attestation","sign_citation":"https://pith.science/pith/5ZP2YXLBUMWK6P4LZVNALI66EQ/action/citation_signature","submit_replication":"https://pith.science/pith/5ZP2YXLBUMWK6P4LZVNALI66EQ/action/replication_record"}},"created_at":"2026-05-18T01:25:10.336052+00:00","updated_at":"2026-05-18T01:25:10.336052+00:00"}