{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:3334MSYFWCPXO3QQR7TAR65BVD","short_pith_number":"pith:3334MSYF","canonical_record":{"source":{"id":"1104.1362","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-04-07T15:46:11Z","cross_cats_sorted":[],"title_canon_sha256":"64dd30d933b78e9ea65b0cbcd08257b81a1b0c16732a63679dfd86cfdea7342b","abstract_canon_sha256":"b43b0a5990f114d5a24faff0f3168ccacaff2dcfadcaa22a54b5d8a9032b31e2"},"schema_version":"1.0"},"canonical_sha256":"def7c64b05b09f776e108fe608fba1a8fa9f2e3e5b9a6c3d45005de78e6a02bb","source":{"kind":"arxiv","id":"1104.1362","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.1362","created_at":"2026-05-18T02:22:10Z"},{"alias_kind":"arxiv_version","alias_value":"1104.1362v3","created_at":"2026-05-18T02:22:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1362","created_at":"2026-05-18T02:22:10Z"},{"alias_kind":"pith_short_12","alias_value":"3334MSYFWCPX","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"3334MSYFWCPXO3QQ","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"3334MSYF","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:3334MSYFWCPXO3QQR7TAR65BVD","target":"record","payload":{"canonical_record":{"source":{"id":"1104.1362","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-04-07T15:46:11Z","cross_cats_sorted":[],"title_canon_sha256":"64dd30d933b78e9ea65b0cbcd08257b81a1b0c16732a63679dfd86cfdea7342b","abstract_canon_sha256":"b43b0a5990f114d5a24faff0f3168ccacaff2dcfadcaa22a54b5d8a9032b31e2"},"schema_version":"1.0"},"canonical_sha256":"def7c64b05b09f776e108fe608fba1a8fa9f2e3e5b9a6c3d45005de78e6a02bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:10.498422Z","signature_b64":"kgRKBFEoEiQ59LkNdIMz4FOuctRustefMqFXjjGwp/CUyrOKm9/A0WVCDqA9ofuJD9c6aIfbznAhKIK4Qt9nCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"def7c64b05b09f776e108fe608fba1a8fa9f2e3e5b9a6c3d45005de78e6a02bb","last_reissued_at":"2026-05-18T02:22:10.497610Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:10.497610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.1362","source_version":3,"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-18T02:22:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SmRZHi/aVVLtkYwsGV4jGt9CSrRLjMdf09UjirfCePSfKjBpZD9gztX4qTYBrGvIpalCk6w2wETMyLtOF2o7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T11:51:28.871836Z"},"content_sha256":"a11e5a8aed3ed4a82b95c22b83847165e3295efa74d5d1eb25be6838e1493519","schema_version":"1.0","event_id":"sha256:a11e5a8aed3ed4a82b95c22b83847165e3295efa74d5d1eb25be6838e1493519"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:3334MSYFWCPXO3QQR7TAR65BVD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Root Refinement for Real Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Michael Kerber, Michael Sagraloff","submitted_at":"2011-04-07T15:46:11Z","abstract_excerpt":"We consider the problem of approximating all real roots of a square-free polynomial $f$. Given isolating intervals, our algorithm refines each of them to a width of $2^{-L}$ or less, that is, each of the roots is approximated to $L$ bits after the binary point. Our method provides a certified answer for arbitrary real polynomials, only considering finite approximations of the polynomial coefficients and choosing a suitable working precision adaptively. In this way, we get a correct algorithm that is simple to implement and practically efficient. Our algorithm uses the quadratic interval refine"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1362","kind":"arxiv","version":3},"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-18T02:22:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qknOGZ9VNsowai/qa3zUFLxlZ8jJJar/ZFRePvwAyRSs6ZlKzcfHjCtvNeykA/g8o+00h00D+jIf5SMFW4f+DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T11:51:28.872541Z"},"content_sha256":"cc67a7c81ebb7cb744b827a93a353dc75323d842326b5f92e498001be97c8698","schema_version":"1.0","event_id":"sha256:cc67a7c81ebb7cb744b827a93a353dc75323d842326b5f92e498001be97c8698"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3334MSYFWCPXO3QQR7TAR65BVD/bundle.json","state_url":"https://pith.science/pith/3334MSYFWCPXO3QQR7TAR65BVD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3334MSYFWCPXO3QQR7TAR65BVD/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-22T11:51:28Z","links":{"resolver":"https://pith.science/pith/3334MSYFWCPXO3QQR7TAR65BVD","bundle":"https://pith.science/pith/3334MSYFWCPXO3QQR7TAR65BVD/bundle.json","state":"https://pith.science/pith/3334MSYFWCPXO3QQR7TAR65BVD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3334MSYFWCPXO3QQR7TAR65BVD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:3334MSYFWCPXO3QQR7TAR65BVD","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":"b43b0a5990f114d5a24faff0f3168ccacaff2dcfadcaa22a54b5d8a9032b31e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-04-07T15:46:11Z","title_canon_sha256":"64dd30d933b78e9ea65b0cbcd08257b81a1b0c16732a63679dfd86cfdea7342b"},"schema_version":"1.0","source":{"id":"1104.1362","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.1362","created_at":"2026-05-18T02:22:10Z"},{"alias_kind":"arxiv_version","alias_value":"1104.1362v3","created_at":"2026-05-18T02:22:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1362","created_at":"2026-05-18T02:22:10Z"},{"alias_kind":"pith_short_12","alias_value":"3334MSYFWCPX","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"3334MSYFWCPXO3QQ","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"3334MSYF","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:cc67a7c81ebb7cb744b827a93a353dc75323d842326b5f92e498001be97c8698","target":"graph","created_at":"2026-05-18T02:22:10Z","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":"We consider the problem of approximating all real roots of a square-free polynomial $f$. Given isolating intervals, our algorithm refines each of them to a width of $2^{-L}$ or less, that is, each of the roots is approximated to $L$ bits after the binary point. Our method provides a certified answer for arbitrary real polynomials, only considering finite approximations of the polynomial coefficients and choosing a suitable working precision adaptively. In this way, we get a correct algorithm that is simple to implement and practically efficient. Our algorithm uses the quadratic interval refine","authors_text":"Michael Kerber, Michael Sagraloff","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-04-07T15:46:11Z","title":"Root Refinement for Real Polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1362","kind":"arxiv","version":3},"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:a11e5a8aed3ed4a82b95c22b83847165e3295efa74d5d1eb25be6838e1493519","target":"record","created_at":"2026-05-18T02:22:10Z","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":"b43b0a5990f114d5a24faff0f3168ccacaff2dcfadcaa22a54b5d8a9032b31e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-04-07T15:46:11Z","title_canon_sha256":"64dd30d933b78e9ea65b0cbcd08257b81a1b0c16732a63679dfd86cfdea7342b"},"schema_version":"1.0","source":{"id":"1104.1362","kind":"arxiv","version":3}},"canonical_sha256":"def7c64b05b09f776e108fe608fba1a8fa9f2e3e5b9a6c3d45005de78e6a02bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"def7c64b05b09f776e108fe608fba1a8fa9f2e3e5b9a6c3d45005de78e6a02bb","first_computed_at":"2026-05-18T02:22:10.497610Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:10.497610Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kgRKBFEoEiQ59LkNdIMz4FOuctRustefMqFXjjGwp/CUyrOKm9/A0WVCDqA9ofuJD9c6aIfbznAhKIK4Qt9nCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:10.498422Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.1362","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a11e5a8aed3ed4a82b95c22b83847165e3295efa74d5d1eb25be6838e1493519","sha256:cc67a7c81ebb7cb744b827a93a353dc75323d842326b5f92e498001be97c8698"],"state_sha256":"4643d74a197f6080c5154525696f0ac48318dc1ca91d9f19a37c94315cb16257"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YHCH4t9WW1uqXCtN40XZY//QXX65WNSmd1YVHyvxtZtzDtSGqsWu/2V5UfTke93SolpW3FctnK1nJ9UPMc75Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T11:51:28.876249Z","bundle_sha256":"f0130d6a3906735c71a23098bc8582099b057bf9393e6328eaa9e6d2b91d5e8e"}}