{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RQA3DGG7M64OOZBB4OAT7CIBXF","short_pith_number":"pith:RQA3DGG7","schema_version":"1.0","canonical_sha256":"8c01b198df67b8e76421e3813f8901b9402145a6c5d0d8a315eb135c4ce43fdc","source":{"kind":"arxiv","id":"1302.1684","version":2},"attestation_state":"computed","paper":{"title":"On high-dimensional acyclic tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Avraham Morgenstern, Nati Linial","submitted_at":"2013-02-07T09:59:48Z","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"},"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":"1302.1684","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-07T09:59:48Z","cross_cats_sorted":[],"title_canon_sha256":"5ea439bfaefcb29d998ef750d44b416d1e2b0fe576b78de4ad699295380bff6c","abstract_canon_sha256":"588874cd2bc06812ebbcd544e36606c23c5a7e21034b8858befdaa481b7bc219"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:28.230426Z","signature_b64":"vzYBegomeS7+K8i04JHgP8W2Ak0lae0DZbQokyVmo7sDFbcRp9kTw+NAEiv0a9r4gsZ1Y5mtIt8TMKeAFom3DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c01b198df67b8e76421e3813f8901b9402145a6c5d0d8a315eb135c4ce43fdc","last_reissued_at":"2026-05-18T03:05:28.229875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:28.229875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On high-dimensional acyclic tournaments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Avraham Morgenstern, Nati Linial","submitted_at":"2013-02-07T09:59:48Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1684","kind":"arxiv","version":2},"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":"1302.1684","created_at":"2026-05-18T03:05:28.229959+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.1684v2","created_at":"2026-05-18T03:05:28.229959+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1684","created_at":"2026-05-18T03:05:28.229959+00:00"},{"alias_kind":"pith_short_12","alias_value":"RQA3DGG7M64O","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"RQA3DGG7M64OOZBB","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"RQA3DGG7","created_at":"2026-05-18T12:27:59.945178+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/RQA3DGG7M64OOZBB4OAT7CIBXF","json":"https://pith.science/pith/RQA3DGG7M64OOZBB4OAT7CIBXF.json","graph_json":"https://pith.science/api/pith-number/RQA3DGG7M64OOZBB4OAT7CIBXF/graph.json","events_json":"https://pith.science/api/pith-number/RQA3DGG7M64OOZBB4OAT7CIBXF/events.json","paper":"https://pith.science/paper/RQA3DGG7"},"agent_actions":{"view_html":"https://pith.science/pith/RQA3DGG7M64OOZBB4OAT7CIBXF","download_json":"https://pith.science/pith/RQA3DGG7M64OOZBB4OAT7CIBXF.json","view_paper":"https://pith.science/paper/RQA3DGG7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.1684&json=true","fetch_graph":"https://pith.science/api/pith-number/RQA3DGG7M64OOZBB4OAT7CIBXF/graph.json","fetch_events":"https://pith.science/api/pith-number/RQA3DGG7M64OOZBB4OAT7CIBXF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RQA3DGG7M64OOZBB4OAT7CIBXF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RQA3DGG7M64OOZBB4OAT7CIBXF/action/storage_attestation","attest_author":"https://pith.science/pith/RQA3DGG7M64OOZBB4OAT7CIBXF/action/author_attestation","sign_citation":"https://pith.science/pith/RQA3DGG7M64OOZBB4OAT7CIBXF/action/citation_signature","submit_replication":"https://pith.science/pith/RQA3DGG7M64OOZBB4OAT7CIBXF/action/replication_record"}},"created_at":"2026-05-18T03:05:28.229959+00:00","updated_at":"2026-05-18T03:05:28.229959+00:00"}