{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:ULW7O4Y3WGYOOAR2EPHUEJS3XL","short_pith_number":"pith:ULW7O4Y3","schema_version":"1.0","canonical_sha256":"a2edf7731bb1b0e7023a23cf42265bbad0297d5649d74e00c1922322572bf0cb","source":{"kind":"arxiv","id":"1006.5299","version":2},"attestation_state":"computed","paper":{"title":"The F5 Algorithm in Buchberger's Style","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Dingkang Wang, Yao Sun","submitted_at":"2010-06-28T09:23:32Z","abstract_excerpt":"The famous F5 algorithm for computing \\gr basis was presented by Faug\\`ere in 2002. The original version of F5 is given in programming codes, so it is a bit difficult to understand. In this paper, the F5 algorithm is simplified as F5B in a Buchberger's style such that it is easy to understand and implement. In order to describe F5B, we introduce F5-reduction, which keeps the signature of labeled polynomials unchanged after reduction. The equivalence between F5 and F5B is also shown. At last, some versions of the F5 algorithm are illustrated."},"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":"1006.5299","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2010-06-28T09:23:32Z","cross_cats_sorted":[],"title_canon_sha256":"23b8dae66f417ef1c95f669b9bd8eb19c2a9d65669d7fd48de881050058eb87c","abstract_canon_sha256":"5749fb53b2e5af10548f6523a21ba179ef2024b722badafe5871c204af53a3df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:21.943860Z","signature_b64":"Tw5v67i+/cBxaD3KSIZFleT7sYvyB6lY9vkNW1AdNLJ96J1+iZ/kW1HjayYCiDtrMgsnVnD24WO6NkuhkTK4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2edf7731bb1b0e7023a23cf42265bbad0297d5649d74e00c1922322572bf0cb","last_reissued_at":"2026-05-18T04:32:21.943068Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:21.943068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The F5 Algorithm in Buchberger's Style","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Dingkang Wang, Yao Sun","submitted_at":"2010-06-28T09:23:32Z","abstract_excerpt":"The famous F5 algorithm for computing \\gr basis was presented by Faug\\`ere in 2002. The original version of F5 is given in programming codes, so it is a bit difficult to understand. In this paper, the F5 algorithm is simplified as F5B in a Buchberger's style such that it is easy to understand and implement. In order to describe F5B, we introduce F5-reduction, which keeps the signature of labeled polynomials unchanged after reduction. The equivalence between F5 and F5B is also shown. At last, some versions of the F5 algorithm are illustrated."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.5299","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1006.5299","created_at":"2026-05-18T04:32:21.943189+00:00"},{"alias_kind":"arxiv_version","alias_value":"1006.5299v2","created_at":"2026-05-18T04:32:21.943189+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.5299","created_at":"2026-05-18T04:32:21.943189+00:00"},{"alias_kind":"pith_short_12","alias_value":"ULW7O4Y3WGYO","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"ULW7O4Y3WGYOOAR2","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"ULW7O4Y3","created_at":"2026-05-18T12:26:15.391820+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/ULW7O4Y3WGYOOAR2EPHUEJS3XL","json":"https://pith.science/pith/ULW7O4Y3WGYOOAR2EPHUEJS3XL.json","graph_json":"https://pith.science/api/pith-number/ULW7O4Y3WGYOOAR2EPHUEJS3XL/graph.json","events_json":"https://pith.science/api/pith-number/ULW7O4Y3WGYOOAR2EPHUEJS3XL/events.json","paper":"https://pith.science/paper/ULW7O4Y3"},"agent_actions":{"view_html":"https://pith.science/pith/ULW7O4Y3WGYOOAR2EPHUEJS3XL","download_json":"https://pith.science/pith/ULW7O4Y3WGYOOAR2EPHUEJS3XL.json","view_paper":"https://pith.science/paper/ULW7O4Y3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1006.5299&json=true","fetch_graph":"https://pith.science/api/pith-number/ULW7O4Y3WGYOOAR2EPHUEJS3XL/graph.json","fetch_events":"https://pith.science/api/pith-number/ULW7O4Y3WGYOOAR2EPHUEJS3XL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ULW7O4Y3WGYOOAR2EPHUEJS3XL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ULW7O4Y3WGYOOAR2EPHUEJS3XL/action/storage_attestation","attest_author":"https://pith.science/pith/ULW7O4Y3WGYOOAR2EPHUEJS3XL/action/author_attestation","sign_citation":"https://pith.science/pith/ULW7O4Y3WGYOOAR2EPHUEJS3XL/action/citation_signature","submit_replication":"https://pith.science/pith/ULW7O4Y3WGYOOAR2EPHUEJS3XL/action/replication_record"}},"created_at":"2026-05-18T04:32:21.943189+00:00","updated_at":"2026-05-18T04:32:21.943189+00:00"}