{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:L3SOM2YXYQJWPRQQZYHDUQQUKM","short_pith_number":"pith:L3SOM2YX","canonical_record":{"source":{"id":"1508.01748","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-08-07T16:26:33Z","cross_cats_sorted":[],"title_canon_sha256":"241eabdd4502968aea558108f89a8e6bf8349440dc629e59f56772b177ce14b2","abstract_canon_sha256":"4f193ef8813edc0186af4bca528c4b482c91788398690b4ff50a1530762488de"},"schema_version":"1.0"},"canonical_sha256":"5ee4e66b17c41367c610ce0e3a42145319f83a78f254388b2121f8a57e586fba","source":{"kind":"arxiv","id":"1508.01748","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01748","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01748v1","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01748","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"pith_short_12","alias_value":"L3SOM2YXYQJW","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"L3SOM2YXYQJWPRQQ","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"L3SOM2YX","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:L3SOM2YXYQJWPRQQZYHDUQQUKM","target":"record","payload":{"canonical_record":{"source":{"id":"1508.01748","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-08-07T16:26:33Z","cross_cats_sorted":[],"title_canon_sha256":"241eabdd4502968aea558108f89a8e6bf8349440dc629e59f56772b177ce14b2","abstract_canon_sha256":"4f193ef8813edc0186af4bca528c4b482c91788398690b4ff50a1530762488de"},"schema_version":"1.0"},"canonical_sha256":"5ee4e66b17c41367c610ce0e3a42145319f83a78f254388b2121f8a57e586fba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:38.851370Z","signature_b64":"qhjIbRSMLiDtF8cvi5+5FjtpioEYoVAoWnzPwzgrCwzAtDjG48d1XODFFK0Fb4gQsltL8XHM1XwLchBPqhLoCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ee4e66b17c41367c610ce0e3a42145319f83a78f254388b2121f8a57e586fba","last_reissued_at":"2026-05-18T01:35:38.850763Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:38.850763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.01748","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-18T01:35:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/uhvHNz04GrBxGva3mgE6ZrL3ZDSTS8NDC4BUB4ASUe5WOP/5Ypbca0HbDHXuR8zMje1UIYrDVlZNebljxtwDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:47:15.655967Z"},"content_sha256":"3d9524c009bf8a9fb0b762e58ee204d7b5080cf8e07ed5d82956577d3868fe08","schema_version":"1.0","event_id":"sha256:3d9524c009bf8a9fb0b762e58ee204d7b5080cf8e07ed5d82956577d3868fe08"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:L3SOM2YXYQJWPRQQZYHDUQQUKM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An optimal class of eighth-order iterative methods based on Kung and Traub's method with its dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Gunar Matthies, Juan Luis Varona, Mehdi Salimi, Somayeh Sharifi","submitted_at":"2015-08-07T16:26:33Z","abstract_excerpt":"In this paper, we present a three-point without memory iterative method based on Kung and Traub's method for solving non-linear equations in one variable. The proposed method has eighth-order convergence and costs only four function evaluations each iteration which supports the Kung-Traub conjecture on the optimal order of convergence. Consequently, this method possesses very high computational efficiency. We present the construction, the convergence analysis, and the numerical implementation of the method. Furthermore, comparisons with some other existing optimal eighth-order methods concerni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01748","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-18T01:35:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hR2q5xdniXbBPns99uWNABuJZ4pVe97Os7dpj1Yc5lniZ1y/H1Gep1XO08mWQR8+5poCpjk0+NNKr6EW7OTEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:47:15.656665Z"},"content_sha256":"d08852e3174202c4172b745d8bf3b65d5085a1b02fc2ba1caeef049d865cae00","schema_version":"1.0","event_id":"sha256:d08852e3174202c4172b745d8bf3b65d5085a1b02fc2ba1caeef049d865cae00"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L3SOM2YXYQJWPRQQZYHDUQQUKM/bundle.json","state_url":"https://pith.science/pith/L3SOM2YXYQJWPRQQZYHDUQQUKM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L3SOM2YXYQJWPRQQZYHDUQQUKM/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-05-25T23:47:15Z","links":{"resolver":"https://pith.science/pith/L3SOM2YXYQJWPRQQZYHDUQQUKM","bundle":"https://pith.science/pith/L3SOM2YXYQJWPRQQZYHDUQQUKM/bundle.json","state":"https://pith.science/pith/L3SOM2YXYQJWPRQQZYHDUQQUKM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L3SOM2YXYQJWPRQQZYHDUQQUKM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:L3SOM2YXYQJWPRQQZYHDUQQUKM","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":"4f193ef8813edc0186af4bca528c4b482c91788398690b4ff50a1530762488de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-08-07T16:26:33Z","title_canon_sha256":"241eabdd4502968aea558108f89a8e6bf8349440dc629e59f56772b177ce14b2"},"schema_version":"1.0","source":{"id":"1508.01748","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.01748","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"arxiv_version","alias_value":"1508.01748v1","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.01748","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"pith_short_12","alias_value":"L3SOM2YXYQJW","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"L3SOM2YXYQJWPRQQ","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"L3SOM2YX","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:d08852e3174202c4172b745d8bf3b65d5085a1b02fc2ba1caeef049d865cae00","target":"graph","created_at":"2026-05-18T01:35:38Z","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":"In this paper, we present a three-point without memory iterative method based on Kung and Traub's method for solving non-linear equations in one variable. The proposed method has eighth-order convergence and costs only four function evaluations each iteration which supports the Kung-Traub conjecture on the optimal order of convergence. Consequently, this method possesses very high computational efficiency. We present the construction, the convergence analysis, and the numerical implementation of the method. Furthermore, comparisons with some other existing optimal eighth-order methods concerni","authors_text":"Gunar Matthies, Juan Luis Varona, Mehdi Salimi, Somayeh Sharifi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-08-07T16:26:33Z","title":"An optimal class of eighth-order iterative methods based on Kung and Traub's method with its dynamics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.01748","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:3d9524c009bf8a9fb0b762e58ee204d7b5080cf8e07ed5d82956577d3868fe08","target":"record","created_at":"2026-05-18T01:35:38Z","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":"4f193ef8813edc0186af4bca528c4b482c91788398690b4ff50a1530762488de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-08-07T16:26:33Z","title_canon_sha256":"241eabdd4502968aea558108f89a8e6bf8349440dc629e59f56772b177ce14b2"},"schema_version":"1.0","source":{"id":"1508.01748","kind":"arxiv","version":1}},"canonical_sha256":"5ee4e66b17c41367c610ce0e3a42145319f83a78f254388b2121f8a57e586fba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ee4e66b17c41367c610ce0e3a42145319f83a78f254388b2121f8a57e586fba","first_computed_at":"2026-05-18T01:35:38.850763Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:38.850763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qhjIbRSMLiDtF8cvi5+5FjtpioEYoVAoWnzPwzgrCwzAtDjG48d1XODFFK0Fb4gQsltL8XHM1XwLchBPqhLoCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:38.851370Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.01748","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d9524c009bf8a9fb0b762e58ee204d7b5080cf8e07ed5d82956577d3868fe08","sha256:d08852e3174202c4172b745d8bf3b65d5085a1b02fc2ba1caeef049d865cae00"],"state_sha256":"230b715b6db0e5ce1effd09d5ecdf2cd9617245c36bd700bdec6462066e71920"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FCw6hBSb17ZzoTodEbqizvx53A7YsM2Mfpc+xGQ8OqMgHVjike1ySjJy8Om7z1lINiA2jxHk7yBm0/SEckBHDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:47:15.660413Z","bundle_sha256":"8367ce5791628fdd3c189d3f3605ef9fe8275688e366cb7890104262fd992871"}}