{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:NSJ7SUICX26TSXSBIE27XVVA4A","short_pith_number":"pith:NSJ7SUIC","canonical_record":{"source":{"id":"2210.03959","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-10-08T08:05:29Z","cross_cats_sorted":[],"title_canon_sha256":"6c14c2cd6ba47eca048ca1360fb26a204bce5fb17dc1cb2007bbc8f2459aca5c","abstract_canon_sha256":"826dadfad64f35a21e0322796ab97e2ff7e2ae02a244457afb1c6b514d9c7c7c"},"schema_version":"1.0"},"canonical_sha256":"6c93f95102bebd395e414135fbd6a0e0273cc5b4005308e7565a56954c60f177","source":{"kind":"arxiv","id":"2210.03959","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.03959","created_at":"2026-07-05T05:04:34Z"},{"alias_kind":"arxiv_version","alias_value":"2210.03959v1","created_at":"2026-07-05T05:04:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.03959","created_at":"2026-07-05T05:04:34Z"},{"alias_kind":"pith_short_12","alias_value":"NSJ7SUICX26T","created_at":"2026-07-05T05:04:34Z"},{"alias_kind":"pith_short_16","alias_value":"NSJ7SUICX26TSXSB","created_at":"2026-07-05T05:04:34Z"},{"alias_kind":"pith_short_8","alias_value":"NSJ7SUIC","created_at":"2026-07-05T05:04:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:NSJ7SUICX26TSXSBIE27XVVA4A","target":"record","payload":{"canonical_record":{"source":{"id":"2210.03959","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-10-08T08:05:29Z","cross_cats_sorted":[],"title_canon_sha256":"6c14c2cd6ba47eca048ca1360fb26a204bce5fb17dc1cb2007bbc8f2459aca5c","abstract_canon_sha256":"826dadfad64f35a21e0322796ab97e2ff7e2ae02a244457afb1c6b514d9c7c7c"},"schema_version":"1.0"},"canonical_sha256":"6c93f95102bebd395e414135fbd6a0e0273cc5b4005308e7565a56954c60f177","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:04:34.448101Z","signature_b64":"ow248oHUkvzDRtQq/4OFYp93mKD9ScWXIda/GmLWOQBjQOIDSVWfjmGfAOulT4cs0wsEqcV22Cbbx27BGAa3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c93f95102bebd395e414135fbd6a0e0273cc5b4005308e7565a56954c60f177","last_reissued_at":"2026-07-05T05:04:34.447659Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:04:34.447659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2210.03959","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-07-05T05:04:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RDK6cOrZe4/hF0s5FCU0C5iAd/ZPmakC6l/oPKnBJMLWEYqov9nvAMDjgIWBdlF0m6oNmbJN/S0+pBiPnUDjCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T11:49:20.189871Z"},"content_sha256":"0793f8d3f54af8ec5c5f9882f79b75664cb8801bc6048199009a69b6ec484619","schema_version":"1.0","event_id":"sha256:0793f8d3f54af8ec5c5f9882f79b75664cb8801bc6048199009a69b6ec484619"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:NSJ7SUICX26TSXSBIE27XVVA4A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On two cycles of consecutive even lengths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Binlong Li, Jie Ma, Jun Gao, Tianying Xie","submitted_at":"2022-10-08T08:05:29Z","abstract_excerpt":"Bondy and Vince showed that every graph with minimum degree at least three contains two cycles of lengths differing by one or two.We prove the following average degree counterpart that every $n$-vertex graph $G$ with at least $\\frac52(n-1)$ edges, unless $4|(n-1)$ and every block of $G$ is a clique $K_5$, contains two cycles of consecutive even lengths. Our proof is mainly based on structural analysis, and a crucial step which may be of independent interest shows that the same conclusion holds for every 3-connected graph with at least 6 vertices. This solves a special case of a conjecture of V"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.03959","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/2210.03959/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"},"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-07-05T05:04:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XQoIrWl4r1BD/Ak7hVu5wDBcrIxzl186SE5/O1zypGolD9of+Jzp7ch6sD48cTnY/d+Dzm54wC05cOPEzcjqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T11:49:20.190380Z"},"content_sha256":"9e0f177ea150b436727a62447567a62f782c3c330e5c6321a12d234f083ce2e2","schema_version":"1.0","event_id":"sha256:9e0f177ea150b436727a62447567a62f782c3c330e5c6321a12d234f083ce2e2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NSJ7SUICX26TSXSBIE27XVVA4A/bundle.json","state_url":"https://pith.science/pith/NSJ7SUICX26TSXSBIE27XVVA4A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NSJ7SUICX26TSXSBIE27XVVA4A/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-08-22T11:49:20Z","links":{"resolver":"https://pith.science/pith/NSJ7SUICX26TSXSBIE27XVVA4A","bundle":"https://pith.science/pith/NSJ7SUICX26TSXSBIE27XVVA4A/bundle.json","state":"https://pith.science/pith/NSJ7SUICX26TSXSBIE27XVVA4A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NSJ7SUICX26TSXSBIE27XVVA4A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:NSJ7SUICX26TSXSBIE27XVVA4A","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":"826dadfad64f35a21e0322796ab97e2ff7e2ae02a244457afb1c6b514d9c7c7c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-10-08T08:05:29Z","title_canon_sha256":"6c14c2cd6ba47eca048ca1360fb26a204bce5fb17dc1cb2007bbc8f2459aca5c"},"schema_version":"1.0","source":{"id":"2210.03959","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.03959","created_at":"2026-07-05T05:04:34Z"},{"alias_kind":"arxiv_version","alias_value":"2210.03959v1","created_at":"2026-07-05T05:04:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.03959","created_at":"2026-07-05T05:04:34Z"},{"alias_kind":"pith_short_12","alias_value":"NSJ7SUICX26T","created_at":"2026-07-05T05:04:34Z"},{"alias_kind":"pith_short_16","alias_value":"NSJ7SUICX26TSXSB","created_at":"2026-07-05T05:04:34Z"},{"alias_kind":"pith_short_8","alias_value":"NSJ7SUIC","created_at":"2026-07-05T05:04:34Z"}],"graph_snapshots":[{"event_id":"sha256:9e0f177ea150b436727a62447567a62f782c3c330e5c6321a12d234f083ce2e2","target":"graph","created_at":"2026-07-05T05:04:34Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2210.03959/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Bondy and Vince showed that every graph with minimum degree at least three contains two cycles of lengths differing by one or two.We prove the following average degree counterpart that every $n$-vertex graph $G$ with at least $\\frac52(n-1)$ edges, unless $4|(n-1)$ and every block of $G$ is a clique $K_5$, contains two cycles of consecutive even lengths. Our proof is mainly based on structural analysis, and a crucial step which may be of independent interest shows that the same conclusion holds for every 3-connected graph with at least 6 vertices. This solves a special case of a conjecture of V","authors_text":"Binlong Li, Jie Ma, Jun Gao, Tianying Xie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-10-08T08:05:29Z","title":"On two cycles of consecutive even lengths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.03959","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:0793f8d3f54af8ec5c5f9882f79b75664cb8801bc6048199009a69b6ec484619","target":"record","created_at":"2026-07-05T05:04:34Z","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":"826dadfad64f35a21e0322796ab97e2ff7e2ae02a244457afb1c6b514d9c7c7c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-10-08T08:05:29Z","title_canon_sha256":"6c14c2cd6ba47eca048ca1360fb26a204bce5fb17dc1cb2007bbc8f2459aca5c"},"schema_version":"1.0","source":{"id":"2210.03959","kind":"arxiv","version":1}},"canonical_sha256":"6c93f95102bebd395e414135fbd6a0e0273cc5b4005308e7565a56954c60f177","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c93f95102bebd395e414135fbd6a0e0273cc5b4005308e7565a56954c60f177","first_computed_at":"2026-07-05T05:04:34.447659Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:04:34.447659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ow248oHUkvzDRtQq/4OFYp93mKD9ScWXIda/GmLWOQBjQOIDSVWfjmGfAOulT4cs0wsEqcV22Cbbx27BGAa3BA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:04:34.448101Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.03959","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0793f8d3f54af8ec5c5f9882f79b75664cb8801bc6048199009a69b6ec484619","sha256:9e0f177ea150b436727a62447567a62f782c3c330e5c6321a12d234f083ce2e2"],"state_sha256":"74a5ae27bd372c9c8d06572d2487ac91616122995281e1626fec5b070537d489"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RPNKmMNoM4jQoHLJPJz939WDfvlWN/mre1thvu9J8tJE39Iihm1huGlpSO34rKJolfHwgaTbpvktoRfseH6UCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T11:49:20.194842Z","bundle_sha256":"7cc6ee0f5f9c4b338ab40e3087eba30de93017819aa529931024f8e90eb1e632"}}