{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6DG6FWHEH7JUW5HAWZP5HXZWLI","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":"9faeea48d006aefb0de2899c7591da90b0b3b3b0b445868cdc6dab2f94d5ac93","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-27T17:15:33Z","title_canon_sha256":"6a84da5b1b5fe011ef8590f08f68783b90c7c74288f11dd326cfda753995930a"},"schema_version":"1.0","source":{"id":"1507.07486","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.07486","created_at":"2026-05-18T01:36:16Z"},{"alias_kind":"arxiv_version","alias_value":"1507.07486v1","created_at":"2026-05-18T01:36:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07486","created_at":"2026-05-18T01:36:16Z"},{"alias_kind":"pith_short_12","alias_value":"6DG6FWHEH7JU","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6DG6FWHEH7JUW5HA","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6DG6FWHE","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:2277c22c7f57ce2cea85e3bef862e9f44ad55add7c9ae9a12cd8243ba9cf3395","target":"graph","created_at":"2026-05-18T01:36:16Z","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":"The research in the present paper was motivated by the conjecture of Ryj\\'{a}\\v{c}ek that every locally connected graph is weakly pancyclic.\n  For a connected locally connected graph $G$ of order at least $3$, our results are as follows: If $G$ is $(K_1+(K_1\\cup K_2))$-free, then $G$ is weakly pancyclic. If $G$ is $(K_1+(K_1\\cup K_2))$-free, then $G$ is fully cycle extendable if and only if $2\\delta(G)\\geq n(G)$. If $G$ is $\\{ K_1+K_1+\\bar{K}_3,K_1+P_4\\}$-free or $\\{ K_1+K_1+\\bar{K}_3,K_1+(K_1\\cup P_3)\\}$-free, then $G$ is fully cycle extendable. If $G$ is distinct from $K_1+K_1+\\bar{K}_3$ and","authors_text":"Christoph Brause, Dieter Rautenbach, Ingo Schiermeyer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-27T17:15:33Z","title":"Local Connectivity, Local Degree Conditions, some Forbidden Induced Subgraphs, and Cycle Extendability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07486","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:5850e3d02c6b6586271e26857dd9df4eb53be2c457e289f4d5c06fe2adb9a15b","target":"record","created_at":"2026-05-18T01:36:16Z","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":"9faeea48d006aefb0de2899c7591da90b0b3b3b0b445868cdc6dab2f94d5ac93","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-27T17:15:33Z","title_canon_sha256":"6a84da5b1b5fe011ef8590f08f68783b90c7c74288f11dd326cfda753995930a"},"schema_version":"1.0","source":{"id":"1507.07486","kind":"arxiv","version":1}},"canonical_sha256":"f0cde2d8e43fd34b74e0b65fd3df365a07efd2e6c92245fcb616e150490fd942","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0cde2d8e43fd34b74e0b65fd3df365a07efd2e6c92245fcb616e150490fd942","first_computed_at":"2026-05-18T01:36:16.285925Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:16.285925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZnVnbeJJ3ED65DspWTYWze++yIJQ6v2jfKnGUIl6dKRSMEZZmOZnmmFzwxIRQYL2o6zY2yPw3nCg2Dd5NhxoCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:16.286399Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.07486","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5850e3d02c6b6586271e26857dd9df4eb53be2c457e289f4d5c06fe2adb9a15b","sha256:2277c22c7f57ce2cea85e3bef862e9f44ad55add7c9ae9a12cd8243ba9cf3395"],"state_sha256":"cee0a737ee3836d305a977183aa633fbef1e4d1ed8e99f3f7ce065d28c92ff9c"}