{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:B4RYWHF3LLSSXDB5VUBV6W4IR5","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":"53cd420639425d431ee613e0fde116e3027a3da41efb62c0db1dddb29a255624","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-04T14:50:53Z","title_canon_sha256":"595749176a90a85ba3ca855977efc7b711284095265da106309ab2b2316e21f2"},"schema_version":"1.0","source":{"id":"1602.01697","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01697","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01697v1","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01697","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"B4RYWHF3LLSS","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"B4RYWHF3LLSSXDB5","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"B4RYWHF3","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:a85ccb9f1b6da845013bc068ce96c0a1dc7e25b1cdc67fdf7a9bb944e25e7b51","target":"graph","created_at":"2026-05-18T01:21:18Z","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":"A 3-tournament is a complete 3-uniform hypergraph where each edge has a special vertex designated as its tail. A vertex set $X$ dominates $T$ if every vertex not in $X$ is contained in an edge whose tail is in $X$. The domination number of $T$ is the minimum size of such an $X$. Generalizing well-known results about usual (graph) tournaments, Gy\\'arf\\'as conjectured that there are 3-tournaments with arbitrarily large domination number, and that this is not the case if any four vertices induce two triples with the same tail. In this short note we solve both problems, proving the first conjectur","authors_text":"Benny Sudakov, D\\'aniel Kor\\'andi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-04T14:50:53Z","title":"Domination in 3-tournaments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01697","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:5483ae17b13c05917efc7508f963a17202824db76c6c82cf61d4846f71661c4f","target":"record","created_at":"2026-05-18T01:21:18Z","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":"53cd420639425d431ee613e0fde116e3027a3da41efb62c0db1dddb29a255624","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-04T14:50:53Z","title_canon_sha256":"595749176a90a85ba3ca855977efc7b711284095265da106309ab2b2316e21f2"},"schema_version":"1.0","source":{"id":"1602.01697","kind":"arxiv","version":1}},"canonical_sha256":"0f238b1cbb5ae52b8c3dad035f5b888f46057679142a39559708163234964bef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f238b1cbb5ae52b8c3dad035f5b888f46057679142a39559708163234964bef","first_computed_at":"2026-05-18T01:21:18.318637Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:18.318637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CN8luJKtj/fvJM0r1pUhm9xmSURcElad6UoOD5YH6bifVFPzlyMnTNMnAAuLkVxcLEtrD/z+LWZZ62uIiZ5UDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:18.319254Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.01697","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5483ae17b13c05917efc7508f963a17202824db76c6c82cf61d4846f71661c4f","sha256:a85ccb9f1b6da845013bc068ce96c0a1dc7e25b1cdc67fdf7a9bb944e25e7b51"],"state_sha256":"027b6681ffa15b3d3746c53808ab5987141f54f1d03b937dc64498746f61f0ee"}