{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5AAY2ISF75MURLOXG647WJYIYH","short_pith_number":"pith:5AAY2ISF","schema_version":"1.0","canonical_sha256":"e8018d2245ff5948add737b9fb2708c1e891837e4fcdf89002aead6adfeb8c03","source":{"kind":"arxiv","id":"1904.10569","version":1},"attestation_state":"computed","paper":{"title":"The Construction of High Order Convergent Look-Ahead Finite Difference Formulas for Zhang Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Frank Uhlig","submitted_at":"2019-04-23T23:38:06Z","abstract_excerpt":"Zhang Neural Networks rely on convergent 1-step ahead finite difference formulas of which very few are known. Those which are known have been constructed in ad-hoc ways and suffer from low truncation error orders. This paper develops a constructive method to find convergent look-ahead finite difference schemes of higher truncation error orders. The method consists of seeding the free variables of a linear system comprised of Taylor expansion coefficients followed by a minimization algorithm for the maximal magnitude root of the formula's characteristic polynomial. This helps us find new conver"},"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":"1904.10569","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-04-23T23:38:06Z","cross_cats_sorted":[],"title_canon_sha256":"eccbe02f72d4e94947564d76996700072d963902086ded52013bf3cdb3f9ea97","abstract_canon_sha256":"bf8395a5b0386cce65b8cec4ba38ce1d1ba263f00f9ca42513d4bf4d5b535f16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:53.372168Z","signature_b64":"0MVhI0c7L0C9ah4jWCjWTL/FQnkrv2PlgPX0TSMsmMyzY+UbOwXqzXx02friJDX/+Pb3HYETn+2HPsQaJEvAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8018d2245ff5948add737b9fb2708c1e891837e4fcdf89002aead6adfeb8c03","last_reissued_at":"2026-05-17T23:47:53.371617Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:53.371617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Construction of High Order Convergent Look-Ahead Finite Difference Formulas for Zhang Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Frank Uhlig","submitted_at":"2019-04-23T23:38:06Z","abstract_excerpt":"Zhang Neural Networks rely on convergent 1-step ahead finite difference formulas of which very few are known. Those which are known have been constructed in ad-hoc ways and suffer from low truncation error orders. This paper develops a constructive method to find convergent look-ahead finite difference schemes of higher truncation error orders. The method consists of seeding the free variables of a linear system comprised of Taylor expansion coefficients followed by a minimization algorithm for the maximal magnitude root of the formula's characteristic polynomial. This helps us find new conver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.10569","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":"1904.10569","created_at":"2026-05-17T23:47:53.371691+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.10569v1","created_at":"2026-05-17T23:47:53.371691+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10569","created_at":"2026-05-17T23:47:53.371691+00:00"},{"alias_kind":"pith_short_12","alias_value":"5AAY2ISF75MU","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5AAY2ISF75MURLOX","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5AAY2ISF","created_at":"2026-05-18T12:33:10.108867+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/5AAY2ISF75MURLOXG647WJYIYH","json":"https://pith.science/pith/5AAY2ISF75MURLOXG647WJYIYH.json","graph_json":"https://pith.science/api/pith-number/5AAY2ISF75MURLOXG647WJYIYH/graph.json","events_json":"https://pith.science/api/pith-number/5AAY2ISF75MURLOXG647WJYIYH/events.json","paper":"https://pith.science/paper/5AAY2ISF"},"agent_actions":{"view_html":"https://pith.science/pith/5AAY2ISF75MURLOXG647WJYIYH","download_json":"https://pith.science/pith/5AAY2ISF75MURLOXG647WJYIYH.json","view_paper":"https://pith.science/paper/5AAY2ISF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.10569&json=true","fetch_graph":"https://pith.science/api/pith-number/5AAY2ISF75MURLOXG647WJYIYH/graph.json","fetch_events":"https://pith.science/api/pith-number/5AAY2ISF75MURLOXG647WJYIYH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5AAY2ISF75MURLOXG647WJYIYH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5AAY2ISF75MURLOXG647WJYIYH/action/storage_attestation","attest_author":"https://pith.science/pith/5AAY2ISF75MURLOXG647WJYIYH/action/author_attestation","sign_citation":"https://pith.science/pith/5AAY2ISF75MURLOXG647WJYIYH/action/citation_signature","submit_replication":"https://pith.science/pith/5AAY2ISF75MURLOXG647WJYIYH/action/replication_record"}},"created_at":"2026-05-17T23:47:53.371691+00:00","updated_at":"2026-05-17T23:47:53.371691+00:00"}