{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:KBDILWR2Z7K5YAWTF2YW4RUCMJ","short_pith_number":"pith:KBDILWR2","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"},"canonical_sha256":"504685da3acfd5dc02d32eb16e46826277544a210598e1751291d5f3ec7090e9","source":{"kind":"arxiv","id":"0906.4027","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.4027","created_at":"2026-05-18T03:02:44Z"},{"alias_kind":"arxiv_version","alias_value":"0906.4027v1","created_at":"2026-05-18T03:02:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.4027","created_at":"2026-05-18T03:02:44Z"},{"alias_kind":"pith_short_12","alias_value":"KBDILWR2Z7K5","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"KBDILWR2Z7K5YAWT","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"KBDILWR2","created_at":"2026-05-18T12:26:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:KBDILWR2Z7K5YAWTF2YW4RUCMJ","target":"record","payload":{"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"},"canonical_sha256":"504685da3acfd5dc02d32eb16e46826277544a210598e1751291d5f3ec7090e9","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"},"source_kind":"arxiv","source_id":"0906.4027","source_version":1,"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-18T03:02:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IIrvl4H3X27RvoVJM1t4HfoiIkHGLWYJxa+S1eyaHebKVX4wP/daQ0BvZxRRF1o66Pb5qqe/GUCYmXkBaNpfCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:53:13.713554Z"},"content_sha256":"8ca9cf7e6e12cc47a8e0ee1263ddc8ddaeacf5edf700429dc86d4094d66905f7","schema_version":"1.0","event_id":"sha256:8ca9cf7e6e12cc47a8e0ee1263ddc8ddaeacf5edf700429dc86d4094d66905f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:KBDILWR2Z7K5YAWTF2YW4RUCMJ","target":"graph","payload":{"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"},"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-18T03:02:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LHnDjagb/NnRCr7UVAs3acx+twi6P0M0aCtsTMqBy+7aamOY3fahWixpCGkMfWyvgvSEOPfLAWzs/Q7/ukoTAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:53:13.714031Z"},"content_sha256":"b215b3a0446f576d72fa227854c6b2f2d938367dbc71ef894b6701fb376804aa","schema_version":"1.0","event_id":"sha256:b215b3a0446f576d72fa227854c6b2f2d938367dbc71ef894b6701fb376804aa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KBDILWR2Z7K5YAWTF2YW4RUCMJ/bundle.json","state_url":"https://pith.science/pith/KBDILWR2Z7K5YAWTF2YW4RUCMJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KBDILWR2Z7K5YAWTF2YW4RUCMJ/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-06-02T16:53:13Z","links":{"resolver":"https://pith.science/pith/KBDILWR2Z7K5YAWTF2YW4RUCMJ","bundle":"https://pith.science/pith/KBDILWR2Z7K5YAWTF2YW4RUCMJ/bundle.json","state":"https://pith.science/pith/KBDILWR2Z7K5YAWTF2YW4RUCMJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KBDILWR2Z7K5YAWTF2YW4RUCMJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:KBDILWR2Z7K5YAWTF2YW4RUCMJ","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":"e2d4ed43b94d33e6bd40e853219b803cce588d6552160b7c019db556dd57cb95","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-06-22T14:58:41Z","title_canon_sha256":"a530d7fb28ac5d97dac71189096802b045aae1437c874ae68d5cd0dda472e5e3"},"schema_version":"1.0","source":{"id":"0906.4027","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.4027","created_at":"2026-05-18T03:02:44Z"},{"alias_kind":"arxiv_version","alias_value":"0906.4027v1","created_at":"2026-05-18T03:02:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.4027","created_at":"2026-05-18T03:02:44Z"},{"alias_kind":"pith_short_12","alias_value":"KBDILWR2Z7K5","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"KBDILWR2Z7K5YAWT","created_at":"2026-05-18T12:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"KBDILWR2","created_at":"2026-05-18T12:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:b215b3a0446f576d72fa227854c6b2f2d938367dbc71ef894b6701fb376804aa","target":"graph","created_at":"2026-05-18T03:02:44Z","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":"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.","authors_text":"Imre Leader, Ta Sheng Tan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-06-22T14:58:41Z","title":"Directed Simplices In Higher Order Tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.4027","kind":"arxiv","version":1},"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:8ca9cf7e6e12cc47a8e0ee1263ddc8ddaeacf5edf700429dc86d4094d66905f7","target":"record","created_at":"2026-05-18T03:02:44Z","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":"e2d4ed43b94d33e6bd40e853219b803cce588d6552160b7c019db556dd57cb95","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-06-22T14:58:41Z","title_canon_sha256":"a530d7fb28ac5d97dac71189096802b045aae1437c874ae68d5cd0dda472e5e3"},"schema_version":"1.0","source":{"id":"0906.4027","kind":"arxiv","version":1}},"canonical_sha256":"504685da3acfd5dc02d32eb16e46826277544a210598e1751291d5f3ec7090e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"504685da3acfd5dc02d32eb16e46826277544a210598e1751291d5f3ec7090e9","first_computed_at":"2026-05-18T03:02:44.636723Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:44.636723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jkfTrfgrZmuSDSzdL82bTQh72nGXA4F9/eb2SymGZVitahY2+zt+n0FzHze1OjrCAqN2l7rq6BFjtN0qKluyBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:44.637520Z","signed_message":"canonical_sha256_bytes"},"source_id":"0906.4027","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ca9cf7e6e12cc47a8e0ee1263ddc8ddaeacf5edf700429dc86d4094d66905f7","sha256:b215b3a0446f576d72fa227854c6b2f2d938367dbc71ef894b6701fb376804aa"],"state_sha256":"390e20e60fb98053f63439d969adeaf6c069444796d6b8d7528033de5f251a9c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XWfWSosgLIqk+6o8Z+7C0Xt23M2fJ+hdJdsGRF62W4hzJKDCn5fvKhcmb0A12hoaFx9bAe9X5qsZCPQ1UMcrBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T16:53:13.716068Z","bundle_sha256":"f75ef258fc198445e879e24a134004639a642777ea478cf86d9cd75b5894463b"}}