{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:WUDLFQNZAQN2BLGINSICBRNN5T","short_pith_number":"pith:WUDLFQNZ","canonical_record":{"source":{"id":"2505.17981","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-23T14:47:33Z","cross_cats_sorted":[],"title_canon_sha256":"0fee931573ae809a7a05f7e9f73974429c9bd06d798e07be5a57c40f750ed0fa","abstract_canon_sha256":"60d795b47f85857d95e541ff29bcb6e8c6138604cdfbde36265bab0c4719fcd8"},"schema_version":"1.0"},"canonical_sha256":"b506b2c1b9041ba0acc86c9020c5adecf2714cd99de138a4da228208ccd41527","source":{"kind":"arxiv","id":"2505.17981","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.17981","created_at":"2026-07-05T11:08:34Z"},{"alias_kind":"arxiv_version","alias_value":"2505.17981v1","created_at":"2026-07-05T11:08:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.17981","created_at":"2026-07-05T11:08:34Z"},{"alias_kind":"pith_short_12","alias_value":"WUDLFQNZAQN2","created_at":"2026-07-05T11:08:34Z"},{"alias_kind":"pith_short_16","alias_value":"WUDLFQNZAQN2BLGI","created_at":"2026-07-05T11:08:34Z"},{"alias_kind":"pith_short_8","alias_value":"WUDLFQNZ","created_at":"2026-07-05T11:08:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:WUDLFQNZAQN2BLGINSICBRNN5T","target":"record","payload":{"canonical_record":{"source":{"id":"2505.17981","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-23T14:47:33Z","cross_cats_sorted":[],"title_canon_sha256":"0fee931573ae809a7a05f7e9f73974429c9bd06d798e07be5a57c40f750ed0fa","abstract_canon_sha256":"60d795b47f85857d95e541ff29bcb6e8c6138604cdfbde36265bab0c4719fcd8"},"schema_version":"1.0"},"canonical_sha256":"b506b2c1b9041ba0acc86c9020c5adecf2714cd99de138a4da228208ccd41527","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:08:34.661283Z","signature_b64":"oyEn3cHiLfqS2mvvOjEn8t0AGG7TEMIS+SFglX/SrpSXeHDEuJ+6bXdvRbuOA5UnWtmX/oNsxbiiD+islTkHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b506b2c1b9041ba0acc86c9020c5adecf2714cd99de138a4da228208ccd41527","last_reissued_at":"2026-07-05T11:08:34.660837Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:08:34.660837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.17981","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-07-05T11:08:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jJwzqy1OqVbZLzZiadwqcCfIt+Qcj9HSHD49d43W/TvAU0Txwg0s2joIVRP7ijJM+/kWuHFYVP7k9KbwQn8HCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T17:56:55.921255Z"},"content_sha256":"316ce356c085edc4d05d2a2b569866ecf784d919d323b44ced409b7fe0f8cc15","schema_version":"1.0","event_id":"sha256:316ce356c085edc4d05d2a2b569866ecf784d919d323b44ced409b7fe0f8cc15"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:WUDLFQNZAQN2BLGINSICBRNN5T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Positive codegree thresholds for perfect matchings in hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Camila Z\\'arate-Guer\\'en, Richard Mycroft","submitted_at":"2025-05-23T14:47:33Z","abstract_excerpt":"We give, for each $k \\geq 3$, the precise best possible minimum positive codegree condition for a perfect matching in a large $k$-uniform hypergraph $H$ on $n$ vertices. Specifically we show that, if $n$ is sufficiently large and divisible by $k$, and $H$ has minimum positive codegree $\\delta^+(H) \\geq \\frac{k-1}{k}n - (k-2)$ and no isolated vertices, then $H$ contains a perfect matching. For $k=3$ this was previously established by Halfpap and Magnan, who also gave bounds for $k \\geq 4$ which were tight up to an additive constant."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.17981","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/2505.17981/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-07-05T11:08:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ij93oRAo9E25ODPUuSEcp59FDd2oX+U7M+DwZflu8heyAo/4EcA8nZ0LPbQI7urbwAo1YxyQtBBPIlQ5wXglAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T17:56:55.921636Z"},"content_sha256":"78d8903341baff618baf3c4a8adc09f90e30b72f9bde8d4b116032acbc1f949e","schema_version":"1.0","event_id":"sha256:78d8903341baff618baf3c4a8adc09f90e30b72f9bde8d4b116032acbc1f949e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WUDLFQNZAQN2BLGINSICBRNN5T/bundle.json","state_url":"https://pith.science/pith/WUDLFQNZAQN2BLGINSICBRNN5T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WUDLFQNZAQN2BLGINSICBRNN5T/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-08-23T17:56:55Z","links":{"resolver":"https://pith.science/pith/WUDLFQNZAQN2BLGINSICBRNN5T","bundle":"https://pith.science/pith/WUDLFQNZAQN2BLGINSICBRNN5T/bundle.json","state":"https://pith.science/pith/WUDLFQNZAQN2BLGINSICBRNN5T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WUDLFQNZAQN2BLGINSICBRNN5T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:WUDLFQNZAQN2BLGINSICBRNN5T","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":"60d795b47f85857d95e541ff29bcb6e8c6138604cdfbde36265bab0c4719fcd8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-23T14:47:33Z","title_canon_sha256":"0fee931573ae809a7a05f7e9f73974429c9bd06d798e07be5a57c40f750ed0fa"},"schema_version":"1.0","source":{"id":"2505.17981","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.17981","created_at":"2026-07-05T11:08:34Z"},{"alias_kind":"arxiv_version","alias_value":"2505.17981v1","created_at":"2026-07-05T11:08:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.17981","created_at":"2026-07-05T11:08:34Z"},{"alias_kind":"pith_short_12","alias_value":"WUDLFQNZAQN2","created_at":"2026-07-05T11:08:34Z"},{"alias_kind":"pith_short_16","alias_value":"WUDLFQNZAQN2BLGI","created_at":"2026-07-05T11:08:34Z"},{"alias_kind":"pith_short_8","alias_value":"WUDLFQNZ","created_at":"2026-07-05T11:08:34Z"}],"graph_snapshots":[{"event_id":"sha256:78d8903341baff618baf3c4a8adc09f90e30b72f9bde8d4b116032acbc1f949e","target":"graph","created_at":"2026-07-05T11:08:34Z","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/2505.17981/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We give, for each $k \\geq 3$, the precise best possible minimum positive codegree condition for a perfect matching in a large $k$-uniform hypergraph $H$ on $n$ vertices. Specifically we show that, if $n$ is sufficiently large and divisible by $k$, and $H$ has minimum positive codegree $\\delta^+(H) \\geq \\frac{k-1}{k}n - (k-2)$ and no isolated vertices, then $H$ contains a perfect matching. For $k=3$ this was previously established by Halfpap and Magnan, who also gave bounds for $k \\geq 4$ which were tight up to an additive constant.","authors_text":"Camila Z\\'arate-Guer\\'en, Richard Mycroft","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-23T14:47:33Z","title":"Positive codegree thresholds for perfect matchings in hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.17981","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:316ce356c085edc4d05d2a2b569866ecf784d919d323b44ced409b7fe0f8cc15","target":"record","created_at":"2026-07-05T11:08:34Z","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":"60d795b47f85857d95e541ff29bcb6e8c6138604cdfbde36265bab0c4719fcd8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-05-23T14:47:33Z","title_canon_sha256":"0fee931573ae809a7a05f7e9f73974429c9bd06d798e07be5a57c40f750ed0fa"},"schema_version":"1.0","source":{"id":"2505.17981","kind":"arxiv","version":1}},"canonical_sha256":"b506b2c1b9041ba0acc86c9020c5adecf2714cd99de138a4da228208ccd41527","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b506b2c1b9041ba0acc86c9020c5adecf2714cd99de138a4da228208ccd41527","first_computed_at":"2026-07-05T11:08:34.660837Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:08:34.660837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oyEn3cHiLfqS2mvvOjEn8t0AGG7TEMIS+SFglX/SrpSXeHDEuJ+6bXdvRbuOA5UnWtmX/oNsxbiiD+islTkHBw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:08:34.661283Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.17981","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:316ce356c085edc4d05d2a2b569866ecf784d919d323b44ced409b7fe0f8cc15","sha256:78d8903341baff618baf3c4a8adc09f90e30b72f9bde8d4b116032acbc1f949e"],"state_sha256":"a3beebb0ccd968a580fa54b0d1720251409a4c46fe3aa21d5f267a753e0fdd58"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mKo9RQT4glRCZ51w5cSvrCGVev247ejtrU1kYs0llxd2yujuUfcyx06zu+XNUsHZnau6eTCRhgXMLdzSMVzUDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T17:56:55.926913Z","bundle_sha256":"bc9bd7d5a482cbdf074d77e4202f3a5c3a844da6ac5e898f34ca1c79f559d267"}}