{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NVJAIC2ZPPACBR7PDEAUFHHHIB","short_pith_number":"pith:NVJAIC2Z","schema_version":"1.0","canonical_sha256":"6d52040b597bc020c7ef1901429ce740741c0d21d8f1224976a515cbee46cad3","source":{"kind":"arxiv","id":"1507.02246","version":1},"attestation_state":"computed","paper":{"title":"An Algorithm for System Identification of a Discrete-Time Polynomial System without Inputs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jana N\\v{e}mcov\\'a, Jan H. van Schuppen, Mih\\'aly Petreczky","submitted_at":"2015-07-08T18:23:13Z","abstract_excerpt":"A subalgebraic approximation algorithm is proposed to estimate from a set of time series the parameters of the observer representation of a discrete-time polynomial system without inputs which can generate an approximation of the observed time series. A major step of the algorithm is to construct a set of generators for the polynomial function from the past outputs to the future outputs. For this singular value decompositions and polynomial factorizations are used. An example is provided."},"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":"1507.02246","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-08T18:23:13Z","cross_cats_sorted":[],"title_canon_sha256":"07589bf91f522e6c5fe31073b67b3cadb477bf1d976c43debeaa8698c26be0f2","abstract_canon_sha256":"491387825f42d02b2d04211a397df135011448bd4088c93b99e568d282a255d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:08.303388Z","signature_b64":"d1lmnkZnoEQL7e7tV9IEAQTjRJ+ort+/huZLUylL/E/Yvd2s/tcjDprqY6Z8hw9NwNFtwGeFpKYySBSzNzpHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d52040b597bc020c7ef1901429ce740741c0d21d8f1224976a515cbee46cad3","last_reissued_at":"2026-05-18T01:37:08.302729Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:08.302729Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Algorithm for System Identification of a Discrete-Time Polynomial System without Inputs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jana N\\v{e}mcov\\'a, Jan H. van Schuppen, Mih\\'aly Petreczky","submitted_at":"2015-07-08T18:23:13Z","abstract_excerpt":"A subalgebraic approximation algorithm is proposed to estimate from a set of time series the parameters of the observer representation of a discrete-time polynomial system without inputs which can generate an approximation of the observed time series. A major step of the algorithm is to construct a set of generators for the polynomial function from the past outputs to the future outputs. For this singular value decompositions and polynomial factorizations are used. An example is provided."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02246","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.02246","created_at":"2026-05-18T01:37:08.302825+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.02246v1","created_at":"2026-05-18T01:37:08.302825+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02246","created_at":"2026-05-18T01:37:08.302825+00:00"},{"alias_kind":"pith_short_12","alias_value":"NVJAIC2ZPPAC","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"NVJAIC2ZPPACBR7P","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"NVJAIC2Z","created_at":"2026-05-18T12:29:34.919912+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/NVJAIC2ZPPACBR7PDEAUFHHHIB","json":"https://pith.science/pith/NVJAIC2ZPPACBR7PDEAUFHHHIB.json","graph_json":"https://pith.science/api/pith-number/NVJAIC2ZPPACBR7PDEAUFHHHIB/graph.json","events_json":"https://pith.science/api/pith-number/NVJAIC2ZPPACBR7PDEAUFHHHIB/events.json","paper":"https://pith.science/paper/NVJAIC2Z"},"agent_actions":{"view_html":"https://pith.science/pith/NVJAIC2ZPPACBR7PDEAUFHHHIB","download_json":"https://pith.science/pith/NVJAIC2ZPPACBR7PDEAUFHHHIB.json","view_paper":"https://pith.science/paper/NVJAIC2Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.02246&json=true","fetch_graph":"https://pith.science/api/pith-number/NVJAIC2ZPPACBR7PDEAUFHHHIB/graph.json","fetch_events":"https://pith.science/api/pith-number/NVJAIC2ZPPACBR7PDEAUFHHHIB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NVJAIC2ZPPACBR7PDEAUFHHHIB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NVJAIC2ZPPACBR7PDEAUFHHHIB/action/storage_attestation","attest_author":"https://pith.science/pith/NVJAIC2ZPPACBR7PDEAUFHHHIB/action/author_attestation","sign_citation":"https://pith.science/pith/NVJAIC2ZPPACBR7PDEAUFHHHIB/action/citation_signature","submit_replication":"https://pith.science/pith/NVJAIC2ZPPACBR7PDEAUFHHHIB/action/replication_record"}},"created_at":"2026-05-18T01:37:08.302825+00:00","updated_at":"2026-05-18T01:37:08.302825+00:00"}