{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HKWICPICPUW2M7E6YATJDPP67B","short_pith_number":"pith:HKWICPIC","canonical_record":{"source":{"id":"1903.04335","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-11T14:45:10Z","cross_cats_sorted":["math.FA","math.NA"],"title_canon_sha256":"d3e5108fc35849ba589280025872abdac2ff6dde147faa49e9d6cbfdd201dcc0","abstract_canon_sha256":"9338649b9a08d17f10b175b0d86309f525cd454071fa816e79d416c150c1bef3"},"schema_version":"1.0"},"canonical_sha256":"3aac813d027d2da67c9ec02691bdfef87415967deef6cf5c6f4610a58f487c3a","source":{"kind":"arxiv","id":"1903.04335","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.04335","created_at":"2026-05-17T23:51:35Z"},{"alias_kind":"arxiv_version","alias_value":"1903.04335v1","created_at":"2026-05-17T23:51:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04335","created_at":"2026-05-17T23:51:35Z"},{"alias_kind":"pith_short_12","alias_value":"HKWICPICPUW2","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HKWICPICPUW2M7E6","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HKWICPIC","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HKWICPICPUW2M7E6YATJDPP67B","target":"record","payload":{"canonical_record":{"source":{"id":"1903.04335","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-11T14:45:10Z","cross_cats_sorted":["math.FA","math.NA"],"title_canon_sha256":"d3e5108fc35849ba589280025872abdac2ff6dde147faa49e9d6cbfdd201dcc0","abstract_canon_sha256":"9338649b9a08d17f10b175b0d86309f525cd454071fa816e79d416c150c1bef3"},"schema_version":"1.0"},"canonical_sha256":"3aac813d027d2da67c9ec02691bdfef87415967deef6cf5c6f4610a58f487c3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:35.696355Z","signature_b64":"sNKBcovlELVo+Fco8Xz+d9e+/REyffmLoAPUP9NTJdIREZ+F6n2VzYVkPnD7NWAxYaPiBlQPUQ0LL/FO2At3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3aac813d027d2da67c9ec02691bdfef87415967deef6cf5c6f4610a58f487c3a","last_reissued_at":"2026-05-17T23:51:35.695597Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:35.695597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.04335","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-17T23:51:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Do/uK12eqyIAvX9JQzKH0Ax/W/aa8KYko6PMjdnCymtgEd8wPFCgzrEiV4BnevAAyJ8gba461IJgZjRi1K/RAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T00:53:51.891124Z"},"content_sha256":"eb3015b23e282aadbffa7095bc99601be34b5829795967c7089dec136bde7418","schema_version":"1.0","event_id":"sha256:eb3015b23e282aadbffa7095bc99601be34b5829795967c7089dec136bde7418"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HKWICPICPUW2M7E6YATJDPP67B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computation of Chebyshev Polynomials for Union of Intervals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.FA","math.NA"],"primary_cat":"math.OC","authors_text":"Jean-Bernard Lasserre (LAAS), Simon Foucart (TAMU)","submitted_at":"2019-03-11T14:45:10Z","abstract_excerpt":"Chebyshev polynomials of the first and second kind for a set K are monic polynomials with minimal L $\\infty$-and L 1-norm on K, respectively. This articles presents numerical procedures based on semidefinite programming to compute these polynomials in case K is a finite union of compact intervals. For Chebyshev polynomials of the first kind, the procedure makes use of a characterization of polynomial nonnegativity. It can incorporate additional constraints, e.g. that all the roots of the polynomial lie in K. For Chebyshev polynomials of the second kind, the procedure exploits the method of mom"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04335","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-17T23:51:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cmf7rv6CaMgwafaOHPhSUU25OVkqMU0mkVawtUwB9CjU3zP/K7k+J5rwFNl1dbjVNfXv10Q8G6uu4bivZkRyDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T00:53:51.891849Z"},"content_sha256":"771dcf08d15d38a5216fe109cc6c66b362dd271b41f94ab9982eb7859cf1cc00","schema_version":"1.0","event_id":"sha256:771dcf08d15d38a5216fe109cc6c66b362dd271b41f94ab9982eb7859cf1cc00"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HKWICPICPUW2M7E6YATJDPP67B/bundle.json","state_url":"https://pith.science/pith/HKWICPICPUW2M7E6YATJDPP67B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HKWICPICPUW2M7E6YATJDPP67B/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-06-06T00:53:51Z","links":{"resolver":"https://pith.science/pith/HKWICPICPUW2M7E6YATJDPP67B","bundle":"https://pith.science/pith/HKWICPICPUW2M7E6YATJDPP67B/bundle.json","state":"https://pith.science/pith/HKWICPICPUW2M7E6YATJDPP67B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HKWICPICPUW2M7E6YATJDPP67B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HKWICPICPUW2M7E6YATJDPP67B","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":"9338649b9a08d17f10b175b0d86309f525cd454071fa816e79d416c150c1bef3","cross_cats_sorted":["math.FA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-11T14:45:10Z","title_canon_sha256":"d3e5108fc35849ba589280025872abdac2ff6dde147faa49e9d6cbfdd201dcc0"},"schema_version":"1.0","source":{"id":"1903.04335","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.04335","created_at":"2026-05-17T23:51:35Z"},{"alias_kind":"arxiv_version","alias_value":"1903.04335v1","created_at":"2026-05-17T23:51:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04335","created_at":"2026-05-17T23:51:35Z"},{"alias_kind":"pith_short_12","alias_value":"HKWICPICPUW2","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HKWICPICPUW2M7E6","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HKWICPIC","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:771dcf08d15d38a5216fe109cc6c66b362dd271b41f94ab9982eb7859cf1cc00","target":"graph","created_at":"2026-05-17T23:51:35Z","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":"Chebyshev polynomials of the first and second kind for a set K are monic polynomials with minimal L $\\infty$-and L 1-norm on K, respectively. This articles presents numerical procedures based on semidefinite programming to compute these polynomials in case K is a finite union of compact intervals. For Chebyshev polynomials of the first kind, the procedure makes use of a characterization of polynomial nonnegativity. It can incorporate additional constraints, e.g. that all the roots of the polynomial lie in K. For Chebyshev polynomials of the second kind, the procedure exploits the method of mom","authors_text":"Jean-Bernard Lasserre (LAAS), Simon Foucart (TAMU)","cross_cats":["math.FA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-11T14:45:10Z","title":"Computation of Chebyshev Polynomials for Union of Intervals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04335","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:eb3015b23e282aadbffa7095bc99601be34b5829795967c7089dec136bde7418","target":"record","created_at":"2026-05-17T23:51:35Z","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":"9338649b9a08d17f10b175b0d86309f525cd454071fa816e79d416c150c1bef3","cross_cats_sorted":["math.FA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-11T14:45:10Z","title_canon_sha256":"d3e5108fc35849ba589280025872abdac2ff6dde147faa49e9d6cbfdd201dcc0"},"schema_version":"1.0","source":{"id":"1903.04335","kind":"arxiv","version":1}},"canonical_sha256":"3aac813d027d2da67c9ec02691bdfef87415967deef6cf5c6f4610a58f487c3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3aac813d027d2da67c9ec02691bdfef87415967deef6cf5c6f4610a58f487c3a","first_computed_at":"2026-05-17T23:51:35.695597Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:35.695597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sNKBcovlELVo+Fco8Xz+d9e+/REyffmLoAPUP9NTJdIREZ+F6n2VzYVkPnD7NWAxYaPiBlQPUQ0LL/FO2At3CA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:35.696355Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.04335","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb3015b23e282aadbffa7095bc99601be34b5829795967c7089dec136bde7418","sha256:771dcf08d15d38a5216fe109cc6c66b362dd271b41f94ab9982eb7859cf1cc00"],"state_sha256":"0eb8874aa11a3de29005c5090cb1528122900f978df3b730b319eb202a1dcc5d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7ytZmx1+7Fe37r/zSAuOtV/era47LhB6hK6XZzRnDdzcol6qvNZejD9KH2trCQaIpr5BYhlAvAqR8oVhm0FIDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T00:53:51.895528Z","bundle_sha256":"ddc9aabf0d2080da2030897ce671eba951d8f5e6d9a94243d892763f1901d775"}}