{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:H2ENS3VJ6DZH2U4TLMUMANIT3Q","short_pith_number":"pith:H2ENS3VJ","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"},"canonical_sha256":"3e88d96ea9f0f27d53935b28c03513dc30f22bce3fd7c6c8b817a42267ab24bb","source":{"kind":"arxiv","id":"1202.4407","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.4407","created_at":"2026-05-18T00:52:42Z"},{"alias_kind":"arxiv_version","alias_value":"1202.4407v1","created_at":"2026-05-18T00:52:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4407","created_at":"2026-05-18T00:52:42Z"},{"alias_kind":"pith_short_12","alias_value":"H2ENS3VJ6DZH","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"H2ENS3VJ6DZH2U4T","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"H2ENS3VJ","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:H2ENS3VJ6DZH2U4TLMUMANIT3Q","target":"record","payload":{"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"},"canonical_sha256":"3e88d96ea9f0f27d53935b28c03513dc30f22bce3fd7c6c8b817a42267ab24bb","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"},"source_kind":"arxiv","source_id":"1202.4407","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:52:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4PLxb7Q8zwXhqdDjU+47mi+oJiCTV1JDqv2bH7cUT+ZQiawrTYRKtyVtHdh5GhzJ0ncFFKA/JyujlmdsTlBgBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:34:32.732046Z"},"content_sha256":"987b3579bf19b7f87f1eafdbcf1c51f5e8ff909060d505459eead57688313664","schema_version":"1.0","event_id":"sha256:987b3579bf19b7f87f1eafdbcf1c51f5e8ff909060d505459eead57688313664"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:H2ENS3VJ6DZH2U4TLMUMANIT3Q","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:52:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hw8M5vaJu7oiDdnYuAEWa+s0bqEjtqMX2lKCmCg1SSGdU50zX8ZsZw7WF2unP/AS5Oy8surAAMSCqxDx94BWAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:34:32.732413Z"},"content_sha256":"115071eef1a8661afc5b125c31e38fcce82c128f33054910ff3dfd3f54e39701","schema_version":"1.0","event_id":"sha256:115071eef1a8661afc5b125c31e38fcce82c128f33054910ff3dfd3f54e39701"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H2ENS3VJ6DZH2U4TLMUMANIT3Q/bundle.json","state_url":"https://pith.science/pith/H2ENS3VJ6DZH2U4TLMUMANIT3Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H2ENS3VJ6DZH2U4TLMUMANIT3Q/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T06:34:32Z","links":{"resolver":"https://pith.science/pith/H2ENS3VJ6DZH2U4TLMUMANIT3Q","bundle":"https://pith.science/pith/H2ENS3VJ6DZH2U4TLMUMANIT3Q/bundle.json","state":"https://pith.science/pith/H2ENS3VJ6DZH2U4TLMUMANIT3Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H2ENS3VJ6DZH2U4TLMUMANIT3Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:H2ENS3VJ6DZH2U4TLMUMANIT3Q","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":"773f26e5784413e7e5f12a7c60c0cd7d618d147ff90e56d31c1fd1ad3d67744a","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2012-02-20T18:09:18Z","title_canon_sha256":"ac50fa586aaf5f9689d5f199e8d2403e368260b54e8e5ba07204f5a1d730014f"},"schema_version":"1.0","source":{"id":"1202.4407","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.4407","created_at":"2026-05-18T00:52:42Z"},{"alias_kind":"arxiv_version","alias_value":"1202.4407v1","created_at":"2026-05-18T00:52:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4407","created_at":"2026-05-18T00:52:42Z"},{"alias_kind":"pith_short_12","alias_value":"H2ENS3VJ6DZH","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"H2ENS3VJ6DZH2U4T","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"H2ENS3VJ","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:115071eef1a8661afc5b125c31e38fcce82c128f33054910ff3dfd3f54e39701","target":"graph","created_at":"2026-05-18T00:52:42Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Amaury Pouly, Daniel S. Gra\\c{c}a, Olivier Bournez","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2012-02-20T18:09:18Z","title":"On the complexity of solving initial value problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4407","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:987b3579bf19b7f87f1eafdbcf1c51f5e8ff909060d505459eead57688313664","target":"record","created_at":"2026-05-18T00:52:42Z","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":"773f26e5784413e7e5f12a7c60c0cd7d618d147ff90e56d31c1fd1ad3d67744a","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2012-02-20T18:09:18Z","title_canon_sha256":"ac50fa586aaf5f9689d5f199e8d2403e368260b54e8e5ba07204f5a1d730014f"},"schema_version":"1.0","source":{"id":"1202.4407","kind":"arxiv","version":1}},"canonical_sha256":"3e88d96ea9f0f27d53935b28c03513dc30f22bce3fd7c6c8b817a42267ab24bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e88d96ea9f0f27d53935b28c03513dc30f22bce3fd7c6c8b817a42267ab24bb","first_computed_at":"2026-05-18T00:52:42.240000Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:42.240000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v/81fpl7qxdZXTXvmQ+8WApb6m4vhGegl5TXspUZpiA6uocBw/V9D9RhJVbBaMHC4voEYB2ascDOa/RVWV96AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:42.240582Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.4407","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:987b3579bf19b7f87f1eafdbcf1c51f5e8ff909060d505459eead57688313664","sha256:115071eef1a8661afc5b125c31e38fcce82c128f33054910ff3dfd3f54e39701"],"state_sha256":"e5097150b27bea854e60a1229615cf0b8e5fe25103cbba106ef215a1de360efb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qp8JIdrRL619YewTTjGoEfPdJotrPhV7GoqJj9Nizbrd8pdEvMP+LZoj877OgiPGWYgyJ5rvUG/bQCKknfOvCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:34:32.734346Z","bundle_sha256":"9fa7b169193eb9981d1f15aa38abaec5714cf6c1946a5adc6c14b5817f73585f"}}