{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:Z5RLJXUSR7ZXN6OLMLDOTSXD7G","short_pith_number":"pith:Z5RLJXUS","schema_version":"1.0","canonical_sha256":"cf62b4de928ff376f9cb62c6e9cae3f9b924ef26818826200bae634fab4dd318","source":{"kind":"arxiv","id":"2505.19639","version":1},"attestation_state":"computed","paper":{"title":"Range Space or Null Space: Least-Squares Methods for the Realization Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Cristian R. Rojas, H\\r{a}kan Hjalmarsson, Jiabao He, Yue Ju, Yueyue Xu","submitted_at":"2025-05-26T07:58:09Z","abstract_excerpt":"This contribution revisits the classical approximate realization problem, which involves determining matrices of a state-space model based on estimates of a truncated series of Markov parameters. A Hankel matrix built up by these Markov parameters plays a fundamental role in this problem, leveraging the fact that both its range space and left null space encode critical information about the state-space model. We examine two prototype realization algorithms based on the Hankel matrix: the classical range-space-based (SVD-based) method and the more recent null-space-based method. It is demonstra"},"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":"2505.19639","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-05-26T07:58:09Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"11ff5bc92a981a4a1491d94c0d27f556fe6d92c9e858eb887ebee9ad99841f3c","abstract_canon_sha256":"877910b6838a98211a6db40b3acb626300b26c6858c07ec8832ab00bad78ac05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:09:33.881499Z","signature_b64":"7eo1z8se8bNZ2+9TLxady2wQLIsx5vB0aEOcw8X4zUUl9l2XlQ50qVaHJlXjTniSb9/mELsDq4PBfYC6/t/SBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf62b4de928ff376f9cb62c6e9cae3f9b924ef26818826200bae634fab4dd318","last_reissued_at":"2026-07-05T11:09:33.881100Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:09:33.881100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Range Space or Null Space: Least-Squares Methods for the Realization Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Cristian R. Rojas, H\\r{a}kan Hjalmarsson, Jiabao He, Yue Ju, Yueyue Xu","submitted_at":"2025-05-26T07:58:09Z","abstract_excerpt":"This contribution revisits the classical approximate realization problem, which involves determining matrices of a state-space model based on estimates of a truncated series of Markov parameters. A Hankel matrix built up by these Markov parameters plays a fundamental role in this problem, leveraging the fact that both its range space and left null space encode critical information about the state-space model. We examine two prototype realization algorithms based on the Hankel matrix: the classical range-space-based (SVD-based) method and the more recent null-space-based method. It is demonstra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.19639","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/2505.19639/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":"2505.19639","created_at":"2026-07-05T11:09:33.881152+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.19639v1","created_at":"2026-07-05T11:09:33.881152+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.19639","created_at":"2026-07-05T11:09:33.881152+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z5RLJXUSR7ZX","created_at":"2026-07-05T11:09:33.881152+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z5RLJXUSR7ZXN6OL","created_at":"2026-07-05T11:09:33.881152+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z5RLJXUS","created_at":"2026-07-05T11:09:33.881152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.15743","citing_title":"Preserving Topology Privacy of Network Systems by Feedback: Conditions and Distributed Design","ref_index":48,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Z5RLJXUSR7ZXN6OLMLDOTSXD7G","json":"https://pith.science/pith/Z5RLJXUSR7ZXN6OLMLDOTSXD7G.json","graph_json":"https://pith.science/api/pith-number/Z5RLJXUSR7ZXN6OLMLDOTSXD7G/graph.json","events_json":"https://pith.science/api/pith-number/Z5RLJXUSR7ZXN6OLMLDOTSXD7G/events.json","paper":"https://pith.science/paper/Z5RLJXUS"},"agent_actions":{"view_html":"https://pith.science/pith/Z5RLJXUSR7ZXN6OLMLDOTSXD7G","download_json":"https://pith.science/pith/Z5RLJXUSR7ZXN6OLMLDOTSXD7G.json","view_paper":"https://pith.science/paper/Z5RLJXUS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.19639&json=true","fetch_graph":"https://pith.science/api/pith-number/Z5RLJXUSR7ZXN6OLMLDOTSXD7G/graph.json","fetch_events":"https://pith.science/api/pith-number/Z5RLJXUSR7ZXN6OLMLDOTSXD7G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z5RLJXUSR7ZXN6OLMLDOTSXD7G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z5RLJXUSR7ZXN6OLMLDOTSXD7G/action/storage_attestation","attest_author":"https://pith.science/pith/Z5RLJXUSR7ZXN6OLMLDOTSXD7G/action/author_attestation","sign_citation":"https://pith.science/pith/Z5RLJXUSR7ZXN6OLMLDOTSXD7G/action/citation_signature","submit_replication":"https://pith.science/pith/Z5RLJXUSR7ZXN6OLMLDOTSXD7G/action/replication_record"}},"created_at":"2026-07-05T11:09:33.881152+00:00","updated_at":"2026-07-05T11:09:33.881152+00:00"}