{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LMQJO7MWKAGEIU3MLUTKJVXIET","short_pith_number":"pith:LMQJO7MW","schema_version":"1.0","canonical_sha256":"5b20977d96500c44536c5d26a4d6e824ca62e89827e2310d2d5495213e3a9f1d","source":{"kind":"arxiv","id":"1601.01401","version":1},"attestation_state":"computed","paper":{"title":"Cyclability of $id$-cycles in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo Ning, Ruonan Li, Shenggui Zhang","submitted_at":"2016-01-07T04:58:48Z","abstract_excerpt":"Let $G$ be a graph on $n$ vertices and $C'=v_0v_1\\cdots v_{p-1}v_0$ a vertex sequence of $G$ with $p\\geq 3$ ($v_i\\neq v_j$ for all $i,j=0,1,\\ldots,p-1$, $i\\neq j$). If for any successive vertices $v_i$, $v_{i+1}$ on $C'$, either $v_iv_{i+1}\\in E(G)$ or both of the first implicit-degrees of $v_i$ and $v_{i+1}$ are at least $n/2$ (indices are taken modulo $p$), then $C'$ is called an $id$-cycle of $G$. In this paper, we prove that for every $id$-cycle $C'$, there exists a cycle $C$ in $G$ with $V(C')\\subseteq V(C)$. This generalizes several early results on the Hamiltonicity and cyclability of g"},"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":"1601.01401","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-07T04:58:48Z","cross_cats_sorted":[],"title_canon_sha256":"3afbab802e2681fdac17eb1c44c7d252c1cd6086ed2b7af4b8fa2843fb6390ee","abstract_canon_sha256":"ff31fae29498c016a4a4ebd1950f9de545875f25114864a47ea825f45766a605"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:15.529498Z","signature_b64":"Tz4AzpSEdxt+lT8CVPoIY+ASS/qwYxt8bYq0X645pjx9PUpI//IMmftUoNhHpH+EBGrbfbrnr/Scj9o5s1vrCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b20977d96500c44536c5d26a4d6e824ca62e89827e2310d2d5495213e3a9f1d","last_reissued_at":"2026-05-18T01:23:15.528857Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:15.528857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cyclability of $id$-cycles in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo Ning, Ruonan Li, Shenggui Zhang","submitted_at":"2016-01-07T04:58:48Z","abstract_excerpt":"Let $G$ be a graph on $n$ vertices and $C'=v_0v_1\\cdots v_{p-1}v_0$ a vertex sequence of $G$ with $p\\geq 3$ ($v_i\\neq v_j$ for all $i,j=0,1,\\ldots,p-1$, $i\\neq j$). If for any successive vertices $v_i$, $v_{i+1}$ on $C'$, either $v_iv_{i+1}\\in E(G)$ or both of the first implicit-degrees of $v_i$ and $v_{i+1}$ are at least $n/2$ (indices are taken modulo $p$), then $C'$ is called an $id$-cycle of $G$. In this paper, we prove that for every $id$-cycle $C'$, there exists a cycle $C$ in $G$ with $V(C')\\subseteq V(C)$. This generalizes several early results on the Hamiltonicity and cyclability of g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01401","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1601.01401","created_at":"2026-05-18T01:23:15.528960+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.01401v1","created_at":"2026-05-18T01:23:15.528960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01401","created_at":"2026-05-18T01:23:15.528960+00:00"},{"alias_kind":"pith_short_12","alias_value":"LMQJO7MWKAGE","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LMQJO7MWKAGEIU3M","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LMQJO7MW","created_at":"2026-05-18T12:30:29.479603+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/LMQJO7MWKAGEIU3MLUTKJVXIET","json":"https://pith.science/pith/LMQJO7MWKAGEIU3MLUTKJVXIET.json","graph_json":"https://pith.science/api/pith-number/LMQJO7MWKAGEIU3MLUTKJVXIET/graph.json","events_json":"https://pith.science/api/pith-number/LMQJO7MWKAGEIU3MLUTKJVXIET/events.json","paper":"https://pith.science/paper/LMQJO7MW"},"agent_actions":{"view_html":"https://pith.science/pith/LMQJO7MWKAGEIU3MLUTKJVXIET","download_json":"https://pith.science/pith/LMQJO7MWKAGEIU3MLUTKJVXIET.json","view_paper":"https://pith.science/paper/LMQJO7MW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.01401&json=true","fetch_graph":"https://pith.science/api/pith-number/LMQJO7MWKAGEIU3MLUTKJVXIET/graph.json","fetch_events":"https://pith.science/api/pith-number/LMQJO7MWKAGEIU3MLUTKJVXIET/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LMQJO7MWKAGEIU3MLUTKJVXIET/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LMQJO7MWKAGEIU3MLUTKJVXIET/action/storage_attestation","attest_author":"https://pith.science/pith/LMQJO7MWKAGEIU3MLUTKJVXIET/action/author_attestation","sign_citation":"https://pith.science/pith/LMQJO7MWKAGEIU3MLUTKJVXIET/action/citation_signature","submit_replication":"https://pith.science/pith/LMQJO7MWKAGEIU3MLUTKJVXIET/action/replication_record"}},"created_at":"2026-05-18T01:23:15.528960+00:00","updated_at":"2026-05-18T01:23:15.528960+00:00"}