{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:PJTXOK5MVRLFS343KPZL65XS4U","short_pith_number":"pith:PJTXOK5M","canonical_record":{"source":{"id":"2407.18144","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-07-25T15:49:22Z","cross_cats_sorted":[],"title_canon_sha256":"81b21918f5a6b477d736a00ec2a198c581afb1b7e51acab08ef118025890a2c4","abstract_canon_sha256":"c6b7150964d4e00479f158f01c8b89d03198ad0db5bd62861a2c460d826b0469"},"schema_version":"1.0"},"canonical_sha256":"7a67772bacac56596f9b53f2bf76f2e51d5d601b7e1408db8c5df7e93a2675d4","source":{"kind":"arxiv","id":"2407.18144","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.18144","created_at":"2026-06-25T01:17:43Z"},{"alias_kind":"arxiv_version","alias_value":"2407.18144v2","created_at":"2026-06-25T01:17:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.18144","created_at":"2026-06-25T01:17:43Z"},{"alias_kind":"pith_short_12","alias_value":"PJTXOK5MVRLF","created_at":"2026-06-25T01:17:43Z"},{"alias_kind":"pith_short_16","alias_value":"PJTXOK5MVRLFS343","created_at":"2026-06-25T01:17:43Z"},{"alias_kind":"pith_short_8","alias_value":"PJTXOK5M","created_at":"2026-06-25T01:17:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:PJTXOK5MVRLFS343KPZL65XS4U","target":"record","payload":{"canonical_record":{"source":{"id":"2407.18144","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-07-25T15:49:22Z","cross_cats_sorted":[],"title_canon_sha256":"81b21918f5a6b477d736a00ec2a198c581afb1b7e51acab08ef118025890a2c4","abstract_canon_sha256":"c6b7150964d4e00479f158f01c8b89d03198ad0db5bd62861a2c460d826b0469"},"schema_version":"1.0"},"canonical_sha256":"7a67772bacac56596f9b53f2bf76f2e51d5d601b7e1408db8c5df7e93a2675d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-25T01:17:43.139487Z","signature_b64":"XCEP8GjPpAuP7A1WL2ZkDrmcuy0+btuCTxy2zXQ60cGQkWgPGXcEg5F1sfQ/ys0OxRAVJHwIdYVnhu9FM+7UAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a67772bacac56596f9b53f2bf76f2e51d5d601b7e1408db8c5df7e93a2675d4","last_reissued_at":"2026-06-25T01:17:43.139007Z","signature_status":"signed_v1","first_computed_at":"2026-06-25T01:17:43.139007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2407.18144","source_version":2,"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-06-25T01:17:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hho/tyRRLQ8hOPeF/ygv2/ZXGCuH/z+ihGzjRYfcnvcaGKYn5a1BpGHJPM5G20OmOpqmyyczdRX5t7hkjaKxDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T03:27:00.542846Z"},"content_sha256":"f3be373539975bc29d65baee4f09e4e3b726f88de247855799ca821a931874c3","schema_version":"1.0","event_id":"sha256:f3be373539975bc29d65baee4f09e4e3b726f88de247855799ca821a931874c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:PJTXOK5MVRLFS343KPZL65XS4U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Conflict-free Hypergraph Matchings and Coverings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dhruv Mubayi, Felix Joos, Zak Smith","submitted_at":"2024-07-25T15:49:22Z","abstract_excerpt":"Recent work showing the existence of conflict-free almost-perfect hypergraph matchings has found many applications. We show that, assuming certain simple degree and codegree conditions on the hypergraph $ \\mathcal{H} $ and the conflicts to be avoided, a conflict-free almost-perfect matching can be extended to one covering all of the vertices in a particular subset of $ V(\\mathcal{H}) $, by using an additional set of edges; in particular, we ensure that our matching avoids all of a further set of conflicts, which may consist of both old and new edges. This setup is useful for various applicatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.18144","kind":"arxiv","version":2},"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/2407.18144/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-06-25T01:17:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Zjq8G1S8EbhwVOdrNjKF59IBBdxoDsrYdm6XMGKZuzSrzRGR44elZPdy3MLvEQiBFZDyVVFbYghJYWWYhmtDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T03:27:00.543350Z"},"content_sha256":"8a993f05c795dcc112b874541fb615bb86641a9885398134ddb4d82792f7c5ca","schema_version":"1.0","event_id":"sha256:8a993f05c795dcc112b874541fb615bb86641a9885398134ddb4d82792f7c5ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PJTXOK5MVRLFS343KPZL65XS4U/bundle.json","state_url":"https://pith.science/pith/PJTXOK5MVRLFS343KPZL65XS4U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PJTXOK5MVRLFS343KPZL65XS4U/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-05T03:27:00Z","links":{"resolver":"https://pith.science/pith/PJTXOK5MVRLFS343KPZL65XS4U","bundle":"https://pith.science/pith/PJTXOK5MVRLFS343KPZL65XS4U/bundle.json","state":"https://pith.science/pith/PJTXOK5MVRLFS343KPZL65XS4U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PJTXOK5MVRLFS343KPZL65XS4U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:PJTXOK5MVRLFS343KPZL65XS4U","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":"c6b7150964d4e00479f158f01c8b89d03198ad0db5bd62861a2c460d826b0469","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-07-25T15:49:22Z","title_canon_sha256":"81b21918f5a6b477d736a00ec2a198c581afb1b7e51acab08ef118025890a2c4"},"schema_version":"1.0","source":{"id":"2407.18144","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.18144","created_at":"2026-06-25T01:17:43Z"},{"alias_kind":"arxiv_version","alias_value":"2407.18144v2","created_at":"2026-06-25T01:17:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.18144","created_at":"2026-06-25T01:17:43Z"},{"alias_kind":"pith_short_12","alias_value":"PJTXOK5MVRLF","created_at":"2026-06-25T01:17:43Z"},{"alias_kind":"pith_short_16","alias_value":"PJTXOK5MVRLFS343","created_at":"2026-06-25T01:17:43Z"},{"alias_kind":"pith_short_8","alias_value":"PJTXOK5M","created_at":"2026-06-25T01:17:43Z"}],"graph_snapshots":[{"event_id":"sha256:8a993f05c795dcc112b874541fb615bb86641a9885398134ddb4d82792f7c5ca","target":"graph","created_at":"2026-06-25T01:17:43Z","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/2407.18144/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recent work showing the existence of conflict-free almost-perfect hypergraph matchings has found many applications. We show that, assuming certain simple degree and codegree conditions on the hypergraph $ \\mathcal{H} $ and the conflicts to be avoided, a conflict-free almost-perfect matching can be extended to one covering all of the vertices in a particular subset of $ V(\\mathcal{H}) $, by using an additional set of edges; in particular, we ensure that our matching avoids all of a further set of conflicts, which may consist of both old and new edges. This setup is useful for various applicatio","authors_text":"Dhruv Mubayi, Felix Joos, Zak Smith","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-07-25T15:49:22Z","title":"Conflict-free Hypergraph Matchings and Coverings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.18144","kind":"arxiv","version":2},"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:f3be373539975bc29d65baee4f09e4e3b726f88de247855799ca821a931874c3","target":"record","created_at":"2026-06-25T01:17:43Z","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":"c6b7150964d4e00479f158f01c8b89d03198ad0db5bd62861a2c460d826b0469","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-07-25T15:49:22Z","title_canon_sha256":"81b21918f5a6b477d736a00ec2a198c581afb1b7e51acab08ef118025890a2c4"},"schema_version":"1.0","source":{"id":"2407.18144","kind":"arxiv","version":2}},"canonical_sha256":"7a67772bacac56596f9b53f2bf76f2e51d5d601b7e1408db8c5df7e93a2675d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a67772bacac56596f9b53f2bf76f2e51d5d601b7e1408db8c5df7e93a2675d4","first_computed_at":"2026-06-25T01:17:43.139007Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-25T01:17:43.139007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XCEP8GjPpAuP7A1WL2ZkDrmcuy0+btuCTxy2zXQ60cGQkWgPGXcEg5F1sfQ/ys0OxRAVJHwIdYVnhu9FM+7UAA==","signature_status":"signed_v1","signed_at":"2026-06-25T01:17:43.139487Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.18144","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3be373539975bc29d65baee4f09e4e3b726f88de247855799ca821a931874c3","sha256:8a993f05c795dcc112b874541fb615bb86641a9885398134ddb4d82792f7c5ca"],"state_sha256":"6635463d3d8b5e3eb5201216c84433c93fca95f7e99bbbe2111866dfcd97815b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x0c6MAbTbCaj4mkT6tLdaiZDEf7lHCxzUEcAnXpMMvvgL4VjlEPczir8eEiWS6nB/K/3QVvNhMHmylAQ8ghVCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T03:27:00.546752Z","bundle_sha256":"70f258d1829eb394c7a802315ab59a184b67d2cb81cebbe557200b8cc7ceee43"}}