{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:OXZVLH7BXN43BAZDHUNVO5VZX5","short_pith_number":"pith:OXZVLH7B","schema_version":"1.0","canonical_sha256":"75f3559fe1bb79b083233d1b5776b9bf498650e7f4eaa0f2d39861b81f63a602","source":{"kind":"arxiv","id":"1109.4344","version":2},"attestation_state":"computed","paper":{"title":"Long paths and cycles passing through specified vertices under the average degree condition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Binlong Li, Bo Ning, Shenggui Zhang","submitted_at":"2011-09-20T16:45:58Z","abstract_excerpt":"Let $G$ be a $k$-connected graph with $k\\geq 2$. In this paper we first prove that: For two distinct vertices $x$ and $z$ in $G$, it contains a path passing through its any $k-2$ {specified} vertices with length at least the average degree of the vertices other than $x$ and $z$. Further, with this result, we prove that: If $G$ has $n$ vertices and $m$ edges, then it contains a cycle of length at least $2m/(n-1)$ passing through its any $k-1$ specified vertices. Our results generalize a theorem of Fan on the existence of long paths and a classical theorem of Erd\\\"os and Gallai on the existence "},"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":"1109.4344","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-20T16:45:58Z","cross_cats_sorted":[],"title_canon_sha256":"8e9c841e27bae354644b3358642ae0b2a9d179784eee7943d088ae13334d9c67","abstract_canon_sha256":"3a2a9e541ac4dd5ea59bf952a948796220798c087c1e5302f3d82a9c8d7fc213"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:13.860979Z","signature_b64":"gBaRYCSof5ZbPs9mbMhAb3LLjQs+XN26zAAN6LkPcfFo8QGQ+NvRywt4r79IgCk7U70LvZQpKPl0vcDSC2aLDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75f3559fe1bb79b083233d1b5776b9bf498650e7f4eaa0f2d39861b81f63a602","last_reissued_at":"2026-05-18T00:17:13.860372Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:13.860372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Long paths and cycles passing through specified vertices under the average degree condition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Binlong Li, Bo Ning, Shenggui Zhang","submitted_at":"2011-09-20T16:45:58Z","abstract_excerpt":"Let $G$ be a $k$-connected graph with $k\\geq 2$. In this paper we first prove that: For two distinct vertices $x$ and $z$ in $G$, it contains a path passing through its any $k-2$ {specified} vertices with length at least the average degree of the vertices other than $x$ and $z$. Further, with this result, we prove that: If $G$ has $n$ vertices and $m$ edges, then it contains a cycle of length at least $2m/(n-1)$ passing through its any $k-1$ specified vertices. Our results generalize a theorem of Fan on the existence of long paths and a classical theorem of Erd\\\"os and Gallai on the existence "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.4344","kind":"arxiv","version":2},"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":"1109.4344","created_at":"2026-05-18T00:17:13.860449+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.4344v2","created_at":"2026-05-18T00:17:13.860449+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.4344","created_at":"2026-05-18T00:17:13.860449+00:00"},{"alias_kind":"pith_short_12","alias_value":"OXZVLH7BXN43","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"OXZVLH7BXN43BAZD","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"OXZVLH7B","created_at":"2026-05-18T12:26:37.096874+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/OXZVLH7BXN43BAZDHUNVO5VZX5","json":"https://pith.science/pith/OXZVLH7BXN43BAZDHUNVO5VZX5.json","graph_json":"https://pith.science/api/pith-number/OXZVLH7BXN43BAZDHUNVO5VZX5/graph.json","events_json":"https://pith.science/api/pith-number/OXZVLH7BXN43BAZDHUNVO5VZX5/events.json","paper":"https://pith.science/paper/OXZVLH7B"},"agent_actions":{"view_html":"https://pith.science/pith/OXZVLH7BXN43BAZDHUNVO5VZX5","download_json":"https://pith.science/pith/OXZVLH7BXN43BAZDHUNVO5VZX5.json","view_paper":"https://pith.science/paper/OXZVLH7B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.4344&json=true","fetch_graph":"https://pith.science/api/pith-number/OXZVLH7BXN43BAZDHUNVO5VZX5/graph.json","fetch_events":"https://pith.science/api/pith-number/OXZVLH7BXN43BAZDHUNVO5VZX5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OXZVLH7BXN43BAZDHUNVO5VZX5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OXZVLH7BXN43BAZDHUNVO5VZX5/action/storage_attestation","attest_author":"https://pith.science/pith/OXZVLH7BXN43BAZDHUNVO5VZX5/action/author_attestation","sign_citation":"https://pith.science/pith/OXZVLH7BXN43BAZDHUNVO5VZX5/action/citation_signature","submit_replication":"https://pith.science/pith/OXZVLH7BXN43BAZDHUNVO5VZX5/action/replication_record"}},"created_at":"2026-05-18T00:17:13.860449+00:00","updated_at":"2026-05-18T00:17:13.860449+00:00"}