{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:VBZON3WPOEM5RKRMYXWUS7LRCU","short_pith_number":"pith:VBZON3WP","canonical_record":{"source":{"id":"2411.18367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-27T14:15:38Z","cross_cats_sorted":[],"title_canon_sha256":"351824e9319b73e5059d24d97874b06fb83c9a33296c235a081ed777aa020eec","abstract_canon_sha256":"a06dc67667f44eee10c0a329f6fa76354f572f590fda8b537be5cc9d556687ce"},"schema_version":"1.0"},"canonical_sha256":"a872e6eecf7119d8aa2cc5ed497d71150edb1a759a8ca002f19a7e13d8634cfc","source":{"kind":"arxiv","id":"2411.18367","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.18367","created_at":"2026-07-05T09:41:15Z"},{"alias_kind":"arxiv_version","alias_value":"2411.18367v1","created_at":"2026-07-05T09:41:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.18367","created_at":"2026-07-05T09:41:15Z"},{"alias_kind":"pith_short_12","alias_value":"VBZON3WPOEM5","created_at":"2026-07-05T09:41:15Z"},{"alias_kind":"pith_short_16","alias_value":"VBZON3WPOEM5RKRM","created_at":"2026-07-05T09:41:15Z"},{"alias_kind":"pith_short_8","alias_value":"VBZON3WP","created_at":"2026-07-05T09:41:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:VBZON3WPOEM5RKRMYXWUS7LRCU","target":"record","payload":{"canonical_record":{"source":{"id":"2411.18367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-27T14:15:38Z","cross_cats_sorted":[],"title_canon_sha256":"351824e9319b73e5059d24d97874b06fb83c9a33296c235a081ed777aa020eec","abstract_canon_sha256":"a06dc67667f44eee10c0a329f6fa76354f572f590fda8b537be5cc9d556687ce"},"schema_version":"1.0"},"canonical_sha256":"a872e6eecf7119d8aa2cc5ed497d71150edb1a759a8ca002f19a7e13d8634cfc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:41:15.684783Z","signature_b64":"8Kz+so8eeRZdDhg8+8kaqhRvCx+vq1NRd0aH1VmSa2bCPavgbwP93qOMwejodf+kj4NgxRzlYtUfOWYdVNJVBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a872e6eecf7119d8aa2cc5ed497d71150edb1a759a8ca002f19a7e13d8634cfc","last_reissued_at":"2026-07-05T09:41:15.684305Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:41:15.684305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.18367","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-05T09:41:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qt6M5yzM0YlhVJrWTjlqzr9J3qVh7Qnj1m8Zfh8ZTT+BjrbW0kk/XxqXhMvZpG1h9s2MZ0FGrw/8UHJeMWhtDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T14:30:45.376801Z"},"content_sha256":"53c6873187c430f0969a181a61c69b0ca2bce5d17cbff68f04a637e3326fe8ce","schema_version":"1.0","event_id":"sha256:53c6873187c430f0969a181a61c69b0ca2bce5d17cbff68f04a637e3326fe8ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:VBZON3WPOEM5RKRMYXWUS7LRCU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Complexity of Fair Many-to-One Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Hossein Shokouhi, Ramin Javadi","submitted_at":"2024-11-27T14:15:38Z","abstract_excerpt":"Given a bipartite graph $G=(U\\cup V,E)$, a left-perfect many-to-one matching is a subset $M \\subseteq E$ such that each vertex in $U$ is incident with exactly one edge in $M$. If $U$ is partitioned into some groups, the matching is called fair if for every $v\\in V$, the difference between the number of vertices matched with $v$ in any two groups does not exceed a given threshold. In this paper, we investigate parameterized complexity of fair left-perfect many-to-one matching problem with respect to the structural parameters of the input graph. In particular, we prove that the problem is W[1]-h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.18367","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/2411.18367/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-05T09:41:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UII/inI50JySzQmwqDoJq1igiXRIJIjHdQCj98Q+sjDSBJ+N9YyjcmfHeN6aVSOwTBNYUQ8/ubtNT/IWfVJXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T14:30:45.377845Z"},"content_sha256":"03e60c6cc6c66851b5b5e861008f83e93a32e112c71871d7e76fb26740fe9626","schema_version":"1.0","event_id":"sha256:03e60c6cc6c66851b5b5e861008f83e93a32e112c71871d7e76fb26740fe9626"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VBZON3WPOEM5RKRMYXWUS7LRCU/bundle.json","state_url":"https://pith.science/pith/VBZON3WPOEM5RKRMYXWUS7LRCU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VBZON3WPOEM5RKRMYXWUS7LRCU/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-13T14:30:45Z","links":{"resolver":"https://pith.science/pith/VBZON3WPOEM5RKRMYXWUS7LRCU","bundle":"https://pith.science/pith/VBZON3WPOEM5RKRMYXWUS7LRCU/bundle.json","state":"https://pith.science/pith/VBZON3WPOEM5RKRMYXWUS7LRCU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VBZON3WPOEM5RKRMYXWUS7LRCU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:VBZON3WPOEM5RKRMYXWUS7LRCU","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":"a06dc67667f44eee10c0a329f6fa76354f572f590fda8b537be5cc9d556687ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-27T14:15:38Z","title_canon_sha256":"351824e9319b73e5059d24d97874b06fb83c9a33296c235a081ed777aa020eec"},"schema_version":"1.0","source":{"id":"2411.18367","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.18367","created_at":"2026-07-05T09:41:15Z"},{"alias_kind":"arxiv_version","alias_value":"2411.18367v1","created_at":"2026-07-05T09:41:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.18367","created_at":"2026-07-05T09:41:15Z"},{"alias_kind":"pith_short_12","alias_value":"VBZON3WPOEM5","created_at":"2026-07-05T09:41:15Z"},{"alias_kind":"pith_short_16","alias_value":"VBZON3WPOEM5RKRM","created_at":"2026-07-05T09:41:15Z"},{"alias_kind":"pith_short_8","alias_value":"VBZON3WP","created_at":"2026-07-05T09:41:15Z"}],"graph_snapshots":[{"event_id":"sha256:03e60c6cc6c66851b5b5e861008f83e93a32e112c71871d7e76fb26740fe9626","target":"graph","created_at":"2026-07-05T09:41:15Z","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/2411.18367/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a bipartite graph $G=(U\\cup V,E)$, a left-perfect many-to-one matching is a subset $M \\subseteq E$ such that each vertex in $U$ is incident with exactly one edge in $M$. If $U$ is partitioned into some groups, the matching is called fair if for every $v\\in V$, the difference between the number of vertices matched with $v$ in any two groups does not exceed a given threshold. In this paper, we investigate parameterized complexity of fair left-perfect many-to-one matching problem with respect to the structural parameters of the input graph. In particular, we prove that the problem is W[1]-h","authors_text":"Hossein Shokouhi, Ramin Javadi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-27T14:15:38Z","title":"Parameterized Complexity of Fair Many-to-One Matchings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.18367","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:53c6873187c430f0969a181a61c69b0ca2bce5d17cbff68f04a637e3326fe8ce","target":"record","created_at":"2026-07-05T09:41:15Z","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":"a06dc67667f44eee10c0a329f6fa76354f572f590fda8b537be5cc9d556687ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-11-27T14:15:38Z","title_canon_sha256":"351824e9319b73e5059d24d97874b06fb83c9a33296c235a081ed777aa020eec"},"schema_version":"1.0","source":{"id":"2411.18367","kind":"arxiv","version":1}},"canonical_sha256":"a872e6eecf7119d8aa2cc5ed497d71150edb1a759a8ca002f19a7e13d8634cfc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a872e6eecf7119d8aa2cc5ed497d71150edb1a759a8ca002f19a7e13d8634cfc","first_computed_at":"2026-07-05T09:41:15.684305Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:41:15.684305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8Kz+so8eeRZdDhg8+8kaqhRvCx+vq1NRd0aH1VmSa2bCPavgbwP93qOMwejodf+kj4NgxRzlYtUfOWYdVNJVBA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:41:15.684783Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.18367","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53c6873187c430f0969a181a61c69b0ca2bce5d17cbff68f04a637e3326fe8ce","sha256:03e60c6cc6c66851b5b5e861008f83e93a32e112c71871d7e76fb26740fe9626"],"state_sha256":"9acae606a4c02c3881056ae4420765e73b4d94fb21ed443ea106748023bda13e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qBxO94O76Cuy6Y2KSXc9uD9626/DtXJtWS4E3ZprQlEbhB+E6z13fABKlgHYd8jolTwKDy1Zcq3bJVSPxQGxDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T14:30:45.385128Z","bundle_sha256":"ea1465c4b530b7f8569d3e65b519d4401394cc97e13950f4ceac5ff48196cf4c"}}