{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:OFMJBRHKRIO3DWGMLPO6UMAVMB","short_pith_number":"pith:OFMJBRHK","schema_version":"1.0","canonical_sha256":"715890c4ea8a1db1d8cc5bddea3015605a4ecf1ca2e079b9304acf180fecc979","source":{"kind":"arxiv","id":"1211.4974","version":1},"attestation_state":"computed","paper":{"title":"Parameterized Uniform Complexity in Numerics: from Smooth to Analytic, from NP-hard to Polytime","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.NA"],"primary_cat":"cs.NA","authors_text":"Akitoshi Kawamura, Carsten R\\\"osnick, Martin Ziegler, Norbert Th. M\\\"uller","submitted_at":"2012-11-21T09:23:14Z","abstract_excerpt":"The synthesis of classical Computational Complexity Theory with Recursive Analysis provides a quantitative foundation to reliable numerics. Here the operators of maximization, integration, and solving ordinary differential equations are known to map (even high-order differentiable) polynomial-time computable functions to instances which are `hard' for classical complexity classes NP, #P, and CH; but, restricted to analytic functions, map polynomial-time computable ones to polynomial-time computable ones -- non-uniformly!\n  We investigate the uniform parameterized complexity of the above operat"},"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":"1211.4974","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2012-11-21T09:23:14Z","cross_cats_sorted":["cs.CC","math.NA"],"title_canon_sha256":"b595ada866789bd3dfde4716024f6571afcba3892494a0df7f03229e37c89b1b","abstract_canon_sha256":"6618199bfa476ba213ac5bab17f5a08989590d36c53414824be236937395372c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:15.386413Z","signature_b64":"ui1aMSaq2U7DWRdC1ZJoliY/weG8yaL8tPs3tEdnOJHCBTURW5cnbhR0JLbbKG6ZsQwDNLxHBy4eMWaGxkRpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"715890c4ea8a1db1d8cc5bddea3015605a4ecf1ca2e079b9304acf180fecc979","last_reissued_at":"2026-05-18T03:40:15.385900Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:15.385900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Uniform Complexity in Numerics: from Smooth to Analytic, from NP-hard to Polytime","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.NA"],"primary_cat":"cs.NA","authors_text":"Akitoshi Kawamura, Carsten R\\\"osnick, Martin Ziegler, Norbert Th. M\\\"uller","submitted_at":"2012-11-21T09:23:14Z","abstract_excerpt":"The synthesis of classical Computational Complexity Theory with Recursive Analysis provides a quantitative foundation to reliable numerics. Here the operators of maximization, integration, and solving ordinary differential equations are known to map (even high-order differentiable) polynomial-time computable functions to instances which are `hard' for classical complexity classes NP, #P, and CH; but, restricted to analytic functions, map polynomial-time computable ones to polynomial-time computable ones -- non-uniformly!\n  We investigate the uniform parameterized complexity of the above operat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4974","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":"1211.4974","created_at":"2026-05-18T03:40:15.385972+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.4974v1","created_at":"2026-05-18T03:40:15.385972+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4974","created_at":"2026-05-18T03:40:15.385972+00:00"},{"alias_kind":"pith_short_12","alias_value":"OFMJBRHKRIO3","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"OFMJBRHKRIO3DWGM","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"OFMJBRHK","created_at":"2026-05-18T12:27:16.716162+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/OFMJBRHKRIO3DWGMLPO6UMAVMB","json":"https://pith.science/pith/OFMJBRHKRIO3DWGMLPO6UMAVMB.json","graph_json":"https://pith.science/api/pith-number/OFMJBRHKRIO3DWGMLPO6UMAVMB/graph.json","events_json":"https://pith.science/api/pith-number/OFMJBRHKRIO3DWGMLPO6UMAVMB/events.json","paper":"https://pith.science/paper/OFMJBRHK"},"agent_actions":{"view_html":"https://pith.science/pith/OFMJBRHKRIO3DWGMLPO6UMAVMB","download_json":"https://pith.science/pith/OFMJBRHKRIO3DWGMLPO6UMAVMB.json","view_paper":"https://pith.science/paper/OFMJBRHK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.4974&json=true","fetch_graph":"https://pith.science/api/pith-number/OFMJBRHKRIO3DWGMLPO6UMAVMB/graph.json","fetch_events":"https://pith.science/api/pith-number/OFMJBRHKRIO3DWGMLPO6UMAVMB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OFMJBRHKRIO3DWGMLPO6UMAVMB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OFMJBRHKRIO3DWGMLPO6UMAVMB/action/storage_attestation","attest_author":"https://pith.science/pith/OFMJBRHKRIO3DWGMLPO6UMAVMB/action/author_attestation","sign_citation":"https://pith.science/pith/OFMJBRHKRIO3DWGMLPO6UMAVMB/action/citation_signature","submit_replication":"https://pith.science/pith/OFMJBRHKRIO3DWGMLPO6UMAVMB/action/replication_record"}},"created_at":"2026-05-18T03:40:15.385972+00:00","updated_at":"2026-05-18T03:40:15.385972+00:00"}