{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QRBKIRU5LFD5GNTYKZQ33QTYOU","short_pith_number":"pith:QRBKIRU5","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"},"canonical_sha256":"8442a4469d5947d336785661bdc27875268ee280f54154ebb8139dd2bdcaaed7","source":{"kind":"arxiv","id":"1906.00039","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.00039","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"arxiv_version","alias_value":"1906.00039v1","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00039","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"pith_short_12","alias_value":"QRBKIRU5LFD5","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QRBKIRU5LFD5GNTY","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QRBKIRU5","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QRBKIRU5LFD5GNTYKZQ33QTYOU","target":"record","payload":{"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"},"canonical_sha256":"8442a4469d5947d336785661bdc27875268ee280f54154ebb8139dd2bdcaaed7","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"},"source_kind":"arxiv","source_id":"1906.00039","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k/61sKore/6S7w7Oj7MRFFQkjn0Z07/f1SfBgWE7lluvEhHpdQ/ex8IMz0WOWeAaZE+gxk0nZXNDKORBNG9uCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:12:29.543683Z"},"content_sha256":"29a0062bd39a723a0b9a0bb562eec51b378a959415ff6e2ec6a12ee984937f43","schema_version":"1.0","event_id":"sha256:29a0062bd39a723a0b9a0bb562eec51b378a959415ff6e2ec6a12ee984937f43"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QRBKIRU5LFD5GNTYKZQ33QTYOU","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gfbBoTYUe/Gh863epfg7AVLUGxenkkLrd8MnJCO+iWeNIcJieMkTAgmsG4ZT+c7+NrtQgJInsHAxfEqJICr9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:12:29.544032Z"},"content_sha256":"cc1d9c6a009e5f6181b75d905e312d0071cc7d0db8256a5f5c25ecc7dedb128f","schema_version":"1.0","event_id":"sha256:cc1d9c6a009e5f6181b75d905e312d0071cc7d0db8256a5f5c25ecc7dedb128f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QRBKIRU5LFD5GNTYKZQ33QTYOU/bundle.json","state_url":"https://pith.science/pith/QRBKIRU5LFD5GNTYKZQ33QTYOU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QRBKIRU5LFD5GNTYKZQ33QTYOU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T02:12:29Z","links":{"resolver":"https://pith.science/pith/QRBKIRU5LFD5GNTYKZQ33QTYOU","bundle":"https://pith.science/pith/QRBKIRU5LFD5GNTYKZQ33QTYOU/bundle.json","state":"https://pith.science/pith/QRBKIRU5LFD5GNTYKZQ33QTYOU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QRBKIRU5LFD5GNTYKZQ33QTYOU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QRBKIRU5LFD5GNTYKZQ33QTYOU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"43f8c22d93e2d4209306adc3f4ab2ac5b290d6728d1a5bbccda41275b2e694ee","cross_cats_sorted":["cs.DC","cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2019-05-31T19:16:47Z","title_canon_sha256":"447d5db9f72b5fe579013290098952e3419df4f79234a87b7a5d29a36d7b4362"},"schema_version":"1.0","source":{"id":"1906.00039","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.00039","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"arxiv_version","alias_value":"1906.00039v1","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00039","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"pith_short_12","alias_value":"QRBKIRU5LFD5","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QRBKIRU5LFD5GNTY","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QRBKIRU5","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:cc1d9c6a009e5f6181b75d905e312d0071cc7d0db8256a5f5c25ecc7dedb128f","target":"graph","created_at":"2026-05-17T23:44:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Alexander Brandt, Marc Moreno Maza, Mohammadali Asadi, Robert H. C. Moir, Yuzhen Xie","cross_cats":["cs.DC","cs.MS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2019-05-31T19:16:47Z","title":"On the Parallelization of Triangular Decomposition of Polynomial Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00039","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:29a0062bd39a723a0b9a0bb562eec51b378a959415ff6e2ec6a12ee984937f43","target":"record","created_at":"2026-05-17T23:44:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"43f8c22d93e2d4209306adc3f4ab2ac5b290d6728d1a5bbccda41275b2e694ee","cross_cats_sorted":["cs.DC","cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2019-05-31T19:16:47Z","title_canon_sha256":"447d5db9f72b5fe579013290098952e3419df4f79234a87b7a5d29a36d7b4362"},"schema_version":"1.0","source":{"id":"1906.00039","kind":"arxiv","version":1}},"canonical_sha256":"8442a4469d5947d336785661bdc27875268ee280f54154ebb8139dd2bdcaaed7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8442a4469d5947d336785661bdc27875268ee280f54154ebb8139dd2bdcaaed7","first_computed_at":"2026-05-17T23:44:33.653090Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:33.653090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o/61+HZKTbIfdwXMU+Xl/cME/silG9GfHgQxwe09wQQpgbVfIBxLLcfwBXGEUZudSbxKa9txHlx/nQU5jcghAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:33.653610Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.00039","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29a0062bd39a723a0b9a0bb562eec51b378a959415ff6e2ec6a12ee984937f43","sha256:cc1d9c6a009e5f6181b75d905e312d0071cc7d0db8256a5f5c25ecc7dedb128f"],"state_sha256":"ff261c9f7557a8374f790e2d6774915722418c049018b29ef3514ad950d35e21"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U9bboLm8/8UMAjfN/72jMeWrcPh/0tZvBIgQbmwH5I9RxCDTxUPBfv/JGbvdQfq6/P5pwjLpk5xQebmYL8Q2Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T02:12:29.546086Z","bundle_sha256":"540cbe65636825478a2005308b2c63996a4c9549812879ba518f3bfc1406ddac"}}