{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:FAC52S67PBFCSJSWMSO4P353QS","short_pith_number":"pith:FAC52S67","canonical_record":{"source":{"id":"1007.4056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2010-07-23T07:27:49Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"13fb17a17ab139b2625a753dbc9e52bf2c8ecab04052add18abdd695e85d82ad","abstract_canon_sha256":"27b75fda2b5811ca4fb43d7a6e0ebfcb6127cdc6c8ced32e5ee65639199d0a11"},"schema_version":"1.0"},"canonical_sha256":"2805dd4bdf784a292656649dc7efbb84b2a5fd9ba8324709b5695ef4e1e2fdf5","source":{"kind":"arxiv","id":"1007.4056","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:FAC52S67PBFCSJSWMSO4P353QS","target":"record","payload":{"canonical_record":{"source":{"id":"1007.4056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2010-07-23T07:27:49Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"13fb17a17ab139b2625a753dbc9e52bf2c8ecab04052add18abdd695e85d82ad","abstract_canon_sha256":"27b75fda2b5811ca4fb43d7a6e0ebfcb6127cdc6c8ced32e5ee65639199d0a11"},"schema_version":"1.0"},"canonical_sha256":"2805dd4bdf784a292656649dc7efbb84b2a5fd9ba8324709b5695ef4e1e2fdf5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:31.821338Z","signature_b64":"9CUgvvT6yl/DUsz7jKVs6E4J2zwVWfpovekHE4xJZSiTtGJ8UrRgM/H+H2zU3nounFLZJ/5vL0LCv5rMVEMyCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2805dd4bdf784a292656649dc7efbb84b2a5fd9ba8324709b5695ef4e1e2fdf5","last_reissued_at":"2026-05-18T01:23:31.820824Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:31.820824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.4056","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:23:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xwjg6kcGc/gjE9rm4tkMknUDVakqJkh9DG/uyTyH1Ttve6qZ1aTzfTkLeqxFsKRAlqGoSR8AUbIgMZv5llcLDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:20:45.968925Z"},"content_sha256":"a6e9d95eed54d9f0602049b6ad218111a29e9e6f0a5b2cc6088b3d685861331e","schema_version":"1.0","event_id":"sha256:a6e9d95eed54d9f0602049b6ad218111a29e9e6f0a5b2cc6088b3d685861331e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:FAC52S67PBFCSJSWMSO4P353QS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds for the regularity of edge ideal of vertex decomposable and shellable graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Dariush Kiani, Somayeh Moradi","submitted_at":"2010-07-23T07:27:49Z","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)\\}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.4056","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:23:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z5s3wmrxW1cNaDMhhbFPFoBk1yFHTJoktb64QoPM+QzxNmJEVCrTm3zXfbG1d89XcXMJoSntUeTXh9C0fzG/Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:20:45.969455Z"},"content_sha256":"2fa254117b973ef0ad97e1d5616e411f8da5fac6c8eca64c1c409bd28efc4b47","schema_version":"1.0","event_id":"sha256:2fa254117b973ef0ad97e1d5616e411f8da5fac6c8eca64c1c409bd28efc4b47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FAC52S67PBFCSJSWMSO4P353QS/bundle.json","state_url":"https://pith.science/pith/FAC52S67PBFCSJSWMSO4P353QS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FAC52S67PBFCSJSWMSO4P353QS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T11:20:45Z","links":{"resolver":"https://pith.science/pith/FAC52S67PBFCSJSWMSO4P353QS","bundle":"https://pith.science/pith/FAC52S67PBFCSJSWMSO4P353QS/bundle.json","state":"https://pith.science/pith/FAC52S67PBFCSJSWMSO4P353QS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FAC52S67PBFCSJSWMSO4P353QS/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V697iH9moVy5nfUiXegX1nnyAKAFVHqprgGf6BeuJNgDE83i83PFC7Awf36+Q8oT5DvVWCGKSpsdO6dhmCGDBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:20:45.972596Z","bundle_sha256":"731c4cae9a846d1acb0fc0c631326a2a02e793bcb9349d175612a203a74fe979"}}