{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SEFB6MFHD4S6VS356AFM4WAVSF","short_pith_number":"pith:SEFB6MFH","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"},"canonical_sha256":"910a1f30a71f25eacb7df00ace58159154e30d531559686f0f58fe09a6215fd7","source":{"kind":"arxiv","id":"1512.02871","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02871","created_at":"2026-05-18T01:24:39Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02871v1","created_at":"2026-05-18T01:24:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02871","created_at":"2026-05-18T01:24:39Z"},{"alias_kind":"pith_short_12","alias_value":"SEFB6MFHD4S6","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"SEFB6MFHD4S6VS35","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"SEFB6MFH","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SEFB6MFHD4S6VS356AFM4WAVSF","target":"record","payload":{"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"},"canonical_sha256":"910a1f30a71f25eacb7df00ace58159154e30d531559686f0f58fe09a6215fd7","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"},"source_kind":"arxiv","source_id":"1512.02871","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-18T01:24:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JKmEpYZZjIAyHsd6L6MJjny0fqKGSvGsTPlUA6z+5n/XnFRbZymEviK1+IeIZNnhdSq/jBW0j0MospmTvFW0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:31:32.049753Z"},"content_sha256":"e35dc21091481e3f4d6845a4f0f1cff9864b1dae0974f4e9457057de945167c7","schema_version":"1.0","event_id":"sha256:e35dc21091481e3f4d6845a4f0f1cff9864b1dae0974f4e9457057de945167c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SEFB6MFHD4S6VS356AFM4WAVSF","target":"graph","payload":{"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"},"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:24:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XQqrw6PTjqQY5gF81BKdyRJbpr/2QoYE1LckwJF9IzaVoKb6Hu9IVz7tQKikw8JWmP2btmjyOnrg0BfPyI6eDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:31:32.050426Z"},"content_sha256":"86f81a16d1a306dc53359955841548aeee278cfe052567f294b3cb6e547db92e","schema_version":"1.0","event_id":"sha256:86f81a16d1a306dc53359955841548aeee278cfe052567f294b3cb6e547db92e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SEFB6MFHD4S6VS356AFM4WAVSF/bundle.json","state_url":"https://pith.science/pith/SEFB6MFHD4S6VS356AFM4WAVSF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SEFB6MFHD4S6VS356AFM4WAVSF/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-27T05:31:32Z","links":{"resolver":"https://pith.science/pith/SEFB6MFHD4S6VS356AFM4WAVSF","bundle":"https://pith.science/pith/SEFB6MFHD4S6VS356AFM4WAVSF/bundle.json","state":"https://pith.science/pith/SEFB6MFHD4S6VS356AFM4WAVSF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SEFB6MFHD4S6VS356AFM4WAVSF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SEFB6MFHD4S6VS356AFM4WAVSF","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":"fa2cb18c827e026982010c2e4b03fb07a647db87d13c617bd1fa918acf6b7583","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-09T14:25:16Z","title_canon_sha256":"18dabeef1e661e1710b171e039f6c05ad486b3ce9208ec221e4aa31c20adbddf"},"schema_version":"1.0","source":{"id":"1512.02871","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02871","created_at":"2026-05-18T01:24:39Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02871v1","created_at":"2026-05-18T01:24:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02871","created_at":"2026-05-18T01:24:39Z"},{"alias_kind":"pith_short_12","alias_value":"SEFB6MFHD4S6","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"SEFB6MFHD4S6VS35","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"SEFB6MFH","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:86f81a16d1a306dc53359955841548aeee278cfe052567f294b3cb6e547db92e","target":"graph","created_at":"2026-05-18T01:24:39Z","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":"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","authors_text":"Erfang Shan, Liying Kang, Zhenyu Ni","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-09T14:25:16Z","title":"Matching criticality in intersecting hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02871","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:e35dc21091481e3f4d6845a4f0f1cff9864b1dae0974f4e9457057de945167c7","target":"record","created_at":"2026-05-18T01:24:39Z","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":"fa2cb18c827e026982010c2e4b03fb07a647db87d13c617bd1fa918acf6b7583","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-12-09T14:25:16Z","title_canon_sha256":"18dabeef1e661e1710b171e039f6c05ad486b3ce9208ec221e4aa31c20adbddf"},"schema_version":"1.0","source":{"id":"1512.02871","kind":"arxiv","version":1}},"canonical_sha256":"910a1f30a71f25eacb7df00ace58159154e30d531559686f0f58fe09a6215fd7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"910a1f30a71f25eacb7df00ace58159154e30d531559686f0f58fe09a6215fd7","first_computed_at":"2026-05-18T01:24:39.286932Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:39.286932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VzvfdZ9vE4bfMyk6W9BxVAkcEv5JFLlC7vNAEnuhLdT6x5E9UABTYWNq4fvbNbsaRodhskS+DAPqp1ZEBTTYDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:39.287298Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.02871","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e35dc21091481e3f4d6845a4f0f1cff9864b1dae0974f4e9457057de945167c7","sha256:86f81a16d1a306dc53359955841548aeee278cfe052567f294b3cb6e547db92e"],"state_sha256":"383d2c3fcda6228e635a5348407f2ae292dd162e024fabe227336e30f2f2dee6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9JKDbTQXdOR6TjF8azjRxIngwpqdys4PChGYhPCBsz1di8GvROlRYBgpAOOKlVRkvB/RRSyH8Gg5wCym8n/DBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:31:32.053755Z","bundle_sha256":"9349459f746305155f1cc3a21770056ac60c809f504138be9362214fc7e1e642"}}