{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:IRHPCOIDHMHNIEPH4UIV6XM5XP","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":"69a7e59c1595e3a0f7743642d214e923fcead000b264e2bcf82034aa996009af","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-12-24T10:35:37Z","title_canon_sha256":"b5b7429218331a46118732837bd176119b498be637d29134d6ce1fdd50f9be00"},"schema_version":"1.0","source":{"id":"2512.21096","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.21096","created_at":"2026-05-17T23:39:00Z"},{"alias_kind":"arxiv_version","alias_value":"2512.21096v3","created_at":"2026-05-17T23:39:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.21096","created_at":"2026-05-17T23:39:00Z"},{"alias_kind":"pith_short_12","alias_value":"IRHPCOIDHMHN","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"IRHPCOIDHMHNIEPH","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"IRHPCOID","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:26e363935c9c3673b4a94f15fbb4e2d681e6f210c662ad17d8726ada8ce8ea72","target":"graph","created_at":"2026-05-17T23:39:00Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"The pole selection algorithm is asymptotically optimal, achieving the fundamental lower bound on the identification bias. The asymptotic identification bias decreases exponentially with the number of basis functions, with the rate of decrease governed by the hyperbolic Chebyshev constant."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The true system is linear time-invariant with poles inside the unit disk, and the H2 bias bound depends only on the locations of the true and model poles without additional unmodeled dynamics or noise assumptions that would invalidate the worst-case minimization."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"OBF-based system identification achieves exponentially decaying asymptotic bias when poles are chosen as Tsuji points, attaining the fundamental lower bound on H2 identification error."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Selecting Tsuji points for model poles lets orthogonal basis function identification reach the lowest possible asymptotic H2 bias for LTI systems."}],"snapshot_sha256":"0e64ce60c7a08d8f8084408842a179c7a26c1bc888eec402b896f006ecd5839f"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"This paper is concerned with performance analysis and pole selection problem in identifying linear time-invariant (LTI) systems using orthogonal basis functions (OBFs), a system identification approach that consists of solving least-squares problems and selecting poles within the OBFs. Specifically, we analyze the convergence properties and asymptotic bias of the OBF algorithm, and propose a pole selection algorithm that robustly minimizes the worst-case identification bias, with the bias measured under the $\\mathcal{H}_2$ error criterion. Our results include an analytical expression for the c","authors_text":"Jiayun Li, Jie Chen, Yilin Mo, Yiwen Lu","cross_cats":[],"headline":"Selecting Tsuji points for model poles lets orthogonal basis function identification reach the lowest possible asymptotic H2 bias for LTI systems.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-12-24T10:35:37Z","title":"Identification with Orthogonal Basis Functions: Convergence Speed, Asymptotic Bias, and Rate-Optimal Pole Selection"},"references":{"count":51,"internal_anchors":0,"resolved_work":51,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"L. Ljung, “System identification,” pp. 163–173, 1998","work_id":"b7c9f276-4097-4333-bf58-fa11fcb55582","year":1998},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"H. Madsen,Time Series Analysis. Chapman & Hall/CRC, 2008","work_id":"8cefb486-be4b-4614-a4ef-1a146517c371","year":2008},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"A. Lindquist and G. Picci,Linear Stochastic Systems: A Geometric Approach to Modeling, Estimation and Identification. Springer Verlag, 2015","work_id":"3eaed07d-5f94-4119-b344-91a5188a41da","year":2015},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"From circuit theory to system theory,","work_id":"340228d1-6890-4d7a-bde9-129eaa6a7416","year":1962},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Linear stochastic filtering-reappraisal and outlook,","work_id":"36d7ec88-0003-4a36-9673-e9c62cf7fbdf","year":1965}],"snapshot_sha256":"2963deba43b6b247d12fb0219675afaacb469767be565920fa3aaa27162a3ba8"},"source":{"id":"2512.21096","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-16T20:10:18.792804Z","id":"854c5a06-61c5-46d8-8de6-ccbaf25271dc","model_set":{"reader":"grok-4.3"},"one_line_summary":"OBF-based system identification achieves exponentially decaying asymptotic bias when poles are chosen as Tsuji points, attaining the fundamental lower bound on H2 identification error.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Selecting Tsuji points for model poles lets orthogonal basis function identification reach the lowest possible asymptotic H2 bias for LTI systems.","strongest_claim":"The pole selection algorithm is asymptotically optimal, achieving the fundamental lower bound on the identification bias. The asymptotic identification bias decreases exponentially with the number of basis functions, with the rate of decrease governed by the hyperbolic Chebyshev constant.","weakest_assumption":"The true system is linear time-invariant with poles inside the unit disk, and the H2 bias bound depends only on the locations of the true and model poles without additional unmodeled dynamics or noise assumptions that would invalidate the worst-case minimization."}},"verdict_id":"854c5a06-61c5-46d8-8de6-ccbaf25271dc"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8c542a69c69d305e756c7dd249ecbab9eeee142d5bfb5b655e34c0b9e7f9fb0e","target":"record","created_at":"2026-05-17T23:39:00Z","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":"69a7e59c1595e3a0f7743642d214e923fcead000b264e2bcf82034aa996009af","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-12-24T10:35:37Z","title_canon_sha256":"b5b7429218331a46118732837bd176119b498be637d29134d6ce1fdd50f9be00"},"schema_version":"1.0","source":{"id":"2512.21096","kind":"arxiv","version":3}},"canonical_sha256":"444ef139033b0ed411e7e5115f5d9dbbff539d63dcc1a7f894da4b0d15b598ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"444ef139033b0ed411e7e5115f5d9dbbff539d63dcc1a7f894da4b0d15b598ec","first_computed_at":"2026-05-17T23:39:00.387564Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:00.387564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QXGr335viF28FnpI+5wIYejtjhbgs7cuEuc4K4rzbq6QhndKMyk+DMKuJj3rijW0eGfujdOafsOsotmp8yyaBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:00.388361Z","signed_message":"canonical_sha256_bytes"},"source_id":"2512.21096","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c542a69c69d305e756c7dd249ecbab9eeee142d5bfb5b655e34c0b9e7f9fb0e","sha256:26e363935c9c3673b4a94f15fbb4e2d681e6f210c662ad17d8726ada8ce8ea72"],"state_sha256":"f7821174b23d8207defdacf4cc7f80ded643ca827d7657954a7f633b74592fda"}