{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:4YHTLPVHUHLNKEPTIO4RT47X2A","short_pith_number":"pith:4YHTLPVH","schema_version":"1.0","canonical_sha256":"e60f35bea7a1d6d511f343b919f3f7d03e5c28374cb1bff62eaf9b3b9c6b09c2","source":{"kind":"arxiv","id":"cs/0307009","version":1},"attestation_state":"computed","paper":{"title":"Finding the \"truncated\" polynomial that is closest to a function","license":"","headline":"","cross_cats":[],"primary_cat":"cs.MS","authors_text":"Jean-Michel Muller, Nicolas Brisebarre","submitted_at":"2003-07-04T13:15:09Z","abstract_excerpt":"When implementing regular enough functions (e.g., elementary or special functions) on a computing system, we frequently use polynomial approximations. In most cases, the polynomial that best approximates (for a given distance and in a given interval) a function has coefficients that are not exactly representable with a finite number of bits. And yet, the polynomial approximations that are actually implemented do have coefficients that are represented with a finite - and sometimes small - number of bits: this is due to the finiteness of the floating-point representations (for software implement"},"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":"cs/0307009","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.MS","submitted_at":"2003-07-04T13:15:09Z","cross_cats_sorted":[],"title_canon_sha256":"e7576933a8f0baa57e7673aac92d0c226c670abcc01d94057ed61309cce5f433","abstract_canon_sha256":"4f20decb37e878ce26f7134cbc0df1f4dba47e63d6a541d9e7b9790c8d35dcca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:24:35.082731Z","signature_b64":"dmLCEsxiXtEuyATLSAcELLnWGia6X141TQrpCJY8vFkvn3XaU5hfwE0LdrhtogkgFEH5peFLkKFOS8+9GGP0Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e60f35bea7a1d6d511f343b919f3f7d03e5c28374cb1bff62eaf9b3b9c6b09c2","last_reissued_at":"2026-07-04T14:24:35.082230Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:24:35.082230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding the \"truncated\" polynomial that is closest to a function","license":"","headline":"","cross_cats":[],"primary_cat":"cs.MS","authors_text":"Jean-Michel Muller, Nicolas Brisebarre","submitted_at":"2003-07-04T13:15:09Z","abstract_excerpt":"When implementing regular enough functions (e.g., elementary or special functions) on a computing system, we frequently use polynomial approximations. In most cases, the polynomial that best approximates (for a given distance and in a given interval) a function has coefficients that are not exactly representable with a finite number of bits. And yet, the polynomial approximations that are actually implemented do have coefficients that are represented with a finite - and sometimes small - number of bits: this is due to the finiteness of the floating-point representations (for software implement"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0307009","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0307009/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"cs/0307009","created_at":"2026-07-04T14:24:35.082319+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0307009v1","created_at":"2026-07-04T14:24:35.082319+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0307009","created_at":"2026-07-04T14:24:35.082319+00:00"},{"alias_kind":"pith_short_12","alias_value":"4YHTLPVHUHLN","created_at":"2026-07-04T14:24:35.082319+00:00"},{"alias_kind":"pith_short_16","alias_value":"4YHTLPVHUHLNKEPT","created_at":"2026-07-04T14:24:35.082319+00:00"},{"alias_kind":"pith_short_8","alias_value":"4YHTLPVH","created_at":"2026-07-04T14:24:35.082319+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/4YHTLPVHUHLNKEPTIO4RT47X2A","json":"https://pith.science/pith/4YHTLPVHUHLNKEPTIO4RT47X2A.json","graph_json":"https://pith.science/api/pith-number/4YHTLPVHUHLNKEPTIO4RT47X2A/graph.json","events_json":"https://pith.science/api/pith-number/4YHTLPVHUHLNKEPTIO4RT47X2A/events.json","paper":"https://pith.science/paper/4YHTLPVH"},"agent_actions":{"view_html":"https://pith.science/pith/4YHTLPVHUHLNKEPTIO4RT47X2A","download_json":"https://pith.science/pith/4YHTLPVHUHLNKEPTIO4RT47X2A.json","view_paper":"https://pith.science/paper/4YHTLPVH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0307009&json=true","fetch_graph":"https://pith.science/api/pith-number/4YHTLPVHUHLNKEPTIO4RT47X2A/graph.json","fetch_events":"https://pith.science/api/pith-number/4YHTLPVHUHLNKEPTIO4RT47X2A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4YHTLPVHUHLNKEPTIO4RT47X2A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4YHTLPVHUHLNKEPTIO4RT47X2A/action/storage_attestation","attest_author":"https://pith.science/pith/4YHTLPVHUHLNKEPTIO4RT47X2A/action/author_attestation","sign_citation":"https://pith.science/pith/4YHTLPVHUHLNKEPTIO4RT47X2A/action/citation_signature","submit_replication":"https://pith.science/pith/4YHTLPVHUHLNKEPTIO4RT47X2A/action/replication_record"}},"created_at":"2026-07-04T14:24:35.082319+00:00","updated_at":"2026-07-04T14:24:35.082319+00:00"}