{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:FAC52S67PBFCSJSWMSO4P353QS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"27b75fda2b5811ca4fb43d7a6e0ebfcb6127cdc6c8ced32e5ee65639199d0a11","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2010-07-23T07:27:49Z","title_canon_sha256":"13fb17a17ab139b2625a753dbc9e52bf2c8ecab04052add18abdd695e85d82ad"},"schema_version":"1.0","source":{"id":"1007.4056","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.4056","created_at":"2026-05-18T01:23:31Z"},{"alias_kind":"arxiv_version","alias_value":"1007.4056v1","created_at":"2026-05-18T01:23:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.4056","created_at":"2026-05-18T01:23:31Z"},{"alias_kind":"pith_short_12","alias_value":"FAC52S67PBFC","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"FAC52S67PBFCSJSW","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"FAC52S67","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:2fa254117b973ef0ad97e1d5616e411f8da5fac6c8eca64c1c409bd28efc4b47","target":"graph","created_at":"2026-05-18T01:23:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper we give upper bounds for the regularity of edge ideal of some classes of graphs in terms of invariants of graph. We introduce two numbers $a'(G)$ and $n(G)$ depending on graph $G$ and show that for a vertex decomposable graph $G$, $\\reg(R/I(G))\\leq \\min\\{a'(G),n(G)\\}$ and for a shellable graph $G$, $\\reg(R/I(G))\\leq n(G)$. Moreover it is shown that for a graph $G$, where $G^c$ is a $d$-tree, we have $\\pd(R/I(G))=\\max_{v\\in V(G)} \\{\\deg_G(v)\\}$.","authors_text":"Dariush Kiani, Somayeh Moradi","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2010-07-23T07:27:49Z","title":"Bounds for the regularity of edge ideal of vertex decomposable and shellable graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.4056","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a6e9d95eed54d9f0602049b6ad218111a29e9e6f0a5b2cc6088b3d685861331e","target":"record","created_at":"2026-05-18T01:23:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"27b75fda2b5811ca4fb43d7a6e0ebfcb6127cdc6c8ced32e5ee65639199d0a11","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2010-07-23T07:27:49Z","title_canon_sha256":"13fb17a17ab139b2625a753dbc9e52bf2c8ecab04052add18abdd695e85d82ad"},"schema_version":"1.0","source":{"id":"1007.4056","kind":"arxiv","version":1}},"canonical_sha256":"2805dd4bdf784a292656649dc7efbb84b2a5fd9ba8324709b5695ef4e1e2fdf5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2805dd4bdf784a292656649dc7efbb84b2a5fd9ba8324709b5695ef4e1e2fdf5","first_computed_at":"2026-05-18T01:23:31.820824Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:31.820824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9CUgvvT6yl/DUsz7jKVs6E4J2zwVWfpovekHE4xJZSiTtGJ8UrRgM/H+H2zU3nounFLZJ/5vL0LCv5rMVEMyCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:31.821338Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.4056","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a6e9d95eed54d9f0602049b6ad218111a29e9e6f0a5b2cc6088b3d685861331e","sha256:2fa254117b973ef0ad97e1d5616e411f8da5fac6c8eca64c1c409bd28efc4b47"],"state_sha256":"6f86d16c628f7500d9e473a3819a7ca25b513c8fbf952ed5546dfbd54eb717b5"}