{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:RQA3DGG7M64OOZBB4OAT7CIBXF","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":"588874cd2bc06812ebbcd544e36606c23c5a7e21034b8858befdaa481b7bc219","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-07T09:59:48Z","title_canon_sha256":"5ea439bfaefcb29d998ef750d44b416d1e2b0fe576b78de4ad699295380bff6c"},"schema_version":"1.0","source":{"id":"1302.1684","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1684","created_at":"2026-05-18T03:05:28Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1684v2","created_at":"2026-05-18T03:05:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1684","created_at":"2026-05-18T03:05:28Z"},{"alias_kind":"pith_short_12","alias_value":"RQA3DGG7M64O","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"RQA3DGG7M64OOZBB","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"RQA3DGG7","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:396eefa3831dbb4c8dc4e01439ed5ed6f57b18e012e18e2aed047f7f9c824e02","target":"graph","created_at":"2026-05-18T03:05:28Z","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":"We study a high-dimensional analog for the notion of an acyclic (aka transitive) tournament. We give upper and lower bounds on the number of $d$-dimensional $n$-vertex acyclic tournaments. In addition, we prove that every $n$-vertex $d$-dimensional tournament contains an acyclic subtournament of $\\Omega(\\log^{1/d}n)$ vertices and the bound is tight. This statement for tournaments (i.e., the case $d=1$) is a well-known fact. We indicate a connection between acyclic high-dimensional tournaments and Ramsey numbers of hypergraphs. We investigate as well the inter-relations among various other noti","authors_text":"Avraham Morgenstern, Nati Linial","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-07T09:59:48Z","title":"On high-dimensional acyclic tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1684","kind":"arxiv","version":2},"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:fc19b9992f08e51be1d2966e2bd27596d5ca2b3bcd95e2218330ac80ed02a497","target":"record","created_at":"2026-05-18T03:05:28Z","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":"588874cd2bc06812ebbcd544e36606c23c5a7e21034b8858befdaa481b7bc219","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-07T09:59:48Z","title_canon_sha256":"5ea439bfaefcb29d998ef750d44b416d1e2b0fe576b78de4ad699295380bff6c"},"schema_version":"1.0","source":{"id":"1302.1684","kind":"arxiv","version":2}},"canonical_sha256":"8c01b198df67b8e76421e3813f8901b9402145a6c5d0d8a315eb135c4ce43fdc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c01b198df67b8e76421e3813f8901b9402145a6c5d0d8a315eb135c4ce43fdc","first_computed_at":"2026-05-18T03:05:28.229875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:28.229875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vzYBegomeS7+K8i04JHgP8W2Ak0lae0DZbQokyVmo7sDFbcRp9kTw+NAEiv0a9r4gsZ1Y5mtIt8TMKeAFom3DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:28.230426Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.1684","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc19b9992f08e51be1d2966e2bd27596d5ca2b3bcd95e2218330ac80ed02a497","sha256:396eefa3831dbb4c8dc4e01439ed5ed6f57b18e012e18e2aed047f7f9c824e02"],"state_sha256":"fbf90721dfa10ed3adbf6dd6af3656f6bddb1471ef6317ac0077756c013d05a9"}