{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6VWDGAX3BJYUKQVWPFR4SXBGCI","short_pith_number":"pith:6VWDGAX3","schema_version":"1.0","canonical_sha256":"f56c3302fb0a714542b67963c95c26121e24809d51fe5bbfa5ab02d37c246631","source":{"kind":"arxiv","id":"1410.6828","version":3},"attestation_state":"computed","paper":{"title":"On the number of 5-cycles in a tournament","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"John Mackey, Natasha Komarov","submitted_at":"2014-10-24T20:19:22Z","abstract_excerpt":"We find an exact formula for the number of directed 5-cycles in a tournament in terms of its edge score sequence. We use this formula to find both upper and lower bounds on the number of 5-cycles in any $n$-tournament. In particular, we show that the maximum number of 5-cycles is asymptotically equal to $\\frac{3}{4}{n \\choose 5}$, the expected number 5-cycles in a random tournament ($p=\\frac{1}{2}$), with equality (up to order of magnitude) for almost all tournaments. Note that this means that almost all $n$-tournaments contain the maximum number of $5$-cycles."},"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":"1410.6828","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-24T20:19:22Z","cross_cats_sorted":[],"title_canon_sha256":"a034409865ff910a9a3b2642c555fa9cc482540ba72931c56b785a3ef159b558","abstract_canon_sha256":"3dc3a3be3b65c7d335f68df501f8f91398f5b3a878770fc95a0680a8cea84c18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:53.405354Z","signature_b64":"c5jQpPyhN5/vvnThnexM8mOVmhuqZGe2EQmFdHyb/9qIfDjwbIDO1UXsSks+jRjZbgYztmDGWDPdCtbdh7lqDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f56c3302fb0a714542b67963c95c26121e24809d51fe5bbfa5ab02d37c246631","last_reissued_at":"2026-05-18T00:52:53.404634Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:53.404634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the number of 5-cycles in a tournament","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"John Mackey, Natasha Komarov","submitted_at":"2014-10-24T20:19:22Z","abstract_excerpt":"We find an exact formula for the number of directed 5-cycles in a tournament in terms of its edge score sequence. We use this formula to find both upper and lower bounds on the number of 5-cycles in any $n$-tournament. In particular, we show that the maximum number of 5-cycles is asymptotically equal to $\\frac{3}{4}{n \\choose 5}$, the expected number 5-cycles in a random tournament ($p=\\frac{1}{2}$), with equality (up to order of magnitude) for almost all tournaments. Note that this means that almost all $n$-tournaments contain the maximum number of $5$-cycles."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6828","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1410.6828","created_at":"2026-05-18T00:52:53.404749+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.6828v3","created_at":"2026-05-18T00:52:53.404749+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6828","created_at":"2026-05-18T00:52:53.404749+00:00"},{"alias_kind":"pith_short_12","alias_value":"6VWDGAX3BJYU","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"6VWDGAX3BJYUKQVW","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"6VWDGAX3","created_at":"2026-05-18T12:28:16.859392+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/6VWDGAX3BJYUKQVWPFR4SXBGCI","json":"https://pith.science/pith/6VWDGAX3BJYUKQVWPFR4SXBGCI.json","graph_json":"https://pith.science/api/pith-number/6VWDGAX3BJYUKQVWPFR4SXBGCI/graph.json","events_json":"https://pith.science/api/pith-number/6VWDGAX3BJYUKQVWPFR4SXBGCI/events.json","paper":"https://pith.science/paper/6VWDGAX3"},"agent_actions":{"view_html":"https://pith.science/pith/6VWDGAX3BJYUKQVWPFR4SXBGCI","download_json":"https://pith.science/pith/6VWDGAX3BJYUKQVWPFR4SXBGCI.json","view_paper":"https://pith.science/paper/6VWDGAX3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.6828&json=true","fetch_graph":"https://pith.science/api/pith-number/6VWDGAX3BJYUKQVWPFR4SXBGCI/graph.json","fetch_events":"https://pith.science/api/pith-number/6VWDGAX3BJYUKQVWPFR4SXBGCI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6VWDGAX3BJYUKQVWPFR4SXBGCI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6VWDGAX3BJYUKQVWPFR4SXBGCI/action/storage_attestation","attest_author":"https://pith.science/pith/6VWDGAX3BJYUKQVWPFR4SXBGCI/action/author_attestation","sign_citation":"https://pith.science/pith/6VWDGAX3BJYUKQVWPFR4SXBGCI/action/citation_signature","submit_replication":"https://pith.science/pith/6VWDGAX3BJYUKQVWPFR4SXBGCI/action/replication_record"}},"created_at":"2026-05-18T00:52:53.404749+00:00","updated_at":"2026-05-18T00:52:53.404749+00:00"}