{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KXPBY2FGMWXFZXJ6TFISI2DVZ6","short_pith_number":"pith:KXPBY2FG","schema_version":"1.0","canonical_sha256":"55de1c68a665ae5cdd3e9951246875cf95ece34e94e5f57e1891e2817158c776","source":{"kind":"arxiv","id":"1504.01403","version":1},"attestation_state":"computed","paper":{"title":"The Castelnuovo-Mumford regularity of binomial edge ideals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Dariush Kiani, Sara Saeedi Madani","submitted_at":"2015-04-06T20:09:47Z","abstract_excerpt":"We prove a conjectured upper bound for the Castelnuovo-Mumford regularity of binomial edge ideals of graphs, due to Matsuda and Murai. Indeed, we prove that $\\mathrm{reg}(J_G)\\leq n-1$ for any graph $G$ with $n$ vertices, which is not a path. Moreover, we study the behavior of the regularity of binomial edge ideals under the join product of graphs."},"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":"1504.01403","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2015-04-06T20:09:47Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2280f6b272c8e42efa829ec2099871e9bc079d511c4a6a237bb3a86fc14de5ec","abstract_canon_sha256":"fdbfefe8f0a76659d562a5b5fa2ebf01cd873d5d1645bf9559df84abad4b7bce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:27.322667Z","signature_b64":"YGcL3LSu7lSK+GIYi3JQGpiH4m4+W9Siu+VZe4LlYB2BgttS/MLQltBaBKZr3yFGV/Efn+oKMkel/mqlS4l3Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55de1c68a665ae5cdd3e9951246875cf95ece34e94e5f57e1891e2817158c776","last_reissued_at":"2026-05-18T02:19:27.322135Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:27.322135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Castelnuovo-Mumford regularity of binomial edge ideals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Dariush Kiani, Sara Saeedi Madani","submitted_at":"2015-04-06T20:09:47Z","abstract_excerpt":"We prove a conjectured upper bound for the Castelnuovo-Mumford regularity of binomial edge ideals of graphs, due to Matsuda and Murai. Indeed, we prove that $\\mathrm{reg}(J_G)\\leq n-1$ for any graph $G$ with $n$ vertices, which is not a path. Moreover, we study the behavior of the regularity of binomial edge ideals under the join product of graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.01403","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":"1504.01403","created_at":"2026-05-18T02:19:27.322219+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.01403v1","created_at":"2026-05-18T02:19:27.322219+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.01403","created_at":"2026-05-18T02:19:27.322219+00:00"},{"alias_kind":"pith_short_12","alias_value":"KXPBY2FGMWXF","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"KXPBY2FGMWXFZXJ6","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"KXPBY2FG","created_at":"2026-05-18T12:29:29.992203+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/KXPBY2FGMWXFZXJ6TFISI2DVZ6","json":"https://pith.science/pith/KXPBY2FGMWXFZXJ6TFISI2DVZ6.json","graph_json":"https://pith.science/api/pith-number/KXPBY2FGMWXFZXJ6TFISI2DVZ6/graph.json","events_json":"https://pith.science/api/pith-number/KXPBY2FGMWXFZXJ6TFISI2DVZ6/events.json","paper":"https://pith.science/paper/KXPBY2FG"},"agent_actions":{"view_html":"https://pith.science/pith/KXPBY2FGMWXFZXJ6TFISI2DVZ6","download_json":"https://pith.science/pith/KXPBY2FGMWXFZXJ6TFISI2DVZ6.json","view_paper":"https://pith.science/paper/KXPBY2FG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.01403&json=true","fetch_graph":"https://pith.science/api/pith-number/KXPBY2FGMWXFZXJ6TFISI2DVZ6/graph.json","fetch_events":"https://pith.science/api/pith-number/KXPBY2FGMWXFZXJ6TFISI2DVZ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KXPBY2FGMWXFZXJ6TFISI2DVZ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KXPBY2FGMWXFZXJ6TFISI2DVZ6/action/storage_attestation","attest_author":"https://pith.science/pith/KXPBY2FGMWXFZXJ6TFISI2DVZ6/action/author_attestation","sign_citation":"https://pith.science/pith/KXPBY2FGMWXFZXJ6TFISI2DVZ6/action/citation_signature","submit_replication":"https://pith.science/pith/KXPBY2FGMWXFZXJ6TFISI2DVZ6/action/replication_record"}},"created_at":"2026-05-18T02:19:27.322219+00:00","updated_at":"2026-05-18T02:19:27.322219+00:00"}