{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5TV5U3IJEKZNB3JSCEOKHFKAJI","short_pith_number":"pith:5TV5U3IJ","schema_version":"1.0","canonical_sha256":"ecebda6d0922b2d0ed32111ca395404a34e51d923809fb7877a36d69ed7a980b","source":{"kind":"arxiv","id":"1602.03663","version":2},"attestation_state":"computed","paper":{"title":"Extremal results for odd cycles in sparse pseudorandom graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Elad Aigner-Horev, Hiep H\\`an, Mathias Schacht","submitted_at":"2016-02-11T10:18:34Z","abstract_excerpt":"We consider extremal problems for subgraphs of pseudorandom graphs. For graphs $F$ and $\\Gamma$ the generalized Tur\\'an density $\\pi_F(\\Gamma)$ denotes the density of a maximum subgraph of $\\Gamma$, which contains no copy of~$F$. Extending classical Tur\\'an type results for odd cycles, we show that $\\pi_{F}(\\Gamma)=1/2$ provided $F$ is an odd cycle and $\\Gamma$ is a sufficiently pseudorandom graph. In particular, for $(n,d,\\lambda)$-graphs $\\Gamma$, i.e., $n$-vertex, $d$-regular graphs with all non-trivial eigenvalues in the interval $[-\\lambda,\\lambda]$, our result holds for odd cycles of len"},"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":"1602.03663","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-11T10:18:34Z","cross_cats_sorted":[],"title_canon_sha256":"1c9837d9b38814ce61e2c31ee1d4903a8452377a9a5b33adf485389739d81dc7","abstract_canon_sha256":"9468e53f81a7b8f50463cf972816bdb469de074650d77b064c7c4f44423efb0a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:10.916903Z","signature_b64":"TQrGqn1V5whyoZwQ5z5GQJ3zO1aNzo5Xerw90O1YJAm2sL+h81IeuqyLOmBDtg3KdvOzPGxbsPwAhK2emhQTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecebda6d0922b2d0ed32111ca395404a34e51d923809fb7877a36d69ed7a980b","last_reissued_at":"2026-05-18T01:19:10.916083Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:10.916083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extremal results for odd cycles in sparse pseudorandom graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Elad Aigner-Horev, Hiep H\\`an, Mathias Schacht","submitted_at":"2016-02-11T10:18:34Z","abstract_excerpt":"We consider extremal problems for subgraphs of pseudorandom graphs. For graphs $F$ and $\\Gamma$ the generalized Tur\\'an density $\\pi_F(\\Gamma)$ denotes the density of a maximum subgraph of $\\Gamma$, which contains no copy of~$F$. Extending classical Tur\\'an type results for odd cycles, we show that $\\pi_{F}(\\Gamma)=1/2$ provided $F$ is an odd cycle and $\\Gamma$ is a sufficiently pseudorandom graph. In particular, for $(n,d,\\lambda)$-graphs $\\Gamma$, i.e., $n$-vertex, $d$-regular graphs with all non-trivial eigenvalues in the interval $[-\\lambda,\\lambda]$, our result holds for odd cycles of len"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03663","kind":"arxiv","version":2},"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":"1602.03663","created_at":"2026-05-18T01:19:10.916176+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.03663v2","created_at":"2026-05-18T01:19:10.916176+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03663","created_at":"2026-05-18T01:19:10.916176+00:00"},{"alias_kind":"pith_short_12","alias_value":"5TV5U3IJEKZN","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5TV5U3IJEKZNB3JS","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5TV5U3IJ","created_at":"2026-05-18T12:30:01.593930+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/5TV5U3IJEKZNB3JSCEOKHFKAJI","json":"https://pith.science/pith/5TV5U3IJEKZNB3JSCEOKHFKAJI.json","graph_json":"https://pith.science/api/pith-number/5TV5U3IJEKZNB3JSCEOKHFKAJI/graph.json","events_json":"https://pith.science/api/pith-number/5TV5U3IJEKZNB3JSCEOKHFKAJI/events.json","paper":"https://pith.science/paper/5TV5U3IJ"},"agent_actions":{"view_html":"https://pith.science/pith/5TV5U3IJEKZNB3JSCEOKHFKAJI","download_json":"https://pith.science/pith/5TV5U3IJEKZNB3JSCEOKHFKAJI.json","view_paper":"https://pith.science/paper/5TV5U3IJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.03663&json=true","fetch_graph":"https://pith.science/api/pith-number/5TV5U3IJEKZNB3JSCEOKHFKAJI/graph.json","fetch_events":"https://pith.science/api/pith-number/5TV5U3IJEKZNB3JSCEOKHFKAJI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5TV5U3IJEKZNB3JSCEOKHFKAJI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5TV5U3IJEKZNB3JSCEOKHFKAJI/action/storage_attestation","attest_author":"https://pith.science/pith/5TV5U3IJEKZNB3JSCEOKHFKAJI/action/author_attestation","sign_citation":"https://pith.science/pith/5TV5U3IJEKZNB3JSCEOKHFKAJI/action/citation_signature","submit_replication":"https://pith.science/pith/5TV5U3IJEKZNB3JSCEOKHFKAJI/action/replication_record"}},"created_at":"2026-05-18T01:19:10.916176+00:00","updated_at":"2026-05-18T01:19:10.916176+00:00"}