{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:H2TUCTN3ISEIQR35NUA5WO7FNT","short_pith_number":"pith:H2TUCTN3","schema_version":"1.0","canonical_sha256":"3ea7414dbb448888477d6d01db3be56cd00f0941fdd72f8edc3b1e6c7e6a5ec7","source":{"kind":"arxiv","id":"1811.05736","version":1},"attestation_state":"computed","paper":{"title":"Standard Bases over Euclidean Domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"Adrian Popescu, Christian Eder, Gerhard Pfister","submitted_at":"2018-11-14T11:47:05Z","abstract_excerpt":"In this paper we state and explain techniques useful for the computation of strong Gr\\\"obner and standard bases over Euclidean domains: First we investigate several strategies for creating the pair set using an idea by Lichtblau. Then we explain methods for avoiding coefficient growth using syzygies. We give an in-depth discussion on normal form computation resp. a generalized reduction process with many optimizations to further avoid large coefficients. These are combined with methods to reach GCD-polynomials at an earlier stage of the computation. Based on various examples we show that our n"},"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":"1811.05736","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2018-11-14T11:47:05Z","cross_cats_sorted":[],"title_canon_sha256":"f0a47cd821f6179bf457b9bd237bec3f96e4e158f26fbd8180b7eb46f26258b4","abstract_canon_sha256":"a655b0180845c126163c51c2e49b8cdd08678476f47ea39fe8bf7569666bd718"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:42.199627Z","signature_b64":"67qwCQQkOQq2o+lff19+7v/pU3KNRX2a2iz4IzaaOIuh3LgAKCh5pbkSDZu/dj0e6VVeAfL4wEnwollJl2PFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ea7414dbb448888477d6d01db3be56cd00f0941fdd72f8edc3b1e6c7e6a5ec7","last_reissued_at":"2026-05-18T00:00:42.199242Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:42.199242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Standard Bases over Euclidean Domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"Adrian Popescu, Christian Eder, Gerhard Pfister","submitted_at":"2018-11-14T11:47:05Z","abstract_excerpt":"In this paper we state and explain techniques useful for the computation of strong Gr\\\"obner and standard bases over Euclidean domains: First we investigate several strategies for creating the pair set using an idea by Lichtblau. Then we explain methods for avoiding coefficient growth using syzygies. We give an in-depth discussion on normal form computation resp. a generalized reduction process with many optimizations to further avoid large coefficients. These are combined with methods to reach GCD-polynomials at an earlier stage of the computation. Based on various examples we show that our n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05736","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":"1811.05736","created_at":"2026-05-18T00:00:42.199300+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.05736v1","created_at":"2026-05-18T00:00:42.199300+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05736","created_at":"2026-05-18T00:00:42.199300+00:00"},{"alias_kind":"pith_short_12","alias_value":"H2TUCTN3ISEI","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"H2TUCTN3ISEIQR35","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"H2TUCTN3","created_at":"2026-05-18T12:32:28.185984+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.08543","citing_title":"Efficient Gr\\\"obner Bases Computation over Principal Ideal Rings","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H2TUCTN3ISEIQR35NUA5WO7FNT","json":"https://pith.science/pith/H2TUCTN3ISEIQR35NUA5WO7FNT.json","graph_json":"https://pith.science/api/pith-number/H2TUCTN3ISEIQR35NUA5WO7FNT/graph.json","events_json":"https://pith.science/api/pith-number/H2TUCTN3ISEIQR35NUA5WO7FNT/events.json","paper":"https://pith.science/paper/H2TUCTN3"},"agent_actions":{"view_html":"https://pith.science/pith/H2TUCTN3ISEIQR35NUA5WO7FNT","download_json":"https://pith.science/pith/H2TUCTN3ISEIQR35NUA5WO7FNT.json","view_paper":"https://pith.science/paper/H2TUCTN3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.05736&json=true","fetch_graph":"https://pith.science/api/pith-number/H2TUCTN3ISEIQR35NUA5WO7FNT/graph.json","fetch_events":"https://pith.science/api/pith-number/H2TUCTN3ISEIQR35NUA5WO7FNT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H2TUCTN3ISEIQR35NUA5WO7FNT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H2TUCTN3ISEIQR35NUA5WO7FNT/action/storage_attestation","attest_author":"https://pith.science/pith/H2TUCTN3ISEIQR35NUA5WO7FNT/action/author_attestation","sign_citation":"https://pith.science/pith/H2TUCTN3ISEIQR35NUA5WO7FNT/action/citation_signature","submit_replication":"https://pith.science/pith/H2TUCTN3ISEIQR35NUA5WO7FNT/action/replication_record"}},"created_at":"2026-05-18T00:00:42.199300+00:00","updated_at":"2026-05-18T00:00:42.199300+00:00"}