{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:G6NA3D7HEJXY5FRVLJWZKMUXNQ","short_pith_number":"pith:G6NA3D7H","schema_version":"1.0","canonical_sha256":"379a0d8fe7226f8e96355a6d9532976c0e76bdbd54b7deefdd1811c1b1b41864","source":{"kind":"arxiv","id":"1904.02351","version":1},"attestation_state":"computed","paper":{"title":"Directed domination in oriented hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adriana Hansberg, Yair Caro","submitted_at":"2019-04-04T05:09:21Z","abstract_excerpt":"Erd\\H{o}s [On Sch\\\"utte problem, Math. Gaz. 47 (1963)] proved that every tournament on $n$ vertices has a directed dominating set of at most $\\log (n+1)$ vertices, where $\\log$ is the logarithm to base $2$. He also showed that there is a tournament on $n$ vertices with no directed domination set of cardinality less than $\\log n - 2 \\log \\log n + 1$. This notion of directed domination number has been generalized to arbitrary graphs by Caro and Henning in [Directed domination in oriented graphs, Discrete Appl. Math. (2012) 160:7--8.]. However, the generalization to directed r-uniform hypergraphs"},"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":"1904.02351","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-04T05:09:21Z","cross_cats_sorted":[],"title_canon_sha256":"a611fce135e49ab235785e4bdf840bc0518fb2607e27c4720cb5be3aded12a15","abstract_canon_sha256":"f3e3fb01805f020fa2ac3c6db8e738526649b5c74af0adce0eba25d6b32ad814"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:23.908506Z","signature_b64":"+27GYmpbiSs2gNr4fGjgFiGJ4n3R3wN4YRx29acLHthCrpC+SOm5APPOW4GQa4VmHGBC5EoDsTrtdOibRn0cDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"379a0d8fe7226f8e96355a6d9532976c0e76bdbd54b7deefdd1811c1b1b41864","last_reissued_at":"2026-05-17T23:49:23.908112Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:23.908112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Directed domination in oriented hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adriana Hansberg, Yair Caro","submitted_at":"2019-04-04T05:09:21Z","abstract_excerpt":"Erd\\H{o}s [On Sch\\\"utte problem, Math. Gaz. 47 (1963)] proved that every tournament on $n$ vertices has a directed dominating set of at most $\\log (n+1)$ vertices, where $\\log$ is the logarithm to base $2$. He also showed that there is a tournament on $n$ vertices with no directed domination set of cardinality less than $\\log n - 2 \\log \\log n + 1$. This notion of directed domination number has been generalized to arbitrary graphs by Caro and Henning in [Directed domination in oriented graphs, Discrete Appl. Math. (2012) 160:7--8.]. However, the generalization to directed r-uniform hypergraphs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02351","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":"1904.02351","created_at":"2026-05-17T23:49:23.908169+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.02351v1","created_at":"2026-05-17T23:49:23.908169+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02351","created_at":"2026-05-17T23:49:23.908169+00:00"},{"alias_kind":"pith_short_12","alias_value":"G6NA3D7HEJXY","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"G6NA3D7HEJXY5FRV","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"G6NA3D7H","created_at":"2026-05-18T12:33:18.533446+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/G6NA3D7HEJXY5FRVLJWZKMUXNQ","json":"https://pith.science/pith/G6NA3D7HEJXY5FRVLJWZKMUXNQ.json","graph_json":"https://pith.science/api/pith-number/G6NA3D7HEJXY5FRVLJWZKMUXNQ/graph.json","events_json":"https://pith.science/api/pith-number/G6NA3D7HEJXY5FRVLJWZKMUXNQ/events.json","paper":"https://pith.science/paper/G6NA3D7H"},"agent_actions":{"view_html":"https://pith.science/pith/G6NA3D7HEJXY5FRVLJWZKMUXNQ","download_json":"https://pith.science/pith/G6NA3D7HEJXY5FRVLJWZKMUXNQ.json","view_paper":"https://pith.science/paper/G6NA3D7H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.02351&json=true","fetch_graph":"https://pith.science/api/pith-number/G6NA3D7HEJXY5FRVLJWZKMUXNQ/graph.json","fetch_events":"https://pith.science/api/pith-number/G6NA3D7HEJXY5FRVLJWZKMUXNQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G6NA3D7HEJXY5FRVLJWZKMUXNQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G6NA3D7HEJXY5FRVLJWZKMUXNQ/action/storage_attestation","attest_author":"https://pith.science/pith/G6NA3D7HEJXY5FRVLJWZKMUXNQ/action/author_attestation","sign_citation":"https://pith.science/pith/G6NA3D7HEJXY5FRVLJWZKMUXNQ/action/citation_signature","submit_replication":"https://pith.science/pith/G6NA3D7HEJXY5FRVLJWZKMUXNQ/action/replication_record"}},"created_at":"2026-05-17T23:49:23.908169+00:00","updated_at":"2026-05-17T23:49:23.908169+00:00"}