{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:C7ZBXPSR7BGZQ6D4RB6T2PEQ3E","short_pith_number":"pith:C7ZBXPSR","canonical_record":{"source":{"id":"1310.6766","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-24T20:28:25Z","cross_cats_sorted":[],"title_canon_sha256":"6e924f05f6de026640cec3acf007812aa70a4304fb74a17b3c152da3d6eda614","abstract_canon_sha256":"3bf6cca7192c1d204299e20178bee67e86808efdbbfc5e4fb011d003795ff49a"},"schema_version":"1.0"},"canonical_sha256":"17f21bbe51f84d98787c887d3d3c90d92de1013b0ef77cd0dfe451c1f516a160","source":{"kind":"arxiv","id":"1310.6766","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.6766","created_at":"2026-05-18T01:59:38Z"},{"alias_kind":"arxiv_version","alias_value":"1310.6766v1","created_at":"2026-05-18T01:59:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6766","created_at":"2026-05-18T01:59:38Z"},{"alias_kind":"pith_short_12","alias_value":"C7ZBXPSR7BGZ","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"C7ZBXPSR7BGZQ6D4","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"C7ZBXPSR","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:C7ZBXPSR7BGZQ6D4RB6T2PEQ3E","target":"record","payload":{"canonical_record":{"source":{"id":"1310.6766","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-24T20:28:25Z","cross_cats_sorted":[],"title_canon_sha256":"6e924f05f6de026640cec3acf007812aa70a4304fb74a17b3c152da3d6eda614","abstract_canon_sha256":"3bf6cca7192c1d204299e20178bee67e86808efdbbfc5e4fb011d003795ff49a"},"schema_version":"1.0"},"canonical_sha256":"17f21bbe51f84d98787c887d3d3c90d92de1013b0ef77cd0dfe451c1f516a160","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:38.958018Z","signature_b64":"T8tET4rPHUUC+vfUj0PQCJY96U7CfOaKNFb5gJhxvU3tLoqDv5HOU3JnGPVWa0RmLpvO1helB32siMWCxDTPDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17f21bbe51f84d98787c887d3d3c90d92de1013b0ef77cd0dfe451c1f516a160","last_reissued_at":"2026-05-18T01:59:38.957145Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:38.957145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.6766","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-18T01:59:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"93itBERM1OlUy26q1deuU3lSfZtsZ/csm0hwlqgaZuzJoesSjSrJ6xuus6OOsvx6f6r07fIIPl34nETGrUiLDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:36:49.417682Z"},"content_sha256":"46edcf60b39d93ce73206b38018cbfdd1b6c9dc42ac2daeb1b2733109ebc262a","schema_version":"1.0","event_id":"sha256:46edcf60b39d93ce73206b38018cbfdd1b6c9dc42ac2daeb1b2733109ebc262a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:C7ZBXPSR7BGZQ6D4RB6T2PEQ3E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extremal numbers for odd cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David S. Gunderson, Zoltan F\\\"uredi","submitted_at":"2013-10-24T20:28:25Z","abstract_excerpt":"We describe the C_{2k+1}-free graphs on n vertices with maximum number of edges. The extremal graphs are unique except for n = 3k-1, 3k, 4k-2, or 4k-1. The value of ex(n,C_{2k+1}) can be read out from the works of Bondy, Woodall, and Bollobas, but here we give a new streamlined proof. The complete determination of the extremal graphs is also new.\n  We obtain that the bound for n_0(C_{2k+1}) is 4k in the classical theorem of Simonovits, from which the unique extremal graph is the bipartite Turan graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6766","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-18T01:59:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zgQa1a8O1Auffv8rEWGfEXsRDgfWhEgedI2BhhW7+BDGK+TtkWfSw4F7alV3AzC1HRxI74/t8MaAG6rmtBdsAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:36:49.418017Z"},"content_sha256":"e9f30324672f34d08c74739c640982e43bfa586bce6ac8866def0a01fb2baa2b","schema_version":"1.0","event_id":"sha256:e9f30324672f34d08c74739c640982e43bfa586bce6ac8866def0a01fb2baa2b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C7ZBXPSR7BGZQ6D4RB6T2PEQ3E/bundle.json","state_url":"https://pith.science/pith/C7ZBXPSR7BGZQ6D4RB6T2PEQ3E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C7ZBXPSR7BGZQ6D4RB6T2PEQ3E/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-02T10:36:49Z","links":{"resolver":"https://pith.science/pith/C7ZBXPSR7BGZQ6D4RB6T2PEQ3E","bundle":"https://pith.science/pith/C7ZBXPSR7BGZQ6D4RB6T2PEQ3E/bundle.json","state":"https://pith.science/pith/C7ZBXPSR7BGZQ6D4RB6T2PEQ3E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C7ZBXPSR7BGZQ6D4RB6T2PEQ3E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:C7ZBXPSR7BGZQ6D4RB6T2PEQ3E","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":"3bf6cca7192c1d204299e20178bee67e86808efdbbfc5e4fb011d003795ff49a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-24T20:28:25Z","title_canon_sha256":"6e924f05f6de026640cec3acf007812aa70a4304fb74a17b3c152da3d6eda614"},"schema_version":"1.0","source":{"id":"1310.6766","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.6766","created_at":"2026-05-18T01:59:38Z"},{"alias_kind":"arxiv_version","alias_value":"1310.6766v1","created_at":"2026-05-18T01:59:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6766","created_at":"2026-05-18T01:59:38Z"},{"alias_kind":"pith_short_12","alias_value":"C7ZBXPSR7BGZ","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"C7ZBXPSR7BGZQ6D4","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"C7ZBXPSR","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:e9f30324672f34d08c74739c640982e43bfa586bce6ac8866def0a01fb2baa2b","target":"graph","created_at":"2026-05-18T01:59:38Z","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":"We describe the C_{2k+1}-free graphs on n vertices with maximum number of edges. The extremal graphs are unique except for n = 3k-1, 3k, 4k-2, or 4k-1. The value of ex(n,C_{2k+1}) can be read out from the works of Bondy, Woodall, and Bollobas, but here we give a new streamlined proof. The complete determination of the extremal graphs is also new.\n  We obtain that the bound for n_0(C_{2k+1}) is 4k in the classical theorem of Simonovits, from which the unique extremal graph is the bipartite Turan graph.","authors_text":"David S. Gunderson, Zoltan F\\\"uredi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-24T20:28:25Z","title":"Extremal numbers for odd cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6766","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:46edcf60b39d93ce73206b38018cbfdd1b6c9dc42ac2daeb1b2733109ebc262a","target":"record","created_at":"2026-05-18T01:59:38Z","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":"3bf6cca7192c1d204299e20178bee67e86808efdbbfc5e4fb011d003795ff49a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-24T20:28:25Z","title_canon_sha256":"6e924f05f6de026640cec3acf007812aa70a4304fb74a17b3c152da3d6eda614"},"schema_version":"1.0","source":{"id":"1310.6766","kind":"arxiv","version":1}},"canonical_sha256":"17f21bbe51f84d98787c887d3d3c90d92de1013b0ef77cd0dfe451c1f516a160","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17f21bbe51f84d98787c887d3d3c90d92de1013b0ef77cd0dfe451c1f516a160","first_computed_at":"2026-05-18T01:59:38.957145Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:38.957145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T8tET4rPHUUC+vfUj0PQCJY96U7CfOaKNFb5gJhxvU3tLoqDv5HOU3JnGPVWa0RmLpvO1helB32siMWCxDTPDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:38.958018Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.6766","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46edcf60b39d93ce73206b38018cbfdd1b6c9dc42ac2daeb1b2733109ebc262a","sha256:e9f30324672f34d08c74739c640982e43bfa586bce6ac8866def0a01fb2baa2b"],"state_sha256":"42bbde34277286052c43f9d36db24b9d2228f298fb712777019209530e9530d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yo13aK+6WY9TI8HyvZSR/fagbDAoArJXRZzaNFbGITyi4w9/iMNywAEBIFKZ5CnaEh3kbclZGlXBt9aQq2lPAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T10:36:49.420004Z","bundle_sha256":"0a017d2c85c00b49bd0539a1ec7e9f3a1230e421a8c4e3f1ae832e5d87b5f64e"}}