{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:YHQ5GGCL2WX77HRFOYC3EYDNPG","short_pith_number":"pith:YHQ5GGCL","schema_version":"1.0","canonical_sha256":"c1e1d3184bd5afff9e257605b2606d79a6b9ab2f6bb2a1378034e630ff58ca3d","source":{"kind":"arxiv","id":"1104.0689","version":1},"attestation_state":"computed","paper":{"title":"Algorithms for Computing Triangular Decompositions of Polynomial Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.SC","authors_text":"Changbo Chen, Marc Moreno Maza","submitted_at":"2011-04-04T20:52:03Z","abstract_excerpt":"We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\\em weakened} notion of a polynomial GCD modulo a regular chain, which permits to greatly simplify and optimize the sub-algorithms. Extracting common work from similar expensive computations is also a key feature of our algorithms. In our experimental results the implementation of our new algorithms, realized with the {\\RegularChains} library in {\\Maple}, outperforms solvers with similar specifications by several orders of magni"},"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":"1104.0689","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2011-04-04T20:52:03Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"d4f2b1667d0d35e79bc90e9c07874fcc4da88e729f1a3b40c7bf7f6d7206bd81","abstract_canon_sha256":"7a4385605bff80c8d0df03222990ab42debb56fe2da547eb518f7716ba0839b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:02.742701Z","signature_b64":"IY+OYKIk0whqNVDl1JShn0TTzjnie0pfimvil20lGOwD+SIJsKRAgRimcj+YW3i7BcjOB3IZbP/D6N2mFpoACQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1e1d3184bd5afff9e257605b2606d79a6b9ab2f6bb2a1378034e630ff58ca3d","last_reissued_at":"2026-05-18T04:25:02.742048Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:02.742048Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for Computing Triangular Decompositions of Polynomial Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.SC","authors_text":"Changbo Chen, Marc Moreno Maza","submitted_at":"2011-04-04T20:52:03Z","abstract_excerpt":"We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\\em weakened} notion of a polynomial GCD modulo a regular chain, which permits to greatly simplify and optimize the sub-algorithms. Extracting common work from similar expensive computations is also a key feature of our algorithms. In our experimental results the implementation of our new algorithms, realized with the {\\RegularChains} library in {\\Maple}, outperforms solvers with similar specifications by several orders of magni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.0689","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":"1104.0689","created_at":"2026-05-18T04:25:02.742152+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.0689v1","created_at":"2026-05-18T04:25:02.742152+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.0689","created_at":"2026-05-18T04:25:02.742152+00:00"},{"alias_kind":"pith_short_12","alias_value":"YHQ5GGCL2WX7","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"YHQ5GGCL2WX77HRF","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"YHQ5GGCL","created_at":"2026-05-18T12:26:47.523578+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/YHQ5GGCL2WX77HRFOYC3EYDNPG","json":"https://pith.science/pith/YHQ5GGCL2WX77HRFOYC3EYDNPG.json","graph_json":"https://pith.science/api/pith-number/YHQ5GGCL2WX77HRFOYC3EYDNPG/graph.json","events_json":"https://pith.science/api/pith-number/YHQ5GGCL2WX77HRFOYC3EYDNPG/events.json","paper":"https://pith.science/paper/YHQ5GGCL"},"agent_actions":{"view_html":"https://pith.science/pith/YHQ5GGCL2WX77HRFOYC3EYDNPG","download_json":"https://pith.science/pith/YHQ5GGCL2WX77HRFOYC3EYDNPG.json","view_paper":"https://pith.science/paper/YHQ5GGCL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.0689&json=true","fetch_graph":"https://pith.science/api/pith-number/YHQ5GGCL2WX77HRFOYC3EYDNPG/graph.json","fetch_events":"https://pith.science/api/pith-number/YHQ5GGCL2WX77HRFOYC3EYDNPG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YHQ5GGCL2WX77HRFOYC3EYDNPG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YHQ5GGCL2WX77HRFOYC3EYDNPG/action/storage_attestation","attest_author":"https://pith.science/pith/YHQ5GGCL2WX77HRFOYC3EYDNPG/action/author_attestation","sign_citation":"https://pith.science/pith/YHQ5GGCL2WX77HRFOYC3EYDNPG/action/citation_signature","submit_replication":"https://pith.science/pith/YHQ5GGCL2WX77HRFOYC3EYDNPG/action/replication_record"}},"created_at":"2026-05-18T04:25:02.742152+00:00","updated_at":"2026-05-18T04:25:02.742152+00:00"}