{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LMQJO7MWKAGEIU3MLUTKJVXIET","short_pith_number":"pith:LMQJO7MW","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"},"canonical_sha256":"5b20977d96500c44536c5d26a4d6e824ca62e89827e2310d2d5495213e3a9f1d","source":{"kind":"arxiv","id":"1601.01401","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.01401","created_at":"2026-05-18T01:23:15Z"},{"alias_kind":"arxiv_version","alias_value":"1601.01401v1","created_at":"2026-05-18T01:23:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01401","created_at":"2026-05-18T01:23:15Z"},{"alias_kind":"pith_short_12","alias_value":"LMQJO7MWKAGE","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LMQJO7MWKAGEIU3M","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LMQJO7MW","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LMQJO7MWKAGEIU3MLUTKJVXIET","target":"record","payload":{"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"},"canonical_sha256":"5b20977d96500c44536c5d26a4d6e824ca62e89827e2310d2d5495213e3a9f1d","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"},"source_kind":"arxiv","source_id":"1601.01401","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-18T01:23:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l8v0PYt/K7RgaQaAEo3hIPCKQ0/j5BbJnre3U/SHDiwoNvgky2hiQqUPmNNgRGdAUSArMFV6f4W9mTBYxvsLAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:43:57.683908Z"},"content_sha256":"c3d68b3c8fd78dbc4d707f6db0b9edd484f47f6f633fff010e1477a0bd42ce2d","schema_version":"1.0","event_id":"sha256:c3d68b3c8fd78dbc4d707f6db0b9edd484f47f6f633fff010e1477a0bd42ce2d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LMQJO7MWKAGEIU3MLUTKJVXIET","target":"graph","payload":{"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"},"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-18T01:23:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"45Y0Gymz0UhYdQQCL2NjlQ3+kW9AqamMjLb6vrxiRAU3lVaJPGIoC9g7y6W9etjEngIj39bg6l+uBLKD6B6hCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:43:57.684530Z"},"content_sha256":"8b81c301651c558231e0edf7579deb09284b774a6d6f676622cabaadc8527fe7","schema_version":"1.0","event_id":"sha256:8b81c301651c558231e0edf7579deb09284b774a6d6f676622cabaadc8527fe7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LMQJO7MWKAGEIU3MLUTKJVXIET/bundle.json","state_url":"https://pith.science/pith/LMQJO7MWKAGEIU3MLUTKJVXIET/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LMQJO7MWKAGEIU3MLUTKJVXIET/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-04T17:43:57Z","links":{"resolver":"https://pith.science/pith/LMQJO7MWKAGEIU3MLUTKJVXIET","bundle":"https://pith.science/pith/LMQJO7MWKAGEIU3MLUTKJVXIET/bundle.json","state":"https://pith.science/pith/LMQJO7MWKAGEIU3MLUTKJVXIET/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LMQJO7MWKAGEIU3MLUTKJVXIET/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LMQJO7MWKAGEIU3MLUTKJVXIET","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":"ff31fae29498c016a4a4ebd1950f9de545875f25114864a47ea825f45766a605","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-07T04:58:48Z","title_canon_sha256":"3afbab802e2681fdac17eb1c44c7d252c1cd6086ed2b7af4b8fa2843fb6390ee"},"schema_version":"1.0","source":{"id":"1601.01401","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.01401","created_at":"2026-05-18T01:23:15Z"},{"alias_kind":"arxiv_version","alias_value":"1601.01401v1","created_at":"2026-05-18T01:23:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01401","created_at":"2026-05-18T01:23:15Z"},{"alias_kind":"pith_short_12","alias_value":"LMQJO7MWKAGE","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LMQJO7MWKAGEIU3M","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LMQJO7MW","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:8b81c301651c558231e0edf7579deb09284b774a6d6f676622cabaadc8527fe7","target":"graph","created_at":"2026-05-18T01:23:15Z","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$ 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","authors_text":"Bo Ning, Ruonan Li, Shenggui Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-07T04:58:48Z","title":"Cyclability of $id$-cycles in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01401","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:c3d68b3c8fd78dbc4d707f6db0b9edd484f47f6f633fff010e1477a0bd42ce2d","target":"record","created_at":"2026-05-18T01:23:15Z","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":"ff31fae29498c016a4a4ebd1950f9de545875f25114864a47ea825f45766a605","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-07T04:58:48Z","title_canon_sha256":"3afbab802e2681fdac17eb1c44c7d252c1cd6086ed2b7af4b8fa2843fb6390ee"},"schema_version":"1.0","source":{"id":"1601.01401","kind":"arxiv","version":1}},"canonical_sha256":"5b20977d96500c44536c5d26a4d6e824ca62e89827e2310d2d5495213e3a9f1d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b20977d96500c44536c5d26a4d6e824ca62e89827e2310d2d5495213e3a9f1d","first_computed_at":"2026-05-18T01:23:15.528857Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:15.528857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Tz4AzpSEdxt+lT8CVPoIY+ASS/qwYxt8bYq0X645pjx9PUpI//IMmftUoNhHpH+EBGrbfbrnr/Scj9o5s1vrCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:15.529498Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.01401","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c3d68b3c8fd78dbc4d707f6db0b9edd484f47f6f633fff010e1477a0bd42ce2d","sha256:8b81c301651c558231e0edf7579deb09284b774a6d6f676622cabaadc8527fe7"],"state_sha256":"aa884440757cb96864aaa728990d258078097c77ace0633b89e574e7470a5afe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MJELEeCUrY9aU+X6DhFoKIBztEifxlfFeg2yJEpJDV1gGJBzNEffZKZ3vFQ6mov5fPQqtnlVduMn7O7ff+EEAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T17:43:57.686887Z","bundle_sha256":"96003c023f79d9699dea8d55704d335b146e9023de0ed6eef9236f9fa3a0f0c2"}}