{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DRLO7TOIKVR3M3BNRRXDURG652","short_pith_number":"pith:DRLO7TOI","schema_version":"1.0","canonical_sha256":"1c56efcdc85563b66c2d8c6e3a44deee9d98a7bfb7eca412a9ff4a7cf0e9187b","source":{"kind":"arxiv","id":"1501.05142","version":2},"attestation_state":"computed","paper":{"title":"Binomial fibers and indispensable binomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"Apostolos Thoma, Hara Charalambous, Marius Vladoiu","submitted_at":"2015-01-21T11:45:06Z","abstract_excerpt":"Let $I$ be an arbitrary ideal generated by binomials. We show that certain equivalence classes of fibers are associated to any minimal binomial generating set of $I$. We provide a simple and efficient algorithm to compute the indispensable binomials of a binomial ideal from a given generating set of binomials and an algorithm to detect whether a binomial ideal is generated by indispensable binomials."},"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":"1501.05142","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2015-01-21T11:45:06Z","cross_cats_sorted":[],"title_canon_sha256":"8f3d81410c3bb1a293f8b0bf615d0b566eb8424e01b80f48ecf1d15b233619cc","abstract_canon_sha256":"0df615cef8121a4b650f753221ca0377b9dbc43677109f1ec1c540f70a9fc84a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:49.049598Z","signature_b64":"Jf6rmwMXmb/E2K+b4KXEmWfriRaZyUwdd5cVq17Nmt8uZzu5fzf8JoWDC2Q5KR4ZzTs22QdUDAQ74KJOcvCIDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c56efcdc85563b66c2d8c6e3a44deee9d98a7bfb7eca412a9ff4a7cf0e9187b","last_reissued_at":"2026-05-18T01:30:49.048943Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:49.048943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binomial fibers and indispensable binomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"Apostolos Thoma, Hara Charalambous, Marius Vladoiu","submitted_at":"2015-01-21T11:45:06Z","abstract_excerpt":"Let $I$ be an arbitrary ideal generated by binomials. We show that certain equivalence classes of fibers are associated to any minimal binomial generating set of $I$. We provide a simple and efficient algorithm to compute the indispensable binomials of a binomial ideal from a given generating set of binomials and an algorithm to detect whether a binomial ideal is generated by indispensable binomials."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05142","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":"1501.05142","created_at":"2026-05-18T01:30:49.049034+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.05142v2","created_at":"2026-05-18T01:30:49.049034+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05142","created_at":"2026-05-18T01:30:49.049034+00:00"},{"alias_kind":"pith_short_12","alias_value":"DRLO7TOIKVR3","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DRLO7TOIKVR3M3BN","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DRLO7TOI","created_at":"2026-05-18T12:29:17.054201+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/DRLO7TOIKVR3M3BNRRXDURG652","json":"https://pith.science/pith/DRLO7TOIKVR3M3BNRRXDURG652.json","graph_json":"https://pith.science/api/pith-number/DRLO7TOIKVR3M3BNRRXDURG652/graph.json","events_json":"https://pith.science/api/pith-number/DRLO7TOIKVR3M3BNRRXDURG652/events.json","paper":"https://pith.science/paper/DRLO7TOI"},"agent_actions":{"view_html":"https://pith.science/pith/DRLO7TOIKVR3M3BNRRXDURG652","download_json":"https://pith.science/pith/DRLO7TOIKVR3M3BNRRXDURG652.json","view_paper":"https://pith.science/paper/DRLO7TOI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.05142&json=true","fetch_graph":"https://pith.science/api/pith-number/DRLO7TOIKVR3M3BNRRXDURG652/graph.json","fetch_events":"https://pith.science/api/pith-number/DRLO7TOIKVR3M3BNRRXDURG652/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DRLO7TOIKVR3M3BNRRXDURG652/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DRLO7TOIKVR3M3BNRRXDURG652/action/storage_attestation","attest_author":"https://pith.science/pith/DRLO7TOIKVR3M3BNRRXDURG652/action/author_attestation","sign_citation":"https://pith.science/pith/DRLO7TOIKVR3M3BNRRXDURG652/action/citation_signature","submit_replication":"https://pith.science/pith/DRLO7TOIKVR3M3BNRRXDURG652/action/replication_record"}},"created_at":"2026-05-18T01:30:49.049034+00:00","updated_at":"2026-05-18T01:30:49.049034+00:00"}