{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:4OHOMDXGF6T4BT2KKLF3INEHQZ","short_pith_number":"pith:4OHOMDXG","schema_version":"1.0","canonical_sha256":"e38ee60ee62fa7c0cf4a52cbb434878672a2a2e11a0095270904063cc554634a","source":{"kind":"arxiv","id":"1201.3035","version":3},"attestation_state":"computed","paper":{"title":"Optimal stability polynomials for numerical integration of initial value problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.NA","authors_text":"Aron J. Ahmadia, David I. Ketcheson","submitted_at":"2012-01-14T18:48:48Z","abstract_excerpt":"We consider the problem of finding optimally stable polynomial approximations to the exponential for application to one-step integration of initial value ordinary and partial differential equations. The objective is to find the largest stable step size and corresponding method for a given problem when the spectrum of the initial value problem is known. The problem is expressed in terms of a general least deviation feasibility problem. Its solution is obtained by a new fast, accurate, and robust algorithm based on convex optimization techniques. Global convergence of the algorithm is proven in "},"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":"1201.3035","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-01-14T18:48:48Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"cc09571834f29efc7d31bab638f32fb86844667fbbb7a3da007810675420fcd0","abstract_canon_sha256":"28e428dd85a3641a7cc15d11c1ff8fd6923b35d5a9b51119d1f93917553a0afe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:56.696034Z","signature_b64":"+IGt59l0gOS8fcRCL60rJtpxS+NcrJeUq9nf1hA7JXMyNIzFTA3ZNpeUHUOs09zIpxGF0h78AJEfBXsQsEcPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e38ee60ee62fa7c0cf4a52cbb434878672a2a2e11a0095270904063cc554634a","last_reissued_at":"2026-05-18T03:36:56.695676Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:56.695676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal stability polynomials for numerical integration of initial value problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.NA","authors_text":"Aron J. Ahmadia, David I. Ketcheson","submitted_at":"2012-01-14T18:48:48Z","abstract_excerpt":"We consider the problem of finding optimally stable polynomial approximations to the exponential for application to one-step integration of initial value ordinary and partial differential equations. The objective is to find the largest stable step size and corresponding method for a given problem when the spectrum of the initial value problem is known. The problem is expressed in terms of a general least deviation feasibility problem. Its solution is obtained by a new fast, accurate, and robust algorithm based on convex optimization techniques. Global convergence of the algorithm is proven in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.3035","kind":"arxiv","version":3},"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":"1201.3035","created_at":"2026-05-18T03:36:56.695727+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.3035v3","created_at":"2026-05-18T03:36:56.695727+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.3035","created_at":"2026-05-18T03:36:56.695727+00:00"},{"alias_kind":"pith_short_12","alias_value":"4OHOMDXGF6T4","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"4OHOMDXGF6T4BT2K","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"4OHOMDXG","created_at":"2026-05-18T12:26:53.410803+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/4OHOMDXGF6T4BT2KKLF3INEHQZ","json":"https://pith.science/pith/4OHOMDXGF6T4BT2KKLF3INEHQZ.json","graph_json":"https://pith.science/api/pith-number/4OHOMDXGF6T4BT2KKLF3INEHQZ/graph.json","events_json":"https://pith.science/api/pith-number/4OHOMDXGF6T4BT2KKLF3INEHQZ/events.json","paper":"https://pith.science/paper/4OHOMDXG"},"agent_actions":{"view_html":"https://pith.science/pith/4OHOMDXGF6T4BT2KKLF3INEHQZ","download_json":"https://pith.science/pith/4OHOMDXGF6T4BT2KKLF3INEHQZ.json","view_paper":"https://pith.science/paper/4OHOMDXG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.3035&json=true","fetch_graph":"https://pith.science/api/pith-number/4OHOMDXGF6T4BT2KKLF3INEHQZ/graph.json","fetch_events":"https://pith.science/api/pith-number/4OHOMDXGF6T4BT2KKLF3INEHQZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4OHOMDXGF6T4BT2KKLF3INEHQZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4OHOMDXGF6T4BT2KKLF3INEHQZ/action/storage_attestation","attest_author":"https://pith.science/pith/4OHOMDXGF6T4BT2KKLF3INEHQZ/action/author_attestation","sign_citation":"https://pith.science/pith/4OHOMDXGF6T4BT2KKLF3INEHQZ/action/citation_signature","submit_replication":"https://pith.science/pith/4OHOMDXGF6T4BT2KKLF3INEHQZ/action/replication_record"}},"created_at":"2026-05-18T03:36:56.695727+00:00","updated_at":"2026-05-18T03:36:56.695727+00:00"}