{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:XCMCXFF4TKSVDPWL3C6LZYHV5W","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":"ddbf75dcb9815362a89c39193e28c554484367431f092c9ff2e5bbe5d31b3ea5","cross_cats_sorted":["cs.NA","math.FA","math.OC"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.NA","submitted_at":"2024-03-24T23:36:42Z","title_canon_sha256":"49904f30e66dbb1780e631fdbfe5e2e335130952b437361e2de9090405303cb7"},"schema_version":"1.0","source":{"id":"2403.16330","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.16330","created_at":"2026-07-05T11:32:14Z"},{"alias_kind":"arxiv_version","alias_value":"2403.16330v3","created_at":"2026-07-05T11:32:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.16330","created_at":"2026-07-05T11:32:14Z"},{"alias_kind":"pith_short_12","alias_value":"XCMCXFF4TKSV","created_at":"2026-07-05T11:32:14Z"},{"alias_kind":"pith_short_16","alias_value":"XCMCXFF4TKSVDPWL","created_at":"2026-07-05T11:32:14Z"},{"alias_kind":"pith_short_8","alias_value":"XCMCXFF4","created_at":"2026-07-05T11:32:14Z"}],"graph_snapshots":[{"event_id":"sha256:483117faa268f0d31b05c14fd7fe0a717e9d6491456223c0aa49af600e6b63c5","target":"graph","created_at":"2026-07-05T11:32:14Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2403.16330/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We address the problem of the best uniform approximation by linear combinations of a finite system of functions. If the system is Chebyshev and the problem is unconstrained, then the classical Remez algorithm provides a fast and precise solution. For non-Chebyshev systems, this problem may offer a great resistance. The same happens to approximations under linear constraints. We propose a solution by modifying the concept of alternance and of the Remez iterative procedure. A criterion of the best approximation is proved and the full set of polynomials of best approximation (which may not be uni","authors_text":"Rinat Kamalov, Vladimir Yu. Protasov","cross_cats":["cs.NA","math.FA","math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.NA","submitted_at":"2024-03-24T23:36:42Z","title":"Chebyshev approximation by non-Chebyshev systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.16330","kind":"arxiv","version":3},"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:ff4d0d222bd3f26ab49ce799a3d0663748c4e991ae20b70ee5c49c0a28683ca2","target":"record","created_at":"2026-07-05T11:32:14Z","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":"ddbf75dcb9815362a89c39193e28c554484367431f092c9ff2e5bbe5d31b3ea5","cross_cats_sorted":["cs.NA","math.FA","math.OC"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.NA","submitted_at":"2024-03-24T23:36:42Z","title_canon_sha256":"49904f30e66dbb1780e631fdbfe5e2e335130952b437361e2de9090405303cb7"},"schema_version":"1.0","source":{"id":"2403.16330","kind":"arxiv","version":3}},"canonical_sha256":"b8982b94bc9aa551becbd8bcbce0f5edb2a4f05903d95da7846f314031edf0ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8982b94bc9aa551becbd8bcbce0f5edb2a4f05903d95da7846f314031edf0ad","first_computed_at":"2026-07-05T11:32:14.742053Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:32:14.742053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vTC1vGIlApKdqA8OvYtamd3fGXJW27WhBNOfRvvApsYnz2UQYBeS95Ty540Id6bTGbw2EImNOR9DwPPoS94MBw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:32:14.742627Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.16330","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff4d0d222bd3f26ab49ce799a3d0663748c4e991ae20b70ee5c49c0a28683ca2","sha256:483117faa268f0d31b05c14fd7fe0a717e9d6491456223c0aa49af600e6b63c5"],"state_sha256":"ccb095c83cfbed454bdb944d6f844d5ab6af36b015b2c116f83d2e6db0a14dfa"}