{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:EPXKZSDB63CVPUYWWZA56P3OZE","short_pith_number":"pith:EPXKZSDB","schema_version":"1.0","canonical_sha256":"23eeacc861f6c557d316b641df3f6ec93982c19a39b8c234ae9a18a3a7a9ae38","source":{"kind":"arxiv","id":"1203.2775","version":1},"attestation_state":"computed","paper":{"title":"The binomial edge ideal of a pair of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Ayesha Asloob Qureshi, J\\\"urgen Herzog, Takayuki Hibi, Viviana Ene","submitted_at":"2012-03-13T11:32:44Z","abstract_excerpt":"We introduce a class of ideals generated by a set of 2-minors of $m\\times n$-matrix of indeterminates indexed by a pair of graphs. This class of ideals is a natural common generalization of binomial edge ideals and ideals generated by adjacent minors. We determine the minimal prime ideals of such ideals and give a lower bound for their degree of nilpotency. In some special cases we compute their Gr\\\"obner basis and characterize unmixedness and Cohen--Macaulayness."},"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":"1203.2775","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2012-03-13T11:32:44Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"77dcb8ecd128fef051fcb6fbac9c5d4b2d1c61e3677f48496c31cd7afe328903","abstract_canon_sha256":"41b1ef0de16f1cdec9257340aa9ae4b265759d89cd245bd00b2a533868cf7aa8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:25.462142Z","signature_b64":"tYuXX/Nb+KF4bu5B03yc3w5a+l5INaMFOHOzqizYwcjjShkD9lMoLVXxsyfFsdijGtKVOKp9lQ3U1N3+4NllCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23eeacc861f6c557d316b641df3f6ec93982c19a39b8c234ae9a18a3a7a9ae38","last_reissued_at":"2026-05-18T02:29:25.461755Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:25.461755Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The binomial edge ideal of a pair of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Ayesha Asloob Qureshi, J\\\"urgen Herzog, Takayuki Hibi, Viviana Ene","submitted_at":"2012-03-13T11:32:44Z","abstract_excerpt":"We introduce a class of ideals generated by a set of 2-minors of $m\\times n$-matrix of indeterminates indexed by a pair of graphs. This class of ideals is a natural common generalization of binomial edge ideals and ideals generated by adjacent minors. We determine the minimal prime ideals of such ideals and give a lower bound for their degree of nilpotency. In some special cases we compute their Gr\\\"obner basis and characterize unmixedness and Cohen--Macaulayness."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2775","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":"1203.2775","created_at":"2026-05-18T02:29:25.461806+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.2775v1","created_at":"2026-05-18T02:29:25.461806+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2775","created_at":"2026-05-18T02:29:25.461806+00:00"},{"alias_kind":"pith_short_12","alias_value":"EPXKZSDB63CV","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"EPXKZSDB63CVPUYW","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"EPXKZSDB","created_at":"2026-05-18T12:27:04.183437+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/EPXKZSDB63CVPUYWWZA56P3OZE","json":"https://pith.science/pith/EPXKZSDB63CVPUYWWZA56P3OZE.json","graph_json":"https://pith.science/api/pith-number/EPXKZSDB63CVPUYWWZA56P3OZE/graph.json","events_json":"https://pith.science/api/pith-number/EPXKZSDB63CVPUYWWZA56P3OZE/events.json","paper":"https://pith.science/paper/EPXKZSDB"},"agent_actions":{"view_html":"https://pith.science/pith/EPXKZSDB63CVPUYWWZA56P3OZE","download_json":"https://pith.science/pith/EPXKZSDB63CVPUYWWZA56P3OZE.json","view_paper":"https://pith.science/paper/EPXKZSDB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.2775&json=true","fetch_graph":"https://pith.science/api/pith-number/EPXKZSDB63CVPUYWWZA56P3OZE/graph.json","fetch_events":"https://pith.science/api/pith-number/EPXKZSDB63CVPUYWWZA56P3OZE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EPXKZSDB63CVPUYWWZA56P3OZE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EPXKZSDB63CVPUYWWZA56P3OZE/action/storage_attestation","attest_author":"https://pith.science/pith/EPXKZSDB63CVPUYWWZA56P3OZE/action/author_attestation","sign_citation":"https://pith.science/pith/EPXKZSDB63CVPUYWWZA56P3OZE/action/citation_signature","submit_replication":"https://pith.science/pith/EPXKZSDB63CVPUYWWZA56P3OZE/action/replication_record"}},"created_at":"2026-05-18T02:29:25.461806+00:00","updated_at":"2026-05-18T02:29:25.461806+00:00"}