{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2EC3HYMTBC6UOK5NVSDZ3ZY3W7","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":"acc80966c921963dbe2d805d42ec00ad6298de9cff50377bff0c885039d5cb60","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2018-05-03T16:33:59Z","title_canon_sha256":"1e18fb7e218f1f7d519ef109a64ae9f944b17b15ad8f20eea8139be45274792c"},"schema_version":"1.0","source":{"id":"1805.01412","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.01412","created_at":"2026-07-05T02:10:47Z"},{"alias_kind":"arxiv_version","alias_value":"1805.01412v2","created_at":"2026-07-05T02:10:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01412","created_at":"2026-07-05T02:10:47Z"},{"alias_kind":"pith_short_12","alias_value":"2EC3HYMTBC6U","created_at":"2026-07-05T02:10:47Z"},{"alias_kind":"pith_short_16","alias_value":"2EC3HYMTBC6UOK5N","created_at":"2026-07-05T02:10:47Z"},{"alias_kind":"pith_short_8","alias_value":"2EC3HYMT","created_at":"2026-07-05T02:10:47Z"}],"graph_snapshots":[{"event_id":"sha256:a58e92c80d29186e5a2402f0b916a51ee0a3f3536ad3a7fe16a00fd98da95d1d","target":"graph","created_at":"2026-07-05T02:10:47Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1805.01412/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G$ be a finite simple graph and $I(G)$ denote the corresponding edge ideal. In this paper, we obtain upper bounds for the Castelnuovo-Mumford regularity of $I(G)^q$ in terms of certain combinatorial invariants associated with $G$. We also prove a weaker version of a conjecture by Alilooee, Banerjee, Beyarslan and H\\`a on an upper bound for the regularity of $I(G)^q$ and we prove the conjectured upper bound for the class of vertex decomposable graphs. Using these results, we explicitly compute the regularity of $I(G)^q$ for several classes of graphs.","authors_text":"A. V. Jayanthan, S. Selvaraja","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2018-05-03T16:33:59Z","title":"Upper bounds for the regularity of powers of edge ideals of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01412","kind":"arxiv","version":2},"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:aba1401b74f6ceb9883515bf929d60739faaa306b833535bfc65cd86e4b705e8","target":"record","created_at":"2026-07-05T02:10:47Z","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":"acc80966c921963dbe2d805d42ec00ad6298de9cff50377bff0c885039d5cb60","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2018-05-03T16:33:59Z","title_canon_sha256":"1e18fb7e218f1f7d519ef109a64ae9f944b17b15ad8f20eea8139be45274792c"},"schema_version":"1.0","source":{"id":"1805.01412","kind":"arxiv","version":2}},"canonical_sha256":"d105b3e19308bd472badac879de71bb7f76d8f945e0b53c33196a2ecc4a4f7fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d105b3e19308bd472badac879de71bb7f76d8f945e0b53c33196a2ecc4a4f7fe","first_computed_at":"2026-07-05T02:10:47.424194Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:10:47.424194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H+kcmgtEcWoLPeWi0lWxlpmU/gNb9+UqzvLaCddSYB5y/rNuemIGmcie9Z1P6YYYtR4qCReVpq3y5cE+I4y+Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:10:47.424633Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.01412","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aba1401b74f6ceb9883515bf929d60739faaa306b833535bfc65cd86e4b705e8","sha256:a58e92c80d29186e5a2402f0b916a51ee0a3f3536ad3a7fe16a00fd98da95d1d"],"state_sha256":"91ab0e30af65f7987e0a13921d42395aa9ff671301e7a73f0885521454cd1e8f"}