{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:V75EDFGHVFN342ZYM4XVXAXECH","short_pith_number":"pith:V75EDFGH","canonical_record":{"source":{"id":"2506.08692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-10T11:08:17Z","cross_cats_sorted":[],"title_canon_sha256":"c9833694bae2b91cf4f5101faee995930ce7a009a84430bcfe07401c3f6915b6","abstract_canon_sha256":"6443bda71f81fc8436872e2d126c7fe691dad185d1f75ae525afaa0fbbc84271"},"schema_version":"1.0"},"canonical_sha256":"affa4194c7a95bbe6b38672f5b82e411f4ed03778096c44b8560f1a504c139a4","source":{"kind":"arxiv","id":"2506.08692","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.08692","created_at":"2026-07-05T11:19:11Z"},{"alias_kind":"arxiv_version","alias_value":"2506.08692v1","created_at":"2026-07-05T11:19:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.08692","created_at":"2026-07-05T11:19:11Z"},{"alias_kind":"pith_short_12","alias_value":"V75EDFGHVFN3","created_at":"2026-07-05T11:19:11Z"},{"alias_kind":"pith_short_16","alias_value":"V75EDFGHVFN342ZY","created_at":"2026-07-05T11:19:11Z"},{"alias_kind":"pith_short_8","alias_value":"V75EDFGH","created_at":"2026-07-05T11:19:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:V75EDFGHVFN342ZYM4XVXAXECH","target":"record","payload":{"canonical_record":{"source":{"id":"2506.08692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-10T11:08:17Z","cross_cats_sorted":[],"title_canon_sha256":"c9833694bae2b91cf4f5101faee995930ce7a009a84430bcfe07401c3f6915b6","abstract_canon_sha256":"6443bda71f81fc8436872e2d126c7fe691dad185d1f75ae525afaa0fbbc84271"},"schema_version":"1.0"},"canonical_sha256":"affa4194c7a95bbe6b38672f5b82e411f4ed03778096c44b8560f1a504c139a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:19:11.968678Z","signature_b64":"H66C/3QGWuc+pfY0J+cg7opf2Rzehr4hmAAwjGj90Hg7dNnYkYD0alI7Nk+jZlFoq1tEzqTv9OwWS3pE6mioDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"affa4194c7a95bbe6b38672f5b82e411f4ed03778096c44b8560f1a504c139a4","last_reissued_at":"2026-07-05T11:19:11.968176Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:19:11.968176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.08692","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-05T11:19:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rn92YLqA6IBKONkKb1U4tiJ+klF3YEdoMNpGxXTm9SbltTbr/H25nl3rrzcsZpYDoHvXEcgq+GquajKf6lvxCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T00:16:34.590643Z"},"content_sha256":"8d95131275b2320ccdb116351ab4d5d7fb23347e605a442744646ce1932df88e","schema_version":"1.0","event_id":"sha256:8d95131275b2320ccdb116351ab4d5d7fb23347e605a442744646ce1932df88e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:V75EDFGHVFN342ZYM4XVXAXECH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on two cycles of consecutive even lengths in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Binlong Li, Lingjuan Shi, Yufeng Pan","submitted_at":"2025-06-10T11:08:17Z","abstract_excerpt":"Bondy and Vince proved that a graph of minimum degree at least three contains two cycles whose lengths differ by one or two, which was conjectured by Erd\\H{o}s. Gao, Li, Ma and Xie gave an average degree counterpart of Bondy-Vince's result, stating that every $n$-vertex graph with at least $\\frac{5}{2}(n-1)$ edges contains two cycles of consecutive even lengths, unless $4|(n-1)$ and every block of $G$ is a clique $K_5$. This confirms the case $k=2$ of Verstra\\\"ete's conjecture, which states that every $n$-vertex graph without $k$ cycles of consecutive even lengths has edge number $e(G)\\leq\\fra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.08692","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/2506.08692/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-05T11:19:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kXPbHuJ9GTRrzKGE5EXl7vKopX33UpqGIZpw2yxzqBkkM3o9E6Ac3Tq47X4b43TWMDq2fzGG+m1qfIk7dIZtCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T00:16:34.591147Z"},"content_sha256":"71ebecc7078b5ebdc3e2448a4ecf22e8bc3f46fbd55a53ecd0b36661ff9eb8a8","schema_version":"1.0","event_id":"sha256:71ebecc7078b5ebdc3e2448a4ecf22e8bc3f46fbd55a53ecd0b36661ff9eb8a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V75EDFGHVFN342ZYM4XVXAXECH/bundle.json","state_url":"https://pith.science/pith/V75EDFGHVFN342ZYM4XVXAXECH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V75EDFGHVFN342ZYM4XVXAXECH/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-08T00:16:34Z","links":{"resolver":"https://pith.science/pith/V75EDFGHVFN342ZYM4XVXAXECH","bundle":"https://pith.science/pith/V75EDFGHVFN342ZYM4XVXAXECH/bundle.json","state":"https://pith.science/pith/V75EDFGHVFN342ZYM4XVXAXECH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V75EDFGHVFN342ZYM4XVXAXECH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:V75EDFGHVFN342ZYM4XVXAXECH","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":"6443bda71f81fc8436872e2d126c7fe691dad185d1f75ae525afaa0fbbc84271","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-10T11:08:17Z","title_canon_sha256":"c9833694bae2b91cf4f5101faee995930ce7a009a84430bcfe07401c3f6915b6"},"schema_version":"1.0","source":{"id":"2506.08692","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.08692","created_at":"2026-07-05T11:19:11Z"},{"alias_kind":"arxiv_version","alias_value":"2506.08692v1","created_at":"2026-07-05T11:19:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.08692","created_at":"2026-07-05T11:19:11Z"},{"alias_kind":"pith_short_12","alias_value":"V75EDFGHVFN3","created_at":"2026-07-05T11:19:11Z"},{"alias_kind":"pith_short_16","alias_value":"V75EDFGHVFN342ZY","created_at":"2026-07-05T11:19:11Z"},{"alias_kind":"pith_short_8","alias_value":"V75EDFGH","created_at":"2026-07-05T11:19:11Z"}],"graph_snapshots":[{"event_id":"sha256:71ebecc7078b5ebdc3e2448a4ecf22e8bc3f46fbd55a53ecd0b36661ff9eb8a8","target":"graph","created_at":"2026-07-05T11:19:11Z","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/2506.08692/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Bondy and Vince proved that a graph of minimum degree at least three contains two cycles whose lengths differ by one or two, which was conjectured by Erd\\H{o}s. Gao, Li, Ma and Xie gave an average degree counterpart of Bondy-Vince's result, stating that every $n$-vertex graph with at least $\\frac{5}{2}(n-1)$ edges contains two cycles of consecutive even lengths, unless $4|(n-1)$ and every block of $G$ is a clique $K_5$. This confirms the case $k=2$ of Verstra\\\"ete's conjecture, which states that every $n$-vertex graph without $k$ cycles of consecutive even lengths has edge number $e(G)\\leq\\fra","authors_text":"Binlong Li, Lingjuan Shi, Yufeng Pan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-10T11:08:17Z","title":"A note on two cycles of consecutive even lengths in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.08692","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:8d95131275b2320ccdb116351ab4d5d7fb23347e605a442744646ce1932df88e","target":"record","created_at":"2026-07-05T11:19:11Z","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":"6443bda71f81fc8436872e2d126c7fe691dad185d1f75ae525afaa0fbbc84271","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-10T11:08:17Z","title_canon_sha256":"c9833694bae2b91cf4f5101faee995930ce7a009a84430bcfe07401c3f6915b6"},"schema_version":"1.0","source":{"id":"2506.08692","kind":"arxiv","version":1}},"canonical_sha256":"affa4194c7a95bbe6b38672f5b82e411f4ed03778096c44b8560f1a504c139a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"affa4194c7a95bbe6b38672f5b82e411f4ed03778096c44b8560f1a504c139a4","first_computed_at":"2026-07-05T11:19:11.968176Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:19:11.968176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H66C/3QGWuc+pfY0J+cg7opf2Rzehr4hmAAwjGj90Hg7dNnYkYD0alI7Nk+jZlFoq1tEzqTv9OwWS3pE6mioDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:19:11.968678Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.08692","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d95131275b2320ccdb116351ab4d5d7fb23347e605a442744646ce1932df88e","sha256:71ebecc7078b5ebdc3e2448a4ecf22e8bc3f46fbd55a53ecd0b36661ff9eb8a8"],"state_sha256":"ca6678c7f7f2700e4564e43a74d024cd6fcfe5a3f79c9ecdb52f8130055ecdc1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EGRmxJgZ/+Q6kQNNROpv5ZDznFXSo0LcpJV85t+t0zp4BM2jtBpSUV/pjctWNOd6MCv4JdPuwXLc/dMJ5TJKAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T00:16:34.595625Z","bundle_sha256":"9e6f319194afc4dcdd606845203b7f269e4f576eff4fd280bdf401d788bf943f"}}