{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QB6D3IEMRUDAXVTXADF6Z5PEE5","short_pith_number":"pith:QB6D3IEM","schema_version":"1.0","canonical_sha256":"807c3da08c8d060bd67700cbecf5e427417164be076d89d4822bb15b4f8f5635","source":{"kind":"arxiv","id":"1902.05701","version":2},"attestation_state":"computed","paper":{"title":"On a conjecture of Bondy and Vince","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Jun Gao","submitted_at":"2019-02-15T06:17:33Z","abstract_excerpt":"Twenty years ago Bondy and Vince conjectured that for any nonnegative integer $k$, except finitely many counterexamples, every graph with $k$ vertices of degree less than three contains two cycles whose lengths differ by one or two. The case $k\\leq 2$ was proved by Bondy and Vince, which resolved an earlier conjecture of Erd\\H{o}s et. al.. In this paper we confirm this conjecture for all $k$."},"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":"1902.05701","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-15T06:17:33Z","cross_cats_sorted":[],"title_canon_sha256":"1971cace1c39706a20358873db10bf5ee8673fc986bbda41c43ea7839634bb44","abstract_canon_sha256":"df02ece6a6a0ccfb52663bda114e34e18175860d598a018a745df3e709e95e6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:39.818265Z","signature_b64":"so7Jds/YHsgNImoaRKa45eBK0h6eq+TyDU5dqhLvHvVM5O0j9yL1pu8NhBxHIil9xwLS2AorqFjSNfkW950PCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"807c3da08c8d060bd67700cbecf5e427417164be076d89d4822bb15b4f8f5635","last_reissued_at":"2026-05-17T23:39:39.817793Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:39.817793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a conjecture of Bondy and Vince","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Jun Gao","submitted_at":"2019-02-15T06:17:33Z","abstract_excerpt":"Twenty years ago Bondy and Vince conjectured that for any nonnegative integer $k$, except finitely many counterexamples, every graph with $k$ vertices of degree less than three contains two cycles whose lengths differ by one or two. The case $k\\leq 2$ was proved by Bondy and Vince, which resolved an earlier conjecture of Erd\\H{o}s et. al.. In this paper we confirm this conjecture for all $k$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05701","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":"1902.05701","created_at":"2026-05-17T23:39:39.817865+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.05701v2","created_at":"2026-05-17T23:39:39.817865+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05701","created_at":"2026-05-17T23:39:39.817865+00:00"},{"alias_kind":"pith_short_12","alias_value":"QB6D3IEMRUDA","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QB6D3IEMRUDAXVTX","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QB6D3IEM","created_at":"2026-05-18T12:33:27.125529+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/QB6D3IEMRUDAXVTXADF6Z5PEE5","json":"https://pith.science/pith/QB6D3IEMRUDAXVTXADF6Z5PEE5.json","graph_json":"https://pith.science/api/pith-number/QB6D3IEMRUDAXVTXADF6Z5PEE5/graph.json","events_json":"https://pith.science/api/pith-number/QB6D3IEMRUDAXVTXADF6Z5PEE5/events.json","paper":"https://pith.science/paper/QB6D3IEM"},"agent_actions":{"view_html":"https://pith.science/pith/QB6D3IEMRUDAXVTXADF6Z5PEE5","download_json":"https://pith.science/pith/QB6D3IEMRUDAXVTXADF6Z5PEE5.json","view_paper":"https://pith.science/paper/QB6D3IEM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.05701&json=true","fetch_graph":"https://pith.science/api/pith-number/QB6D3IEMRUDAXVTXADF6Z5PEE5/graph.json","fetch_events":"https://pith.science/api/pith-number/QB6D3IEMRUDAXVTXADF6Z5PEE5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QB6D3IEMRUDAXVTXADF6Z5PEE5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QB6D3IEMRUDAXVTXADF6Z5PEE5/action/storage_attestation","attest_author":"https://pith.science/pith/QB6D3IEMRUDAXVTXADF6Z5PEE5/action/author_attestation","sign_citation":"https://pith.science/pith/QB6D3IEMRUDAXVTXADF6Z5PEE5/action/citation_signature","submit_replication":"https://pith.science/pith/QB6D3IEMRUDAXVTXADF6Z5PEE5/action/replication_record"}},"created_at":"2026-05-17T23:39:39.817865+00:00","updated_at":"2026-05-17T23:39:39.817865+00:00"}