{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:TQGWOIOJITUD5SFLS3DXHWJVAN","short_pith_number":"pith:TQGWOIOJ","schema_version":"1.0","canonical_sha256":"9c0d6721c944e83ec8ab96c773d9350344858b5569bc42795716cd9530a7fc1b","source":{"kind":"arxiv","id":"2304.03024","version":3},"attestation_state":"computed","paper":{"title":"Markov Parameter Identification via Chebyshev Approximation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jiayun Li, Yilin Mo","submitted_at":"2023-04-06T12:18:56Z","abstract_excerpt":"This paper proposes an identification algorithm for Single Input Single Output (SISO) Linear Time-Invariant (LTI) systems. In the noise-free setting, where the first $T$ Markov parameters can be precisely estimated, all Markov parameters can be inferred by the linear combination of the known $T$ Markov parameters, of which the coefficients are obtained by solving the uniform polynomial approximation problem, and the upper bound of the asymptotic identification bias is provided. For the finite-time identification scenario, we cast the system identification problem with noisy Markov parameters i"},"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":"2304.03024","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-04-06T12:18:56Z","cross_cats_sorted":[],"title_canon_sha256":"80e1fc2776b931f4827b6efc426e1cb5c3379477262abfcbdfbae7bf7c909198","abstract_canon_sha256":"d7a06525dcea7b55d21b67b410b30e6efda9c266c7a2c115ccf140d7eabd0bdd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:59:50.147215Z","signature_b64":"oB3TwVyBakGTixqVYoCWlveATs38Zd75ELW2K0IDpNoaEj2hMM98ea1RGWfIqubBZw3qrLSDCvgaDn2ORrqSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c0d6721c944e83ec8ab96c773d9350344858b5569bc42795716cd9530a7fc1b","last_reissued_at":"2026-07-05T05:59:50.146782Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:59:50.146782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Markov Parameter Identification via Chebyshev Approximation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jiayun Li, Yilin Mo","submitted_at":"2023-04-06T12:18:56Z","abstract_excerpt":"This paper proposes an identification algorithm for Single Input Single Output (SISO) Linear Time-Invariant (LTI) systems. In the noise-free setting, where the first $T$ Markov parameters can be precisely estimated, all Markov parameters can be inferred by the linear combination of the known $T$ Markov parameters, of which the coefficients are obtained by solving the uniform polynomial approximation problem, and the upper bound of the asymptotic identification bias is provided. For the finite-time identification scenario, we cast the system identification problem with noisy Markov parameters i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.03024","kind":"arxiv","version":3},"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/2304.03024/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":"2304.03024","created_at":"2026-07-05T05:59:50.146841+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.03024v3","created_at":"2026-07-05T05:59:50.146841+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.03024","created_at":"2026-07-05T05:59:50.146841+00:00"},{"alias_kind":"pith_short_12","alias_value":"TQGWOIOJITUD","created_at":"2026-07-05T05:59:50.146841+00:00"},{"alias_kind":"pith_short_16","alias_value":"TQGWOIOJITUD5SFL","created_at":"2026-07-05T05:59:50.146841+00:00"},{"alias_kind":"pith_short_8","alias_value":"TQGWOIOJ","created_at":"2026-07-05T05:59:50.146841+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/TQGWOIOJITUD5SFLS3DXHWJVAN","json":"https://pith.science/pith/TQGWOIOJITUD5SFLS3DXHWJVAN.json","graph_json":"https://pith.science/api/pith-number/TQGWOIOJITUD5SFLS3DXHWJVAN/graph.json","events_json":"https://pith.science/api/pith-number/TQGWOIOJITUD5SFLS3DXHWJVAN/events.json","paper":"https://pith.science/paper/TQGWOIOJ"},"agent_actions":{"view_html":"https://pith.science/pith/TQGWOIOJITUD5SFLS3DXHWJVAN","download_json":"https://pith.science/pith/TQGWOIOJITUD5SFLS3DXHWJVAN.json","view_paper":"https://pith.science/paper/TQGWOIOJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.03024&json=true","fetch_graph":"https://pith.science/api/pith-number/TQGWOIOJITUD5SFLS3DXHWJVAN/graph.json","fetch_events":"https://pith.science/api/pith-number/TQGWOIOJITUD5SFLS3DXHWJVAN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TQGWOIOJITUD5SFLS3DXHWJVAN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TQGWOIOJITUD5SFLS3DXHWJVAN/action/storage_attestation","attest_author":"https://pith.science/pith/TQGWOIOJITUD5SFLS3DXHWJVAN/action/author_attestation","sign_citation":"https://pith.science/pith/TQGWOIOJITUD5SFLS3DXHWJVAN/action/citation_signature","submit_replication":"https://pith.science/pith/TQGWOIOJITUD5SFLS3DXHWJVAN/action/replication_record"}},"created_at":"2026-07-05T05:59:50.146841+00:00","updated_at":"2026-07-05T05:59:50.146841+00:00"}