{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:A6BSPEHMZXEAPDD24TTVCRUJUW","short_pith_number":"pith:A6BSPEHM","schema_version":"1.0","canonical_sha256":"07832790eccdc8078c7ae4e7514689a5956d62e337a8faf38bc475e5d4d453e9","source":{"kind":"arxiv","id":"1611.06629","version":1},"attestation_state":"computed","paper":{"title":"Extremal hypergraphs for matching number and domination number","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":"2016-11-21T01:42:55Z","abstract_excerpt":"A matching in a hypergraph $\\mathcal{H}$ is a set of pairwise disjoint hyperedges. The matching number $\\nu(\\mathcal{H})$ of $\\mathcal{H}$ is the size of a maximum matching in $\\mathcal{H}$. A subset $D$ of vertices of $\\mathcal{H}$ is a dominating set of $\\mathcal{H}$ if for every $v\\in V\\setminus D$ there exists $u\\in D$ such that $u$ and $v$ lie in an hyperedge of $\\mathcal{H}$. The cardinality of a minimum dominating set of $\\mathcal{H}$ is the domination number of $\\mathcal{H}$, denoted by $\\gamma(\\mathcal{H})$. It was proved that $\\gamma(\\mathcal{H})\\leq (r-1)\\nu(\\mathcal{H})$ for $r$-un"},"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":"1611.06629","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-21T01:42:55Z","cross_cats_sorted":[],"title_canon_sha256":"ba0fe40d8f26ffbdcff40955f696be9e2dc23cb18d838a17271161b5ae27bf47","abstract_canon_sha256":"046846d725c94bf360b560bfd548db5fd5bcd65cc8c4eacffcae8cdbc252d79f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:33.324179Z","signature_b64":"7ruZ9ZIj2KUTHoU9sVWTu22Yr+5sUMGpytZcspF0LtSdg0s2OsP55F9OJqecsjsNDKoB9yMYaiNyzXMYHeCpDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07832790eccdc8078c7ae4e7514689a5956d62e337a8faf38bc475e5d4d453e9","last_reissued_at":"2026-05-18T00:57:33.323769Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:33.323769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extremal hypergraphs for matching number and domination number","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":"2016-11-21T01:42:55Z","abstract_excerpt":"A matching in a hypergraph $\\mathcal{H}$ is a set of pairwise disjoint hyperedges. The matching number $\\nu(\\mathcal{H})$ of $\\mathcal{H}$ is the size of a maximum matching in $\\mathcal{H}$. A subset $D$ of vertices of $\\mathcal{H}$ is a dominating set of $\\mathcal{H}$ if for every $v\\in V\\setminus D$ there exists $u\\in D$ such that $u$ and $v$ lie in an hyperedge of $\\mathcal{H}$. The cardinality of a minimum dominating set of $\\mathcal{H}$ is the domination number of $\\mathcal{H}$, denoted by $\\gamma(\\mathcal{H})$. It was proved that $\\gamma(\\mathcal{H})\\leq (r-1)\\nu(\\mathcal{H})$ for $r$-un"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06629","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":"1611.06629","created_at":"2026-05-18T00:57:33.323833+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.06629v1","created_at":"2026-05-18T00:57:33.323833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06629","created_at":"2026-05-18T00:57:33.323833+00:00"},{"alias_kind":"pith_short_12","alias_value":"A6BSPEHMZXEA","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"A6BSPEHMZXEAPDD2","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"A6BSPEHM","created_at":"2026-05-18T12:30:04.600751+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/A6BSPEHMZXEAPDD24TTVCRUJUW","json":"https://pith.science/pith/A6BSPEHMZXEAPDD24TTVCRUJUW.json","graph_json":"https://pith.science/api/pith-number/A6BSPEHMZXEAPDD24TTVCRUJUW/graph.json","events_json":"https://pith.science/api/pith-number/A6BSPEHMZXEAPDD24TTVCRUJUW/events.json","paper":"https://pith.science/paper/A6BSPEHM"},"agent_actions":{"view_html":"https://pith.science/pith/A6BSPEHMZXEAPDD24TTVCRUJUW","download_json":"https://pith.science/pith/A6BSPEHMZXEAPDD24TTVCRUJUW.json","view_paper":"https://pith.science/paper/A6BSPEHM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.06629&json=true","fetch_graph":"https://pith.science/api/pith-number/A6BSPEHMZXEAPDD24TTVCRUJUW/graph.json","fetch_events":"https://pith.science/api/pith-number/A6BSPEHMZXEAPDD24TTVCRUJUW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A6BSPEHMZXEAPDD24TTVCRUJUW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A6BSPEHMZXEAPDD24TTVCRUJUW/action/storage_attestation","attest_author":"https://pith.science/pith/A6BSPEHMZXEAPDD24TTVCRUJUW/action/author_attestation","sign_citation":"https://pith.science/pith/A6BSPEHMZXEAPDD24TTVCRUJUW/action/citation_signature","submit_replication":"https://pith.science/pith/A6BSPEHMZXEAPDD24TTVCRUJUW/action/replication_record"}},"created_at":"2026-05-18T00:57:33.323833+00:00","updated_at":"2026-05-18T00:57:33.323833+00:00"}