{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ZWUPPOJQGCNV2TUTGS5AILA7M6","short_pith_number":"pith:ZWUPPOJQ","schema_version":"1.0","canonical_sha256":"cda8f7b930309b5d4e9334ba042c1f67a077d2a9f3ed57cbeb4a6a16f0a99bc9","source":{"kind":"arxiv","id":"1210.7960","version":1},"attestation_state":"computed","paper":{"title":"Generalized Binomial Edge Ideals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"Johannes Rauh","submitted_at":"2012-10-30T10:52:29Z","abstract_excerpt":"This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\\\"obner basis can be computed by studying paths in the graph. Since these Gr\\\"obner bases are square-free, generalized binomial edge ideals are radical. To find the primary decomposition a combinatorial problem involving the connected components of subgraphs has to be solved. The irreducible components of the solution variety are all rational."},"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":"1210.7960","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2012-10-30T10:52:29Z","cross_cats_sorted":[],"title_canon_sha256":"2a597ca985cd7136d6c8886d98bb14f7a767b6805d60867fd931bf930ea8c5c2","abstract_canon_sha256":"5331d123731668a3d985c0f9d18a763f03075aefee305c585493a7124e517676"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:39.101079Z","signature_b64":"XpzcUh0douaCl8y+pkDgRshOHUbh+3ozdvC2pgsbkADfFY0dU4p7wZj4f7EtD0wcjfL9sNtXD1eH8NyCJosZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cda8f7b930309b5d4e9334ba042c1f67a077d2a9f3ed57cbeb4a6a16f0a99bc9","last_reissued_at":"2026-05-18T02:49:39.100738Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:39.100738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Binomial Edge Ideals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"Johannes Rauh","submitted_at":"2012-10-30T10:52:29Z","abstract_excerpt":"This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\\\"obner basis can be computed by studying paths in the graph. Since these Gr\\\"obner bases are square-free, generalized binomial edge ideals are radical. To find the primary decomposition a combinatorial problem involving the connected components of subgraphs has to be solved. The irreducible components of the solution variety are all rational."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.7960","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":"1210.7960","created_at":"2026-05-18T02:49:39.100784+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.7960v1","created_at":"2026-05-18T02:49:39.100784+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7960","created_at":"2026-05-18T02:49:39.100784+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZWUPPOJQGCNV","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZWUPPOJQGCNV2TUT","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZWUPPOJQ","created_at":"2026-05-18T12:27:30.460161+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/ZWUPPOJQGCNV2TUTGS5AILA7M6","json":"https://pith.science/pith/ZWUPPOJQGCNV2TUTGS5AILA7M6.json","graph_json":"https://pith.science/api/pith-number/ZWUPPOJQGCNV2TUTGS5AILA7M6/graph.json","events_json":"https://pith.science/api/pith-number/ZWUPPOJQGCNV2TUTGS5AILA7M6/events.json","paper":"https://pith.science/paper/ZWUPPOJQ"},"agent_actions":{"view_html":"https://pith.science/pith/ZWUPPOJQGCNV2TUTGS5AILA7M6","download_json":"https://pith.science/pith/ZWUPPOJQGCNV2TUTGS5AILA7M6.json","view_paper":"https://pith.science/paper/ZWUPPOJQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.7960&json=true","fetch_graph":"https://pith.science/api/pith-number/ZWUPPOJQGCNV2TUTGS5AILA7M6/graph.json","fetch_events":"https://pith.science/api/pith-number/ZWUPPOJQGCNV2TUTGS5AILA7M6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZWUPPOJQGCNV2TUTGS5AILA7M6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZWUPPOJQGCNV2TUTGS5AILA7M6/action/storage_attestation","attest_author":"https://pith.science/pith/ZWUPPOJQGCNV2TUTGS5AILA7M6/action/author_attestation","sign_citation":"https://pith.science/pith/ZWUPPOJQGCNV2TUTGS5AILA7M6/action/citation_signature","submit_replication":"https://pith.science/pith/ZWUPPOJQGCNV2TUTGS5AILA7M6/action/replication_record"}},"created_at":"2026-05-18T02:49:39.100784+00:00","updated_at":"2026-05-18T02:49:39.100784+00:00"}