{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5TV5U3IJEKZNB3JSCEOKHFKAJI","short_pith_number":"pith:5TV5U3IJ","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"},"canonical_sha256":"ecebda6d0922b2d0ed32111ca395404a34e51d923809fb7877a36d69ed7a980b","source":{"kind":"arxiv","id":"1602.03663","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.03663","created_at":"2026-05-18T01:19:10Z"},{"alias_kind":"arxiv_version","alias_value":"1602.03663v2","created_at":"2026-05-18T01:19:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03663","created_at":"2026-05-18T01:19:10Z"},{"alias_kind":"pith_short_12","alias_value":"5TV5U3IJEKZN","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5TV5U3IJEKZNB3JS","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5TV5U3IJ","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5TV5U3IJEKZNB3JSCEOKHFKAJI","target":"record","payload":{"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"},"canonical_sha256":"ecebda6d0922b2d0ed32111ca395404a34e51d923809fb7877a36d69ed7a980b","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"},"source_kind":"arxiv","source_id":"1602.03663","source_version":2,"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:19:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gt2xFh7WzoPINfH4gQshZ4p2Bo1+C+E9TFsvSlwq3W7HhmsiT/Q7EOZRYyonnfRB6hlTW8+O/dlXw3W/rhoaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:58:12.620670Z"},"content_sha256":"7c5bdcdb4bedd5852578254d10e4ada4aecdad1e6fcfd4ec4cc570819fb6c4a9","schema_version":"1.0","event_id":"sha256:7c5bdcdb4bedd5852578254d10e4ada4aecdad1e6fcfd4ec4cc570819fb6c4a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5TV5U3IJEKZNB3JSCEOKHFKAJI","target":"graph","payload":{"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"},"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:19:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o70XYGbe92DsmzdInEPzj5GD+0ZQ10CsgU6JjWIe3MBIXdvcCiWSgfOY60GRribguZYkTXu/StxNDUJ6ujfoBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:58:12.621292Z"},"content_sha256":"974397adfe97dc47168041b67d69d5ad11150deeff62b07b67bbb47d52ffe8d5","schema_version":"1.0","event_id":"sha256:974397adfe97dc47168041b67d69d5ad11150deeff62b07b67bbb47d52ffe8d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5TV5U3IJEKZNB3JSCEOKHFKAJI/bundle.json","state_url":"https://pith.science/pith/5TV5U3IJEKZNB3JSCEOKHFKAJI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5TV5U3IJEKZNB3JSCEOKHFKAJI/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-27T05:58:12Z","links":{"resolver":"https://pith.science/pith/5TV5U3IJEKZNB3JSCEOKHFKAJI","bundle":"https://pith.science/pith/5TV5U3IJEKZNB3JSCEOKHFKAJI/bundle.json","state":"https://pith.science/pith/5TV5U3IJEKZNB3JSCEOKHFKAJI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5TV5U3IJEKZNB3JSCEOKHFKAJI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5TV5U3IJEKZNB3JSCEOKHFKAJI","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":"9468e53f81a7b8f50463cf972816bdb469de074650d77b064c7c4f44423efb0a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-11T10:18:34Z","title_canon_sha256":"1c9837d9b38814ce61e2c31ee1d4903a8452377a9a5b33adf485389739d81dc7"},"schema_version":"1.0","source":{"id":"1602.03663","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.03663","created_at":"2026-05-18T01:19:10Z"},{"alias_kind":"arxiv_version","alias_value":"1602.03663v2","created_at":"2026-05-18T01:19:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03663","created_at":"2026-05-18T01:19:10Z"},{"alias_kind":"pith_short_12","alias_value":"5TV5U3IJEKZN","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5TV5U3IJEKZNB3JS","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5TV5U3IJ","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:974397adfe97dc47168041b67d69d5ad11150deeff62b07b67bbb47d52ffe8d5","target":"graph","created_at":"2026-05-18T01:19:10Z","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 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","authors_text":"Elad Aigner-Horev, Hiep H\\`an, Mathias Schacht","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-11T10:18:34Z","title":"Extremal results for odd cycles in sparse pseudorandom graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03663","kind":"arxiv","version":2},"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:7c5bdcdb4bedd5852578254d10e4ada4aecdad1e6fcfd4ec4cc570819fb6c4a9","target":"record","created_at":"2026-05-18T01:19:10Z","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":"9468e53f81a7b8f50463cf972816bdb469de074650d77b064c7c4f44423efb0a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-11T10:18:34Z","title_canon_sha256":"1c9837d9b38814ce61e2c31ee1d4903a8452377a9a5b33adf485389739d81dc7"},"schema_version":"1.0","source":{"id":"1602.03663","kind":"arxiv","version":2}},"canonical_sha256":"ecebda6d0922b2d0ed32111ca395404a34e51d923809fb7877a36d69ed7a980b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ecebda6d0922b2d0ed32111ca395404a34e51d923809fb7877a36d69ed7a980b","first_computed_at":"2026-05-18T01:19:10.916083Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:10.916083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TQrGqn1V5whyoZwQ5z5GQJ3zO1aNzo5Xerw90O1YJAm2sL+h81IeuqyLOmBDtg3KdvOzPGxbsPwAhK2emhQTBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:10.916903Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.03663","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c5bdcdb4bedd5852578254d10e4ada4aecdad1e6fcfd4ec4cc570819fb6c4a9","sha256:974397adfe97dc47168041b67d69d5ad11150deeff62b07b67bbb47d52ffe8d5"],"state_sha256":"e617ee705549beb53721f35990d7bbdb19209eeae24f27ff0352090f6e7b4e9b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i5sligKvJ8PKsJH4rz760rhvtqjb5Eas4muGobHWTO1Ig0E0oWOIxfbBVa6xismE4gzOZQLXaqa3VL7+q0YLBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:58:12.624882Z","bundle_sha256":"211fc0165eb40e8442e602793718a586ff1e8d449cdb714ba5059d3849f2ce33"}}