{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:KBDILWR2Z7K5YAWTF2YW4RUCMJ","short_pith_number":"pith:KBDILWR2","schema_version":"1.0","canonical_sha256":"504685da3acfd5dc02d32eb16e46826277544a210598e1751291d5f3ec7090e9","source":{"kind":"arxiv","id":"0906.4027","version":1},"attestation_state":"computed","paper":{"title":"Directed Simplices In Higher Order Tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Imre Leader, Ta Sheng Tan","submitted_at":"2009-06-22T14:58:41Z","abstract_excerpt":"It is well known that a tournament (complete oriented graph) on $n$ vertices has at most ${1/4}\\binom{n}{3}$ directed triangles, and that the constant 1/4 is best possible. Motivated by some geometric considerations, our aim in this paper is to consider some `higher order' versions of this statement. For example, if we give each 3-set from an $n$-set a cyclic ordering, then what is the greatest number of `directed 4-sets' we can have? We give an asymptotically best possible answer to this question, and give bounds in the general case when we orient each $d$-set from an $n$-set."},"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":"0906.4027","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-06-22T14:58:41Z","cross_cats_sorted":[],"title_canon_sha256":"a530d7fb28ac5d97dac71189096802b045aae1437c874ae68d5cd0dda472e5e3","abstract_canon_sha256":"e2d4ed43b94d33e6bd40e853219b803cce588d6552160b7c019db556dd57cb95"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:44.637520Z","signature_b64":"jkfTrfgrZmuSDSzdL82bTQh72nGXA4F9/eb2SymGZVitahY2+zt+n0FzHze1OjrCAqN2l7rq6BFjtN0qKluyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"504685da3acfd5dc02d32eb16e46826277544a210598e1751291d5f3ec7090e9","last_reissued_at":"2026-05-18T03:02:44.636723Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:44.636723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Directed Simplices In Higher Order Tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Imre Leader, Ta Sheng Tan","submitted_at":"2009-06-22T14:58:41Z","abstract_excerpt":"It is well known that a tournament (complete oriented graph) on $n$ vertices has at most ${1/4}\\binom{n}{3}$ directed triangles, and that the constant 1/4 is best possible. Motivated by some geometric considerations, our aim in this paper is to consider some `higher order' versions of this statement. For example, if we give each 3-set from an $n$-set a cyclic ordering, then what is the greatest number of `directed 4-sets' we can have? We give an asymptotically best possible answer to this question, and give bounds in the general case when we orient each $d$-set from an $n$-set."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.4027","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":""},"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":"0906.4027","created_at":"2026-05-18T03:02:44.636853+00:00"},{"alias_kind":"arxiv_version","alias_value":"0906.4027v1","created_at":"2026-05-18T03:02:44.636853+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.4027","created_at":"2026-05-18T03:02:44.636853+00:00"},{"alias_kind":"pith_short_12","alias_value":"KBDILWR2Z7K5","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"KBDILWR2Z7K5YAWT","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"KBDILWR2","created_at":"2026-05-18T12:26:00.592388+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/KBDILWR2Z7K5YAWTF2YW4RUCMJ","json":"https://pith.science/pith/KBDILWR2Z7K5YAWTF2YW4RUCMJ.json","graph_json":"https://pith.science/api/pith-number/KBDILWR2Z7K5YAWTF2YW4RUCMJ/graph.json","events_json":"https://pith.science/api/pith-number/KBDILWR2Z7K5YAWTF2YW4RUCMJ/events.json","paper":"https://pith.science/paper/KBDILWR2"},"agent_actions":{"view_html":"https://pith.science/pith/KBDILWR2Z7K5YAWTF2YW4RUCMJ","download_json":"https://pith.science/pith/KBDILWR2Z7K5YAWTF2YW4RUCMJ.json","view_paper":"https://pith.science/paper/KBDILWR2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0906.4027&json=true","fetch_graph":"https://pith.science/api/pith-number/KBDILWR2Z7K5YAWTF2YW4RUCMJ/graph.json","fetch_events":"https://pith.science/api/pith-number/KBDILWR2Z7K5YAWTF2YW4RUCMJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KBDILWR2Z7K5YAWTF2YW4RUCMJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KBDILWR2Z7K5YAWTF2YW4RUCMJ/action/storage_attestation","attest_author":"https://pith.science/pith/KBDILWR2Z7K5YAWTF2YW4RUCMJ/action/author_attestation","sign_citation":"https://pith.science/pith/KBDILWR2Z7K5YAWTF2YW4RUCMJ/action/citation_signature","submit_replication":"https://pith.science/pith/KBDILWR2Z7K5YAWTF2YW4RUCMJ/action/replication_record"}},"created_at":"2026-05-18T03:02:44.636853+00:00","updated_at":"2026-05-18T03:02:44.636853+00:00"}