{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:73YSQQAPD25DPLDI5QCV4K5GUI","short_pith_number":"pith:73YSQQAP","schema_version":"1.0","canonical_sha256":"fef128400f1eba37ac68ec055e2ba6a219f4dc1b94c50340dc45d5ad1cd0ab7a","source":{"kind":"arxiv","id":"1808.04954","version":1},"attestation_state":"computed","paper":{"title":"Rainbow matchings in properly-colored hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guanghui Wang, Hao Huang, Tong Li","submitted_at":"2018-08-15T03:13:17Z","abstract_excerpt":"A hypergraph $H$ is properly colored if for every vertex $v\\in V(H)$, all the edges incident to $v$ have distinct colors. In this paper, we show that if $H_{1}$, \\cdots, $H_{s}$ are properly-colored $k$-uniform hypergraphs on $n$ vertices, where $n\\geq3k^{2}s$, and $e(H_{i})>{{n}\\choose {k}}-{{n-s+1}\\choose {k}}$, then there exists a rainbow matching of size $s$, containing one edge from each $H_i$. This generalizes some previous results on the Erd\\H{o}s Matching Conjecture."},"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":"1808.04954","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-15T03:13:17Z","cross_cats_sorted":[],"title_canon_sha256":"42f04966f6d3541acca7e66e1209e0745b8cb42e27d034490aa38acc031170bf","abstract_canon_sha256":"14aa62697498bb61dfaad940f657b2677780b224d8b5f89a52762c76d813548f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:02.064857Z","signature_b64":"NUbhbB24MiBStObvAJt/iOGtQvLiSwLisre7cQoO7Jgkiz0TQZ4vuClU0J+gJw9+fwrBDgLIW9u8xSP/AGweDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fef128400f1eba37ac68ec055e2ba6a219f4dc1b94c50340dc45d5ad1cd0ab7a","last_reissued_at":"2026-05-18T00:08:02.064225Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:02.064225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rainbow matchings in properly-colored hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guanghui Wang, Hao Huang, Tong Li","submitted_at":"2018-08-15T03:13:17Z","abstract_excerpt":"A hypergraph $H$ is properly colored if for every vertex $v\\in V(H)$, all the edges incident to $v$ have distinct colors. In this paper, we show that if $H_{1}$, \\cdots, $H_{s}$ are properly-colored $k$-uniform hypergraphs on $n$ vertices, where $n\\geq3k^{2}s$, and $e(H_{i})>{{n}\\choose {k}}-{{n-s+1}\\choose {k}}$, then there exists a rainbow matching of size $s$, containing one edge from each $H_i$. This generalizes some previous results on the Erd\\H{o}s Matching Conjecture."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04954","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":"1808.04954","created_at":"2026-05-18T00:08:02.064336+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.04954v1","created_at":"2026-05-18T00:08:02.064336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04954","created_at":"2026-05-18T00:08:02.064336+00:00"},{"alias_kind":"pith_short_12","alias_value":"73YSQQAPD25D","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"73YSQQAPD25DPLDI","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"73YSQQAP","created_at":"2026-05-18T12:32:11.075285+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/73YSQQAPD25DPLDI5QCV4K5GUI","json":"https://pith.science/pith/73YSQQAPD25DPLDI5QCV4K5GUI.json","graph_json":"https://pith.science/api/pith-number/73YSQQAPD25DPLDI5QCV4K5GUI/graph.json","events_json":"https://pith.science/api/pith-number/73YSQQAPD25DPLDI5QCV4K5GUI/events.json","paper":"https://pith.science/paper/73YSQQAP"},"agent_actions":{"view_html":"https://pith.science/pith/73YSQQAPD25DPLDI5QCV4K5GUI","download_json":"https://pith.science/pith/73YSQQAPD25DPLDI5QCV4K5GUI.json","view_paper":"https://pith.science/paper/73YSQQAP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.04954&json=true","fetch_graph":"https://pith.science/api/pith-number/73YSQQAPD25DPLDI5QCV4K5GUI/graph.json","fetch_events":"https://pith.science/api/pith-number/73YSQQAPD25DPLDI5QCV4K5GUI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/73YSQQAPD25DPLDI5QCV4K5GUI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/73YSQQAPD25DPLDI5QCV4K5GUI/action/storage_attestation","attest_author":"https://pith.science/pith/73YSQQAPD25DPLDI5QCV4K5GUI/action/author_attestation","sign_citation":"https://pith.science/pith/73YSQQAPD25DPLDI5QCV4K5GUI/action/citation_signature","submit_replication":"https://pith.science/pith/73YSQQAPD25DPLDI5QCV4K5GUI/action/replication_record"}},"created_at":"2026-05-18T00:08:02.064336+00:00","updated_at":"2026-05-18T00:08:02.064336+00:00"}