{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:CLMED2BWEUBPNXH5GLVKJSRJSE","short_pith_number":"pith:CLMED2BW","schema_version":"1.0","canonical_sha256":"12d841e8362502f6dcfd32eaa4ca299112148bc422e7887c63e238236a5b8b50","source":{"kind":"arxiv","id":"1102.5463","version":1},"attestation_state":"computed","paper":{"title":"Complete Subdivision Algorithms, II: Isotopic Meshing of Singular Algebraic Curves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.AG"],"primary_cat":"cs.CG","authors_text":"Ben Galehouse, Chee Yap, Michael Burr, Sung Woo Choi","submitted_at":"2011-02-27T00:49:36Z","abstract_excerpt":"Given a real valued function f(X,Y), a box region B_0 in R^2 and a positive epsilon, we want to compute an epsilon-isotopic polygonal approximation to the restriction of the curve S=f^{-1}(0)={p in R^2: f(p)=0} to B_0. We focus on subdivision algorithms because of their adaptive complexity and ease of implementation. Plantinga and Vegter gave a numerical subdivision algorithm that is exact when the curve S is bounded and non-singular. They used a computational model that relied only on function evaluation and interval arithmetic. We generalize their algorithm to any bounded (but possibly non-s"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1102.5463","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-02-27T00:49:36Z","cross_cats_sorted":["cs.DS","math.AG"],"title_canon_sha256":"ded0f90fd9d2718e185ebfe828d5de9299d8f0314d6b432858c13cf38320d9c6","abstract_canon_sha256":"2a38ef6bc172cb6c82a7e93b4041cc1bf86ae4df303776da9b8bc866311ed6fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:46.862481Z","signature_b64":"CCZVT3gVTU30DwcfhkgVp1Mydre/6xAquroLGFO0anfqrrHB+Scg82u5vG80WM+bj3mlZe0zmoqO0hE/nB4xDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12d841e8362502f6dcfd32eaa4ca299112148bc422e7887c63e238236a5b8b50","last_reissued_at":"2026-05-18T04:27:46.861744Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:46.861744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complete Subdivision Algorithms, II: Isotopic Meshing of Singular Algebraic Curves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.AG"],"primary_cat":"cs.CG","authors_text":"Ben Galehouse, Chee Yap, Michael Burr, Sung Woo Choi","submitted_at":"2011-02-27T00:49:36Z","abstract_excerpt":"Given a real valued function f(X,Y), a box region B_0 in R^2 and a positive epsilon, we want to compute an epsilon-isotopic polygonal approximation to the restriction of the curve S=f^{-1}(0)={p in R^2: f(p)=0} to B_0. We focus on subdivision algorithms because of their adaptive complexity and ease of implementation. Plantinga and Vegter gave a numerical subdivision algorithm that is exact when the curve S is bounded and non-singular. They used a computational model that relied only on function evaluation and interval arithmetic. We generalize their algorithm to any bounded (but possibly non-s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5463","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1102.5463","created_at":"2026-05-18T04:27:46.861872+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.5463v1","created_at":"2026-05-18T04:27:46.861872+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5463","created_at":"2026-05-18T04:27:46.861872+00:00"},{"alias_kind":"pith_short_12","alias_value":"CLMED2BWEUBP","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"CLMED2BWEUBPNXH5","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"CLMED2BW","created_at":"2026-05-18T12:26:26.731475+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CLMED2BWEUBPNXH5GLVKJSRJSE","json":"https://pith.science/pith/CLMED2BWEUBPNXH5GLVKJSRJSE.json","graph_json":"https://pith.science/api/pith-number/CLMED2BWEUBPNXH5GLVKJSRJSE/graph.json","events_json":"https://pith.science/api/pith-number/CLMED2BWEUBPNXH5GLVKJSRJSE/events.json","paper":"https://pith.science/paper/CLMED2BW"},"agent_actions":{"view_html":"https://pith.science/pith/CLMED2BWEUBPNXH5GLVKJSRJSE","download_json":"https://pith.science/pith/CLMED2BWEUBPNXH5GLVKJSRJSE.json","view_paper":"https://pith.science/paper/CLMED2BW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.5463&json=true","fetch_graph":"https://pith.science/api/pith-number/CLMED2BWEUBPNXH5GLVKJSRJSE/graph.json","fetch_events":"https://pith.science/api/pith-number/CLMED2BWEUBPNXH5GLVKJSRJSE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CLMED2BWEUBPNXH5GLVKJSRJSE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CLMED2BWEUBPNXH5GLVKJSRJSE/action/storage_attestation","attest_author":"https://pith.science/pith/CLMED2BWEUBPNXH5GLVKJSRJSE/action/author_attestation","sign_citation":"https://pith.science/pith/CLMED2BWEUBPNXH5GLVKJSRJSE/action/citation_signature","submit_replication":"https://pith.science/pith/CLMED2BWEUBPNXH5GLVKJSRJSE/action/replication_record"}},"created_at":"2026-05-18T04:27:46.861872+00:00","updated_at":"2026-05-18T04:27:46.861872+00:00"}