{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:COWVISI7RYLFEYCYRT5WZECRZ5","short_pith_number":"pith:COWVISI7","canonical_record":{"source":{"id":"1005.5663","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2010-05-31T11:50:48Z","cross_cats_sorted":[],"title_canon_sha256":"41c8cf5c13569bc140f404171da009fcb08f809306f9bae9b3660d5ee671d755","abstract_canon_sha256":"24ca7ab510be56888887722b1d70904316e5cdde6e2978cb6b703b9b8997479a"},"schema_version":"1.0"},"canonical_sha256":"13ad54491f8e165260588cfb6c9051cf4ae579b2e692ee150464f37b34a2894c","source":{"kind":"arxiv","id":"1005.5663","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.5663","created_at":"2026-05-18T04:26:56Z"},{"alias_kind":"arxiv_version","alias_value":"1005.5663v2","created_at":"2026-05-18T04:26:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.5663","created_at":"2026-05-18T04:26:56Z"},{"alias_kind":"pith_short_12","alias_value":"COWVISI7RYLF","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"COWVISI7RYLFEYCY","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"COWVISI7","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:COWVISI7RYLFEYCYRT5WZECRZ5","target":"record","payload":{"canonical_record":{"source":{"id":"1005.5663","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2010-05-31T11:50:48Z","cross_cats_sorted":[],"title_canon_sha256":"41c8cf5c13569bc140f404171da009fcb08f809306f9bae9b3660d5ee671d755","abstract_canon_sha256":"24ca7ab510be56888887722b1d70904316e5cdde6e2978cb6b703b9b8997479a"},"schema_version":"1.0"},"canonical_sha256":"13ad54491f8e165260588cfb6c9051cf4ae579b2e692ee150464f37b34a2894c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:56.568768Z","signature_b64":"6dJDaWPurAwPL/jX6Pa4jPFqK8YShQ0oxs5Xzzf80RzwU5sc/Olb6dI3gRc1ilN1Mz7vKByKiLakegEfKF3EDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13ad54491f8e165260588cfb6c9051cf4ae579b2e692ee150464f37b34a2894c","last_reissued_at":"2026-05-18T04:26:56.568267Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:56.568267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1005.5663","source_version":2,"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-18T04:26:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V/hv4V/1UzLEH9uf1yFVms9hMQbKFmzw0xY6XtWU4ItZzzvbRaf1nPrDb9ipd/8Dv+6KH+5QkjBRMLIjVUFZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:19:38.378844Z"},"content_sha256":"a35994a9454c196d44e976686fb5011ee7b8a1873f3c57eadc7358b9ccab7bd5","schema_version":"1.0","event_id":"sha256:a35994a9454c196d44e976686fb5011ee7b8a1873f3c57eadc7358b9ccab7bd5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:COWVISI7RYLFEYCYRT5WZECRZ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallelization of Modular Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"Gerhard Pfister, Nazeran Idrees, Stefan Steidel","submitted_at":"2010-05-31T11:50:48Z","abstract_excerpt":"In this paper we investigate the parallelization of two modular algorithms. In fact, we consider the modular computation of Gr\\\"obner bases (resp. standard bases) and the modular computation of the associated primes of a zero-dimensional ideal and describe their parallel implementation in SINGULAR. Our modular algorithms to solve problems over Q mainly consist of three parts, solving the problem modulo p for several primes p, lifting the result to Q by applying Chinese remainder resp. rational reconstruction, and a part of verification. Arnold proved using the Hilbert function that the verific"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.5663","kind":"arxiv","version":2},"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-18T04:26:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JCitVwS4R34FhZ6jlod04HYF+UTPAuEJGMr6fgIMDrM7FRkx0xgFxBP7qGBGAY3azaxLnE3gJvm2t1MRaKzZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:19:38.379206Z"},"content_sha256":"68925a660eaf0a93245d514e11eda01960983d068526494355047af10cf6aa0d","schema_version":"1.0","event_id":"sha256:68925a660eaf0a93245d514e11eda01960983d068526494355047af10cf6aa0d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/COWVISI7RYLFEYCYRT5WZECRZ5/bundle.json","state_url":"https://pith.science/pith/COWVISI7RYLFEYCYRT5WZECRZ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/COWVISI7RYLFEYCYRT5WZECRZ5/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-06-08T18:19:38Z","links":{"resolver":"https://pith.science/pith/COWVISI7RYLFEYCYRT5WZECRZ5","bundle":"https://pith.science/pith/COWVISI7RYLFEYCYRT5WZECRZ5/bundle.json","state":"https://pith.science/pith/COWVISI7RYLFEYCYRT5WZECRZ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/COWVISI7RYLFEYCYRT5WZECRZ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:COWVISI7RYLFEYCYRT5WZECRZ5","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":"24ca7ab510be56888887722b1d70904316e5cdde6e2978cb6b703b9b8997479a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2010-05-31T11:50:48Z","title_canon_sha256":"41c8cf5c13569bc140f404171da009fcb08f809306f9bae9b3660d5ee671d755"},"schema_version":"1.0","source":{"id":"1005.5663","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.5663","created_at":"2026-05-18T04:26:56Z"},{"alias_kind":"arxiv_version","alias_value":"1005.5663v2","created_at":"2026-05-18T04:26:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.5663","created_at":"2026-05-18T04:26:56Z"},{"alias_kind":"pith_short_12","alias_value":"COWVISI7RYLF","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"COWVISI7RYLFEYCY","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"COWVISI7","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:68925a660eaf0a93245d514e11eda01960983d068526494355047af10cf6aa0d","target":"graph","created_at":"2026-05-18T04:26:56Z","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":"In this paper we investigate the parallelization of two modular algorithms. In fact, we consider the modular computation of Gr\\\"obner bases (resp. standard bases) and the modular computation of the associated primes of a zero-dimensional ideal and describe their parallel implementation in SINGULAR. Our modular algorithms to solve problems over Q mainly consist of three parts, solving the problem modulo p for several primes p, lifting the result to Q by applying Chinese remainder resp. rational reconstruction, and a part of verification. Arnold proved using the Hilbert function that the verific","authors_text":"Gerhard Pfister, Nazeran Idrees, Stefan Steidel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2010-05-31T11:50:48Z","title":"Parallelization of Modular Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.5663","kind":"arxiv","version":2},"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:a35994a9454c196d44e976686fb5011ee7b8a1873f3c57eadc7358b9ccab7bd5","target":"record","created_at":"2026-05-18T04:26:56Z","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":"24ca7ab510be56888887722b1d70904316e5cdde6e2978cb6b703b9b8997479a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2010-05-31T11:50:48Z","title_canon_sha256":"41c8cf5c13569bc140f404171da009fcb08f809306f9bae9b3660d5ee671d755"},"schema_version":"1.0","source":{"id":"1005.5663","kind":"arxiv","version":2}},"canonical_sha256":"13ad54491f8e165260588cfb6c9051cf4ae579b2e692ee150464f37b34a2894c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13ad54491f8e165260588cfb6c9051cf4ae579b2e692ee150464f37b34a2894c","first_computed_at":"2026-05-18T04:26:56.568267Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:26:56.568267Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6dJDaWPurAwPL/jX6Pa4jPFqK8YShQ0oxs5Xzzf80RzwU5sc/Olb6dI3gRc1ilN1Mz7vKByKiLakegEfKF3EDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:26:56.568768Z","signed_message":"canonical_sha256_bytes"},"source_id":"1005.5663","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a35994a9454c196d44e976686fb5011ee7b8a1873f3c57eadc7358b9ccab7bd5","sha256:68925a660eaf0a93245d514e11eda01960983d068526494355047af10cf6aa0d"],"state_sha256":"0305bc351c07b5498955e3477b3f79ad3f21fe9043fa7b8bda25b502950d7eee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"msMf1eP0hq5J372oHotw8N3V9J3cs9aW3DIZmbGUcdcezd2Z5tca+sydzevqGhcCHe92oS+w0/yPP0Vfg+ieCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T18:19:38.381665Z","bundle_sha256":"ae30d63a32ceed11662ee9dee8550cafe3d7a128ff6bbf822e6df5da7b66173d"}}