{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:EAX3XU4YTQU266G5K25OMXJGET","short_pith_number":"pith:EAX3XU4Y","canonical_record":{"source":{"id":"1305.6122","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2013-05-27T06:34:57Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d1e5354497faf7181788ce12bf48e7c7f35957310454bdccd07b346f57b36d3d","abstract_canon_sha256":"5bf442c9ac1de7e18b82f8c0a38b291abd211d6e179454a9a919431873ebd6e6"},"schema_version":"1.0"},"canonical_sha256":"202fbbd3989c29af78dd56bae65d2624ccebb9122dc285cc195cf892786259a1","source":{"kind":"arxiv","id":"1305.6122","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.6122","created_at":"2026-05-18T00:52:24Z"},{"alias_kind":"arxiv_version","alias_value":"1305.6122v1","created_at":"2026-05-18T00:52:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6122","created_at":"2026-05-18T00:52:24Z"},{"alias_kind":"pith_short_12","alias_value":"EAX3XU4YTQU2","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EAX3XU4YTQU266G5","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EAX3XU4Y","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:EAX3XU4YTQU266G5K25OMXJGET","target":"record","payload":{"canonical_record":{"source":{"id":"1305.6122","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2013-05-27T06:34:57Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"d1e5354497faf7181788ce12bf48e7c7f35957310454bdccd07b346f57b36d3d","abstract_canon_sha256":"5bf442c9ac1de7e18b82f8c0a38b291abd211d6e179454a9a919431873ebd6e6"},"schema_version":"1.0"},"canonical_sha256":"202fbbd3989c29af78dd56bae65d2624ccebb9122dc285cc195cf892786259a1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:24.317982Z","signature_b64":"PX7okAT90J10oytf0P0oBBPAJBnVyPwiVwlR32QoctBmhsjFWCzU4jzNbaJxmbkrY5aFRhtWRAFJnBEHgjBmCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"202fbbd3989c29af78dd56bae65d2624ccebb9122dc285cc195cf892786259a1","last_reissued_at":"2026-05-18T00:52:24.317386Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:24.317386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.6122","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-18T00:52:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IPpVaD9S/VFTDLfCNiXX5A5vpKR4KYX1SAtzI1T1ne+DmfjwNzeG05iqk0FxL59X0Y9YlnbRQkzdVi4laWZ3Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:33:55.227722Z"},"content_sha256":"efd151e0e20451c1c89bf6a5017627cde304365806e3f22c20185a257cdc6a43","schema_version":"1.0","event_id":"sha256:efd151e0e20451c1c89bf6a5017627cde304365806e3f22c20185a257cdc6a43"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:EAX3XU4YTQU266G5K25OMXJGET","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Regularity and projective dimension of edge ideal of $C_5$-free vertex decomposable graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Fahimeh Khosh-Ahang, Somayeh Moradi","submitted_at":"2013-05-27T06:34:57Z","abstract_excerpt":"In this paper, we explain the regularity, projective dimension and depth of edge ideal of some classes of graphs in terms of invariants of graphs. We show that for a $C_5$-free vertex decomposable graph $G$, $\\T{reg}(R/I(G))= c_G$, where $c_G$ is the maximum number of 3-disjoint edges in $G$. Moreover for this class of graphs we characterize $\\T{pd}(R/I(G))$ and $\\T{depth}(R/I(G))$. As a corollary we describe these invariants in forests and sequentially Cohen-Macaulay bipartite graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6122","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-18T00:52:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0i6+AAiG9mY2/hz9tF0wb2L4OY1JVgIpL9Dt3Ttz7vx1t/kPpPapUnIaDyGuBRX4qIJ/OXQiPjWqs9ESllq2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:33:55.228092Z"},"content_sha256":"89e6c2e56d0e912d7fb25ba89ec5fe127a7729f519e92aa3e624cbafc6415721","schema_version":"1.0","event_id":"sha256:89e6c2e56d0e912d7fb25ba89ec5fe127a7729f519e92aa3e624cbafc6415721"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EAX3XU4YTQU266G5K25OMXJGET/bundle.json","state_url":"https://pith.science/pith/EAX3XU4YTQU266G5K25OMXJGET/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EAX3XU4YTQU266G5K25OMXJGET/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-06-21T23:33:55Z","links":{"resolver":"https://pith.science/pith/EAX3XU4YTQU266G5K25OMXJGET","bundle":"https://pith.science/pith/EAX3XU4YTQU266G5K25OMXJGET/bundle.json","state":"https://pith.science/pith/EAX3XU4YTQU266G5K25OMXJGET/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EAX3XU4YTQU266G5K25OMXJGET/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:EAX3XU4YTQU266G5K25OMXJGET","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":"5bf442c9ac1de7e18b82f8c0a38b291abd211d6e179454a9a919431873ebd6e6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2013-05-27T06:34:57Z","title_canon_sha256":"d1e5354497faf7181788ce12bf48e7c7f35957310454bdccd07b346f57b36d3d"},"schema_version":"1.0","source":{"id":"1305.6122","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.6122","created_at":"2026-05-18T00:52:24Z"},{"alias_kind":"arxiv_version","alias_value":"1305.6122v1","created_at":"2026-05-18T00:52:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6122","created_at":"2026-05-18T00:52:24Z"},{"alias_kind":"pith_short_12","alias_value":"EAX3XU4YTQU2","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EAX3XU4YTQU266G5","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EAX3XU4Y","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:89e6c2e56d0e912d7fb25ba89ec5fe127a7729f519e92aa3e624cbafc6415721","target":"graph","created_at":"2026-05-18T00:52:24Z","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 explain the regularity, projective dimension and depth of edge ideal of some classes of graphs in terms of invariants of graphs. We show that for a $C_5$-free vertex decomposable graph $G$, $\\T{reg}(R/I(G))= c_G$, where $c_G$ is the maximum number of 3-disjoint edges in $G$. Moreover for this class of graphs we characterize $\\T{pd}(R/I(G))$ and $\\T{depth}(R/I(G))$. As a corollary we describe these invariants in forests and sequentially Cohen-Macaulay bipartite graphs.","authors_text":"Fahimeh Khosh-Ahang, Somayeh Moradi","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2013-05-27T06:34:57Z","title":"Regularity and projective dimension of edge ideal of $C_5$-free vertex decomposable graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6122","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:efd151e0e20451c1c89bf6a5017627cde304365806e3f22c20185a257cdc6a43","target":"record","created_at":"2026-05-18T00:52:24Z","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":"5bf442c9ac1de7e18b82f8c0a38b291abd211d6e179454a9a919431873ebd6e6","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2013-05-27T06:34:57Z","title_canon_sha256":"d1e5354497faf7181788ce12bf48e7c7f35957310454bdccd07b346f57b36d3d"},"schema_version":"1.0","source":{"id":"1305.6122","kind":"arxiv","version":1}},"canonical_sha256":"202fbbd3989c29af78dd56bae65d2624ccebb9122dc285cc195cf892786259a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"202fbbd3989c29af78dd56bae65d2624ccebb9122dc285cc195cf892786259a1","first_computed_at":"2026-05-18T00:52:24.317386Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:24.317386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PX7okAT90J10oytf0P0oBBPAJBnVyPwiVwlR32QoctBmhsjFWCzU4jzNbaJxmbkrY5aFRhtWRAFJnBEHgjBmCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:24.317982Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.6122","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:efd151e0e20451c1c89bf6a5017627cde304365806e3f22c20185a257cdc6a43","sha256:89e6c2e56d0e912d7fb25ba89ec5fe127a7729f519e92aa3e624cbafc6415721"],"state_sha256":"10405677583a7b29dcba025d4d4ea0606764601d90958eef2d5d9216a24db400"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TayP4jVk7/xKk1rTCCN49FhHpQvgcSgq7ls8PxTnNLvZcSJOlGcjy8BdEugRWlXjrAu95EtaczMxIKyw4NGiDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T23:33:55.230232Z","bundle_sha256":"bc71309ebb2c90c3a4d665857f17f5d2e11f6c91de121634af0fd4df9ed9c28f"}}