{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BQS4AC6WZXAHHJSYQEXQXZWSR2","short_pith_number":"pith:BQS4AC6W","schema_version":"1.0","canonical_sha256":"0c25c00bd6cdc073a658812f0be6d28e840fc4fce76f9929ae7b93b3aec0d20f","source":{"kind":"arxiv","id":"1601.04856","version":1},"attestation_state":"computed","paper":{"title":"Bounds on the Game Transversal Number in Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Csilla Bujt\\'as, Michael A. Henning, Zsolt Tuza","submitted_at":"2016-01-19T10:12:04Z","abstract_excerpt":"Let $H = (V,E)$ be a hypergraph with vertex set $V$ and edge set $E$ of order $\\nH = |V|$ and size $\\mH = |E|$. A transversal in $H$ is a subset of vertices in $H$ that has a nonempty intersection with every edge of $H$. A vertex hits an edge if it belongs to that edge. The transversal game played on $H$ involves of two players, \\emph{Edge-hitter} and \\emph{Staller}, who take turns choosing a vertex from $H$. Each vertex chosen must hit at least one edge not hit by the vertices previously chosen. The game ends when the set of vertices chosen becomes a transversal in $H$. Edge-hitter wishes to "},"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":"1601.04856","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-19T10:12:04Z","cross_cats_sorted":[],"title_canon_sha256":"adbe3c21577175d00b97de1711fe7954779b38bcc59aeb7c5bba1c4619dbaecf","abstract_canon_sha256":"3bbb174c22424c05a7447f663a14296d558977285f07eeda5eb1089b05d3096b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:31.692087Z","signature_b64":"4q+KlnXQn/7XujIlcNssO5ybujWemlDrb/sd59E6FhIBaZJ88HY6MXQjs5nJeiO7ydfMc+oDQJWW3R/HBQvRDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c25c00bd6cdc073a658812f0be6d28e840fc4fce76f9929ae7b93b3aec0d20f","last_reissued_at":"2026-05-18T01:22:31.691660Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:31.691660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds on the Game Transversal Number in Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Csilla Bujt\\'as, Michael A. Henning, Zsolt Tuza","submitted_at":"2016-01-19T10:12:04Z","abstract_excerpt":"Let $H = (V,E)$ be a hypergraph with vertex set $V$ and edge set $E$ of order $\\nH = |V|$ and size $\\mH = |E|$. A transversal in $H$ is a subset of vertices in $H$ that has a nonempty intersection with every edge of $H$. A vertex hits an edge if it belongs to that edge. The transversal game played on $H$ involves of two players, \\emph{Edge-hitter} and \\emph{Staller}, who take turns choosing a vertex from $H$. Each vertex chosen must hit at least one edge not hit by the vertices previously chosen. The game ends when the set of vertices chosen becomes a transversal in $H$. Edge-hitter wishes to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.04856","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":"1601.04856","created_at":"2026-05-18T01:22:31.691720+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.04856v1","created_at":"2026-05-18T01:22:31.691720+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.04856","created_at":"2026-05-18T01:22:31.691720+00:00"},{"alias_kind":"pith_short_12","alias_value":"BQS4AC6WZXAH","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"BQS4AC6WZXAHHJSY","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"BQS4AC6W","created_at":"2026-05-18T12:30:07.202191+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/BQS4AC6WZXAHHJSYQEXQXZWSR2","json":"https://pith.science/pith/BQS4AC6WZXAHHJSYQEXQXZWSR2.json","graph_json":"https://pith.science/api/pith-number/BQS4AC6WZXAHHJSYQEXQXZWSR2/graph.json","events_json":"https://pith.science/api/pith-number/BQS4AC6WZXAHHJSYQEXQXZWSR2/events.json","paper":"https://pith.science/paper/BQS4AC6W"},"agent_actions":{"view_html":"https://pith.science/pith/BQS4AC6WZXAHHJSYQEXQXZWSR2","download_json":"https://pith.science/pith/BQS4AC6WZXAHHJSYQEXQXZWSR2.json","view_paper":"https://pith.science/paper/BQS4AC6W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.04856&json=true","fetch_graph":"https://pith.science/api/pith-number/BQS4AC6WZXAHHJSYQEXQXZWSR2/graph.json","fetch_events":"https://pith.science/api/pith-number/BQS4AC6WZXAHHJSYQEXQXZWSR2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BQS4AC6WZXAHHJSYQEXQXZWSR2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BQS4AC6WZXAHHJSYQEXQXZWSR2/action/storage_attestation","attest_author":"https://pith.science/pith/BQS4AC6WZXAHHJSYQEXQXZWSR2/action/author_attestation","sign_citation":"https://pith.science/pith/BQS4AC6WZXAHHJSYQEXQXZWSR2/action/citation_signature","submit_replication":"https://pith.science/pith/BQS4AC6WZXAHHJSYQEXQXZWSR2/action/replication_record"}},"created_at":"2026-05-18T01:22:31.691720+00:00","updated_at":"2026-05-18T01:22:31.691720+00:00"}