{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:WKLIMBD7UQAM3FQYNYBJA2M6AI","short_pith_number":"pith:WKLIMBD7","schema_version":"1.0","canonical_sha256":"b29686047fa400cd96186e0290699e021b32f9849e56e875d8ff6cb984d6daed","source":{"kind":"arxiv","id":"1107.4715","version":1},"attestation_state":"computed","paper":{"title":"On a conjecture of Erdos and Simonovits: Even Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Jacques Verstraete, Peter Keevash","submitted_at":"2011-07-23T22:42:15Z","abstract_excerpt":"Let $\\mc{F}$ be a family of graphs. A graph is {\\em $\\mc{F}$-free} if it contains no copy of a graph in $\\mc{F}$ as a subgraph. A cornerstone of extremal graph theory is the study of the {\\em Tur\\'an number} $ex(n,\\mc{F})$, the maximum number of edges in an $\\mc{F}$-free graph on $n$ vertices. Define the {\\em Zarankiewicz number} $z(n,\\mc{F})$ to be the maximum number of edges in an $\\mc{F}$-free {\\em bipartite} graph on $n$ vertices. Let $C_k$ denote a cycle of length $k$, and let $\\mc{C}_k$ denote the set of cycles $C_{\\ell}$, where $3 \\le \\ell \\leq k$ and $\\ell$ and $k$ have the same parity"},"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":"1107.4715","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-23T22:42:15Z","cross_cats_sorted":[],"title_canon_sha256":"3de0ffe61b379363f815d9cc8032edb53d92ebdb1b4810e4e609f463edb16922","abstract_canon_sha256":"0dd9c4ab8642ada6e0fd0c3f8e0d368ebef1e9d569527c8fc324dbcc08c13b0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:44.157825Z","signature_b64":"fxhqVcHix+ddzBlu+Mqe+OdWTyNDnvmFQxaZmyI5plFRbLl8KJdIKgjVEUbCyF7c/ghFoLPv++tmoBWk7CcSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b29686047fa400cd96186e0290699e021b32f9849e56e875d8ff6cb984d6daed","last_reissued_at":"2026-05-18T03:02:44.157138Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:44.157138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a conjecture of Erdos and Simonovits: Even Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, Jacques Verstraete, Peter Keevash","submitted_at":"2011-07-23T22:42:15Z","abstract_excerpt":"Let $\\mc{F}$ be a family of graphs. A graph is {\\em $\\mc{F}$-free} if it contains no copy of a graph in $\\mc{F}$ as a subgraph. A cornerstone of extremal graph theory is the study of the {\\em Tur\\'an number} $ex(n,\\mc{F})$, the maximum number of edges in an $\\mc{F}$-free graph on $n$ vertices. Define the {\\em Zarankiewicz number} $z(n,\\mc{F})$ to be the maximum number of edges in an $\\mc{F}$-free {\\em bipartite} graph on $n$ vertices. Let $C_k$ denote a cycle of length $k$, and let $\\mc{C}_k$ denote the set of cycles $C_{\\ell}$, where $3 \\le \\ell \\leq k$ and $\\ell$ and $k$ have the same parity"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4715","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1107.4715","created_at":"2026-05-18T03:02:44.157238+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.4715v1","created_at":"2026-05-18T03:02:44.157238+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4715","created_at":"2026-05-18T03:02:44.157238+00:00"},{"alias_kind":"pith_short_12","alias_value":"WKLIMBD7UQAM","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"WKLIMBD7UQAM3FQY","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"WKLIMBD7","created_at":"2026-05-18T12:26:44.992195+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/WKLIMBD7UQAM3FQYNYBJA2M6AI","json":"https://pith.science/pith/WKLIMBD7UQAM3FQYNYBJA2M6AI.json","graph_json":"https://pith.science/api/pith-number/WKLIMBD7UQAM3FQYNYBJA2M6AI/graph.json","events_json":"https://pith.science/api/pith-number/WKLIMBD7UQAM3FQYNYBJA2M6AI/events.json","paper":"https://pith.science/paper/WKLIMBD7"},"agent_actions":{"view_html":"https://pith.science/pith/WKLIMBD7UQAM3FQYNYBJA2M6AI","download_json":"https://pith.science/pith/WKLIMBD7UQAM3FQYNYBJA2M6AI.json","view_paper":"https://pith.science/paper/WKLIMBD7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.4715&json=true","fetch_graph":"https://pith.science/api/pith-number/WKLIMBD7UQAM3FQYNYBJA2M6AI/graph.json","fetch_events":"https://pith.science/api/pith-number/WKLIMBD7UQAM3FQYNYBJA2M6AI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WKLIMBD7UQAM3FQYNYBJA2M6AI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WKLIMBD7UQAM3FQYNYBJA2M6AI/action/storage_attestation","attest_author":"https://pith.science/pith/WKLIMBD7UQAM3FQYNYBJA2M6AI/action/author_attestation","sign_citation":"https://pith.science/pith/WKLIMBD7UQAM3FQYNYBJA2M6AI/action/citation_signature","submit_replication":"https://pith.science/pith/WKLIMBD7UQAM3FQYNYBJA2M6AI/action/replication_record"}},"created_at":"2026-05-18T03:02:44.157238+00:00","updated_at":"2026-05-18T03:02:44.157238+00:00"}