{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:BAORPA2DPPKIUXRKSODAHW66VO","short_pith_number":"pith:BAORPA2D","schema_version":"1.0","canonical_sha256":"081d1783437bd48a5e2a938603dbdeabb043376006b60cdf009fed49e80332f4","source":{"kind":"arxiv","id":"1105.0433","version":1},"attestation_state":"computed","paper":{"title":"On Gr\\\"obner Basis Detection for Zero-dimensional Ideals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Ambedkar Dukkipati, Prabhanjan Ananth","submitted_at":"2011-05-02T20:13:41Z","abstract_excerpt":"The Gr\\\"obner basis detection (GBD) is defined as follows: Given a set of polynomials, decide whether there exists -and if \"yes\" find- a term order such that the set of polynomials is a Gr\\\"obner basis. This problem was shown to be NP-hard by Sturmfels and Wiegelmann. We show that GBD when studied in the context of zero dimensional ideals is also NP-hard. An algorithm to solve GBD for zero dimensional ideals is also proposed which runs in polynomial time if the number of indeterminates is a constant."},"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":"1105.0433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-05-02T20:13:41Z","cross_cats_sorted":[],"title_canon_sha256":"dd40245a72e1e2c575179f2841ffe63f3f0e6342cd7ac923d8074a33b754bea3","abstract_canon_sha256":"5c4a319206cfbf3e673ae553a7064d30d40fc015de30b9fc4b963d4c3ee0cf15"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:11.308966Z","signature_b64":"xAl8VJa4p/pqDM6RvtJ1MCyqi3tMkN4yX/0gD+gKgu3BG2yHzpG7fciTuHSwCF95tisnIMtzZNJJYiLEdILOCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"081d1783437bd48a5e2a938603dbdeabb043376006b60cdf009fed49e80332f4","last_reissued_at":"2026-05-18T04:23:11.308534Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:11.308534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Gr\\\"obner Basis Detection for Zero-dimensional Ideals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Ambedkar Dukkipati, Prabhanjan Ananth","submitted_at":"2011-05-02T20:13:41Z","abstract_excerpt":"The Gr\\\"obner basis detection (GBD) is defined as follows: Given a set of polynomials, decide whether there exists -and if \"yes\" find- a term order such that the set of polynomials is a Gr\\\"obner basis. This problem was shown to be NP-hard by Sturmfels and Wiegelmann. We show that GBD when studied in the context of zero dimensional ideals is also NP-hard. An algorithm to solve GBD for zero dimensional ideals is also proposed which runs in polynomial time if the number of indeterminates is a constant."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0433","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":"1105.0433","created_at":"2026-05-18T04:23:11.308599+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.0433v1","created_at":"2026-05-18T04:23:11.308599+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0433","created_at":"2026-05-18T04:23:11.308599+00:00"},{"alias_kind":"pith_short_12","alias_value":"BAORPA2DPPKI","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BAORPA2DPPKIUXRK","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BAORPA2D","created_at":"2026-05-18T12:26:24.575870+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/BAORPA2DPPKIUXRKSODAHW66VO","json":"https://pith.science/pith/BAORPA2DPPKIUXRKSODAHW66VO.json","graph_json":"https://pith.science/api/pith-number/BAORPA2DPPKIUXRKSODAHW66VO/graph.json","events_json":"https://pith.science/api/pith-number/BAORPA2DPPKIUXRKSODAHW66VO/events.json","paper":"https://pith.science/paper/BAORPA2D"},"agent_actions":{"view_html":"https://pith.science/pith/BAORPA2DPPKIUXRKSODAHW66VO","download_json":"https://pith.science/pith/BAORPA2DPPKIUXRKSODAHW66VO.json","view_paper":"https://pith.science/paper/BAORPA2D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.0433&json=true","fetch_graph":"https://pith.science/api/pith-number/BAORPA2DPPKIUXRKSODAHW66VO/graph.json","fetch_events":"https://pith.science/api/pith-number/BAORPA2DPPKIUXRKSODAHW66VO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BAORPA2DPPKIUXRKSODAHW66VO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BAORPA2DPPKIUXRKSODAHW66VO/action/storage_attestation","attest_author":"https://pith.science/pith/BAORPA2DPPKIUXRKSODAHW66VO/action/author_attestation","sign_citation":"https://pith.science/pith/BAORPA2DPPKIUXRKSODAHW66VO/action/citation_signature","submit_replication":"https://pith.science/pith/BAORPA2DPPKIUXRKSODAHW66VO/action/replication_record"}},"created_at":"2026-05-18T04:23:11.308599+00:00","updated_at":"2026-05-18T04:23:11.308599+00:00"}