{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MCRSNS2AK6CZZZPT3UNQJLPLJL","short_pith_number":"pith:MCRSNS2A","schema_version":"1.0","canonical_sha256":"60a326cb4057859ce5f3dd1b04adeb4af46a7d6a1bb3994ae7d7d5dfcfe1fc35","source":{"kind":"arxiv","id":"1404.6371","version":1},"attestation_state":"computed","paper":{"title":"Problem formulation 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":"Changbo Chen, David Wilson, James H. Davenport, Marc Moreno Maza, Matthew England, Russell Bradford","submitted_at":"2014-04-25T09:49:49Z","abstract_excerpt":"Cylindrical algebraic decompositions (CADs) are a key tool for solving problems in real algebraic geometry and beyond. We recently presented a new CAD algorithm combining two advances: truth-table invariance, making the CAD invariant with respect to the truth of logical formulae rather than the signs of polynomials; and CAD construction by regular chains technology, where first a complex decomposition is constructed by refining a tree incrementally by constraint. We here consider how best to formulate problems for input to this algorithm. We focus on a choice (not relevant for other CAD algori"},"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":"1404.6371","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2014-04-25T09:49:49Z","cross_cats_sorted":[],"title_canon_sha256":"144bda5ae3d17f9519229004690b484b6249e60be33294121c1776facc06e8fe","abstract_canon_sha256":"dfe9eb85f8082f2559ab8ef230da47ecc95cdf1f38d0d0b38b760071ae82ef16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:43.953352Z","signature_b64":"bLO2/ICRNc74ebNwo2On9mftv0Yc9NksAJ4dkPToDsyiogWQxdz5jjeEQoq+Vfo5aO+vH6bQfPYfkx6Ug8P2Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60a326cb4057859ce5f3dd1b04adeb4af46a7d6a1bb3994ae7d7d5dfcfe1fc35","last_reissued_at":"2026-05-18T02:47:43.952660Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:43.952660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Problem formulation 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":"Changbo Chen, David Wilson, James H. Davenport, Marc Moreno Maza, Matthew England, Russell Bradford","submitted_at":"2014-04-25T09:49:49Z","abstract_excerpt":"Cylindrical algebraic decompositions (CADs) are a key tool for solving problems in real algebraic geometry and beyond. We recently presented a new CAD algorithm combining two advances: truth-table invariance, making the CAD invariant with respect to the truth of logical formulae rather than the signs of polynomials; and CAD construction by regular chains technology, where first a complex decomposition is constructed by refining a tree incrementally by constraint. We here consider how best to formulate problems for input to this algorithm. We focus on a choice (not relevant for other CAD algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6371","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":"1404.6371","created_at":"2026-05-18T02:47:43.952761+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.6371v1","created_at":"2026-05-18T02:47:43.952761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6371","created_at":"2026-05-18T02:47:43.952761+00:00"},{"alias_kind":"pith_short_12","alias_value":"MCRSNS2AK6CZ","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MCRSNS2AK6CZZZPT","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MCRSNS2A","created_at":"2026-05-18T12:28:38.356838+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/MCRSNS2AK6CZZZPT3UNQJLPLJL","json":"https://pith.science/pith/MCRSNS2AK6CZZZPT3UNQJLPLJL.json","graph_json":"https://pith.science/api/pith-number/MCRSNS2AK6CZZZPT3UNQJLPLJL/graph.json","events_json":"https://pith.science/api/pith-number/MCRSNS2AK6CZZZPT3UNQJLPLJL/events.json","paper":"https://pith.science/paper/MCRSNS2A"},"agent_actions":{"view_html":"https://pith.science/pith/MCRSNS2AK6CZZZPT3UNQJLPLJL","download_json":"https://pith.science/pith/MCRSNS2AK6CZZZPT3UNQJLPLJL.json","view_paper":"https://pith.science/paper/MCRSNS2A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.6371&json=true","fetch_graph":"https://pith.science/api/pith-number/MCRSNS2AK6CZZZPT3UNQJLPLJL/graph.json","fetch_events":"https://pith.science/api/pith-number/MCRSNS2AK6CZZZPT3UNQJLPLJL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MCRSNS2AK6CZZZPT3UNQJLPLJL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MCRSNS2AK6CZZZPT3UNQJLPLJL/action/storage_attestation","attest_author":"https://pith.science/pith/MCRSNS2AK6CZZZPT3UNQJLPLJL/action/author_attestation","sign_citation":"https://pith.science/pith/MCRSNS2AK6CZZZPT3UNQJLPLJL/action/citation_signature","submit_replication":"https://pith.science/pith/MCRSNS2AK6CZZZPT3UNQJLPLJL/action/replication_record"}},"created_at":"2026-05-18T02:47:43.952761+00:00","updated_at":"2026-05-18T02:47:43.952761+00:00"}