{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2NHQNFR7OAYWTARIOU72QF5SHV","short_pith_number":"pith:2NHQNFR7","canonical_record":{"source":{"id":"1603.03557","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-11T08:17:06Z","cross_cats_sorted":[],"title_canon_sha256":"a6d9f431434b307306ffbc1dd114fa1a1695b464d333828a8478fef7d78e00d9","abstract_canon_sha256":"2fafcc1e0b3f3a4463ca491a2ade9b03c3e890ca9db823b48ec1b6e18e28455f"},"schema_version":"1.0"},"canonical_sha256":"d34f06963f7031698228753fa817b23d7effe6879845df1d683966e483902fa4","source":{"kind":"arxiv","id":"1603.03557","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.03557","created_at":"2026-05-18T01:10:59Z"},{"alias_kind":"arxiv_version","alias_value":"1603.03557v2","created_at":"2026-05-18T01:10:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03557","created_at":"2026-05-18T01:10:59Z"},{"alias_kind":"pith_short_12","alias_value":"2NHQNFR7OAYW","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2NHQNFR7OAYWTARI","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2NHQNFR7","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2NHQNFR7OAYWTARIOU72QF5SHV","target":"record","payload":{"canonical_record":{"source":{"id":"1603.03557","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-11T08:17:06Z","cross_cats_sorted":[],"title_canon_sha256":"a6d9f431434b307306ffbc1dd114fa1a1695b464d333828a8478fef7d78e00d9","abstract_canon_sha256":"2fafcc1e0b3f3a4463ca491a2ade9b03c3e890ca9db823b48ec1b6e18e28455f"},"schema_version":"1.0"},"canonical_sha256":"d34f06963f7031698228753fa817b23d7effe6879845df1d683966e483902fa4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:59.279417Z","signature_b64":"IbqSBGLUe/3EBNcA/4oGMFVCoRlnHbgt4+V7az1pt1tbVYqL+7ccHM8jl6Jrfr/hSMXbsAmQOJidejwy9mJRDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d34f06963f7031698228753fa817b23d7effe6879845df1d683966e483902fa4","last_reissued_at":"2026-05-18T01:10:59.278800Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:59.278800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.03557","source_version":2,"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-18T01:10:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GK54RTsvvjTixwqCByU7BpNNvIKWa9OZqZcsd5EUVSLAQjWPQzGlOvC3Shr5XsolHTeV5us4yKXiBmgFsF4oAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:17:17.372309Z"},"content_sha256":"69d84cfe15cfcd36f245c9d620b82817a911cd5c8faa932088223097d6da396b","schema_version":"1.0","event_id":"sha256:69d84cfe15cfcd36f245c9d620b82817a911cd5c8faa932088223097d6da396b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2NHQNFR7OAYWTARIOU72QF5SHV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The minimum number of vertices in uniform hypergraphs with given domination number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Patk\\'os, Csilla Bujt\\'as, M\\'at\\'e Vizer, Zsolt Tuza","submitted_at":"2016-03-11T08:17:06Z","abstract_excerpt":"The \\textit{domination number} $\\gamma(\\mathcal{H})$ of a hypergraph $\\mathcal{H}=(V(\\mathcal{H}),E(\\mathcal{H})$ is the minimum size of a subset $D\\subset V(\\mathcal{H}$ of the vertices such that for every $v\\in V(\\mathcal{H})\\setminus D$ there exist a vertex $d \\in D$ and an edge $H\\in E(\\mathcal{H})$ with $v,d\\in H$. We address the problem of finding the minimum number $n(k,\\gamma)$ of vertices that a $k$-uniform hypergraph $\\mathcal{H}$ can have if $\\gamma(\\mathcal{H})\\ge \\gamma$ and $\\mathcal{H}$ does not contain isolated vertices. We prove that $$n(k,\\gamma)=k+\\Theta(k^{1-1/\\gamma})$$ an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03557","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"},"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-18T01:10:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HWlIN4jG3eXvGLKMV7XT+95Dec8jtk2y2GNxk+7KE06TW0LANJmi/SvFTQ5vLC3369OKtE+GcVfHkV/9SUT/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:17:17.372686Z"},"content_sha256":"17e940ecfbd0b5279859a2c5df6e95ad347a0b3dc471efa02abe86622b9da676","schema_version":"1.0","event_id":"sha256:17e940ecfbd0b5279859a2c5df6e95ad347a0b3dc471efa02abe86622b9da676"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2NHQNFR7OAYWTARIOU72QF5SHV/bundle.json","state_url":"https://pith.science/pith/2NHQNFR7OAYWTARIOU72QF5SHV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2NHQNFR7OAYWTARIOU72QF5SHV/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-05-30T07:17:17Z","links":{"resolver":"https://pith.science/pith/2NHQNFR7OAYWTARIOU72QF5SHV","bundle":"https://pith.science/pith/2NHQNFR7OAYWTARIOU72QF5SHV/bundle.json","state":"https://pith.science/pith/2NHQNFR7OAYWTARIOU72QF5SHV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2NHQNFR7OAYWTARIOU72QF5SHV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2NHQNFR7OAYWTARIOU72QF5SHV","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":"2fafcc1e0b3f3a4463ca491a2ade9b03c3e890ca9db823b48ec1b6e18e28455f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-11T08:17:06Z","title_canon_sha256":"a6d9f431434b307306ffbc1dd114fa1a1695b464d333828a8478fef7d78e00d9"},"schema_version":"1.0","source":{"id":"1603.03557","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.03557","created_at":"2026-05-18T01:10:59Z"},{"alias_kind":"arxiv_version","alias_value":"1603.03557v2","created_at":"2026-05-18T01:10:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03557","created_at":"2026-05-18T01:10:59Z"},{"alias_kind":"pith_short_12","alias_value":"2NHQNFR7OAYW","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2NHQNFR7OAYWTARI","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2NHQNFR7","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:17e940ecfbd0b5279859a2c5df6e95ad347a0b3dc471efa02abe86622b9da676","target":"graph","created_at":"2026-05-18T01:10:59Z","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":"The \\textit{domination number} $\\gamma(\\mathcal{H})$ of a hypergraph $\\mathcal{H}=(V(\\mathcal{H}),E(\\mathcal{H})$ is the minimum size of a subset $D\\subset V(\\mathcal{H}$ of the vertices such that for every $v\\in V(\\mathcal{H})\\setminus D$ there exist a vertex $d \\in D$ and an edge $H\\in E(\\mathcal{H})$ with $v,d\\in H$. We address the problem of finding the minimum number $n(k,\\gamma)$ of vertices that a $k$-uniform hypergraph $\\mathcal{H}$ can have if $\\gamma(\\mathcal{H})\\ge \\gamma$ and $\\mathcal{H}$ does not contain isolated vertices. We prove that $$n(k,\\gamma)=k+\\Theta(k^{1-1/\\gamma})$$ an","authors_text":"Bal\\'azs Patk\\'os, Csilla Bujt\\'as, M\\'at\\'e Vizer, Zsolt Tuza","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-11T08:17:06Z","title":"The minimum number of vertices in uniform hypergraphs with given domination number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03557","kind":"arxiv","version":2},"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:69d84cfe15cfcd36f245c9d620b82817a911cd5c8faa932088223097d6da396b","target":"record","created_at":"2026-05-18T01:10:59Z","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":"2fafcc1e0b3f3a4463ca491a2ade9b03c3e890ca9db823b48ec1b6e18e28455f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-11T08:17:06Z","title_canon_sha256":"a6d9f431434b307306ffbc1dd114fa1a1695b464d333828a8478fef7d78e00d9"},"schema_version":"1.0","source":{"id":"1603.03557","kind":"arxiv","version":2}},"canonical_sha256":"d34f06963f7031698228753fa817b23d7effe6879845df1d683966e483902fa4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d34f06963f7031698228753fa817b23d7effe6879845df1d683966e483902fa4","first_computed_at":"2026-05-18T01:10:59.278800Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:59.278800Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IbqSBGLUe/3EBNcA/4oGMFVCoRlnHbgt4+V7az1pt1tbVYqL+7ccHM8jl6Jrfr/hSMXbsAmQOJidejwy9mJRDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:59.279417Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.03557","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69d84cfe15cfcd36f245c9d620b82817a911cd5c8faa932088223097d6da396b","sha256:17e940ecfbd0b5279859a2c5df6e95ad347a0b3dc471efa02abe86622b9da676"],"state_sha256":"9ac0e4a39c83fc3bb15c2336d44085f8d95f429b1f190a63afa9f039aa76c182"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GXCDHzwhWxe2nfoytsqBdVeQGR9qJtUGMuVmwA6DVykSYjUkqk1Uc78FtXlzygEww/aEVBpu56Mj0NdMpZcQDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:17:17.375067Z","bundle_sha256":"a14b6fd57ff0c06011ff28f75bab89fc1cbe518f80c1e5ed1d6624f8b342c4ec"}}