{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PGDUMSZK47M5QYEN5K7ONFIYN2","short_pith_number":"pith:PGDUMSZK","schema_version":"1.0","canonical_sha256":"7987464b2ae7d9d8608deabee695186ea10f090e06d4aaf930694997e50158a1","source":{"kind":"arxiv","id":"1701.01564","version":1},"attestation_state":"computed","paper":{"title":"Domination in intersecting hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Erfang Shan, Liying Kang, Shan Li, Yanxia Dong","submitted_at":"2017-01-06T08:17:35Z","abstract_excerpt":"A matching in a hypergraph $H$ is a set of pairwise disjoint hyperedges. The matching number $\\alpha'(H)$ of $H$ is the size of a maximum matching in $H$. A subset $D$ of vertices of $H$ is a dominating set of $H$ if for every $v\\in V\\setminus D$ there exists $u\\in D$ such that $u$ and $v$ lie in an hyperedge of $H$. The cardinality of a minimum dominating set of $H$ is called the domination number of $H$, denoted by $\\gamma(H)$. It is known that for a intersecting hypergraph $H$ with rank $r$, $\\gamma(H)\\leq r-1$. In this paper we present structural properties on intersecting hypergraphs with"},"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":"1701.01564","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-06T08:17:35Z","cross_cats_sorted":[],"title_canon_sha256":"ee3331967db7f1eb49ea0cb32d4773e4e308d41ebdc333c451ce8fe41d4c6666","abstract_canon_sha256":"1508c3e8e5ac516e4b9f14fc3fcd8bd8655aa8dea876a4f1a9eb3e976ba3fc5f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:16.533513Z","signature_b64":"Giv0dTZLHZHp9ns/V2AUE0tWgdfugcIhTM16p80xFEYKnCy8J/N17MZSoOWBW/cBDmdElOsgLL2eZ5KXGGPCCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7987464b2ae7d9d8608deabee695186ea10f090e06d4aaf930694997e50158a1","last_reissued_at":"2026-05-18T00:53:16.533026Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:16.533026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Domination in intersecting hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Erfang Shan, Liying Kang, Shan Li, Yanxia Dong","submitted_at":"2017-01-06T08:17:35Z","abstract_excerpt":"A matching in a hypergraph $H$ is a set of pairwise disjoint hyperedges. The matching number $\\alpha'(H)$ of $H$ is the size of a maximum matching in $H$. A subset $D$ of vertices of $H$ is a dominating set of $H$ if for every $v\\in V\\setminus D$ there exists $u\\in D$ such that $u$ and $v$ lie in an hyperedge of $H$. The cardinality of a minimum dominating set of $H$ is called the domination number of $H$, denoted by $\\gamma(H)$. It is known that for a intersecting hypergraph $H$ with rank $r$, $\\gamma(H)\\leq r-1$. In this paper we present structural properties on intersecting hypergraphs with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01564","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":"1701.01564","created_at":"2026-05-18T00:53:16.533112+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.01564v1","created_at":"2026-05-18T00:53:16.533112+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01564","created_at":"2026-05-18T00:53:16.533112+00:00"},{"alias_kind":"pith_short_12","alias_value":"PGDUMSZK47M5","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PGDUMSZK47M5QYEN","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PGDUMSZK","created_at":"2026-05-18T12:31:37.085036+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/PGDUMSZK47M5QYEN5K7ONFIYN2","json":"https://pith.science/pith/PGDUMSZK47M5QYEN5K7ONFIYN2.json","graph_json":"https://pith.science/api/pith-number/PGDUMSZK47M5QYEN5K7ONFIYN2/graph.json","events_json":"https://pith.science/api/pith-number/PGDUMSZK47M5QYEN5K7ONFIYN2/events.json","paper":"https://pith.science/paper/PGDUMSZK"},"agent_actions":{"view_html":"https://pith.science/pith/PGDUMSZK47M5QYEN5K7ONFIYN2","download_json":"https://pith.science/pith/PGDUMSZK47M5QYEN5K7ONFIYN2.json","view_paper":"https://pith.science/paper/PGDUMSZK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.01564&json=true","fetch_graph":"https://pith.science/api/pith-number/PGDUMSZK47M5QYEN5K7ONFIYN2/graph.json","fetch_events":"https://pith.science/api/pith-number/PGDUMSZK47M5QYEN5K7ONFIYN2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PGDUMSZK47M5QYEN5K7ONFIYN2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PGDUMSZK47M5QYEN5K7ONFIYN2/action/storage_attestation","attest_author":"https://pith.science/pith/PGDUMSZK47M5QYEN5K7ONFIYN2/action/author_attestation","sign_citation":"https://pith.science/pith/PGDUMSZK47M5QYEN5K7ONFIYN2/action/citation_signature","submit_replication":"https://pith.science/pith/PGDUMSZK47M5QYEN5K7ONFIYN2/action/replication_record"}},"created_at":"2026-05-18T00:53:16.533112+00:00","updated_at":"2026-05-18T00:53:16.533112+00:00"}