{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:73J7KMHYSN536H5UYFMRZXFG6R","short_pith_number":"pith:73J7KMHY","schema_version":"1.0","canonical_sha256":"fed3f530f8937bbf1fb4c1591cdca6f4550d1e164058ffc1fe516987ab36eb2a","source":{"kind":"arxiv","id":"2505.22189","version":1},"attestation_state":"computed","paper":{"title":"Generalized Tur\\'an problem for directed cycles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Grzesik, Bart{\\l}omiej Kielak, Justyna Jaworska, Piotr Kuc, Tomasz \\'Slusarczyk","submitted_at":"2025-05-28T10:02:29Z","abstract_excerpt":"For integers $k, \\ell \\geq 3$, let $\\mathrm{ex}(n, \\overrightarrow{C_k}, \\overrightarrow{C_\\ell})$ denote the maximum number of directed cycles of length $k$ in any oriented graph on $n$ vertices which does not contain a directed cycle of length $\\ell$. We establish the order of magnitude of $\\mathrm{ex}(n, \\overrightarrow{C_k}, \\overrightarrow{C_\\ell})$ for every $k$ and $\\ell$ and determine its value up to a lower error term when $k \\nmid \\ell$ and $\\ell$ is large enough. Additionally, we calculate the value of $\\mathrm{ex}(n, \\overrightarrow{C_k}, \\overrightarrow{C_\\ell})$ for some other sp"},"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":"2505.22189","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-05-28T10:02:29Z","cross_cats_sorted":[],"title_canon_sha256":"08a40258a4d40d642ab535241898bbe6eccb6224ea24f2823fac8fa9630c1faa","abstract_canon_sha256":"1ed550d9b831c357619c91050a8a543469c3fc3837671eb65bf849e931c47ae6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:11.145252Z","signature_b64":"W+iPzvdf7xd+anWEbBjG21EAhU9qnTftr/i9bXTRdq6BMcqYi+FBOiaHDokOhmNu7dVHuXnDb8KvH9ft/wzMCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fed3f530f8937bbf1fb4c1591cdca6f4550d1e164058ffc1fe516987ab36eb2a","last_reissued_at":"2026-07-05T11:11:11.144762Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:11.144762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Tur\\'an problem for directed cycles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Grzesik, Bart{\\l}omiej Kielak, Justyna Jaworska, Piotr Kuc, Tomasz \\'Slusarczyk","submitted_at":"2025-05-28T10:02:29Z","abstract_excerpt":"For integers $k, \\ell \\geq 3$, let $\\mathrm{ex}(n, \\overrightarrow{C_k}, \\overrightarrow{C_\\ell})$ denote the maximum number of directed cycles of length $k$ in any oriented graph on $n$ vertices which does not contain a directed cycle of length $\\ell$. We establish the order of magnitude of $\\mathrm{ex}(n, \\overrightarrow{C_k}, \\overrightarrow{C_\\ell})$ for every $k$ and $\\ell$ and determine its value up to a lower error term when $k \\nmid \\ell$ and $\\ell$ is large enough. Additionally, we calculate the value of $\\mathrm{ex}(n, \\overrightarrow{C_k}, \\overrightarrow{C_\\ell})$ for some other sp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.22189","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.22189/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2505.22189","created_at":"2026-07-05T11:11:11.144819+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.22189v1","created_at":"2026-07-05T11:11:11.144819+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.22189","created_at":"2026-07-05T11:11:11.144819+00:00"},{"alias_kind":"pith_short_12","alias_value":"73J7KMHYSN53","created_at":"2026-07-05T11:11:11.144819+00:00"},{"alias_kind":"pith_short_16","alias_value":"73J7KMHYSN536H5U","created_at":"2026-07-05T11:11:11.144819+00:00"},{"alias_kind":"pith_short_8","alias_value":"73J7KMHY","created_at":"2026-07-05T11:11:11.144819+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/73J7KMHYSN536H5UYFMRZXFG6R","json":"https://pith.science/pith/73J7KMHYSN536H5UYFMRZXFG6R.json","graph_json":"https://pith.science/api/pith-number/73J7KMHYSN536H5UYFMRZXFG6R/graph.json","events_json":"https://pith.science/api/pith-number/73J7KMHYSN536H5UYFMRZXFG6R/events.json","paper":"https://pith.science/paper/73J7KMHY"},"agent_actions":{"view_html":"https://pith.science/pith/73J7KMHYSN536H5UYFMRZXFG6R","download_json":"https://pith.science/pith/73J7KMHYSN536H5UYFMRZXFG6R.json","view_paper":"https://pith.science/paper/73J7KMHY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.22189&json=true","fetch_graph":"https://pith.science/api/pith-number/73J7KMHYSN536H5UYFMRZXFG6R/graph.json","fetch_events":"https://pith.science/api/pith-number/73J7KMHYSN536H5UYFMRZXFG6R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/73J7KMHYSN536H5UYFMRZXFG6R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/73J7KMHYSN536H5UYFMRZXFG6R/action/storage_attestation","attest_author":"https://pith.science/pith/73J7KMHYSN536H5UYFMRZXFG6R/action/author_attestation","sign_citation":"https://pith.science/pith/73J7KMHYSN536H5UYFMRZXFG6R/action/citation_signature","submit_replication":"https://pith.science/pith/73J7KMHYSN536H5UYFMRZXFG6R/action/replication_record"}},"created_at":"2026-07-05T11:11:11.144819+00:00","updated_at":"2026-07-05T11:11:11.144819+00:00"}