{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LPHMH2ZIGNSM5SKU5QDUTSSLBD","short_pith_number":"pith:LPHMH2ZI","canonical_record":{"source":{"id":"1505.00060","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-01T00:11:27Z","cross_cats_sorted":["math.AC"],"title_canon_sha256":"f9d5673d3ab12aa355d701610bc6f7448c2a422e8866c5067d60ada3a171d81b","abstract_canon_sha256":"794231101884e38b678b3744703c30bbb67814d873a282ae6af45fdb907f666c"},"schema_version":"1.0"},"canonical_sha256":"5bcec3eb283364cec954ec0749ca4b08ef583b4666effbdcf07c199f3ca0063f","source":{"kind":"arxiv","id":"1505.00060","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.00060","created_at":"2026-05-18T02:17:13Z"},{"alias_kind":"arxiv_version","alias_value":"1505.00060v1","created_at":"2026-05-18T02:17:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00060","created_at":"2026-05-18T02:17:13Z"},{"alias_kind":"pith_short_12","alias_value":"LPHMH2ZIGNSM","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LPHMH2ZIGNSM5SKU","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LPHMH2ZI","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LPHMH2ZIGNSM5SKU5QDUTSSLBD","target":"record","payload":{"canonical_record":{"source":{"id":"1505.00060","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-01T00:11:27Z","cross_cats_sorted":["math.AC"],"title_canon_sha256":"f9d5673d3ab12aa355d701610bc6f7448c2a422e8866c5067d60ada3a171d81b","abstract_canon_sha256":"794231101884e38b678b3744703c30bbb67814d873a282ae6af45fdb907f666c"},"schema_version":"1.0"},"canonical_sha256":"5bcec3eb283364cec954ec0749ca4b08ef583b4666effbdcf07c199f3ca0063f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:13.692706Z","signature_b64":"nMLI32W9nJoTSC0xJSwvW2f+1u9tVlg26h5qqgcjP+zCilZE9z0Q9KYkP7cGTUo6UWY7qS3WR8N5GbFlk938CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bcec3eb283364cec954ec0749ca4b08ef583b4666effbdcf07c199f3ca0063f","last_reissued_at":"2026-05-18T02:17:13.691956Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:13.691956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.00060","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-18T02:17:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7mEiJHAHYmRmt7d6hsujnAzg6teOjx8z3VyHsuXE0d5BnpQdr7jDhpZv2KiKEL8j2kfYrIpy3EbbTZI2yolwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:26:58.471200Z"},"content_sha256":"e09bae58908dcdfd98c9815617554052ea7792a3265e2a0500df758e76359755","schema_version":"1.0","event_id":"sha256:e09bae58908dcdfd98c9815617554052ea7792a3265e2a0500df758e76359755"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LPHMH2ZIGNSM5SKU5QDUTSSLBD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On well-covered, vertex decomposable and Cohen-Macaulay graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"math.CO","authors_text":"Enrique Reyes, Iv\\'an Dario Castrill\\'on, Roberto Cruz","submitted_at":"2015-05-01T00:11:27Z","abstract_excerpt":"Let $G=(V,E)$ be a graph. If $G$ is a K\\\"onig graph or $G$ is a graph without 3-cycles and 5-cycle, we prove that the following conditions are equivalent: $\\Delta_{G}$ is pure shellable, $R/I_{\\Delta}$ is Cohen-Macaulay, $G$ is unmixed vertex decomposable graph and $G$ is well-covered with a perfect matching of K\\\"onig type $e_{1},...,e_{g}$ without square with two $e_i$'s. We characterize well-covered graphs without 3-cycles, 5-cycles and 7-cycles. Also, we study when graphs without 3-cycles and 5-cycles are vertex decomposable or shellable. Furthermore, we give some properties and relations "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00060","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-18T02:17:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zbFiUGgzY3IgHuiTudO/d+wVjxUM4jWySDccLKFu7hqP9cac1jIwKO4MXyRmT4l4Jpj4FRZbU7gh+HPDw4LwCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:26:58.471615Z"},"content_sha256":"c03ac9776b40582a58918a103a9108b11066b8d1bec2c0d56c5f48395df06287","schema_version":"1.0","event_id":"sha256:c03ac9776b40582a58918a103a9108b11066b8d1bec2c0d56c5f48395df06287"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LPHMH2ZIGNSM5SKU5QDUTSSLBD/bundle.json","state_url":"https://pith.science/pith/LPHMH2ZIGNSM5SKU5QDUTSSLBD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LPHMH2ZIGNSM5SKU5QDUTSSLBD/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-01T03:26:58Z","links":{"resolver":"https://pith.science/pith/LPHMH2ZIGNSM5SKU5QDUTSSLBD","bundle":"https://pith.science/pith/LPHMH2ZIGNSM5SKU5QDUTSSLBD/bundle.json","state":"https://pith.science/pith/LPHMH2ZIGNSM5SKU5QDUTSSLBD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LPHMH2ZIGNSM5SKU5QDUTSSLBD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LPHMH2ZIGNSM5SKU5QDUTSSLBD","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":"794231101884e38b678b3744703c30bbb67814d873a282ae6af45fdb907f666c","cross_cats_sorted":["math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-01T00:11:27Z","title_canon_sha256":"f9d5673d3ab12aa355d701610bc6f7448c2a422e8866c5067d60ada3a171d81b"},"schema_version":"1.0","source":{"id":"1505.00060","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.00060","created_at":"2026-05-18T02:17:13Z"},{"alias_kind":"arxiv_version","alias_value":"1505.00060v1","created_at":"2026-05-18T02:17:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00060","created_at":"2026-05-18T02:17:13Z"},{"alias_kind":"pith_short_12","alias_value":"LPHMH2ZIGNSM","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LPHMH2ZIGNSM5SKU","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LPHMH2ZI","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:c03ac9776b40582a58918a103a9108b11066b8d1bec2c0d56c5f48395df06287","target":"graph","created_at":"2026-05-18T02:17:13Z","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":"Let $G=(V,E)$ be a graph. If $G$ is a K\\\"onig graph or $G$ is a graph without 3-cycles and 5-cycle, we prove that the following conditions are equivalent: $\\Delta_{G}$ is pure shellable, $R/I_{\\Delta}$ is Cohen-Macaulay, $G$ is unmixed vertex decomposable graph and $G$ is well-covered with a perfect matching of K\\\"onig type $e_{1},...,e_{g}$ without square with two $e_i$'s. We characterize well-covered graphs without 3-cycles, 5-cycles and 7-cycles. Also, we study when graphs without 3-cycles and 5-cycles are vertex decomposable or shellable. Furthermore, we give some properties and relations ","authors_text":"Enrique Reyes, Iv\\'an Dario Castrill\\'on, Roberto Cruz","cross_cats":["math.AC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-01T00:11:27Z","title":"On well-covered, vertex decomposable and Cohen-Macaulay graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00060","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:e09bae58908dcdfd98c9815617554052ea7792a3265e2a0500df758e76359755","target":"record","created_at":"2026-05-18T02:17:13Z","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":"794231101884e38b678b3744703c30bbb67814d873a282ae6af45fdb907f666c","cross_cats_sorted":["math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-01T00:11:27Z","title_canon_sha256":"f9d5673d3ab12aa355d701610bc6f7448c2a422e8866c5067d60ada3a171d81b"},"schema_version":"1.0","source":{"id":"1505.00060","kind":"arxiv","version":1}},"canonical_sha256":"5bcec3eb283364cec954ec0749ca4b08ef583b4666effbdcf07c199f3ca0063f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5bcec3eb283364cec954ec0749ca4b08ef583b4666effbdcf07c199f3ca0063f","first_computed_at":"2026-05-18T02:17:13.691956Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:13.691956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nMLI32W9nJoTSC0xJSwvW2f+1u9tVlg26h5qqgcjP+zCilZE9z0Q9KYkP7cGTUo6UWY7qS3WR8N5GbFlk938CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:13.692706Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.00060","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e09bae58908dcdfd98c9815617554052ea7792a3265e2a0500df758e76359755","sha256:c03ac9776b40582a58918a103a9108b11066b8d1bec2c0d56c5f48395df06287"],"state_sha256":"93b2d3d2fbeb3a5ca3863c8f280b939841adf2135d0869842ce6a013083a8074"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6L6dwNAcIgbnY6RyBm8XNEqbnuvtrS4DFgeb6SViW4/0MhQjN5dSErmKF57Z9VOESWcyEQKFf2IQfQnA6ChhDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:26:58.473709Z","bundle_sha256":"695b3946aa7d7cc12c2b68eb35e1960845a7449a1cf6c3eabb0180671c2fae1b"}}