{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:HHH4TY26XD4IFIJUHPA6WHFILC","short_pith_number":"pith:HHH4TY26","schema_version":"1.0","canonical_sha256":"39cfc9e35eb8f882a1343bc1eb1ca85892f8fd1b73bb9f9d53316694bbc7c89d","source":{"kind":"arxiv","id":"2608.06238","version":1},"attestation_state":"computed","paper":{"title":"Maximizing directed cycles in tournaments","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hao Huang, Yijia Fang","submitted_at":"2026-08-06T16:25:54Z","abstract_excerpt":"Determining the combinatorial structures that maximize the number of prescribed substructures is a central theme in extremal combinatorics. Grzesik, Kr\\'al', Lov\\'asz and Volec showed that when $\\ell$ is not divisible by $4$, the random tournament contains asymptotically the most directed cycles of length $\\ell$ among all $n$-vertex tournaments. In the paper, we resolve the remaining cases where $\\ell$ is divisible by $4$. We show that, in this regime, the so-called carousel tournament asymptotically maximizes the number of directed $\\ell$-cycles among all $n$-vertex tournaments, and in partic"},"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":"2608.06238","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-08-06T16:25:54Z","cross_cats_sorted":[],"title_canon_sha256":"9fe7168682ec020d9d42b1fa387eb22d9802cd08a63087fa9ac1bbd8bbb2bba3","abstract_canon_sha256":"896a66f541afa4a3267195f9c593911f8ef76ad6141016e96355e9086329e81f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-07T01:41:00.880208Z","signature_b64":"yKFqmRxMEQXJ+oenQeqR6b8U0FoXwDnRiVDNXXwlcfh0Gk3JI7/jZNoec6QsHHBdKNp+xP6PW/uPQ2Url/e8DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39cfc9e35eb8f882a1343bc1eb1ca85892f8fd1b73bb9f9d53316694bbc7c89d","last_reissued_at":"2026-08-07T01:41:00.878510Z","signature_status":"signed_v1","first_computed_at":"2026-08-07T01:41:00.878510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximizing directed cycles in tournaments","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hao Huang, Yijia Fang","submitted_at":"2026-08-06T16:25:54Z","abstract_excerpt":"Determining the combinatorial structures that maximize the number of prescribed substructures is a central theme in extremal combinatorics. Grzesik, Kr\\'al', Lov\\'asz and Volec showed that when $\\ell$ is not divisible by $4$, the random tournament contains asymptotically the most directed cycles of length $\\ell$ among all $n$-vertex tournaments. In the paper, we resolve the remaining cases where $\\ell$ is divisible by $4$. We show that, in this regime, the so-called carousel tournament asymptotically maximizes the number of directed $\\ell$-cycles among all $n$-vertex tournaments, and in partic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.06238","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/2608.06238/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":"2608.06238","created_at":"2026-08-07T01:41:00.881188+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.06238v1","created_at":"2026-08-07T01:41:00.881188+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.06238","created_at":"2026-08-07T01:41:00.881188+00:00"},{"alias_kind":"pith_short_12","alias_value":"HHH4TY26XD4I","created_at":"2026-08-07T01:41:00.881188+00:00"},{"alias_kind":"pith_short_16","alias_value":"HHH4TY26XD4IFIJU","created_at":"2026-08-07T01:41:00.881188+00:00"},{"alias_kind":"pith_short_8","alias_value":"HHH4TY26","created_at":"2026-08-07T01:41:00.881188+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/HHH4TY26XD4IFIJUHPA6WHFILC","json":"https://pith.science/pith/HHH4TY26XD4IFIJUHPA6WHFILC.json","graph_json":"https://pith.science/api/pith-number/HHH4TY26XD4IFIJUHPA6WHFILC/graph.json","events_json":"https://pith.science/api/pith-number/HHH4TY26XD4IFIJUHPA6WHFILC/events.json","paper":"https://pith.science/paper/HHH4TY26"},"agent_actions":{"view_html":"https://pith.science/pith/HHH4TY26XD4IFIJUHPA6WHFILC","download_json":"https://pith.science/pith/HHH4TY26XD4IFIJUHPA6WHFILC.json","view_paper":"https://pith.science/paper/HHH4TY26","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.06238&json=true","fetch_graph":"https://pith.science/api/pith-number/HHH4TY26XD4IFIJUHPA6WHFILC/graph.json","fetch_events":"https://pith.science/api/pith-number/HHH4TY26XD4IFIJUHPA6WHFILC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HHH4TY26XD4IFIJUHPA6WHFILC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HHH4TY26XD4IFIJUHPA6WHFILC/action/storage_attestation","attest_author":"https://pith.science/pith/HHH4TY26XD4IFIJUHPA6WHFILC/action/author_attestation","sign_citation":"https://pith.science/pith/HHH4TY26XD4IFIJUHPA6WHFILC/action/citation_signature","submit_replication":"https://pith.science/pith/HHH4TY26XD4IFIJUHPA6WHFILC/action/replication_record"}},"created_at":"2026-08-07T01:41:00.881188+00:00","updated_at":"2026-08-07T01:41:00.881188+00:00"}