{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KTIGL3VBSVCIOBRTY2S4PNGL37","short_pith_number":"pith:KTIGL3VB","schema_version":"1.0","canonical_sha256":"54d065eea19544870633c6a5c7b4cbdff3fa2cd75acb705223ba2a2691703982","source":{"kind":"arxiv","id":"1404.7602","version":3},"attestation_state":"computed","paper":{"title":"Binomial edge ideals and rational normal scrolls","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"Ahmet Dokuyucu, Faryal Chaudhry, Viviana Ene","submitted_at":"2014-04-30T06:20:00Z","abstract_excerpt":"Let $X$ be the Hankel matrix of size $2\\times n$ and let $G$ be a closed graph on the vertex set $[n].$ We study the binomial ideal $I_G\\subset K[x_1,\\ldots,x_{n+1}]$ which is generated by all the $2$-minors of $X$ which correspond to the edges of $G.$ We show that $I_G$ is Cohen-Macaulay. We find the minimal primes of $I_G$ and show that $I_G$ is a set theoretical complete intersection. Moreover, a sharp upper bound for the regularity of $I_G$ is given."},"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":"1404.7602","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2014-04-30T06:20:00Z","cross_cats_sorted":[],"title_canon_sha256":"bd1e13c7cc0e8da7c6fe2f38f70a079bd10df9e21832b02325ec369577d892a4","abstract_canon_sha256":"abbb1e8ce3459e155be09482f672c0e126347ee6e37da119f058996a6f124493"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:45.465858Z","signature_b64":"FUheVL7kGK0rp7fqZOgrIcjquEVc1GxmelR0gWhwooYIQ1YdxWgb+vWMg5NpwdZf6JyTNLoKm89y45OCTA6wDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54d065eea19544870633c6a5c7b4cbdff3fa2cd75acb705223ba2a2691703982","last_reissued_at":"2026-05-18T02:49:45.465481Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:45.465481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binomial edge ideals and rational normal scrolls","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"Ahmet Dokuyucu, Faryal Chaudhry, Viviana Ene","submitted_at":"2014-04-30T06:20:00Z","abstract_excerpt":"Let $X$ be the Hankel matrix of size $2\\times n$ and let $G$ be a closed graph on the vertex set $[n].$ We study the binomial ideal $I_G\\subset K[x_1,\\ldots,x_{n+1}]$ which is generated by all the $2$-minors of $X$ which correspond to the edges of $G.$ We show that $I_G$ is Cohen-Macaulay. We find the minimal primes of $I_G$ and show that $I_G$ is a set theoretical complete intersection. Moreover, a sharp upper bound for the regularity of $I_G$ is given."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.7602","kind":"arxiv","version":3},"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":"1404.7602","created_at":"2026-05-18T02:49:45.465538+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.7602v3","created_at":"2026-05-18T02:49:45.465538+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.7602","created_at":"2026-05-18T02:49:45.465538+00:00"},{"alias_kind":"pith_short_12","alias_value":"KTIGL3VBSVCI","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KTIGL3VBSVCIOBRT","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KTIGL3VB","created_at":"2026-05-18T12:28:35.611951+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/KTIGL3VBSVCIOBRTY2S4PNGL37","json":"https://pith.science/pith/KTIGL3VBSVCIOBRTY2S4PNGL37.json","graph_json":"https://pith.science/api/pith-number/KTIGL3VBSVCIOBRTY2S4PNGL37/graph.json","events_json":"https://pith.science/api/pith-number/KTIGL3VBSVCIOBRTY2S4PNGL37/events.json","paper":"https://pith.science/paper/KTIGL3VB"},"agent_actions":{"view_html":"https://pith.science/pith/KTIGL3VBSVCIOBRTY2S4PNGL37","download_json":"https://pith.science/pith/KTIGL3VBSVCIOBRTY2S4PNGL37.json","view_paper":"https://pith.science/paper/KTIGL3VB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.7602&json=true","fetch_graph":"https://pith.science/api/pith-number/KTIGL3VBSVCIOBRTY2S4PNGL37/graph.json","fetch_events":"https://pith.science/api/pith-number/KTIGL3VBSVCIOBRTY2S4PNGL37/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KTIGL3VBSVCIOBRTY2S4PNGL37/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KTIGL3VBSVCIOBRTY2S4PNGL37/action/storage_attestation","attest_author":"https://pith.science/pith/KTIGL3VBSVCIOBRTY2S4PNGL37/action/author_attestation","sign_citation":"https://pith.science/pith/KTIGL3VBSVCIOBRTY2S4PNGL37/action/citation_signature","submit_replication":"https://pith.science/pith/KTIGL3VBSVCIOBRTY2S4PNGL37/action/replication_record"}},"created_at":"2026-05-18T02:49:45.465538+00:00","updated_at":"2026-05-18T02:49:45.465538+00:00"}