{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TSXO7TTOVPZEIMJFQ65CO7DMNB","short_pith_number":"pith:TSXO7TTO","canonical_record":{"source":{"id":"1409.0451","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-09-01T15:22:54Z","cross_cats_sorted":[],"title_canon_sha256":"1ca81a65e776dd09abdf898b41f9ef6b8bfaf27f9c3914753f172609459e0b2c","abstract_canon_sha256":"67f770fa3376faf100a579ac417124b2050cb9195b22a058018e5ee08616732a"},"schema_version":"1.0"},"canonical_sha256":"9caeefce6eabf244312587ba277c6c687eaac64fe8c118a7894535566e7739a3","source":{"kind":"arxiv","id":"1409.0451","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.0451","created_at":"2026-05-18T00:52:42Z"},{"alias_kind":"arxiv_version","alias_value":"1409.0451v4","created_at":"2026-05-18T00:52:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0451","created_at":"2026-05-18T00:52:42Z"},{"alias_kind":"pith_short_12","alias_value":"TSXO7TTOVPZE","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"TSXO7TTOVPZEIMJF","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"TSXO7TTO","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TSXO7TTOVPZEIMJFQ65CO7DMNB","target":"record","payload":{"canonical_record":{"source":{"id":"1409.0451","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-09-01T15:22:54Z","cross_cats_sorted":[],"title_canon_sha256":"1ca81a65e776dd09abdf898b41f9ef6b8bfaf27f9c3914753f172609459e0b2c","abstract_canon_sha256":"67f770fa3376faf100a579ac417124b2050cb9195b22a058018e5ee08616732a"},"schema_version":"1.0"},"canonical_sha256":"9caeefce6eabf244312587ba277c6c687eaac64fe8c118a7894535566e7739a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:42.108894Z","signature_b64":"Fd/VFcc8b2aXsAM8cOXylmvaPoAhpBKfZw6Dn8epjIpfIX7uGftpm1zQfFKTJbo7LNmdh1y/VuoG5mOj+fG/CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9caeefce6eabf244312587ba277c6c687eaac64fe8c118a7894535566e7739a3","last_reissued_at":"2026-05-18T00:52:42.108017Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:42.108017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.0451","source_version":4,"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":"9bHaBARkpCejzt7UAku7vrvSM6CXjA90lBiDlBWPlzxg8Jo25Iby1+SbqeeuVm3RjAsRwWz8JDwio7ERkm2SDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:06:53.776832Z"},"content_sha256":"4865ffa554d07e58a71d4d13ad42d1f45c6c1413886388555ca19e99d41a0d48","schema_version":"1.0","event_id":"sha256:4865ffa554d07e58a71d4d13ad42d1f45c6c1413886388555ca19e99d41a0d48"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TSXO7TTOVPZEIMJFQ65CO7DMNB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computational complexity of solving polynomial differential equations over unbounded domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Amaury Pouly, Daniel S. Gra\\c{c}a","submitted_at":"2014-09-01T15:22:54Z","abstract_excerpt":"In this paper we investigate the computational complexity of solving ordinary differential equations (ODEs) $y^{\\prime}=p(y)$ over \\emph{unbounded time domains}, where $p$ is a vector of polynomials. Contrarily to the bounded (compact) time case, this problem has not been well-studied, apparently due to the \"intuition\" that it can always be reduced to the bounded case by using rescaling techniques. However, as we show in this paper, rescaling techniques do not seem to provide meaningful insights on the complexity of this problem, since the use of such techniques introduces a dependence on para"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0451","kind":"arxiv","version":4},"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":"08jh2bBSNLu+L8wrlLxK1FfgzEZUEu5jo9SxMuvj1841unOBphixFwwhFxBw7kHSaR4uXk3qdcnHV1y25pzMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:06:53.777486Z"},"content_sha256":"d07d147d51edfc7efc251372bab91abf4abee043092c924f8f7845d1c5dcdf68","schema_version":"1.0","event_id":"sha256:d07d147d51edfc7efc251372bab91abf4abee043092c924f8f7845d1c5dcdf68"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TSXO7TTOVPZEIMJFQ65CO7DMNB/bundle.json","state_url":"https://pith.science/pith/TSXO7TTOVPZEIMJFQ65CO7DMNB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TSXO7TTOVPZEIMJFQ65CO7DMNB/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-04T06:06:53Z","links":{"resolver":"https://pith.science/pith/TSXO7TTOVPZEIMJFQ65CO7DMNB","bundle":"https://pith.science/pith/TSXO7TTOVPZEIMJFQ65CO7DMNB/bundle.json","state":"https://pith.science/pith/TSXO7TTOVPZEIMJFQ65CO7DMNB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TSXO7TTOVPZEIMJFQ65CO7DMNB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TSXO7TTOVPZEIMJFQ65CO7DMNB","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":"67f770fa3376faf100a579ac417124b2050cb9195b22a058018e5ee08616732a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-09-01T15:22:54Z","title_canon_sha256":"1ca81a65e776dd09abdf898b41f9ef6b8bfaf27f9c3914753f172609459e0b2c"},"schema_version":"1.0","source":{"id":"1409.0451","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.0451","created_at":"2026-05-18T00:52:42Z"},{"alias_kind":"arxiv_version","alias_value":"1409.0451v4","created_at":"2026-05-18T00:52:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0451","created_at":"2026-05-18T00:52:42Z"},{"alias_kind":"pith_short_12","alias_value":"TSXO7TTOVPZE","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"TSXO7TTOVPZEIMJF","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"TSXO7TTO","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:d07d147d51edfc7efc251372bab91abf4abee043092c924f8f7845d1c5dcdf68","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 investigate the computational complexity of solving ordinary differential equations (ODEs) $y^{\\prime}=p(y)$ over \\emph{unbounded time domains}, where $p$ is a vector of polynomials. Contrarily to the bounded (compact) time case, this problem has not been well-studied, apparently due to the \"intuition\" that it can always be reduced to the bounded case by using rescaling techniques. However, as we show in this paper, rescaling techniques do not seem to provide meaningful insights on the complexity of this problem, since the use of such techniques introduces a dependence on para","authors_text":"Amaury Pouly, Daniel S. Gra\\c{c}a","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-09-01T15:22:54Z","title":"Computational complexity of solving polynomial differential equations over unbounded domains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0451","kind":"arxiv","version":4},"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:4865ffa554d07e58a71d4d13ad42d1f45c6c1413886388555ca19e99d41a0d48","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":"67f770fa3376faf100a579ac417124b2050cb9195b22a058018e5ee08616732a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-09-01T15:22:54Z","title_canon_sha256":"1ca81a65e776dd09abdf898b41f9ef6b8bfaf27f9c3914753f172609459e0b2c"},"schema_version":"1.0","source":{"id":"1409.0451","kind":"arxiv","version":4}},"canonical_sha256":"9caeefce6eabf244312587ba277c6c687eaac64fe8c118a7894535566e7739a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9caeefce6eabf244312587ba277c6c687eaac64fe8c118a7894535566e7739a3","first_computed_at":"2026-05-18T00:52:42.108017Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:42.108017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fd/VFcc8b2aXsAM8cOXylmvaPoAhpBKfZw6Dn8epjIpfIX7uGftpm1zQfFKTJbo7LNmdh1y/VuoG5mOj+fG/CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:42.108894Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.0451","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4865ffa554d07e58a71d4d13ad42d1f45c6c1413886388555ca19e99d41a0d48","sha256:d07d147d51edfc7efc251372bab91abf4abee043092c924f8f7845d1c5dcdf68"],"state_sha256":"b4f27d8ba25234f0617f8a9ed169b019ef08e8ba809c63761176777c5b81087c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FAlCxnfY5xIS7nKlWcTWAQ/+6tfOw9EnbDwUEc2qjgw42THyTpBSHi7Xgd9KLgCRoCsPHzlH5t9PvEzqDLuWCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:06:53.780442Z","bundle_sha256":"8777f7dde5f933d4132a7febe782be9bfec2127ed134f292ad9f4b1827b87421"}}