{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:YFRHUR4Q74DQTFNXUIUQIKKPXC","short_pith_number":"pith:YFRHUR4Q","canonical_record":{"source":{"id":"2605.26060","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-25T17:19:09Z","cross_cats_sorted":[],"title_canon_sha256":"db0ceea3a7755ca630ea6b6fc95350efd0e04da7cc7a4dbe883d5f51174268f8","abstract_canon_sha256":"127253c0c5363a5f90a977b9918dfba7c79780f2c8ccb9604d18d4d7e19cc069"},"schema_version":"1.0"},"canonical_sha256":"c1627a4790ff070995b7a22904294fb88389d049b5709d5a842c4e61130b9edc","source":{"kind":"arxiv","id":"2605.26060","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.26060","created_at":"2026-05-26T02:05:25Z"},{"alias_kind":"arxiv_version","alias_value":"2605.26060v1","created_at":"2026-05-26T02:05:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.26060","created_at":"2026-05-26T02:05:25Z"},{"alias_kind":"pith_short_12","alias_value":"YFRHUR4Q74DQ","created_at":"2026-05-26T02:05:25Z"},{"alias_kind":"pith_short_16","alias_value":"YFRHUR4Q74DQTFNX","created_at":"2026-05-26T02:05:25Z"},{"alias_kind":"pith_short_8","alias_value":"YFRHUR4Q","created_at":"2026-05-26T02:05:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:YFRHUR4Q74DQTFNXUIUQIKKPXC","target":"record","payload":{"canonical_record":{"source":{"id":"2605.26060","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-25T17:19:09Z","cross_cats_sorted":[],"title_canon_sha256":"db0ceea3a7755ca630ea6b6fc95350efd0e04da7cc7a4dbe883d5f51174268f8","abstract_canon_sha256":"127253c0c5363a5f90a977b9918dfba7c79780f2c8ccb9604d18d4d7e19cc069"},"schema_version":"1.0"},"canonical_sha256":"c1627a4790ff070995b7a22904294fb88389d049b5709d5a842c4e61130b9edc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:05:25.293563Z","signature_b64":"RiaEDkGFklm0iwx1V+QO9X1nbRdmP+VzEKa3T68hhp5AUgB3FCcQpnJW23/TUyElirDwLnfU9+pBA9nm8HL4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1627a4790ff070995b7a22904294fb88389d049b5709d5a842c4e61130b9edc","last_reissued_at":"2026-05-26T02:05:25.292908Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:05:25.292908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.26060","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-26T02:05:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0lvuACfrJmPoVPyUCupVmtfwgx4PN6AsV2AkMZDBFa2vKeRhqW6Fz0dTXaZz+4vFY5OvPNx7JNJ59H7tVODRAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T02:21:39.341132Z"},"content_sha256":"2d52441b53b7ad149d8f13482009b452bb9abbbf0280db6304105f476474998d","schema_version":"1.0","event_id":"sha256:2d52441b53b7ad149d8f13482009b452bb9abbbf0280db6304105f476474998d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:YFRHUR4Q74DQTFNXUIUQIKKPXC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A finite-board reduction for the Erd\\H{o}s Matching Conjecture and the 4-uniform case via exact certificates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Caiyun Hu, Jianfeng Hou, Xizhi Liu","submitted_at":"2026-05-25T17:19:09Z","abstract_excerpt":"We prove the 4-uniform Erd\\H{o}s Matching Conjecture for every matching number $s\\ge 6961$. The proof has two parts. First, building on ideas from Frankl--R\\\"odl--Ruci\\'nski, we formulate a general finite-board criterion for the $r$-uniform conjecture. The criterion has two assumptions: the $(r-1)$-uniform cover-side bound for links with matching number at most $t$ holds at every $m\\ge n_r(t)$, and a finite optimization problem for mixed-size trace configurations on an $(r^2+r-1)$-vertex board. Together with the corresponding lower-uniformity input, this finite-board optimization implies the E"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.26060","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/2605.26060/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"},"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-26T02:05:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rvQ1RZhHZdaXXP9qKFl4hupCXHoSKbZjmO4YdqHKlrnV5c9x8RHmNnNSbs+A3SuuFluXI47YnUJV4ZUjLQg2CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T02:21:39.341514Z"},"content_sha256":"71d800dae5f70513f4e5bc559dd6789265d9805dc942e7a9370efc24636e50b3","schema_version":"1.0","event_id":"sha256:71d800dae5f70513f4e5bc559dd6789265d9805dc942e7a9370efc24636e50b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YFRHUR4Q74DQTFNXUIUQIKKPXC/bundle.json","state_url":"https://pith.science/pith/YFRHUR4Q74DQTFNXUIUQIKKPXC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YFRHUR4Q74DQTFNXUIUQIKKPXC/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-06-29T02:21:39Z","links":{"resolver":"https://pith.science/pith/YFRHUR4Q74DQTFNXUIUQIKKPXC","bundle":"https://pith.science/pith/YFRHUR4Q74DQTFNXUIUQIKKPXC/bundle.json","state":"https://pith.science/pith/YFRHUR4Q74DQTFNXUIUQIKKPXC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YFRHUR4Q74DQTFNXUIUQIKKPXC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:YFRHUR4Q74DQTFNXUIUQIKKPXC","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":"127253c0c5363a5f90a977b9918dfba7c79780f2c8ccb9604d18d4d7e19cc069","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-25T17:19:09Z","title_canon_sha256":"db0ceea3a7755ca630ea6b6fc95350efd0e04da7cc7a4dbe883d5f51174268f8"},"schema_version":"1.0","source":{"id":"2605.26060","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.26060","created_at":"2026-05-26T02:05:25Z"},{"alias_kind":"arxiv_version","alias_value":"2605.26060v1","created_at":"2026-05-26T02:05:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.26060","created_at":"2026-05-26T02:05:25Z"},{"alias_kind":"pith_short_12","alias_value":"YFRHUR4Q74DQ","created_at":"2026-05-26T02:05:25Z"},{"alias_kind":"pith_short_16","alias_value":"YFRHUR4Q74DQTFNX","created_at":"2026-05-26T02:05:25Z"},{"alias_kind":"pith_short_8","alias_value":"YFRHUR4Q","created_at":"2026-05-26T02:05:25Z"}],"graph_snapshots":[{"event_id":"sha256:71d800dae5f70513f4e5bc559dd6789265d9805dc942e7a9370efc24636e50b3","target":"graph","created_at":"2026-05-26T02:05:25Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.26060/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove the 4-uniform Erd\\H{o}s Matching Conjecture for every matching number $s\\ge 6961$. The proof has two parts. First, building on ideas from Frankl--R\\\"odl--Ruci\\'nski, we formulate a general finite-board criterion for the $r$-uniform conjecture. The criterion has two assumptions: the $(r-1)$-uniform cover-side bound for links with matching number at most $t$ holds at every $m\\ge n_r(t)$, and a finite optimization problem for mixed-size trace configurations on an $(r^2+r-1)$-vertex board. Together with the corresponding lower-uniformity input, this finite-board optimization implies the E","authors_text":"Caiyun Hu, Jianfeng Hou, Xizhi Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-25T17:19:09Z","title":"A finite-board reduction for the Erd\\H{o}s Matching Conjecture and the 4-uniform case via exact certificates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.26060","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:2d52441b53b7ad149d8f13482009b452bb9abbbf0280db6304105f476474998d","target":"record","created_at":"2026-05-26T02:05:25Z","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":"127253c0c5363a5f90a977b9918dfba7c79780f2c8ccb9604d18d4d7e19cc069","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-25T17:19:09Z","title_canon_sha256":"db0ceea3a7755ca630ea6b6fc95350efd0e04da7cc7a4dbe883d5f51174268f8"},"schema_version":"1.0","source":{"id":"2605.26060","kind":"arxiv","version":1}},"canonical_sha256":"c1627a4790ff070995b7a22904294fb88389d049b5709d5a842c4e61130b9edc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1627a4790ff070995b7a22904294fb88389d049b5709d5a842c4e61130b9edc","first_computed_at":"2026-05-26T02:05:25.292908Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T02:05:25.292908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RiaEDkGFklm0iwx1V+QO9X1nbRdmP+VzEKa3T68hhp5AUgB3FCcQpnJW23/TUyElirDwLnfU9+pBA9nm8HL4Ag==","signature_status":"signed_v1","signed_at":"2026-05-26T02:05:25.293563Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.26060","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d52441b53b7ad149d8f13482009b452bb9abbbf0280db6304105f476474998d","sha256:71d800dae5f70513f4e5bc559dd6789265d9805dc942e7a9370efc24636e50b3"],"state_sha256":"841658a3c859d689fc65917faa0485dec8374a8e41a53100812b597165150b04"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WATYuQZ8zL/NX+f+Ko76JGJ9om6WVK1cheiO5Lx4Mke5v7TFpRQ+XihX+jbI0pH9oSop/C+szcvDHzRDcjw8AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T02:21:39.343470Z","bundle_sha256":"a970e1100ba5fb0b63c691f93921b67de1284aa22aa9e8b0d3df262f1692bc7d"}}