{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:PGZUTVTSHM6EPPS3DDZWUBQP5T","short_pith_number":"pith:PGZUTVTS","schema_version":"1.0","canonical_sha256":"79b349d6723b3c47be5b18f36a060fece524bfb251b25b33ff3e8e3ac3d3a6ef","source":{"kind":"arxiv","id":"1312.1655","version":2},"attestation_state":"computed","paper":{"title":"On the Complexity of the F5 Gr\\\"obner basis Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Bruno Salvy, Jean-Charles Faug\\`ere, Magali Bardet","submitted_at":"2013-12-05T19:47:02Z","abstract_excerpt":"We study the complexity of Gr\\\"obner bases computation, in particular in the generic situation where the variables are in simultaneous Noether position with respect to the system.\n  We give a bound on the number of polynomials of degree $d$ in a Gr\\\"obner basis computed by Faug\\`ere's $F_5$ algorithm~(Fau02) in this generic case for the grevlex ordering (which is also a bound on the number of polynomials for a reduced Gr\\\"obner basis, independently of the algorithm used). Next, we analyse more precisely the structure of the polynomials in the Gr\\\"obner bases with signatures that $F_5$ computes"},"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":"1312.1655","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2013-12-05T19:47:02Z","cross_cats_sorted":[],"title_canon_sha256":"e631280ef19f3402a521037b86344a4f9c7a2307f4e2ba9c24a06e2220187363","abstract_canon_sha256":"1e56c209ae2a0c7c67dd55075310d9ab5bf7314d00735636b0a5695dae031d26"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:24.302391Z","signature_b64":"rjRwU69rrNK1r08I51o6fLZqumgPeQVx3grhLZs5njRMRjTCQA01i+mj8FKJjn7RM4rYykxlQ4xCR9eeHp2EDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79b349d6723b3c47be5b18f36a060fece524bfb251b25b33ff3e8e3ac3d3a6ef","last_reissued_at":"2026-05-18T02:47:24.302019Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:24.302019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of the F5 Gr\\\"obner basis Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Bruno Salvy, Jean-Charles Faug\\`ere, Magali Bardet","submitted_at":"2013-12-05T19:47:02Z","abstract_excerpt":"We study the complexity of Gr\\\"obner bases computation, in particular in the generic situation where the variables are in simultaneous Noether position with respect to the system.\n  We give a bound on the number of polynomials of degree $d$ in a Gr\\\"obner basis computed by Faug\\`ere's $F_5$ algorithm~(Fau02) in this generic case for the grevlex ordering (which is also a bound on the number of polynomials for a reduced Gr\\\"obner basis, independently of the algorithm used). Next, we analyse more precisely the structure of the polynomials in the Gr\\\"obner bases with signatures that $F_5$ computes"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1655","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":"1312.1655","created_at":"2026-05-18T02:47:24.302073+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.1655v2","created_at":"2026-05-18T02:47:24.302073+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1655","created_at":"2026-05-18T02:47:24.302073+00:00"},{"alias_kind":"pith_short_12","alias_value":"PGZUTVTSHM6E","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PGZUTVTSHM6EPPS3","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PGZUTVTS","created_at":"2026-05-18T12:27:54.935989+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/PGZUTVTSHM6EPPS3DDZWUBQP5T","json":"https://pith.science/pith/PGZUTVTSHM6EPPS3DDZWUBQP5T.json","graph_json":"https://pith.science/api/pith-number/PGZUTVTSHM6EPPS3DDZWUBQP5T/graph.json","events_json":"https://pith.science/api/pith-number/PGZUTVTSHM6EPPS3DDZWUBQP5T/events.json","paper":"https://pith.science/paper/PGZUTVTS"},"agent_actions":{"view_html":"https://pith.science/pith/PGZUTVTSHM6EPPS3DDZWUBQP5T","download_json":"https://pith.science/pith/PGZUTVTSHM6EPPS3DDZWUBQP5T.json","view_paper":"https://pith.science/paper/PGZUTVTS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.1655&json=true","fetch_graph":"https://pith.science/api/pith-number/PGZUTVTSHM6EPPS3DDZWUBQP5T/graph.json","fetch_events":"https://pith.science/api/pith-number/PGZUTVTSHM6EPPS3DDZWUBQP5T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PGZUTVTSHM6EPPS3DDZWUBQP5T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PGZUTVTSHM6EPPS3DDZWUBQP5T/action/storage_attestation","attest_author":"https://pith.science/pith/PGZUTVTSHM6EPPS3DDZWUBQP5T/action/author_attestation","sign_citation":"https://pith.science/pith/PGZUTVTSHM6EPPS3DDZWUBQP5T/action/citation_signature","submit_replication":"https://pith.science/pith/PGZUTVTSHM6EPPS3DDZWUBQP5T/action/replication_record"}},"created_at":"2026-05-18T02:47:24.302073+00:00","updated_at":"2026-05-18T02:47:24.302073+00:00"}