{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6OS7WOFEU5CQENHRZLQE5GHIKX","short_pith_number":"pith:6OS7WOFE","schema_version":"1.0","canonical_sha256":"f3a5fb38a4a7450234f1cae04e98e855d3829df25afe964fcaf05cbc4808e21a","source":{"kind":"arxiv","id":"1811.12663","version":1},"attestation_state":"computed","paper":{"title":"An efficient reduction strategy for signature-based algorithms to compute Groebner basis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"cs.SC","authors_text":"Kosuke Sakata","submitted_at":"2018-11-30T08:12:42Z","abstract_excerpt":"This paper introduces a strategy for signature-based algorithms to compute Groebner basis. The signature-based algorithms generate S-pairs instead of S-polynomials, and use s-reduction instead of the usual reduction used in the Buchberger algorithm. There are two strategies for s-reduction: one is the only-top reduction strategy which is the way that only leading monomials are s-reduced. The other is the full reduction strategy which is the way that all monomials are s-reduced. A new strategy, which we call selective-full strategy, for s-reduction of S-pairs is introduced in this paper. In the"},"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.12663","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-11-30T08:12:42Z","cross_cats_sorted":["math.AC"],"title_canon_sha256":"29071ac394327233b36987e4c049540a54259cb9c077c9ee4417bce2197d2b47","abstract_canon_sha256":"5d0022e53e0eaa1c510497da69a6fd30ff4f1e47605d0c7762f7ef1ed262df7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:28.900150Z","signature_b64":"rECBz6EzCwdbN+N2Stzwk3u6u74+wnm8lXi2icdWAoFePe71SkHQNTH72DxjG9mbgDSctoD725IDrpgcoeRvCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3a5fb38a4a7450234f1cae04e98e855d3829df25afe964fcaf05cbc4808e21a","last_reissued_at":"2026-05-17T23:59:28.899417Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:28.899417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An efficient reduction strategy for signature-based algorithms to compute Groebner basis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"cs.SC","authors_text":"Kosuke Sakata","submitted_at":"2018-11-30T08:12:42Z","abstract_excerpt":"This paper introduces a strategy for signature-based algorithms to compute Groebner basis. The signature-based algorithms generate S-pairs instead of S-polynomials, and use s-reduction instead of the usual reduction used in the Buchberger algorithm. There are two strategies for s-reduction: one is the only-top reduction strategy which is the way that only leading monomials are s-reduced. The other is the full reduction strategy which is the way that all monomials are s-reduced. A new strategy, which we call selective-full strategy, for s-reduction of S-pairs is introduced in this paper. In the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12663","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.12663","created_at":"2026-05-17T23:59:28.899531+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.12663v1","created_at":"2026-05-17T23:59:28.899531+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12663","created_at":"2026-05-17T23:59:28.899531+00:00"},{"alias_kind":"pith_short_12","alias_value":"6OS7WOFEU5CQ","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"6OS7WOFEU5CQENHR","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"6OS7WOFE","created_at":"2026-05-18T12:32:11.075285+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/6OS7WOFEU5CQENHRZLQE5GHIKX","json":"https://pith.science/pith/6OS7WOFEU5CQENHRZLQE5GHIKX.json","graph_json":"https://pith.science/api/pith-number/6OS7WOFEU5CQENHRZLQE5GHIKX/graph.json","events_json":"https://pith.science/api/pith-number/6OS7WOFEU5CQENHRZLQE5GHIKX/events.json","paper":"https://pith.science/paper/6OS7WOFE"},"agent_actions":{"view_html":"https://pith.science/pith/6OS7WOFEU5CQENHRZLQE5GHIKX","download_json":"https://pith.science/pith/6OS7WOFEU5CQENHRZLQE5GHIKX.json","view_paper":"https://pith.science/paper/6OS7WOFE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.12663&json=true","fetch_graph":"https://pith.science/api/pith-number/6OS7WOFEU5CQENHRZLQE5GHIKX/graph.json","fetch_events":"https://pith.science/api/pith-number/6OS7WOFEU5CQENHRZLQE5GHIKX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6OS7WOFEU5CQENHRZLQE5GHIKX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6OS7WOFEU5CQENHRZLQE5GHIKX/action/storage_attestation","attest_author":"https://pith.science/pith/6OS7WOFEU5CQENHRZLQE5GHIKX/action/author_attestation","sign_citation":"https://pith.science/pith/6OS7WOFEU5CQENHRZLQE5GHIKX/action/citation_signature","submit_replication":"https://pith.science/pith/6OS7WOFEU5CQENHRZLQE5GHIKX/action/replication_record"}},"created_at":"2026-05-17T23:59:28.899531+00:00","updated_at":"2026-05-17T23:59:28.899531+00:00"}