{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:H2ENS3VJ6DZH2U4TLMUMANIT3Q","short_pith_number":"pith:H2ENS3VJ","schema_version":"1.0","canonical_sha256":"3e88d96ea9f0f27d53935b28c03513dc30f22bce3fd7c6c8b817a42267ab24bb","source":{"kind":"arxiv","id":"1202.4407","version":1},"attestation_state":"computed","paper":{"title":"On the complexity of solving initial value problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.NA","authors_text":"Amaury Pouly, Daniel S. Gra\\c{c}a, Olivier Bournez","submitted_at":"2012-02-20T18:09:18Z","abstract_excerpt":"In this paper we prove that computing the solution of an initial-value problem $\\dot{y}=p(y)$ with initial condition $y(t_0)=y_0\\in\\R^d$ at time $t_0+T$ with precision $e^{-\\mu}$ where $p$ is a vector of polynomials can be done in time polynomial in the value of $T$, $\\mu$ and $Y=\\sup_{t_0\\leqslant u\\leqslant T}\\infnorm{y(u)}$. Contrary to existing results, our algorithm works for any vector of polynomials $p$ over any bounded or unbounded domain and has a guaranteed complexity and precision. In particular we do not assume $p$ to be fixed, nor the solution to lie in a compact domain, nor we as"},"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":"1202.4407","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2012-02-20T18:09:18Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"ac50fa586aaf5f9689d5f199e8d2403e368260b54e8e5ba07204f5a1d730014f","abstract_canon_sha256":"773f26e5784413e7e5f12a7c60c0cd7d618d147ff90e56d31c1fd1ad3d67744a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:42.240582Z","signature_b64":"v/81fpl7qxdZXTXvmQ+8WApb6m4vhGegl5TXspUZpiA6uocBw/V9D9RhJVbBaMHC4voEYB2ascDOa/RVWV96AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e88d96ea9f0f27d53935b28c03513dc30f22bce3fd7c6c8b817a42267ab24bb","last_reissued_at":"2026-05-18T00:52:42.240000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:42.240000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the complexity of solving initial value problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.NA","authors_text":"Amaury Pouly, Daniel S. Gra\\c{c}a, Olivier Bournez","submitted_at":"2012-02-20T18:09:18Z","abstract_excerpt":"In this paper we prove that computing the solution of an initial-value problem $\\dot{y}=p(y)$ with initial condition $y(t_0)=y_0\\in\\R^d$ at time $t_0+T$ with precision $e^{-\\mu}$ where $p$ is a vector of polynomials can be done in time polynomial in the value of $T$, $\\mu$ and $Y=\\sup_{t_0\\leqslant u\\leqslant T}\\infnorm{y(u)}$. Contrary to existing results, our algorithm works for any vector of polynomials $p$ over any bounded or unbounded domain and has a guaranteed complexity and precision. In particular we do not assume $p$ to be fixed, nor the solution to lie in a compact domain, nor we as"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4407","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":"1202.4407","created_at":"2026-05-18T00:52:42.240088+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.4407v1","created_at":"2026-05-18T00:52:42.240088+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4407","created_at":"2026-05-18T00:52:42.240088+00:00"},{"alias_kind":"pith_short_12","alias_value":"H2ENS3VJ6DZH","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"H2ENS3VJ6DZH2U4T","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"H2ENS3VJ","created_at":"2026-05-18T12:27:06.952714+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/H2ENS3VJ6DZH2U4TLMUMANIT3Q","json":"https://pith.science/pith/H2ENS3VJ6DZH2U4TLMUMANIT3Q.json","graph_json":"https://pith.science/api/pith-number/H2ENS3VJ6DZH2U4TLMUMANIT3Q/graph.json","events_json":"https://pith.science/api/pith-number/H2ENS3VJ6DZH2U4TLMUMANIT3Q/events.json","paper":"https://pith.science/paper/H2ENS3VJ"},"agent_actions":{"view_html":"https://pith.science/pith/H2ENS3VJ6DZH2U4TLMUMANIT3Q","download_json":"https://pith.science/pith/H2ENS3VJ6DZH2U4TLMUMANIT3Q.json","view_paper":"https://pith.science/paper/H2ENS3VJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.4407&json=true","fetch_graph":"https://pith.science/api/pith-number/H2ENS3VJ6DZH2U4TLMUMANIT3Q/graph.json","fetch_events":"https://pith.science/api/pith-number/H2ENS3VJ6DZH2U4TLMUMANIT3Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H2ENS3VJ6DZH2U4TLMUMANIT3Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H2ENS3VJ6DZH2U4TLMUMANIT3Q/action/storage_attestation","attest_author":"https://pith.science/pith/H2ENS3VJ6DZH2U4TLMUMANIT3Q/action/author_attestation","sign_citation":"https://pith.science/pith/H2ENS3VJ6DZH2U4TLMUMANIT3Q/action/citation_signature","submit_replication":"https://pith.science/pith/H2ENS3VJ6DZH2U4TLMUMANIT3Q/action/replication_record"}},"created_at":"2026-05-18T00:52:42.240088+00:00","updated_at":"2026-05-18T00:52:42.240088+00:00"}