{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JKYUUMQQAOBAIFBAW6TEZ5N2FI","short_pith_number":"pith:JKYUUMQQ","canonical_record":{"source":{"id":"1704.02866","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-10T14:16:18Z","cross_cats_sorted":[],"title_canon_sha256":"b8e9196aae15425bb4aecbd25e9afcc57160d54e72e24221ddbd1c78d2c5c644","abstract_canon_sha256":"45c597c4f129ebf692e4f47f92a6234dc738599b25818a35d122bb17686db794"},"schema_version":"1.0"},"canonical_sha256":"4ab14a32100382041420b7a64cf5ba2a019f603158b85b6ea8e562cbb53c7686","source":{"kind":"arxiv","id":"1704.02866","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02866","created_at":"2026-05-18T00:46:44Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02866v1","created_at":"2026-05-18T00:46:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02866","created_at":"2026-05-18T00:46:44Z"},{"alias_kind":"pith_short_12","alias_value":"JKYUUMQQAOBA","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JKYUUMQQAOBAIFBA","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JKYUUMQQ","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JKYUUMQQAOBAIFBAW6TEZ5N2FI","target":"record","payload":{"canonical_record":{"source":{"id":"1704.02866","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-10T14:16:18Z","cross_cats_sorted":[],"title_canon_sha256":"b8e9196aae15425bb4aecbd25e9afcc57160d54e72e24221ddbd1c78d2c5c644","abstract_canon_sha256":"45c597c4f129ebf692e4f47f92a6234dc738599b25818a35d122bb17686db794"},"schema_version":"1.0"},"canonical_sha256":"4ab14a32100382041420b7a64cf5ba2a019f603158b85b6ea8e562cbb53c7686","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:44.175626Z","signature_b64":"gUbemugQG94Pr9F86Ccp/Id1rzhdYlC78m8/72rtzjz511lN3b41rfz83B3uf8RIxuyvhCT6aU/JwwSIbXh+CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ab14a32100382041420b7a64cf5ba2a019f603158b85b6ea8e562cbb53c7686","last_reissued_at":"2026-05-18T00:46:44.174657Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:44.174657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.02866","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-18T00:46:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jTv0JBIc8AjGgF0Zs4cLHlMMSV0H90m0+EGbl83TPn+jEJ5/qz3GQNNEwqbHcc7smfxxWeKVAa5Hbnli5CFBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:55:03.744161Z"},"content_sha256":"348dc59fe47626fa78bd792d8fe2a86cb4fe35f61d031ffaa2b206891d75566d","schema_version":"1.0","event_id":"sha256:348dc59fe47626fa78bd792d8fe2a86cb4fe35f61d031ffaa2b206891d75566d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JKYUUMQQAOBAIFBAW6TEZ5N2FI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stability in the Erd\\H{o}s--Gallai Theorem on cycles and paths, II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alexandr Kostochka, Jacques Verstra\\\"ete, Ruth Luo, Zolt\\'an F\\\"uredi","submitted_at":"2017-04-10T14:16:18Z","abstract_excerpt":"The Erd\\H{o}s--Gallai Theorem states that for $k \\geq 3$, any $n$-vertex graph with no cycle of length at least $k$ has at most $\\frac{1}{2}(k-1)(n-1)$ edges. A stronger version of the Erd\\H{o}s--Gallai Theorem was given by Kopylov: If $G$ is a 2-connected $n$-vertex graph with no cycle of length at least $k$, then $e(G) \\leq \\max\\{h(n,k,2),h(n,k,\\lfloor \\frac{k-1}{2}\\rfloor)\\}$, where $h(n,k,a) := {k - a \\choose 2} + a(n - k + a)$. Furthermore, Kopylov presented the two possible extremal graphs, one with $h(n,k,2)$ edges and one with $h(n,k,\\lfloor \\frac{k-1}{2}\\rfloor)$ edges.\n  In this pape"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02866","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-18T00:46:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V84cGl6yCh3x+KMblj7MabrauEF4IOAHrWNelI4UfwCR0BFrJRLEVDlhJ9GIIoyDMfwbZgIhsXUZHZE87KEHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:55:03.744546Z"},"content_sha256":"959470197813f96576b7c736879060fe78f38c5ce5ae967a2825f6e452a1a96a","schema_version":"1.0","event_id":"sha256:959470197813f96576b7c736879060fe78f38c5ce5ae967a2825f6e452a1a96a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JKYUUMQQAOBAIFBAW6TEZ5N2FI/bundle.json","state_url":"https://pith.science/pith/JKYUUMQQAOBAIFBAW6TEZ5N2FI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JKYUUMQQAOBAIFBAW6TEZ5N2FI/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-04T06:55:03Z","links":{"resolver":"https://pith.science/pith/JKYUUMQQAOBAIFBAW6TEZ5N2FI","bundle":"https://pith.science/pith/JKYUUMQQAOBAIFBAW6TEZ5N2FI/bundle.json","state":"https://pith.science/pith/JKYUUMQQAOBAIFBAW6TEZ5N2FI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JKYUUMQQAOBAIFBAW6TEZ5N2FI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JKYUUMQQAOBAIFBAW6TEZ5N2FI","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":"45c597c4f129ebf692e4f47f92a6234dc738599b25818a35d122bb17686db794","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-10T14:16:18Z","title_canon_sha256":"b8e9196aae15425bb4aecbd25e9afcc57160d54e72e24221ddbd1c78d2c5c644"},"schema_version":"1.0","source":{"id":"1704.02866","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02866","created_at":"2026-05-18T00:46:44Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02866v1","created_at":"2026-05-18T00:46:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02866","created_at":"2026-05-18T00:46:44Z"},{"alias_kind":"pith_short_12","alias_value":"JKYUUMQQAOBA","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JKYUUMQQAOBAIFBA","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JKYUUMQQ","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:959470197813f96576b7c736879060fe78f38c5ce5ae967a2825f6e452a1a96a","target":"graph","created_at":"2026-05-18T00:46:44Z","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":"The Erd\\H{o}s--Gallai Theorem states that for $k \\geq 3$, any $n$-vertex graph with no cycle of length at least $k$ has at most $\\frac{1}{2}(k-1)(n-1)$ edges. A stronger version of the Erd\\H{o}s--Gallai Theorem was given by Kopylov: If $G$ is a 2-connected $n$-vertex graph with no cycle of length at least $k$, then $e(G) \\leq \\max\\{h(n,k,2),h(n,k,\\lfloor \\frac{k-1}{2}\\rfloor)\\}$, where $h(n,k,a) := {k - a \\choose 2} + a(n - k + a)$. Furthermore, Kopylov presented the two possible extremal graphs, one with $h(n,k,2)$ edges and one with $h(n,k,\\lfloor \\frac{k-1}{2}\\rfloor)$ edges.\n  In this pape","authors_text":"Alexandr Kostochka, Jacques Verstra\\\"ete, Ruth Luo, Zolt\\'an F\\\"uredi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-10T14:16:18Z","title":"Stability in the Erd\\H{o}s--Gallai Theorem on cycles and paths, II"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02866","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:348dc59fe47626fa78bd792d8fe2a86cb4fe35f61d031ffaa2b206891d75566d","target":"record","created_at":"2026-05-18T00:46:44Z","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":"45c597c4f129ebf692e4f47f92a6234dc738599b25818a35d122bb17686db794","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-10T14:16:18Z","title_canon_sha256":"b8e9196aae15425bb4aecbd25e9afcc57160d54e72e24221ddbd1c78d2c5c644"},"schema_version":"1.0","source":{"id":"1704.02866","kind":"arxiv","version":1}},"canonical_sha256":"4ab14a32100382041420b7a64cf5ba2a019f603158b85b6ea8e562cbb53c7686","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ab14a32100382041420b7a64cf5ba2a019f603158b85b6ea8e562cbb53c7686","first_computed_at":"2026-05-18T00:46:44.174657Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:44.174657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gUbemugQG94Pr9F86Ccp/Id1rzhdYlC78m8/72rtzjz511lN3b41rfz83B3uf8RIxuyvhCT6aU/JwwSIbXh+CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:44.175626Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.02866","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:348dc59fe47626fa78bd792d8fe2a86cb4fe35f61d031ffaa2b206891d75566d","sha256:959470197813f96576b7c736879060fe78f38c5ce5ae967a2825f6e452a1a96a"],"state_sha256":"b4700fe6564db0fafda7d861cd9f34898ff52e3cc9a0d768ad688e8c98d7cf56"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zdOS4+an2s6CamKqQhYCywlNLQJBjlAms06LHtzzAEYQDWQZL7NVVRW+qT1zP+XY/OMsTZ4Yt1ZRYeo9D2n2Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:55:03.754502Z","bundle_sha256":"f4111519895e33f6379f7a1f7255f457d32b66740a08b2aa555586789f1fe1e0"}}