{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:R7QQPADRO6T6DZLERQRN7LL44U","short_pith_number":"pith:R7QQPADR","canonical_record":{"source":{"id":"1712.07079","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-19T17:52:43Z","cross_cats_sorted":[],"title_canon_sha256":"13a4b13fc9c2e6150e701134cf868f4ee4251947ea438f8473b483db86d84f35","abstract_canon_sha256":"6f6a9d50fc728b61f39059afeac8a2007b5f1eaf50454fc94c584c943d145331"},"schema_version":"1.0"},"canonical_sha256":"8fe107807177a7e1e5648c22dfad7ce50be1136efc44957047ef4ee519123543","source":{"kind":"arxiv","id":"1712.07079","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.07079","created_at":"2026-05-17T23:58:14Z"},{"alias_kind":"arxiv_version","alias_value":"1712.07079v3","created_at":"2026-05-17T23:58:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07079","created_at":"2026-05-17T23:58:14Z"},{"alias_kind":"pith_short_12","alias_value":"R7QQPADRO6T6","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"R7QQPADRO6T6DZLE","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"R7QQPADR","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:R7QQPADRO6T6DZLERQRN7LL44U","target":"record","payload":{"canonical_record":{"source":{"id":"1712.07079","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-19T17:52:43Z","cross_cats_sorted":[],"title_canon_sha256":"13a4b13fc9c2e6150e701134cf868f4ee4251947ea438f8473b483db86d84f35","abstract_canon_sha256":"6f6a9d50fc728b61f39059afeac8a2007b5f1eaf50454fc94c584c943d145331"},"schema_version":"1.0"},"canonical_sha256":"8fe107807177a7e1e5648c22dfad7ce50be1136efc44957047ef4ee519123543","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:14.741895Z","signature_b64":"9D8fBa7VG9ooR9qaZdoHyr+Rg6iTIBgHu44Tega04cZApj2rh2YE29tO6Y7Ik4c4kuSg9vAYbrat0T91H7mTDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fe107807177a7e1e5648c22dfad7ce50be1136efc44957047ef4ee519123543","last_reissued_at":"2026-05-17T23:58:14.741415Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:14.741415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.07079","source_version":3,"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:58:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R+7IPrFtqOAnr7uF892dMB8M3jUk8Rid4WUzSPwTP6P1hcf5ET9cVX0tTy0HCoZmDjEmBRI7EDJf2VlaKKkQAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:47:51.862182Z"},"content_sha256":"e19b9c291756e35f8c1669fdd4ae66a3e42015ec408732c277f606f6ef50cd73","schema_version":"1.0","event_id":"sha256:e19b9c291756e35f8c1669fdd4ae66a3e42015ec408732c277f606f6ef50cd73"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:R7QQPADRO6T6DZLERQRN7LL44U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Tur\\'an problems for even cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, D\\'aniel Gerbner, Ervin Gy\\H{o}ri, M\\'at\\'e Vizer","submitted_at":"2017-12-19T17:52:43Z","abstract_excerpt":"Given a graph $H$ and a set of graphs $\\mathcal F$, let $ex(n,H,\\mathcal F)$ denote the maximum possible number of copies of $H$ in an $\\mathcal F$-free graph on $n$ vertices. We investigate the function $ex(n,H,\\mathcal F)$, when $H$ and members of $\\mathcal F$ are cycles. Let $C_k$ denote the cycle of length $k$ and let $\\mathscr C_k=\\{C_3,C_4,\\ldots,C_k\\}$. Some of our main results are the following.\n  (i) We show that $ex(n, C_{2l}, C_{2k}) = \\Theta(n^l)$ for any $l, k \\ge 2$. Moreover, we determine it asymptotically in the following cases: We show that $ex(n,C_4,C_{2k}) = (1+o(1)) \\frac{("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07079","kind":"arxiv","version":3},"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:58:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ye7HyRyrtdRYAvHgvQeDRmgnqyTL08V01p2MPipnP7ZCWyYJLf/PRlTzonzagjJhyTJeHfqXA6AgJB0/Ows3Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:47:51.862839Z"},"content_sha256":"aa780c2bb9003bda16422ae434844b175e701db90f4ceed682d31697ea3d61ac","schema_version":"1.0","event_id":"sha256:aa780c2bb9003bda16422ae434844b175e701db90f4ceed682d31697ea3d61ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R7QQPADRO6T6DZLERQRN7LL44U/bundle.json","state_url":"https://pith.science/pith/R7QQPADRO6T6DZLERQRN7LL44U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R7QQPADRO6T6DZLERQRN7LL44U/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-30T08:47:51Z","links":{"resolver":"https://pith.science/pith/R7QQPADRO6T6DZLERQRN7LL44U","bundle":"https://pith.science/pith/R7QQPADRO6T6DZLERQRN7LL44U/bundle.json","state":"https://pith.science/pith/R7QQPADRO6T6DZLERQRN7LL44U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R7QQPADRO6T6DZLERQRN7LL44U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:R7QQPADRO6T6DZLERQRN7LL44U","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":"6f6a9d50fc728b61f39059afeac8a2007b5f1eaf50454fc94c584c943d145331","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-19T17:52:43Z","title_canon_sha256":"13a4b13fc9c2e6150e701134cf868f4ee4251947ea438f8473b483db86d84f35"},"schema_version":"1.0","source":{"id":"1712.07079","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.07079","created_at":"2026-05-17T23:58:14Z"},{"alias_kind":"arxiv_version","alias_value":"1712.07079v3","created_at":"2026-05-17T23:58:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07079","created_at":"2026-05-17T23:58:14Z"},{"alias_kind":"pith_short_12","alias_value":"R7QQPADRO6T6","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"R7QQPADRO6T6DZLE","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"R7QQPADR","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:aa780c2bb9003bda16422ae434844b175e701db90f4ceed682d31697ea3d61ac","target":"graph","created_at":"2026-05-17T23:58:14Z","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":"Given a graph $H$ and a set of graphs $\\mathcal F$, let $ex(n,H,\\mathcal F)$ denote the maximum possible number of copies of $H$ in an $\\mathcal F$-free graph on $n$ vertices. We investigate the function $ex(n,H,\\mathcal F)$, when $H$ and members of $\\mathcal F$ are cycles. Let $C_k$ denote the cycle of length $k$ and let $\\mathscr C_k=\\{C_3,C_4,\\ldots,C_k\\}$. Some of our main results are the following.\n  (i) We show that $ex(n, C_{2l}, C_{2k}) = \\Theta(n^l)$ for any $l, k \\ge 2$. Moreover, we determine it asymptotically in the following cases: We show that $ex(n,C_4,C_{2k}) = (1+o(1)) \\frac{(","authors_text":"Abhishek Methuku, D\\'aniel Gerbner, Ervin Gy\\H{o}ri, M\\'at\\'e Vizer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-19T17:52:43Z","title":"Generalized Tur\\'an problems for even cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07079","kind":"arxiv","version":3},"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:e19b9c291756e35f8c1669fdd4ae66a3e42015ec408732c277f606f6ef50cd73","target":"record","created_at":"2026-05-17T23:58:14Z","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":"6f6a9d50fc728b61f39059afeac8a2007b5f1eaf50454fc94c584c943d145331","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-19T17:52:43Z","title_canon_sha256":"13a4b13fc9c2e6150e701134cf868f4ee4251947ea438f8473b483db86d84f35"},"schema_version":"1.0","source":{"id":"1712.07079","kind":"arxiv","version":3}},"canonical_sha256":"8fe107807177a7e1e5648c22dfad7ce50be1136efc44957047ef4ee519123543","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8fe107807177a7e1e5648c22dfad7ce50be1136efc44957047ef4ee519123543","first_computed_at":"2026-05-17T23:58:14.741415Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:14.741415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9D8fBa7VG9ooR9qaZdoHyr+Rg6iTIBgHu44Tega04cZApj2rh2YE29tO6Y7Ik4c4kuSg9vAYbrat0T91H7mTDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:14.741895Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.07079","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e19b9c291756e35f8c1669fdd4ae66a3e42015ec408732c277f606f6ef50cd73","sha256:aa780c2bb9003bda16422ae434844b175e701db90f4ceed682d31697ea3d61ac"],"state_sha256":"6a9e8ff56281075840c69a39a78449d0fb7e5dc4dee59f39cdfd1ecb793f031d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vnjv791Eh/5stFi+IqxxD+CqbzmQSLBC8f4raqCCoQBXnlWwAWquGJX0a+eXEtgSYbkmL8CrxJ0sHQ9+PbYIBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:47:51.865849Z","bundle_sha256":"3f8ef022716df57a95f3251b32cc8768815801a3a2ba51d85c75f5d281fc6874"}}