{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5AAY2ISF75MURLOXG647WJYIYH","short_pith_number":"pith:5AAY2ISF","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"},"canonical_sha256":"e8018d2245ff5948add737b9fb2708c1e891837e4fcdf89002aead6adfeb8c03","source":{"kind":"arxiv","id":"1904.10569","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.10569","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"arxiv_version","alias_value":"1904.10569v1","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10569","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"pith_short_12","alias_value":"5AAY2ISF75MU","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5AAY2ISF75MURLOX","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5AAY2ISF","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5AAY2ISF75MURLOXG647WJYIYH","target":"record","payload":{"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"},"canonical_sha256":"e8018d2245ff5948add737b9fb2708c1e891837e4fcdf89002aead6adfeb8c03","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"},"source_kind":"arxiv","source_id":"1904.10569","source_version":1,"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-17T23:47:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yFDlcY/I7drbgIKdLiknNEnEjYFr675qGMwifjWNgMBxK2Kf3v/03exX8CG7u5dyEEbkuqMWTZBx+itmUklZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:06:26.045594Z"},"content_sha256":"a58bc49f150a3f3ee75145ba150d4cfc162e1d636c9bca1f3dfaaf25a1de0357","schema_version":"1.0","event_id":"sha256:a58bc49f150a3f3ee75145ba150d4cfc162e1d636c9bca1f3dfaaf25a1de0357"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5AAY2ISF75MURLOXG647WJYIYH","target":"graph","payload":{"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"},"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-17T23:47:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Q3vUQKZP6hEyrjL2fyxyfCBdd2stQqKBtas43TIZgNPSMJVjzKJY/p9SKgpSKr7IdoxMRAt4Vf58izvSiSfAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T13:06:26.045953Z"},"content_sha256":"b888f545874a819d684e6c564ec75e1b45822f17cb97a55f78f0ea3328823223","schema_version":"1.0","event_id":"sha256:b888f545874a819d684e6c564ec75e1b45822f17cb97a55f78f0ea3328823223"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5AAY2ISF75MURLOXG647WJYIYH/bundle.json","state_url":"https://pith.science/pith/5AAY2ISF75MURLOXG647WJYIYH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5AAY2ISF75MURLOXG647WJYIYH/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-02T13:06:26Z","links":{"resolver":"https://pith.science/pith/5AAY2ISF75MURLOXG647WJYIYH","bundle":"https://pith.science/pith/5AAY2ISF75MURLOXG647WJYIYH/bundle.json","state":"https://pith.science/pith/5AAY2ISF75MURLOXG647WJYIYH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5AAY2ISF75MURLOXG647WJYIYH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5AAY2ISF75MURLOXG647WJYIYH","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":"bf8395a5b0386cce65b8cec4ba38ce1d1ba263f00f9ca42513d4bf4d5b535f16","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-04-23T23:38:06Z","title_canon_sha256":"eccbe02f72d4e94947564d76996700072d963902086ded52013bf3cdb3f9ea97"},"schema_version":"1.0","source":{"id":"1904.10569","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.10569","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"arxiv_version","alias_value":"1904.10569v1","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10569","created_at":"2026-05-17T23:47:53Z"},{"alias_kind":"pith_short_12","alias_value":"5AAY2ISF75MU","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5AAY2ISF75MURLOX","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5AAY2ISF","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:b888f545874a819d684e6c564ec75e1b45822f17cb97a55f78f0ea3328823223","target":"graph","created_at":"2026-05-17T23:47:53Z","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":"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","authors_text":"Frank Uhlig","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-04-23T23:38:06Z","title":"The Construction of High Order Convergent Look-Ahead Finite Difference Formulas for Zhang Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.10569","kind":"arxiv","version":1},"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:a58bc49f150a3f3ee75145ba150d4cfc162e1d636c9bca1f3dfaaf25a1de0357","target":"record","created_at":"2026-05-17T23:47:53Z","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":"bf8395a5b0386cce65b8cec4ba38ce1d1ba263f00f9ca42513d4bf4d5b535f16","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-04-23T23:38:06Z","title_canon_sha256":"eccbe02f72d4e94947564d76996700072d963902086ded52013bf3cdb3f9ea97"},"schema_version":"1.0","source":{"id":"1904.10569","kind":"arxiv","version":1}},"canonical_sha256":"e8018d2245ff5948add737b9fb2708c1e891837e4fcdf89002aead6adfeb8c03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8018d2245ff5948add737b9fb2708c1e891837e4fcdf89002aead6adfeb8c03","first_computed_at":"2026-05-17T23:47:53.371617Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:53.371617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0MVhI0c7L0C9ah4jWCjWTL/FQnkrv2PlgPX0TSMsmMyzY+UbOwXqzXx02friJDX/+Pb3HYETn+2HPsQaJEvAAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:53.372168Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.10569","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a58bc49f150a3f3ee75145ba150d4cfc162e1d636c9bca1f3dfaaf25a1de0357","sha256:b888f545874a819d684e6c564ec75e1b45822f17cb97a55f78f0ea3328823223"],"state_sha256":"b248c327050a42a8662bab20a5d24deb739fc9c56427fa9c3936c01b188c9071"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5CeJxuJOieUTHR2bxQs7Sh0u2wQOHEuO+CPyBXUGTtO0K2kDXm7pAp3lNcBCHedA0eonaa/isBbD74arsFkFDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T13:06:26.048108Z","bundle_sha256":"43e188e54034423598f24a926c34b0d59bb8328035c8ebf9a0e6314d4bca853d"}}