{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:AMW2GQHXUBTMYL4TJFGDDCWXZH","short_pith_number":"pith:AMW2GQHX","schema_version":"1.0","canonical_sha256":"032da340f7a066cc2f93494c318ad7c9e972de32e33367add7d273aec91594f4","source":{"kind":"arxiv","id":"2606.24863","version":1},"attestation_state":"computed","paper":{"title":"Structural Reductions for Monochromatic Matchings and Ramsey Tilings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong Liu, Lanchao Wang, Maksim Turevskii, Zhifei Yan","submitted_at":"2026-06-23T17:44:38Z","abstract_excerpt":"The Alon--Frankl--Lov\\'asz theorem determines the chromatic number of Kneser hypergraphs; equivalently, it gives the sharp minimum size of a monochromatic matching in every \\(r\\)-edge-colouring of the complete \\(t\\)-uniform hypergraph. The known proofs of the exact theorem are topological. We develop a topology-free structural framework for its asymptotic form and for related sparse and tiling problems.\n  Our main theorem shows that every \\(r\\)-colouring of a sufficiently pseudo-random \\(t\\)-graph can be reduced, with only \\(o(n)\\) loss in the largest monochromatic matching, to a colouring of "},"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":"2606.24863","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-23T17:44:38Z","cross_cats_sorted":[],"title_canon_sha256":"6e44895e4a67a5f97eca7db590f4d149641bd2b421436e5c4dafefc4e0a1cadf","abstract_canon_sha256":"08bd465dec18df84b09882133a586cd42394683bc002299d1143560584828307"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T01:15:44.853982Z","signature_b64":"goxdMOAGG9ObGm3IpaIci45arn6oicQgGo2FA+gBcDpuEF8b0Mhgm8gqfSTnxPJ0l0cKqL+59X+wPgrDqg74BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"032da340f7a066cc2f93494c318ad7c9e972de32e33367add7d273aec91594f4","last_reissued_at":"2026-06-24T01:15:44.853597Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T01:15:44.853597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structural Reductions for Monochromatic Matchings and Ramsey Tilings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong Liu, Lanchao Wang, Maksim Turevskii, Zhifei Yan","submitted_at":"2026-06-23T17:44:38Z","abstract_excerpt":"The Alon--Frankl--Lov\\'asz theorem determines the chromatic number of Kneser hypergraphs; equivalently, it gives the sharp minimum size of a monochromatic matching in every \\(r\\)-edge-colouring of the complete \\(t\\)-uniform hypergraph. The known proofs of the exact theorem are topological. We develop a topology-free structural framework for its asymptotic form and for related sparse and tiling problems.\n  Our main theorem shows that every \\(r\\)-colouring of a sufficiently pseudo-random \\(t\\)-graph can be reduced, with only \\(o(n)\\) loss in the largest monochromatic matching, to a colouring of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.24863","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.24863/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.24863","created_at":"2026-06-24T01:15:44.853661+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.24863v1","created_at":"2026-06-24T01:15:44.853661+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24863","created_at":"2026-06-24T01:15:44.853661+00:00"},{"alias_kind":"pith_short_12","alias_value":"AMW2GQHXUBTM","created_at":"2026-06-24T01:15:44.853661+00:00"},{"alias_kind":"pith_short_16","alias_value":"AMW2GQHXUBTMYL4T","created_at":"2026-06-24T01:15:44.853661+00:00"},{"alias_kind":"pith_short_8","alias_value":"AMW2GQHX","created_at":"2026-06-24T01:15:44.853661+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/AMW2GQHXUBTMYL4TJFGDDCWXZH","json":"https://pith.science/pith/AMW2GQHXUBTMYL4TJFGDDCWXZH.json","graph_json":"https://pith.science/api/pith-number/AMW2GQHXUBTMYL4TJFGDDCWXZH/graph.json","events_json":"https://pith.science/api/pith-number/AMW2GQHXUBTMYL4TJFGDDCWXZH/events.json","paper":"https://pith.science/paper/AMW2GQHX"},"agent_actions":{"view_html":"https://pith.science/pith/AMW2GQHXUBTMYL4TJFGDDCWXZH","download_json":"https://pith.science/pith/AMW2GQHXUBTMYL4TJFGDDCWXZH.json","view_paper":"https://pith.science/paper/AMW2GQHX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.24863&json=true","fetch_graph":"https://pith.science/api/pith-number/AMW2GQHXUBTMYL4TJFGDDCWXZH/graph.json","fetch_events":"https://pith.science/api/pith-number/AMW2GQHXUBTMYL4TJFGDDCWXZH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AMW2GQHXUBTMYL4TJFGDDCWXZH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AMW2GQHXUBTMYL4TJFGDDCWXZH/action/storage_attestation","attest_author":"https://pith.science/pith/AMW2GQHXUBTMYL4TJFGDDCWXZH/action/author_attestation","sign_citation":"https://pith.science/pith/AMW2GQHXUBTMYL4TJFGDDCWXZH/action/citation_signature","submit_replication":"https://pith.science/pith/AMW2GQHXUBTMYL4TJFGDDCWXZH/action/replication_record"}},"created_at":"2026-06-24T01:15:44.853661+00:00","updated_at":"2026-06-24T01:15:44.853661+00:00"}