{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CO3CPZRM6EBPKALXKAQDY4MSVL","short_pith_number":"pith:CO3CPZRM","schema_version":"1.0","canonical_sha256":"13b627e62cf102f5017750203c7192aad9045b00b41019a1c67ddd6ab5393c31","source":{"kind":"arxiv","id":"2405.03176","version":1},"attestation_state":"computed","paper":{"title":"FIMP-HGA: A Novel Approach to Addressing the Partitioning Min-Max Weighted Matching Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Jinyao Xie, Jiongzhi Zheng, Kun He, Yuxuan Wang","submitted_at":"2024-05-06T05:57:46Z","abstract_excerpt":"The Partitioning Min-Max Weighted Matching (PMMWM) problem, being a practical NP-hard problem, integrates the task of partitioning the vertices of a bipartite graph into disjoint sets of limited size with the classical Maximum-Weight Perfect Matching (MPWM) problem. Initially introduced in 2015, the state-of-the-art method for addressing PMMWM is the MP$_{\\text{LS}}$. In this paper, we present a novel approach, the Fast Iterative Match-Partition Hybrid Genetic Algorithm (FIMP-HGA), for addressing PMMWM. Similar to MP$_{\\text{LS}}$, FIMP-HGA divides the solving into match and partition stages, "},"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":"2405.03176","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2024-05-06T05:57:46Z","cross_cats_sorted":[],"title_canon_sha256":"79a1e363cf3a4172fdcf89e9849e08da0b96aacd345d928161ce3e136bc6d014","abstract_canon_sha256":"80a5ebfe27839c67fafe5edf5005e7c6b2da8a567d76ce4c188a11a02d9ca78e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:15:59.867524Z","signature_b64":"TqahJYaiyMv3fmr4l3W80wD8nVOYqvSze1Jiyvs1Gt07Q4IFn8y8Q6MSZZ/6GfTXiifNOYn2ob02UHG/vnyTCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13b627e62cf102f5017750203c7192aad9045b00b41019a1c67ddd6ab5393c31","last_reissued_at":"2026-07-05T08:15:59.867018Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:15:59.867018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FIMP-HGA: A Novel Approach to Addressing the Partitioning Min-Max Weighted Matching Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Jinyao Xie, Jiongzhi Zheng, Kun He, Yuxuan Wang","submitted_at":"2024-05-06T05:57:46Z","abstract_excerpt":"The Partitioning Min-Max Weighted Matching (PMMWM) problem, being a practical NP-hard problem, integrates the task of partitioning the vertices of a bipartite graph into disjoint sets of limited size with the classical Maximum-Weight Perfect Matching (MPWM) problem. Initially introduced in 2015, the state-of-the-art method for addressing PMMWM is the MP$_{\\text{LS}}$. In this paper, we present a novel approach, the Fast Iterative Match-Partition Hybrid Genetic Algorithm (FIMP-HGA), for addressing PMMWM. Similar to MP$_{\\text{LS}}$, FIMP-HGA divides the solving into match and partition stages, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.03176","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/2405.03176/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":"2405.03176","created_at":"2026-07-05T08:15:59.867078+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.03176v1","created_at":"2026-07-05T08:15:59.867078+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.03176","created_at":"2026-07-05T08:15:59.867078+00:00"},{"alias_kind":"pith_short_12","alias_value":"CO3CPZRM6EBP","created_at":"2026-07-05T08:15:59.867078+00:00"},{"alias_kind":"pith_short_16","alias_value":"CO3CPZRM6EBPKALX","created_at":"2026-07-05T08:15:59.867078+00:00"},{"alias_kind":"pith_short_8","alias_value":"CO3CPZRM","created_at":"2026-07-05T08:15:59.867078+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/CO3CPZRM6EBPKALXKAQDY4MSVL","json":"https://pith.science/pith/CO3CPZRM6EBPKALXKAQDY4MSVL.json","graph_json":"https://pith.science/api/pith-number/CO3CPZRM6EBPKALXKAQDY4MSVL/graph.json","events_json":"https://pith.science/api/pith-number/CO3CPZRM6EBPKALXKAQDY4MSVL/events.json","paper":"https://pith.science/paper/CO3CPZRM"},"agent_actions":{"view_html":"https://pith.science/pith/CO3CPZRM6EBPKALXKAQDY4MSVL","download_json":"https://pith.science/pith/CO3CPZRM6EBPKALXKAQDY4MSVL.json","view_paper":"https://pith.science/paper/CO3CPZRM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.03176&json=true","fetch_graph":"https://pith.science/api/pith-number/CO3CPZRM6EBPKALXKAQDY4MSVL/graph.json","fetch_events":"https://pith.science/api/pith-number/CO3CPZRM6EBPKALXKAQDY4MSVL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CO3CPZRM6EBPKALXKAQDY4MSVL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CO3CPZRM6EBPKALXKAQDY4MSVL/action/storage_attestation","attest_author":"https://pith.science/pith/CO3CPZRM6EBPKALXKAQDY4MSVL/action/author_attestation","sign_citation":"https://pith.science/pith/CO3CPZRM6EBPKALXKAQDY4MSVL/action/citation_signature","submit_replication":"https://pith.science/pith/CO3CPZRM6EBPKALXKAQDY4MSVL/action/replication_record"}},"created_at":"2026-07-05T08:15:59.867078+00:00","updated_at":"2026-07-05T08:15:59.867078+00:00"}