{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:IE7PACJYIP7LBUWGUSQESJIEBA","short_pith_number":"pith:IE7PACJY","schema_version":"1.0","canonical_sha256":"413ef0093843feb0d2c6a4a049250408020138b7379d64d8da5e8229cebbfaa3","source":{"kind":"arxiv","id":"2005.01917","version":3},"attestation_state":"computed","paper":{"title":"Learning selection strategies in Buchberger's algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC","math.AC","math.AG","stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniel Halpern-Leistner, Dylan Peifer, Michael Stillman","submitted_at":"2020-05-05T02:27:00Z","abstract_excerpt":"Studying the set of exact solutions of a system of polynomial equations largely depends on a single iterative algorithm, known as Buchberger's algorithm. Optimized versions of this algorithm are crucial for many computer algebra systems (e.g., Mathematica, Maple, Sage). We introduce a new approach to Buchberger's algorithm that uses reinforcement learning agents to perform S-pair selection, a key step in the algorithm. We then study how the difficulty of the problem depends on the choices of domain and distribution of polynomials, about which little is known. Finally, we train a policy model u"},"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":"2005.01917","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-05T02:27:00Z","cross_cats_sorted":["cs.SC","math.AC","math.AG","stat.ML"],"title_canon_sha256":"d4194e4274d43569b2efc118a7b34e9d682a09d036717605f5ecb7b1852421ed","abstract_canon_sha256":"da628afeec5c8fcb74c973d0fde376a46c81ba41577109ca71b3d67cafb2031f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:27:46.243601Z","signature_b64":"05S6lywhZBYoq9dcb6gyCOSpDDlcIuGmCpG0QRBVC1jnkl5o0BtWicGKSEHEbu7/w+ocSD7WTkgbH0gov2axDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"413ef0093843feb0d2c6a4a049250408020138b7379d64d8da5e8229cebbfaa3","last_reissued_at":"2026-07-05T01:27:46.243143Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:27:46.243143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning selection strategies in Buchberger's algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC","math.AC","math.AG","stat.ML"],"primary_cat":"cs.LG","authors_text":"Daniel Halpern-Leistner, Dylan Peifer, Michael Stillman","submitted_at":"2020-05-05T02:27:00Z","abstract_excerpt":"Studying the set of exact solutions of a system of polynomial equations largely depends on a single iterative algorithm, known as Buchberger's algorithm. Optimized versions of this algorithm are crucial for many computer algebra systems (e.g., Mathematica, Maple, Sage). We introduce a new approach to Buchberger's algorithm that uses reinforcement learning agents to perform S-pair selection, a key step in the algorithm. We then study how the difficulty of the problem depends on the choices of domain and distribution of polynomials, about which little is known. Finally, we train a policy model u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.01917","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.01917/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2005.01917","created_at":"2026-07-05T01:27:46.243207+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.01917v3","created_at":"2026-07-05T01:27:46.243207+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.01917","created_at":"2026-07-05T01:27:46.243207+00:00"},{"alias_kind":"pith_short_12","alias_value":"IE7PACJYIP7L","created_at":"2026-07-05T01:27:46.243207+00:00"},{"alias_kind":"pith_short_16","alias_value":"IE7PACJYIP7LBUWG","created_at":"2026-07-05T01:27:46.243207+00:00"},{"alias_kind":"pith_short_8","alias_value":"IE7PACJY","created_at":"2026-07-05T01:27:46.243207+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.07240","citing_title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","ref_index":35,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IE7PACJYIP7LBUWGUSQESJIEBA","json":"https://pith.science/pith/IE7PACJYIP7LBUWGUSQESJIEBA.json","graph_json":"https://pith.science/api/pith-number/IE7PACJYIP7LBUWGUSQESJIEBA/graph.json","events_json":"https://pith.science/api/pith-number/IE7PACJYIP7LBUWGUSQESJIEBA/events.json","paper":"https://pith.science/paper/IE7PACJY"},"agent_actions":{"view_html":"https://pith.science/pith/IE7PACJYIP7LBUWGUSQESJIEBA","download_json":"https://pith.science/pith/IE7PACJYIP7LBUWGUSQESJIEBA.json","view_paper":"https://pith.science/paper/IE7PACJY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.01917&json=true","fetch_graph":"https://pith.science/api/pith-number/IE7PACJYIP7LBUWGUSQESJIEBA/graph.json","fetch_events":"https://pith.science/api/pith-number/IE7PACJYIP7LBUWGUSQESJIEBA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IE7PACJYIP7LBUWGUSQESJIEBA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IE7PACJYIP7LBUWGUSQESJIEBA/action/storage_attestation","attest_author":"https://pith.science/pith/IE7PACJYIP7LBUWGUSQESJIEBA/action/author_attestation","sign_citation":"https://pith.science/pith/IE7PACJYIP7LBUWGUSQESJIEBA/action/citation_signature","submit_replication":"https://pith.science/pith/IE7PACJYIP7LBUWGUSQESJIEBA/action/replication_record"}},"created_at":"2026-07-05T01:27:46.243207+00:00","updated_at":"2026-07-05T01:27:46.243207+00:00"}