{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5AISA5AHPAPDRMDSFUUDXY77JM","short_pith_number":"pith:5AISA5AH","schema_version":"1.0","canonical_sha256":"e811207407781e38b0722d283be3ff4b27fd9bca75986ce9e8911155dc760310","source":{"kind":"arxiv","id":"1607.02135","version":2},"attestation_state":"computed","paper":{"title":"Finding binomials in polynomial ideals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"math.AC","authors_text":"Anders Jensen, Lukas Katth\\\"an, Thomas Kahle","submitted_at":"2016-07-07T19:56:31Z","abstract_excerpt":"We describe an algorithm which finds binomials in a given ideal $I\\subset\\mathbb{Q}[x_1,\\dots,x_n]$ and in particular decides whether binomials exist in $I$ at all. Binomials in polynomial ideals can be well hidden. For example, the lowest degree of a binomial cannot be bounded as a function of the number of indeterminates, the degree of the generators, or the Castelnuovo--Mumford regularity. We approach the detection problem by reduction to the Artinian case using tropical geometry. The Artinian case is solved with algorithms from computational number theory."},"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":"1607.02135","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2016-07-07T19:56:31Z","cross_cats_sorted":["cs.SC"],"title_canon_sha256":"14179b06fee50f37fa63eba3edafc1c543e2e7873aae0b9ac366d1aec63828a4","abstract_canon_sha256":"6bbf4697cd862b90b6b1a5ee260619626efb9bac08bb1ef44773cbad99d3826f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:16.608177Z","signature_b64":"dq7HYbZdhxXPDlRBslmvGcNhyOxGtVpTyT7m9rDL/GFTKBD6V7kkCchdrn2oVdqSvplythlSlcChphOAnynqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e811207407781e38b0722d283be3ff4b27fd9bca75986ce9e8911155dc760310","last_reissued_at":"2026-05-18T00:46:16.607717Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:16.607717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding binomials in polynomial ideals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"math.AC","authors_text":"Anders Jensen, Lukas Katth\\\"an, Thomas Kahle","submitted_at":"2016-07-07T19:56:31Z","abstract_excerpt":"We describe an algorithm which finds binomials in a given ideal $I\\subset\\mathbb{Q}[x_1,\\dots,x_n]$ and in particular decides whether binomials exist in $I$ at all. Binomials in polynomial ideals can be well hidden. For example, the lowest degree of a binomial cannot be bounded as a function of the number of indeterminates, the degree of the generators, or the Castelnuovo--Mumford regularity. We approach the detection problem by reduction to the Artinian case using tropical geometry. The Artinian case is solved with algorithms from computational number theory."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02135","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":"1607.02135","created_at":"2026-05-18T00:46:16.607790+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.02135v2","created_at":"2026-05-18T00:46:16.607790+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02135","created_at":"2026-05-18T00:46:16.607790+00:00"},{"alias_kind":"pith_short_12","alias_value":"5AISA5AHPAPD","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"5AISA5AHPAPDRMDS","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"5AISA5AH","created_at":"2026-05-18T12:29:58.707656+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/5AISA5AHPAPDRMDSFUUDXY77JM","json":"https://pith.science/pith/5AISA5AHPAPDRMDSFUUDXY77JM.json","graph_json":"https://pith.science/api/pith-number/5AISA5AHPAPDRMDSFUUDXY77JM/graph.json","events_json":"https://pith.science/api/pith-number/5AISA5AHPAPDRMDSFUUDXY77JM/events.json","paper":"https://pith.science/paper/5AISA5AH"},"agent_actions":{"view_html":"https://pith.science/pith/5AISA5AHPAPDRMDSFUUDXY77JM","download_json":"https://pith.science/pith/5AISA5AHPAPDRMDSFUUDXY77JM.json","view_paper":"https://pith.science/paper/5AISA5AH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.02135&json=true","fetch_graph":"https://pith.science/api/pith-number/5AISA5AHPAPDRMDSFUUDXY77JM/graph.json","fetch_events":"https://pith.science/api/pith-number/5AISA5AHPAPDRMDSFUUDXY77JM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5AISA5AHPAPDRMDSFUUDXY77JM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5AISA5AHPAPDRMDSFUUDXY77JM/action/storage_attestation","attest_author":"https://pith.science/pith/5AISA5AHPAPDRMDSFUUDXY77JM/action/author_attestation","sign_citation":"https://pith.science/pith/5AISA5AHPAPDRMDSFUUDXY77JM/action/citation_signature","submit_replication":"https://pith.science/pith/5AISA5AHPAPDRMDSFUUDXY77JM/action/replication_record"}},"created_at":"2026-05-18T00:46:16.607790+00:00","updated_at":"2026-05-18T00:46:16.607790+00:00"}