{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZS2UVZHCM4ZDLE2F2R3Q5CATYJ","short_pith_number":"pith:ZS2UVZHC","schema_version":"1.0","canonical_sha256":"ccb54ae4e26732359345d4770e8813c26e8dc42629df989f4c9a9853c12ff264","source":{"kind":"arxiv","id":"1711.02552","version":1},"attestation_state":"computed","paper":{"title":"Explicit Error Bounds for Carleman Linearization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.NA","authors_text":"Amaury Pouly, Marcelo Forets","submitted_at":"2017-11-07T15:34:40Z","abstract_excerpt":"We revisit the method of Carleman linearization for systems of ordinary differential equations with polynomial right-hand sides. This transformation provides an approximate linearization in a higher-dimensional space through the exact embedding of polynomial nonlinearities into an infinite-dimensional linear system, which is then truncated to obtain a finite-dimensional representation with an additive error. To the best of our knowledge, no explicit calculation of the error bound has been studied. In this paper, we propose two strategies to obtain a time-dependent function that locally bounds "},"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":"1711.02552","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-11-07T15:34:40Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"4805b21372a9dce71fabe518ec4b1571815ba1019c0b26c0917fd7d87940fede","abstract_canon_sha256":"b202c50f72c2e6a6d0a5de14946a602ee8921b8937e95c842feb384d281c8386"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:07.607146Z","signature_b64":"fHauAzqd7YEqwK7I762xIQVxqSCe793BxGGyuqLi97pb2O/TAmySZdM7yxp2pvaaJCBwpuHHYfOuh4oBPhsXDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccb54ae4e26732359345d4770e8813c26e8dc42629df989f4c9a9853c12ff264","last_reissued_at":"2026-05-18T00:31:07.606504Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:07.606504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Explicit Error Bounds for Carleman Linearization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.NA","authors_text":"Amaury Pouly, Marcelo Forets","submitted_at":"2017-11-07T15:34:40Z","abstract_excerpt":"We revisit the method of Carleman linearization for systems of ordinary differential equations with polynomial right-hand sides. This transformation provides an approximate linearization in a higher-dimensional space through the exact embedding of polynomial nonlinearities into an infinite-dimensional linear system, which is then truncated to obtain a finite-dimensional representation with an additive error. To the best of our knowledge, no explicit calculation of the error bound has been studied. In this paper, we propose two strategies to obtain a time-dependent function that locally bounds "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02552","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":"1711.02552","created_at":"2026-05-18T00:31:07.606606+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.02552v1","created_at":"2026-05-18T00:31:07.606606+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02552","created_at":"2026-05-18T00:31:07.606606+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZS2UVZHCM4ZD","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZS2UVZHCM4ZDLE2F","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZS2UVZHC","created_at":"2026-05-18T12:31:59.375834+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2605.19054","citing_title":"Quantum Koopman Algorithms","ref_index":38,"is_internal_anchor":true},{"citing_arxiv_id":"2605.15366","citing_title":"Measurement-Efficient Variational Quantum Linear Solver for Carleman-Linearized Nonlinear Dynamics","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2510.06837","citing_title":"A Quantum Linear Systems Pathway for Solving Differential Equations","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2605.03381","citing_title":"Nonlinear semigroups with unbounded generators under Carleman linearization","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11113","citing_title":"Schr\\\"odinger-Navier-Stokes Equation for the Quantum Simulation of Navier-Stokes Flows","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZS2UVZHCM4ZDLE2F2R3Q5CATYJ","json":"https://pith.science/pith/ZS2UVZHCM4ZDLE2F2R3Q5CATYJ.json","graph_json":"https://pith.science/api/pith-number/ZS2UVZHCM4ZDLE2F2R3Q5CATYJ/graph.json","events_json":"https://pith.science/api/pith-number/ZS2UVZHCM4ZDLE2F2R3Q5CATYJ/events.json","paper":"https://pith.science/paper/ZS2UVZHC"},"agent_actions":{"view_html":"https://pith.science/pith/ZS2UVZHCM4ZDLE2F2R3Q5CATYJ","download_json":"https://pith.science/pith/ZS2UVZHCM4ZDLE2F2R3Q5CATYJ.json","view_paper":"https://pith.science/paper/ZS2UVZHC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.02552&json=true","fetch_graph":"https://pith.science/api/pith-number/ZS2UVZHCM4ZDLE2F2R3Q5CATYJ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZS2UVZHCM4ZDLE2F2R3Q5CATYJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZS2UVZHCM4ZDLE2F2R3Q5CATYJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZS2UVZHCM4ZDLE2F2R3Q5CATYJ/action/storage_attestation","attest_author":"https://pith.science/pith/ZS2UVZHCM4ZDLE2F2R3Q5CATYJ/action/author_attestation","sign_citation":"https://pith.science/pith/ZS2UVZHCM4ZDLE2F2R3Q5CATYJ/action/citation_signature","submit_replication":"https://pith.science/pith/ZS2UVZHCM4ZDLE2F2R3Q5CATYJ/action/replication_record"}},"created_at":"2026-05-18T00:31:07.606606+00:00","updated_at":"2026-05-18T00:31:07.606606+00:00"}