{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QRBKIRU5LFD5GNTYKZQ33QTYOU","short_pith_number":"pith:QRBKIRU5","schema_version":"1.0","canonical_sha256":"8442a4469d5947d336785661bdc27875268ee280f54154ebb8139dd2bdcaaed7","source":{"kind":"arxiv","id":"1906.00039","version":1},"attestation_state":"computed","paper":{"title":"On the Parallelization of Triangular Decomposition of Polynomial Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.MS"],"primary_cat":"cs.SC","authors_text":"Alexander Brandt, Marc Moreno Maza, Mohammadali Asadi, Robert H. C. Moir, Yuzhen Xie","submitted_at":"2019-05-31T19:16:47Z","abstract_excerpt":"We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decomposition. Algorithms for solving polynomial systems combine low-level routines for performing arithmetic operations on polynomials and high-level procedures which produce the different components (points, curves, surfaces) of the solution set. The latter \"component-level\" parallelization of triangular decompositions, our focus here, belongs to the class of dynamic irregular parallel applications. Possible speedup factors depend on geometrical properties of the solution set (number"},"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":"1906.00039","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2019-05-31T19:16:47Z","cross_cats_sorted":["cs.DC","cs.MS"],"title_canon_sha256":"447d5db9f72b5fe579013290098952e3419df4f79234a87b7a5d29a36d7b4362","abstract_canon_sha256":"43f8c22d93e2d4209306adc3f4ab2ac5b290d6728d1a5bbccda41275b2e694ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:33.653610Z","signature_b64":"o/61+HZKTbIfdwXMU+Xl/cME/silG9GfHgQxwe09wQQpgbVfIBxLLcfwBXGEUZudSbxKa9txHlx/nQU5jcghAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8442a4469d5947d336785661bdc27875268ee280f54154ebb8139dd2bdcaaed7","last_reissued_at":"2026-05-17T23:44:33.653090Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:33.653090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Parallelization of Triangular Decomposition of Polynomial Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.MS"],"primary_cat":"cs.SC","authors_text":"Alexander Brandt, Marc Moreno Maza, Mohammadali Asadi, Robert H. C. Moir, Yuzhen Xie","submitted_at":"2019-05-31T19:16:47Z","abstract_excerpt":"We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decomposition. Algorithms for solving polynomial systems combine low-level routines for performing arithmetic operations on polynomials and high-level procedures which produce the different components (points, curves, surfaces) of the solution set. The latter \"component-level\" parallelization of triangular decompositions, our focus here, belongs to the class of dynamic irregular parallel applications. Possible speedup factors depend on geometrical properties of the solution set (number"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00039","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":"1906.00039","created_at":"2026-05-17T23:44:33.653179+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.00039v1","created_at":"2026-05-17T23:44:33.653179+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00039","created_at":"2026-05-17T23:44:33.653179+00:00"},{"alias_kind":"pith_short_12","alias_value":"QRBKIRU5LFD5","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QRBKIRU5LFD5GNTY","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QRBKIRU5","created_at":"2026-05-18T12:33:27.125529+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/QRBKIRU5LFD5GNTYKZQ33QTYOU","json":"https://pith.science/pith/QRBKIRU5LFD5GNTYKZQ33QTYOU.json","graph_json":"https://pith.science/api/pith-number/QRBKIRU5LFD5GNTYKZQ33QTYOU/graph.json","events_json":"https://pith.science/api/pith-number/QRBKIRU5LFD5GNTYKZQ33QTYOU/events.json","paper":"https://pith.science/paper/QRBKIRU5"},"agent_actions":{"view_html":"https://pith.science/pith/QRBKIRU5LFD5GNTYKZQ33QTYOU","download_json":"https://pith.science/pith/QRBKIRU5LFD5GNTYKZQ33QTYOU.json","view_paper":"https://pith.science/paper/QRBKIRU5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.00039&json=true","fetch_graph":"https://pith.science/api/pith-number/QRBKIRU5LFD5GNTYKZQ33QTYOU/graph.json","fetch_events":"https://pith.science/api/pith-number/QRBKIRU5LFD5GNTYKZQ33QTYOU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QRBKIRU5LFD5GNTYKZQ33QTYOU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QRBKIRU5LFD5GNTYKZQ33QTYOU/action/storage_attestation","attest_author":"https://pith.science/pith/QRBKIRU5LFD5GNTYKZQ33QTYOU/action/author_attestation","sign_citation":"https://pith.science/pith/QRBKIRU5LFD5GNTYKZQ33QTYOU/action/citation_signature","submit_replication":"https://pith.science/pith/QRBKIRU5LFD5GNTYKZQ33QTYOU/action/replication_record"}},"created_at":"2026-05-17T23:44:33.653179+00:00","updated_at":"2026-05-17T23:44:33.653179+00:00"}