{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:G6NA3D7HEJXY5FRVLJWZKMUXNQ","short_pith_number":"pith:G6NA3D7H","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"},"canonical_sha256":"379a0d8fe7226f8e96355a6d9532976c0e76bdbd54b7deefdd1811c1b1b41864","source":{"kind":"arxiv","id":"1904.02351","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.02351","created_at":"2026-05-17T23:49:23Z"},{"alias_kind":"arxiv_version","alias_value":"1904.02351v1","created_at":"2026-05-17T23:49:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02351","created_at":"2026-05-17T23:49:23Z"},{"alias_kind":"pith_short_12","alias_value":"G6NA3D7HEJXY","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"G6NA3D7HEJXY5FRV","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"G6NA3D7H","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:G6NA3D7HEJXY5FRVLJWZKMUXNQ","target":"record","payload":{"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"},"canonical_sha256":"379a0d8fe7226f8e96355a6d9532976c0e76bdbd54b7deefdd1811c1b1b41864","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"},"source_kind":"arxiv","source_id":"1904.02351","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:49:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9RR13LWGOWskfJqLOz4mKapt5jIcH025M9uSzdsG3q8YuaHxmSBksd9IGTR4OfjbhX5aJNYTvmCbwcwoKf9EAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:37:41.784073Z"},"content_sha256":"3ed3ead321ee3e5af76a1ae56a3a47561910abfca802f2d8a3f6494513002fe4","schema_version":"1.0","event_id":"sha256:3ed3ead321ee3e5af76a1ae56a3a47561910abfca802f2d8a3f6494513002fe4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:G6NA3D7HEJXY5FRVLJWZKMUXNQ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:49:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o5FPOlps6QgrgbFzzIAAE7KufDwh2ANW3NEbnKtfczHzmVlVwRWONcKDJRwA3ymoNxnUAe123aCFq5XGOadLAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T00:37:41.784426Z"},"content_sha256":"fdd20158fb68c9360abc9b12b0baf507390c35727f0fda1285123026f53cd9eb","schema_version":"1.0","event_id":"sha256:fdd20158fb68c9360abc9b12b0baf507390c35727f0fda1285123026f53cd9eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G6NA3D7HEJXY5FRVLJWZKMUXNQ/bundle.json","state_url":"https://pith.science/pith/G6NA3D7HEJXY5FRVLJWZKMUXNQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G6NA3D7HEJXY5FRVLJWZKMUXNQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-23T00:37:41Z","links":{"resolver":"https://pith.science/pith/G6NA3D7HEJXY5FRVLJWZKMUXNQ","bundle":"https://pith.science/pith/G6NA3D7HEJXY5FRVLJWZKMUXNQ/bundle.json","state":"https://pith.science/pith/G6NA3D7HEJXY5FRVLJWZKMUXNQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G6NA3D7HEJXY5FRVLJWZKMUXNQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:G6NA3D7HEJXY5FRVLJWZKMUXNQ","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":"f3e3fb01805f020fa2ac3c6db8e738526649b5c74af0adce0eba25d6b32ad814","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-04T05:09:21Z","title_canon_sha256":"a611fce135e49ab235785e4bdf840bc0518fb2607e27c4720cb5be3aded12a15"},"schema_version":"1.0","source":{"id":"1904.02351","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.02351","created_at":"2026-05-17T23:49:23Z"},{"alias_kind":"arxiv_version","alias_value":"1904.02351v1","created_at":"2026-05-17T23:49:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.02351","created_at":"2026-05-17T23:49:23Z"},{"alias_kind":"pith_short_12","alias_value":"G6NA3D7HEJXY","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"G6NA3D7HEJXY5FRV","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"G6NA3D7H","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:fdd20158fb68c9360abc9b12b0baf507390c35727f0fda1285123026f53cd9eb","target":"graph","created_at":"2026-05-17T23:49:23Z","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":"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","authors_text":"Adriana Hansberg, Yair Caro","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-04T05:09:21Z","title":"Directed domination in oriented hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.02351","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:3ed3ead321ee3e5af76a1ae56a3a47561910abfca802f2d8a3f6494513002fe4","target":"record","created_at":"2026-05-17T23:49:23Z","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":"f3e3fb01805f020fa2ac3c6db8e738526649b5c74af0adce0eba25d6b32ad814","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-04T05:09:21Z","title_canon_sha256":"a611fce135e49ab235785e4bdf840bc0518fb2607e27c4720cb5be3aded12a15"},"schema_version":"1.0","source":{"id":"1904.02351","kind":"arxiv","version":1}},"canonical_sha256":"379a0d8fe7226f8e96355a6d9532976c0e76bdbd54b7deefdd1811c1b1b41864","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"379a0d8fe7226f8e96355a6d9532976c0e76bdbd54b7deefdd1811c1b1b41864","first_computed_at":"2026-05-17T23:49:23.908112Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:23.908112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+27GYmpbiSs2gNr4fGjgFiGJ4n3R3wN4YRx29acLHthCrpC+SOm5APPOW4GQa4VmHGBC5EoDsTrtdOibRn0cDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:23.908506Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.02351","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ed3ead321ee3e5af76a1ae56a3a47561910abfca802f2d8a3f6494513002fe4","sha256:fdd20158fb68c9360abc9b12b0baf507390c35727f0fda1285123026f53cd9eb"],"state_sha256":"bba6f26b63f0de1400991efa834fc872fff17fc4dc25111e3f7ec5f976dc8407"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vzx0W/Nt9q56QFRvwkWEndQ54DWFu3rp32Gyof6s83tC+So57Cj3gcMqkmSTImRPrtUBNxpWyRlobvrZBHGqBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T00:37:41.786292Z","bundle_sha256":"863f3a005a7063459deb08dde2df0d6c550ce7f8dfeb6eafbad9e5bae06e4359"}}