{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PG5MOBEXSPA4PIR5MYQN2MBANP","short_pith_number":"pith:PG5MOBEX","schema_version":"1.0","canonical_sha256":"79bac7049793c1c7a23d6620dd30206bdc20416fed722207f8d5a4c88d612ccd","source":{"kind":"arxiv","id":"1608.00135","version":1},"attestation_state":"computed","paper":{"title":"Computational complexity of solving polynomial differential equations over unbounded domains with non-rational coefficients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.CC","authors_text":"Amaury Pouly","submitted_at":"2016-07-30T15:57:16Z","abstract_excerpt":"In this note, we extend the result of \\cite{PoulyG16} about the complexity of solving polynomial differential equations over unbounded domains to work with non-rational input. In order to deal with arbitrary input, we phrase the result in framework of Conputable Analysis \\cite{Ko91}. As a side result, we also get a uniform result about complexity of the operator, and not just about the solution."},"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":"1608.00135","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-07-30T15:57:16Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"0924a9badd01c6bbc8aac5dd9fb40dbcce09a48aa01c577338db167e0c27695c","abstract_canon_sha256":"88af5bd6342c39900809115c830c2b34a8485ade2bbe242c954e394e7f09a250"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:13.733950Z","signature_b64":"FR9sTtSKOeRxxSAHd35kTE3gvX9XDfnQ1+hUnu31u9Ug03wLuc4wD+YjAIaQtIMy1R0IyxxCgFwgCP4zrNQRBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79bac7049793c1c7a23d6620dd30206bdc20416fed722207f8d5a4c88d612ccd","last_reissued_at":"2026-05-18T01:10:13.733127Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:13.733127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computational complexity of solving polynomial differential equations over unbounded domains with non-rational coefficients","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.CC","authors_text":"Amaury Pouly","submitted_at":"2016-07-30T15:57:16Z","abstract_excerpt":"In this note, we extend the result of \\cite{PoulyG16} about the complexity of solving polynomial differential equations over unbounded domains to work with non-rational input. In order to deal with arbitrary input, we phrase the result in framework of Conputable Analysis \\cite{Ko91}. As a side result, we also get a uniform result about complexity of the operator, and not just about the solution."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00135","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":"1608.00135","created_at":"2026-05-18T01:10:13.733237+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.00135v1","created_at":"2026-05-18T01:10:13.733237+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00135","created_at":"2026-05-18T01:10:13.733237+00:00"},{"alias_kind":"pith_short_12","alias_value":"PG5MOBEXSPA4","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PG5MOBEXSPA4PIR5","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PG5MOBEX","created_at":"2026-05-18T12:30:39.010887+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/PG5MOBEXSPA4PIR5MYQN2MBANP","json":"https://pith.science/pith/PG5MOBEXSPA4PIR5MYQN2MBANP.json","graph_json":"https://pith.science/api/pith-number/PG5MOBEXSPA4PIR5MYQN2MBANP/graph.json","events_json":"https://pith.science/api/pith-number/PG5MOBEXSPA4PIR5MYQN2MBANP/events.json","paper":"https://pith.science/paper/PG5MOBEX"},"agent_actions":{"view_html":"https://pith.science/pith/PG5MOBEXSPA4PIR5MYQN2MBANP","download_json":"https://pith.science/pith/PG5MOBEXSPA4PIR5MYQN2MBANP.json","view_paper":"https://pith.science/paper/PG5MOBEX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.00135&json=true","fetch_graph":"https://pith.science/api/pith-number/PG5MOBEXSPA4PIR5MYQN2MBANP/graph.json","fetch_events":"https://pith.science/api/pith-number/PG5MOBEXSPA4PIR5MYQN2MBANP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PG5MOBEXSPA4PIR5MYQN2MBANP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PG5MOBEXSPA4PIR5MYQN2MBANP/action/storage_attestation","attest_author":"https://pith.science/pith/PG5MOBEXSPA4PIR5MYQN2MBANP/action/author_attestation","sign_citation":"https://pith.science/pith/PG5MOBEXSPA4PIR5MYQN2MBANP/action/citation_signature","submit_replication":"https://pith.science/pith/PG5MOBEXSPA4PIR5MYQN2MBANP/action/replication_record"}},"created_at":"2026-05-18T01:10:13.733237+00:00","updated_at":"2026-05-18T01:10:13.733237+00:00"}