{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:MXCOFPYXGW6PJDC7SLDXQMT6AV","short_pith_number":"pith:MXCOFPYX","canonical_record":{"source":{"id":"1211.4332","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2012-11-19T08:30:30Z","cross_cats_sorted":[],"title_canon_sha256":"afbe689083f54e7daa8a1e7c8318977f1c96c1377294c70d271df319d773c28f","abstract_canon_sha256":"c6bb0bf67fa9ec0175adcb04e69a5fb5f490d38a83ab41489a02e0dae6f7b81d"},"schema_version":"1.0"},"canonical_sha256":"65c4e2bf1735bcf48c5f92c778327e057086f38f537eebf422cb1c70d3a14ded","source":{"kind":"arxiv","id":"1211.4332","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.4332","created_at":"2026-05-18T03:40:27Z"},{"alias_kind":"arxiv_version","alias_value":"1211.4332v1","created_at":"2026-05-18T03:40:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4332","created_at":"2026-05-18T03:40:27Z"},{"alias_kind":"pith_short_12","alias_value":"MXCOFPYXGW6P","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MXCOFPYXGW6PJDC7","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MXCOFPYX","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:MXCOFPYXGW6PJDC7SLDXQMT6AV","target":"record","payload":{"canonical_record":{"source":{"id":"1211.4332","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2012-11-19T08:30:30Z","cross_cats_sorted":[],"title_canon_sha256":"afbe689083f54e7daa8a1e7c8318977f1c96c1377294c70d271df319d773c28f","abstract_canon_sha256":"c6bb0bf67fa9ec0175adcb04e69a5fb5f490d38a83ab41489a02e0dae6f7b81d"},"schema_version":"1.0"},"canonical_sha256":"65c4e2bf1735bcf48c5f92c778327e057086f38f537eebf422cb1c70d3a14ded","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:27.256490Z","signature_b64":"URV4GFRIIUOAzZsY2jjsF+8oe/OoFXSHJ3e8rHQzpUI4GtJvqcC/2AfgKHCRDGg+zlpKgHRg7aCjP38M2iB1Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65c4e2bf1735bcf48c5f92c778327e057086f38f537eebf422cb1c70d3a14ded","last_reissued_at":"2026-05-18T03:40:27.256058Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:27.256058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.4332","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-18T03:40:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qwhpJ0sLNnV5KqhI58G5P9UB1lTUSMhTQPY/r4GyGs19kwIHTLnr+3bG3aHz0CKNH/JuPijHxrhfkWofOSE5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T09:59:52.726618Z"},"content_sha256":"d85aa260fcebc3eb30a6f6a7fe81c9417b2016697724102a829482a6e079f567","schema_version":"1.0","event_id":"sha256:d85aa260fcebc3eb30a6f6a7fe81c9417b2016697724102a829482a6e079f567"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:MXCOFPYXGW6PJDC7SLDXQMT6AV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Real root refinements for univariate polynomial equations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NA","authors_text":"Ye Liang","submitted_at":"2012-11-19T08:30:30Z","abstract_excerpt":"Real root finding of polynomial equations is a basic problem in computer algebra. This task is usually divided into two parts: isolation and refinement. In this paper, we propose two algorithms LZ1 and LZ2 to refine real roots of univariate polynomial equations. Our algorithms combine Newton's method and the secant method to bound the unique solution in an interval of a monotonic convex isolation (MCI) of a polynomial, and have quadratic and cubic convergence rates, respectively. To avoid the swell of coefficients and speed up the computation, we implement the two algorithms by using the float"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4332","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-18T03:40:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GGqZTSDZ1fWLAehl+zYrj7RZ28BfaVxcUlUZBH89IVf9Ej6eej8WxgNIQcfEuLtBfgnBnanO3g/+dLqgRcftCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T09:59:52.726958Z"},"content_sha256":"756f31bad796fe8bf2eddba5c9d787c52051d6d0933fcd7dd231b945abce6cb3","schema_version":"1.0","event_id":"sha256:756f31bad796fe8bf2eddba5c9d787c52051d6d0933fcd7dd231b945abce6cb3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MXCOFPYXGW6PJDC7SLDXQMT6AV/bundle.json","state_url":"https://pith.science/pith/MXCOFPYXGW6PJDC7SLDXQMT6AV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MXCOFPYXGW6PJDC7SLDXQMT6AV/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-28T09:59:52Z","links":{"resolver":"https://pith.science/pith/MXCOFPYXGW6PJDC7SLDXQMT6AV","bundle":"https://pith.science/pith/MXCOFPYXGW6PJDC7SLDXQMT6AV/bundle.json","state":"https://pith.science/pith/MXCOFPYXGW6PJDC7SLDXQMT6AV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MXCOFPYXGW6PJDC7SLDXQMT6AV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:MXCOFPYXGW6PJDC7SLDXQMT6AV","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":"c6bb0bf67fa9ec0175adcb04e69a5fb5f490d38a83ab41489a02e0dae6f7b81d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2012-11-19T08:30:30Z","title_canon_sha256":"afbe689083f54e7daa8a1e7c8318977f1c96c1377294c70d271df319d773c28f"},"schema_version":"1.0","source":{"id":"1211.4332","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.4332","created_at":"2026-05-18T03:40:27Z"},{"alias_kind":"arxiv_version","alias_value":"1211.4332v1","created_at":"2026-05-18T03:40:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4332","created_at":"2026-05-18T03:40:27Z"},{"alias_kind":"pith_short_12","alias_value":"MXCOFPYXGW6P","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MXCOFPYXGW6PJDC7","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MXCOFPYX","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:756f31bad796fe8bf2eddba5c9d787c52051d6d0933fcd7dd231b945abce6cb3","target":"graph","created_at":"2026-05-18T03:40:27Z","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":"Real root finding of polynomial equations is a basic problem in computer algebra. This task is usually divided into two parts: isolation and refinement. In this paper, we propose two algorithms LZ1 and LZ2 to refine real roots of univariate polynomial equations. Our algorithms combine Newton's method and the secant method to bound the unique solution in an interval of a monotonic convex isolation (MCI) of a polynomial, and have quadratic and cubic convergence rates, respectively. To avoid the swell of coefficients and speed up the computation, we implement the two algorithms by using the float","authors_text":"Ye Liang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2012-11-19T08:30:30Z","title":"Real root refinements for univariate polynomial equations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4332","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:d85aa260fcebc3eb30a6f6a7fe81c9417b2016697724102a829482a6e079f567","target":"record","created_at":"2026-05-18T03:40:27Z","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":"c6bb0bf67fa9ec0175adcb04e69a5fb5f490d38a83ab41489a02e0dae6f7b81d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2012-11-19T08:30:30Z","title_canon_sha256":"afbe689083f54e7daa8a1e7c8318977f1c96c1377294c70d271df319d773c28f"},"schema_version":"1.0","source":{"id":"1211.4332","kind":"arxiv","version":1}},"canonical_sha256":"65c4e2bf1735bcf48c5f92c778327e057086f38f537eebf422cb1c70d3a14ded","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65c4e2bf1735bcf48c5f92c778327e057086f38f537eebf422cb1c70d3a14ded","first_computed_at":"2026-05-18T03:40:27.256058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:40:27.256058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"URV4GFRIIUOAzZsY2jjsF+8oe/OoFXSHJ3e8rHQzpUI4GtJvqcC/2AfgKHCRDGg+zlpKgHRg7aCjP38M2iB1Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:40:27.256490Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.4332","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d85aa260fcebc3eb30a6f6a7fe81c9417b2016697724102a829482a6e079f567","sha256:756f31bad796fe8bf2eddba5c9d787c52051d6d0933fcd7dd231b945abce6cb3"],"state_sha256":"b74d4057a0c015cbd1ba98fcd3bffbc1e67d9f000e64527d47b77e09d392eda3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xcix57LFVvTJ5J5t7OL9TKnCwjbtmM2gHteYaLiH1hkqyHWpLi+BdbH1QNFa95qWzPfaDpkNXgkRA01JrFQLBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T09:59:52.728802Z","bundle_sha256":"5b555aff29f506ac49503d0585cf64ee7d86a1627af4d8d66250cd944ae216f2"}}