{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MNZ6YIAHPT65EUSHV2XQC533PI","short_pith_number":"pith:MNZ6YIAH","schema_version":"1.0","canonical_sha256":"6373ec20077cfdd25247aeaf01777b7a18b5c6a0d02c38770629deca6a173a93","source":{"kind":"arxiv","id":"1210.5543","version":1},"attestation_state":"computed","paper":{"title":"An Incremental Algorithm for Computing Cylindrical Algebraic Decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Changbo Chen, Marc Moreno Maza","submitted_at":"2012-10-19T21:31:13Z","abstract_excerpt":"In this paper, we propose an incremental algorithm for computing cylindrical algebraic decompositions. The algorithm consists of two parts: computing a complex cylindrical tree and refining this complex tree into a cylindrical tree in real space. The incrementality comes from the first part of the algorithm, where a complex cylindrical tree is constructed by refining a previous complex cylindrical tree with a polynomial constraint. We have implemented our algorithm in Maple. The experimentation shows that the proposed algorithm outperforms existing ones for many examples taken from the literat"},"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":"1210.5543","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2012-10-19T21:31:13Z","cross_cats_sorted":[],"title_canon_sha256":"734b887c88058c42462653d96c8e3b86ff0a3e5799530c0ec441617aa4f581fc","abstract_canon_sha256":"36360c2b9a93339009140421b538df4c55c80586ce928818b8d4e35a68aaa7ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:43.694180Z","signature_b64":"YPMdj3HxCjdSdq5tIgLoegHoNRqKOdjdQHdgR9iP2rmY9YHKrQ8lLpRlUtbvIj0nvlVHp5e3k5GNPstTKay+Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6373ec20077cfdd25247aeaf01777b7a18b5c6a0d02c38770629deca6a173a93","last_reissued_at":"2026-05-18T03:42:43.693403Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:43.693403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Incremental Algorithm for Computing Cylindrical Algebraic Decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Changbo Chen, Marc Moreno Maza","submitted_at":"2012-10-19T21:31:13Z","abstract_excerpt":"In this paper, we propose an incremental algorithm for computing cylindrical algebraic decompositions. The algorithm consists of two parts: computing a complex cylindrical tree and refining this complex tree into a cylindrical tree in real space. The incrementality comes from the first part of the algorithm, where a complex cylindrical tree is constructed by refining a previous complex cylindrical tree with a polynomial constraint. We have implemented our algorithm in Maple. The experimentation shows that the proposed algorithm outperforms existing ones for many examples taken from the literat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.5543","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":"1210.5543","created_at":"2026-05-18T03:42:43.693535+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.5543v1","created_at":"2026-05-18T03:42:43.693535+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.5543","created_at":"2026-05-18T03:42:43.693535+00:00"},{"alias_kind":"pith_short_12","alias_value":"MNZ6YIAHPT65","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MNZ6YIAHPT65EUSH","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MNZ6YIAH","created_at":"2026-05-18T12:27:14.488303+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/MNZ6YIAHPT65EUSHV2XQC533PI","json":"https://pith.science/pith/MNZ6YIAHPT65EUSHV2XQC533PI.json","graph_json":"https://pith.science/api/pith-number/MNZ6YIAHPT65EUSHV2XQC533PI/graph.json","events_json":"https://pith.science/api/pith-number/MNZ6YIAHPT65EUSHV2XQC533PI/events.json","paper":"https://pith.science/paper/MNZ6YIAH"},"agent_actions":{"view_html":"https://pith.science/pith/MNZ6YIAHPT65EUSHV2XQC533PI","download_json":"https://pith.science/pith/MNZ6YIAHPT65EUSHV2XQC533PI.json","view_paper":"https://pith.science/paper/MNZ6YIAH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.5543&json=true","fetch_graph":"https://pith.science/api/pith-number/MNZ6YIAHPT65EUSHV2XQC533PI/graph.json","fetch_events":"https://pith.science/api/pith-number/MNZ6YIAHPT65EUSHV2XQC533PI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MNZ6YIAHPT65EUSHV2XQC533PI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MNZ6YIAHPT65EUSHV2XQC533PI/action/storage_attestation","attest_author":"https://pith.science/pith/MNZ6YIAHPT65EUSHV2XQC533PI/action/author_attestation","sign_citation":"https://pith.science/pith/MNZ6YIAHPT65EUSHV2XQC533PI/action/citation_signature","submit_replication":"https://pith.science/pith/MNZ6YIAHPT65EUSHV2XQC533PI/action/replication_record"}},"created_at":"2026-05-18T03:42:43.693535+00:00","updated_at":"2026-05-18T03:42:43.693535+00:00"}