{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SEFB6MFHD4S6VS356AFM4WAVSF","short_pith_number":"pith:SEFB6MFH","schema_version":"1.0","canonical_sha256":"910a1f30a71f25eacb7df00ace58159154e30d531559686f0f58fe09a6215fd7","source":{"kind":"arxiv","id":"1512.02871","version":1},"attestation_state":"computed","paper":{"title":"Matching criticality 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, Zhenyu Ni","submitted_at":"2015-12-09T14:25:16Z","abstract_excerpt":"A matching in a hypergraph $H$ is a set of pairwise vertex disjoint edges in $H$ and the matching number of $H$ is the maximum cardinality of a matching in $H$. A transversal in $H$ is a subset of vertices in $H$ that has a nonempty intersection with every edge of $H$. The transversal number $\\tau(H)$ of $H$ is the minimum cardinality of a transversal in $H$. A hypergraph $H$ is an intersecting hypergraph if every two distinct edges of $H$ have a non-empty intersection. Equivalently, $H$ is an intersecting hypergraph if and only if it has matching number one. In this paper we study the extrema"},"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":"1512.02871","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-09T14:25:16Z","cross_cats_sorted":[],"title_canon_sha256":"18dabeef1e661e1710b171e039f6c05ad486b3ce9208ec221e4aa31c20adbddf","abstract_canon_sha256":"fa2cb18c827e026982010c2e4b03fb07a647db87d13c617bd1fa918acf6b7583"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:39.287298Z","signature_b64":"VzvfdZ9vE4bfMyk6W9BxVAkcEv5JFLlC7vNAEnuhLdT6x5E9UABTYWNq4fvbNbsaRodhskS+DAPqp1ZEBTTYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"910a1f30a71f25eacb7df00ace58159154e30d531559686f0f58fe09a6215fd7","last_reissued_at":"2026-05-18T01:24:39.286932Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:39.286932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matching criticality 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, Zhenyu Ni","submitted_at":"2015-12-09T14:25:16Z","abstract_excerpt":"A matching in a hypergraph $H$ is a set of pairwise vertex disjoint edges in $H$ and the matching number of $H$ is the maximum cardinality of a matching in $H$. A transversal in $H$ is a subset of vertices in $H$ that has a nonempty intersection with every edge of $H$. The transversal number $\\tau(H)$ of $H$ is the minimum cardinality of a transversal in $H$. A hypergraph $H$ is an intersecting hypergraph if every two distinct edges of $H$ have a non-empty intersection. Equivalently, $H$ is an intersecting hypergraph if and only if it has matching number one. In this paper we study the extrema"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02871","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":"1512.02871","created_at":"2026-05-18T01:24:39.286991+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.02871v1","created_at":"2026-05-18T01:24:39.286991+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02871","created_at":"2026-05-18T01:24:39.286991+00:00"},{"alias_kind":"pith_short_12","alias_value":"SEFB6MFHD4S6","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"SEFB6MFHD4S6VS35","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"SEFB6MFH","created_at":"2026-05-18T12:29:39.896362+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/SEFB6MFHD4S6VS356AFM4WAVSF","json":"https://pith.science/pith/SEFB6MFHD4S6VS356AFM4WAVSF.json","graph_json":"https://pith.science/api/pith-number/SEFB6MFHD4S6VS356AFM4WAVSF/graph.json","events_json":"https://pith.science/api/pith-number/SEFB6MFHD4S6VS356AFM4WAVSF/events.json","paper":"https://pith.science/paper/SEFB6MFH"},"agent_actions":{"view_html":"https://pith.science/pith/SEFB6MFHD4S6VS356AFM4WAVSF","download_json":"https://pith.science/pith/SEFB6MFHD4S6VS356AFM4WAVSF.json","view_paper":"https://pith.science/paper/SEFB6MFH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.02871&json=true","fetch_graph":"https://pith.science/api/pith-number/SEFB6MFHD4S6VS356AFM4WAVSF/graph.json","fetch_events":"https://pith.science/api/pith-number/SEFB6MFHD4S6VS356AFM4WAVSF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SEFB6MFHD4S6VS356AFM4WAVSF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SEFB6MFHD4S6VS356AFM4WAVSF/action/storage_attestation","attest_author":"https://pith.science/pith/SEFB6MFHD4S6VS356AFM4WAVSF/action/author_attestation","sign_citation":"https://pith.science/pith/SEFB6MFHD4S6VS356AFM4WAVSF/action/citation_signature","submit_replication":"https://pith.science/pith/SEFB6MFHD4S6VS356AFM4WAVSF/action/replication_record"}},"created_at":"2026-05-18T01:24:39.286991+00:00","updated_at":"2026-05-18T01:24:39.286991+00:00"}