{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HKNNQIYMH7JNKKJVJGHMMV7BFU","short_pith_number":"pith:HKNNQIYM","canonical_record":{"source":{"id":"1501.05386","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-01-22T04:19:00Z","cross_cats_sorted":[],"title_canon_sha256":"6ef58a95008ae64aa35b80a68626d5daa9763126e41c93efbaf336ea39035542","abstract_canon_sha256":"32639c6009f593082ba9ee23fa2ec15aec669792bde71502c5561d513f78b9ca"},"schema_version":"1.0"},"canonical_sha256":"3a9ad8230c3fd2d52935498ec657e12d05bd5760b72ce13b9f972b1cf1edb210","source":{"kind":"arxiv","id":"1501.05386","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05386","created_at":"2026-05-18T01:49:55Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05386v5","created_at":"2026-05-18T01:49:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05386","created_at":"2026-05-18T01:49:55Z"},{"alias_kind":"pith_short_12","alias_value":"HKNNQIYMH7JN","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HKNNQIYMH7JNKKJV","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HKNNQIYM","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HKNNQIYMH7JNKKJVJGHMMV7BFU","target":"record","payload":{"canonical_record":{"source":{"id":"1501.05386","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-01-22T04:19:00Z","cross_cats_sorted":[],"title_canon_sha256":"6ef58a95008ae64aa35b80a68626d5daa9763126e41c93efbaf336ea39035542","abstract_canon_sha256":"32639c6009f593082ba9ee23fa2ec15aec669792bde71502c5561d513f78b9ca"},"schema_version":"1.0"},"canonical_sha256":"3a9ad8230c3fd2d52935498ec657e12d05bd5760b72ce13b9f972b1cf1edb210","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:49:55.748511Z","signature_b64":"lapSm+m+0TN3roFRun4PH0FhzFQZN8HwB5Ncc/EakA8hAJyrX2Shz+Xwg09frIdla4b3r9s6kPqbZDXNu8njDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a9ad8230c3fd2d52935498ec657e12d05bd5760b72ce13b9f972b1cf1edb210","last_reissued_at":"2026-05-18T01:49:55.747795Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:49:55.747795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.05386","source_version":5,"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:49:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y7OiGaKtW9awzwSd+pp2LZ9z4totRYA0BarpFrcQayLc/Wofs4VjA4SN/F6rBrC8ZoqWOFAf+seJyW6KUTedAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:27:47.079717Z"},"content_sha256":"13b1460655181ab90eb935e00baa4b9416a2d7de9e8bb16ade589d89ff3a517d","schema_version":"1.0","event_id":"sha256:13b1460655181ab90eb935e00baa4b9416a2d7de9e8bb16ade589d89ff3a517d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HKNNQIYMH7JNKKJVJGHMMV7BFU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomial Root Isolation by Means of Root Radii Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Liang Zhao, Victor Y. Pan","submitted_at":"2015-01-22T04:19:00Z","abstract_excerpt":"Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a real coefficient polynomial. They can be approximated at a low computational cost if the polynomial has no nonreal roots, but for high degree polynomials, nonreal roots are typically much more numerous than the real ones. The challenge is known for long time, and the subject has been intensively studied. The Boolean cost bounds for the refinement of the simple and isolated real roots have been decreased to nearly optimal, but the success has been more l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05386","kind":"arxiv","version":5},"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:49:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bHlYBvdZN61XtdCe2gne/wyl3uXFRjST3qsC3A+crRgJfmIf/Le+eRzXLG37VwaOZjIAabqLfTv7uXIpIATQAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:27:47.080433Z"},"content_sha256":"ba2c7a07b2a61a7362b750bb3513054f46ee41ba34440da59303923c24e67a5c","schema_version":"1.0","event_id":"sha256:ba2c7a07b2a61a7362b750bb3513054f46ee41ba34440da59303923c24e67a5c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HKNNQIYMH7JNKKJVJGHMMV7BFU/bundle.json","state_url":"https://pith.science/pith/HKNNQIYMH7JNKKJVJGHMMV7BFU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HKNNQIYMH7JNKKJVJGHMMV7BFU/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-07T20:27:47Z","links":{"resolver":"https://pith.science/pith/HKNNQIYMH7JNKKJVJGHMMV7BFU","bundle":"https://pith.science/pith/HKNNQIYMH7JNKKJVJGHMMV7BFU/bundle.json","state":"https://pith.science/pith/HKNNQIYMH7JNKKJVJGHMMV7BFU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HKNNQIYMH7JNKKJVJGHMMV7BFU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HKNNQIYMH7JNKKJVJGHMMV7BFU","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":"32639c6009f593082ba9ee23fa2ec15aec669792bde71502c5561d513f78b9ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-01-22T04:19:00Z","title_canon_sha256":"6ef58a95008ae64aa35b80a68626d5daa9763126e41c93efbaf336ea39035542"},"schema_version":"1.0","source":{"id":"1501.05386","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05386","created_at":"2026-05-18T01:49:55Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05386v5","created_at":"2026-05-18T01:49:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05386","created_at":"2026-05-18T01:49:55Z"},{"alias_kind":"pith_short_12","alias_value":"HKNNQIYMH7JN","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HKNNQIYMH7JNKKJV","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HKNNQIYM","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:ba2c7a07b2a61a7362b750bb3513054f46ee41ba34440da59303923c24e67a5c","target":"graph","created_at":"2026-05-18T01:49:55Z","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":"Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a real coefficient polynomial. They can be approximated at a low computational cost if the polynomial has no nonreal roots, but for high degree polynomials, nonreal roots are typically much more numerous than the real ones. The challenge is known for long time, and the subject has been intensively studied. The Boolean cost bounds for the refinement of the simple and isolated real roots have been decreased to nearly optimal, but the success has been more l","authors_text":"Liang Zhao, Victor Y. Pan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-01-22T04:19:00Z","title":"Polynomial Root Isolation by Means of Root Radii Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05386","kind":"arxiv","version":5},"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:13b1460655181ab90eb935e00baa4b9416a2d7de9e8bb16ade589d89ff3a517d","target":"record","created_at":"2026-05-18T01:49:55Z","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":"32639c6009f593082ba9ee23fa2ec15aec669792bde71502c5561d513f78b9ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-01-22T04:19:00Z","title_canon_sha256":"6ef58a95008ae64aa35b80a68626d5daa9763126e41c93efbaf336ea39035542"},"schema_version":"1.0","source":{"id":"1501.05386","kind":"arxiv","version":5}},"canonical_sha256":"3a9ad8230c3fd2d52935498ec657e12d05bd5760b72ce13b9f972b1cf1edb210","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a9ad8230c3fd2d52935498ec657e12d05bd5760b72ce13b9f972b1cf1edb210","first_computed_at":"2026-05-18T01:49:55.747795Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:49:55.747795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lapSm+m+0TN3roFRun4PH0FhzFQZN8HwB5Ncc/EakA8hAJyrX2Shz+Xwg09frIdla4b3r9s6kPqbZDXNu8njDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:49:55.748511Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.05386","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13b1460655181ab90eb935e00baa4b9416a2d7de9e8bb16ade589d89ff3a517d","sha256:ba2c7a07b2a61a7362b750bb3513054f46ee41ba34440da59303923c24e67a5c"],"state_sha256":"97260bf8f1809878ea43ed1eb58d7fdeb36ea8de03b5ad682f43ecf2fa517746"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SSpk+C9aEZvYEZlNVb99ZREv+5ZgnQ2ETn+42bdxC3N3ar0xcHBWZbFTUfdhgi3DLL4qOUzemxGx7mTLs0juDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T20:27:47.084452Z","bundle_sha256":"bbb2100437403722a093447df29f0250950f01a0322bf6c5f5f3b488bc58d4ab"}}