{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:AZ4TTUI74QUGFMTHFGHEWPY6P5","short_pith_number":"pith:AZ4TTUI7","schema_version":"1.0","canonical_sha256":"067939d11fe42862b267298e4b3f1e7f6fcf4b5457b4e3954aeb854a77e1f3a9","source":{"kind":"arxiv","id":"2605.21165","version":1},"attestation_state":"computed","paper":{"title":"On $k$-connected vertex-pancyclic graphs without pancyclic edges","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo Zhou, Leyou Xu","submitted_at":"2026-05-20T13:32:50Z","abstract_excerpt":"An edge of a graph of order $n$ is pancyclic if it lies in a cycle of every length $3,\\ldots,n$. A graph of order $n$ is vertex-pancyclic if every vertex lies in a cycle of every length $3,\\ldots,n$. Recently, Li and Zhan proved that every $2$-connected $[4,2]$-graph of order at least seven contains a pancyclic edge. Zhan asked whether there exists a positive integer $k$ such that every $k$-connected vertex-pancyclic graph contains a pancyclic edge. We answer this question by showing that for every positive integer $k$, there is a $k$-connected vertex-pancyclic graph containing no pancyclic ed"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.21165","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-20T13:32:50Z","cross_cats_sorted":[],"title_canon_sha256":"8819c5ed8915227c6d52ebaa2e59ec8006a958c5d351652c3ee71595e81b5b83","abstract_canon_sha256":"bd279360c47fdddda92c468a16d977b09935d66c306b0d7f4324b76fec43dc16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:05:40.654367Z","signature_b64":"Ji/tQbvh6Ph/RQcjeKA23fjFtQqBL5+lqBFJ0g0+HXI3VnmYJQ/YpbJ2KzuRIXw3rJ5TjC3Vmlho1ZlnwP/dBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"067939d11fe42862b267298e4b3f1e7f6fcf4b5457b4e3954aeb854a77e1f3a9","last_reissued_at":"2026-05-21T01:05:40.653831Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:05:40.653831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On $k$-connected vertex-pancyclic graphs without pancyclic edges","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo Zhou, Leyou Xu","submitted_at":"2026-05-20T13:32:50Z","abstract_excerpt":"An edge of a graph of order $n$ is pancyclic if it lies in a cycle of every length $3,\\ldots,n$. A graph of order $n$ is vertex-pancyclic if every vertex lies in a cycle of every length $3,\\ldots,n$. Recently, Li and Zhan proved that every $2$-connected $[4,2]$-graph of order at least seven contains a pancyclic edge. Zhan asked whether there exists a positive integer $k$ such that every $k$-connected vertex-pancyclic graph contains a pancyclic edge. We answer this question by showing that for every positive integer $k$, there is a $k$-connected vertex-pancyclic graph containing no pancyclic ed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21165","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.21165/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.21165","created_at":"2026-05-21T01:05:40.653914+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.21165v1","created_at":"2026-05-21T01:05:40.653914+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21165","created_at":"2026-05-21T01:05:40.653914+00:00"},{"alias_kind":"pith_short_12","alias_value":"AZ4TTUI74QUG","created_at":"2026-05-21T01:05:40.653914+00:00"},{"alias_kind":"pith_short_16","alias_value":"AZ4TTUI74QUGFMTH","created_at":"2026-05-21T01:05:40.653914+00:00"},{"alias_kind":"pith_short_8","alias_value":"AZ4TTUI7","created_at":"2026-05-21T01:05:40.653914+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AZ4TTUI74QUGFMTHFGHEWPY6P5","json":"https://pith.science/pith/AZ4TTUI74QUGFMTHFGHEWPY6P5.json","graph_json":"https://pith.science/api/pith-number/AZ4TTUI74QUGFMTHFGHEWPY6P5/graph.json","events_json":"https://pith.science/api/pith-number/AZ4TTUI74QUGFMTHFGHEWPY6P5/events.json","paper":"https://pith.science/paper/AZ4TTUI7"},"agent_actions":{"view_html":"https://pith.science/pith/AZ4TTUI74QUGFMTHFGHEWPY6P5","download_json":"https://pith.science/pith/AZ4TTUI74QUGFMTHFGHEWPY6P5.json","view_paper":"https://pith.science/paper/AZ4TTUI7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.21165&json=true","fetch_graph":"https://pith.science/api/pith-number/AZ4TTUI74QUGFMTHFGHEWPY6P5/graph.json","fetch_events":"https://pith.science/api/pith-number/AZ4TTUI74QUGFMTHFGHEWPY6P5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AZ4TTUI74QUGFMTHFGHEWPY6P5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AZ4TTUI74QUGFMTHFGHEWPY6P5/action/storage_attestation","attest_author":"https://pith.science/pith/AZ4TTUI74QUGFMTHFGHEWPY6P5/action/author_attestation","sign_citation":"https://pith.science/pith/AZ4TTUI74QUGFMTHFGHEWPY6P5/action/citation_signature","submit_replication":"https://pith.science/pith/AZ4TTUI74QUGFMTHFGHEWPY6P5/action/replication_record"}},"created_at":"2026-05-21T01:05:40.653914+00:00","updated_at":"2026-05-21T01:05:40.653914+00:00"}