{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WJ5MNF6HF7IQO7IEGYQJ2EFLY4","short_pith_number":"pith:WJ5MNF6H","schema_version":"1.0","canonical_sha256":"b27ac697c72fd1077d0436209d10abc722900b4ef91ee42952a3c77e22a052bc","source":{"kind":"arxiv","id":"1405.6094","version":1},"attestation_state":"computed","paper":{"title":"Choosing a variable ordering for truth-table invariant cylindrical algebraic decomposition by incremental triangular decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"David Wilson, James H. Davenport, Matthew England, Russell Bradford","submitted_at":"2014-05-23T15:18:19Z","abstract_excerpt":"Cylindrical algebraic decomposition (CAD) is a key tool for solving problems in real algebraic geometry and beyond. In recent years a new approach has been developed, where regular chains technology is used to first build a decomposition in complex space. We consider the latest variant of this which builds the complex decomposition incrementally by polynomial and produces CADs on whose cells a sequence of formulae are truth-invariant. Like all CAD algorithms the user must provide a variable ordering which can have a profound impact on the tractability of a problem. We evaluate existing heurist"},"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":"1405.6094","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2014-05-23T15:18:19Z","cross_cats_sorted":[],"title_canon_sha256":"892d961727c48317d3c42f877e1c2af94aa3c7c243ebe81b45b98ec423808c8b","abstract_canon_sha256":"33f85a358aa63676d3421c612a50c6a88153e897716079250952318da756b8bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:08.168893Z","signature_b64":"8p1k6LC8knGxFmO2u+WfEnqfiNcLMLYXF0/PeUvqhl8Mg9SnQWe7CqCtK5d22jGHZn3pSPieiKXIqgIvuysWCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b27ac697c72fd1077d0436209d10abc722900b4ef91ee42952a3c77e22a052bc","last_reissued_at":"2026-05-18T02:44:08.168455Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:08.168455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Choosing a variable ordering for truth-table invariant cylindrical algebraic decomposition by incremental triangular decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"David Wilson, James H. Davenport, Matthew England, Russell Bradford","submitted_at":"2014-05-23T15:18:19Z","abstract_excerpt":"Cylindrical algebraic decomposition (CAD) is a key tool for solving problems in real algebraic geometry and beyond. In recent years a new approach has been developed, where regular chains technology is used to first build a decomposition in complex space. We consider the latest variant of this which builds the complex decomposition incrementally by polynomial and produces CADs on whose cells a sequence of formulae are truth-invariant. Like all CAD algorithms the user must provide a variable ordering which can have a profound impact on the tractability of a problem. We evaluate existing heurist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6094","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":"1405.6094","created_at":"2026-05-18T02:44:08.168522+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.6094v1","created_at":"2026-05-18T02:44:08.168522+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6094","created_at":"2026-05-18T02:44:08.168522+00:00"},{"alias_kind":"pith_short_12","alias_value":"WJ5MNF6HF7IQ","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WJ5MNF6HF7IQO7IE","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WJ5MNF6H","created_at":"2026-05-18T12:28:54.890064+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/WJ5MNF6HF7IQO7IEGYQJ2EFLY4","json":"https://pith.science/pith/WJ5MNF6HF7IQO7IEGYQJ2EFLY4.json","graph_json":"https://pith.science/api/pith-number/WJ5MNF6HF7IQO7IEGYQJ2EFLY4/graph.json","events_json":"https://pith.science/api/pith-number/WJ5MNF6HF7IQO7IEGYQJ2EFLY4/events.json","paper":"https://pith.science/paper/WJ5MNF6H"},"agent_actions":{"view_html":"https://pith.science/pith/WJ5MNF6HF7IQO7IEGYQJ2EFLY4","download_json":"https://pith.science/pith/WJ5MNF6HF7IQO7IEGYQJ2EFLY4.json","view_paper":"https://pith.science/paper/WJ5MNF6H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.6094&json=true","fetch_graph":"https://pith.science/api/pith-number/WJ5MNF6HF7IQO7IEGYQJ2EFLY4/graph.json","fetch_events":"https://pith.science/api/pith-number/WJ5MNF6HF7IQO7IEGYQJ2EFLY4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WJ5MNF6HF7IQO7IEGYQJ2EFLY4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WJ5MNF6HF7IQO7IEGYQJ2EFLY4/action/storage_attestation","attest_author":"https://pith.science/pith/WJ5MNF6HF7IQO7IEGYQJ2EFLY4/action/author_attestation","sign_citation":"https://pith.science/pith/WJ5MNF6HF7IQO7IEGYQJ2EFLY4/action/citation_signature","submit_replication":"https://pith.science/pith/WJ5MNF6HF7IQO7IEGYQJ2EFLY4/action/replication_record"}},"created_at":"2026-05-18T02:44:08.168522+00:00","updated_at":"2026-05-18T02:44:08.168522+00:00"}