{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IMZW4FNUH4YO7YBMJHOJ7N2JW6","short_pith_number":"pith:IMZW4FNU","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"},"canonical_sha256":"43336e15b43f30efe02c49dc9fb749b79c9db0e6d6e6af2437db24394d83cd0f","source":{"kind":"arxiv","id":"1906.05100","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05100","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05100v1","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05100","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"pith_short_12","alias_value":"IMZW4FNUH4YO","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IMZW4FNUH4YO7YBM","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IMZW4FNU","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IMZW4FNUH4YO7YBMJHOJ7N2JW6","target":"record","payload":{"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"},"canonical_sha256":"43336e15b43f30efe02c49dc9fb749b79c9db0e6d6e6af2437db24394d83cd0f","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"},"source_kind":"arxiv","source_id":"1906.05100","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-17T23:43:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jugNAEyq9HZMcpfGFYdrYiAdsXkQjTDa3ZwvQS+HJIYP5ZMS58/ZGrmst8wiRFGvU9uCdZtbQMwMWL4OnEYiDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:14:57.321772Z"},"content_sha256":"b5d98f7d15b4aa47727f0bf18ca15757c24121206a0f6662849deaf43e842e14","schema_version":"1.0","event_id":"sha256:b5d98f7d15b4aa47727f0bf18ca15757c24121206a0f6662849deaf43e842e14"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IMZW4FNUH4YO7YBMJHOJ7N2JW6","target":"graph","payload":{"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"},"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-17T23:43:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5LjZaOxIUkrWCL/RaUeAeyC5/zLzvU4w1zELCjTQ0dyuwBXDxwixbu4q065Xki6dmMu3zujqC0eXzYBbHMAaCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:14:57.322396Z"},"content_sha256":"309d1eaa5731a11ef3cba9ab189133090b3f84d7cf9241a07f0c2a9f52f039fb","schema_version":"1.0","event_id":"sha256:309d1eaa5731a11ef3cba9ab189133090b3f84d7cf9241a07f0c2a9f52f039fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IMZW4FNUH4YO7YBMJHOJ7N2JW6/bundle.json","state_url":"https://pith.science/pith/IMZW4FNUH4YO7YBMJHOJ7N2JW6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IMZW4FNUH4YO7YBMJHOJ7N2JW6/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-05-27T06:14:57Z","links":{"resolver":"https://pith.science/pith/IMZW4FNUH4YO7YBMJHOJ7N2JW6","bundle":"https://pith.science/pith/IMZW4FNUH4YO7YBMJHOJ7N2JW6/bundle.json","state":"https://pith.science/pith/IMZW4FNUH4YO7YBMJHOJ7N2JW6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IMZW4FNUH4YO7YBMJHOJ7N2JW6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IMZW4FNUH4YO7YBMJHOJ7N2JW6","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":"8c047fceda4bdf9bf2b51504496fe9169fb5e5faa0f38cfb9af74228da46bf63","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-12T12:55:45Z","title_canon_sha256":"24b5b6b78cba9cff67c88a39910500972eb6b65b09e7728736eb688b405594b1"},"schema_version":"1.0","source":{"id":"1906.05100","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05100","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05100v1","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05100","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"pith_short_12","alias_value":"IMZW4FNUH4YO","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"IMZW4FNUH4YO7YBM","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"IMZW4FNU","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:309d1eaa5731a11ef3cba9ab189133090b3f84d7cf9241a07f0c2a9f52f039fb","target":"graph","created_at":"2026-05-17T23:43:29Z","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 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 ","authors_text":"Joonkyung Lee, Mathias Schacht, S\\\"oren Berger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-12T12:55:45Z","title":"Odd cycles in subgraphs of sparse pseudorandom graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05100","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:b5d98f7d15b4aa47727f0bf18ca15757c24121206a0f6662849deaf43e842e14","target":"record","created_at":"2026-05-17T23:43:29Z","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":"8c047fceda4bdf9bf2b51504496fe9169fb5e5faa0f38cfb9af74228da46bf63","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-12T12:55:45Z","title_canon_sha256":"24b5b6b78cba9cff67c88a39910500972eb6b65b09e7728736eb688b405594b1"},"schema_version":"1.0","source":{"id":"1906.05100","kind":"arxiv","version":1}},"canonical_sha256":"43336e15b43f30efe02c49dc9fb749b79c9db0e6d6e6af2437db24394d83cd0f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43336e15b43f30efe02c49dc9fb749b79c9db0e6d6e6af2437db24394d83cd0f","first_computed_at":"2026-05-17T23:43:29.485944Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:29.485944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aZVpiCSHv1pu5dlICh61YQuKb4d+mPEaU/5OtbZZBfgIgW4XeMg6hUXstDPUbqzIf0yD9T0LouxlhOVQbLIFBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:29.486641Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.05100","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5d98f7d15b4aa47727f0bf18ca15757c24121206a0f6662849deaf43e842e14","sha256:309d1eaa5731a11ef3cba9ab189133090b3f84d7cf9241a07f0c2a9f52f039fb"],"state_sha256":"a748c2480c32ef00081645c4b5fe31fa148e9ad220de439662c0aa63c65404d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M5BDGlDh6dc1XLVJA/k/3BNAV0Oxiv5C8fCN+wsZJKzCM9wrH5v4+P3cE+0ZZgVK7EYBPJ8WHtYnAlZTT3OuCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T06:14:57.326135Z","bundle_sha256":"05bfcb3a6e6ccc7f8e3877c564de87442dfe57a1d9529188a8743bee47576570"}}