{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IMZW4FNUH4YO7YBMJHOJ7N2JW6","short_pith_number":"pith:IMZW4FNU","schema_version":"1.0","canonical_sha256":"43336e15b43f30efe02c49dc9fb749b79c9db0e6d6e6af2437db24394d83cd0f","source":{"kind":"arxiv","id":"1906.05100","version":1},"attestation_state":"computed","paper":{"title":"Odd cycles in subgraphs of sparse pseudorandom graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Joonkyung Lee, Mathias Schacht, S\\\"oren Berger","submitted_at":"2019-06-12T12:55:45Z","abstract_excerpt":"We answer two extremal questions about odd cycles that naturally arise in the study of sparse pseudorandom graphs. Let $\\Gamma$ be an $(n,d,\\lambda)$-graph, i.e., $n$-vertex, $d$-regular graphs with all nontrivial eigenvalues in the interval $[-\\lambda,\\lambda]$. Krivelevich, Lee, and Sudakov conjectured that, whenever $\\lambda^{2k-1}\\ll d^{2k}/n$, every subgraph $G$ of $\\Gamma$ with $(1/2+o(1))e(\\Gamma)$ edges contains an odd cycle $C_{2k+1}$. Aigner-Horev, H\\`{a}n, and the third author proved a weaker statement by allowing an extra polylogarithmic factor in the assumption $\\lambda^{2k-1}\\ll "},"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":"1906.05100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-12T12:55:45Z","cross_cats_sorted":[],"title_canon_sha256":"24b5b6b78cba9cff67c88a39910500972eb6b65b09e7728736eb688b405594b1","abstract_canon_sha256":"8c047fceda4bdf9bf2b51504496fe9169fb5e5faa0f38cfb9af74228da46bf63"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:29.486641Z","signature_b64":"aZVpiCSHv1pu5dlICh61YQuKb4d+mPEaU/5OtbZZBfgIgW4XeMg6hUXstDPUbqzIf0yD9T0LouxlhOVQbLIFBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43336e15b43f30efe02c49dc9fb749b79c9db0e6d6e6af2437db24394d83cd0f","last_reissued_at":"2026-05-17T23:43:29.485944Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:29.485944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Odd cycles in subgraphs of sparse pseudorandom graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Joonkyung Lee, Mathias Schacht, S\\\"oren Berger","submitted_at":"2019-06-12T12:55:45Z","abstract_excerpt":"We answer two extremal questions about odd cycles that naturally arise in the study of sparse pseudorandom graphs. Let $\\Gamma$ be an $(n,d,\\lambda)$-graph, i.e., $n$-vertex, $d$-regular graphs with all nontrivial eigenvalues in the interval $[-\\lambda,\\lambda]$. Krivelevich, Lee, and Sudakov conjectured that, whenever $\\lambda^{2k-1}\\ll d^{2k}/n$, every subgraph $G$ of $\\Gamma$ with $(1/2+o(1))e(\\Gamma)$ edges contains an odd cycle $C_{2k+1}$. Aigner-Horev, H\\`{a}n, and the third author proved a weaker statement by allowing an extra polylogarithmic factor in the assumption $\\lambda^{2k-1}\\ll "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05100","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":"1906.05100","created_at":"2026-05-17T23:43:29.486053+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.05100v1","created_at":"2026-05-17T23:43:29.486053+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05100","created_at":"2026-05-17T23:43:29.486053+00:00"},{"alias_kind":"pith_short_12","alias_value":"IMZW4FNUH4YO","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"IMZW4FNUH4YO7YBM","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"IMZW4FNU","created_at":"2026-05-18T12:33:18.533446+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/IMZW4FNUH4YO7YBMJHOJ7N2JW6","json":"https://pith.science/pith/IMZW4FNUH4YO7YBMJHOJ7N2JW6.json","graph_json":"https://pith.science/api/pith-number/IMZW4FNUH4YO7YBMJHOJ7N2JW6/graph.json","events_json":"https://pith.science/api/pith-number/IMZW4FNUH4YO7YBMJHOJ7N2JW6/events.json","paper":"https://pith.science/paper/IMZW4FNU"},"agent_actions":{"view_html":"https://pith.science/pith/IMZW4FNUH4YO7YBMJHOJ7N2JW6","download_json":"https://pith.science/pith/IMZW4FNUH4YO7YBMJHOJ7N2JW6.json","view_paper":"https://pith.science/paper/IMZW4FNU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.05100&json=true","fetch_graph":"https://pith.science/api/pith-number/IMZW4FNUH4YO7YBMJHOJ7N2JW6/graph.json","fetch_events":"https://pith.science/api/pith-number/IMZW4FNUH4YO7YBMJHOJ7N2JW6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IMZW4FNUH4YO7YBMJHOJ7N2JW6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IMZW4FNUH4YO7YBMJHOJ7N2JW6/action/storage_attestation","attest_author":"https://pith.science/pith/IMZW4FNUH4YO7YBMJHOJ7N2JW6/action/author_attestation","sign_citation":"https://pith.science/pith/IMZW4FNUH4YO7YBMJHOJ7N2JW6/action/citation_signature","submit_replication":"https://pith.science/pith/IMZW4FNUH4YO7YBMJHOJ7N2JW6/action/replication_record"}},"created_at":"2026-05-17T23:43:29.486053+00:00","updated_at":"2026-05-17T23:43:29.486053+00:00"}