{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:CO3CPZRM6EBPKALXKAQDY4MSVL","short_pith_number":"pith:CO3CPZRM","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"},"canonical_sha256":"13b627e62cf102f5017750203c7192aad9045b00b41019a1c67ddd6ab5393c31","source":{"kind":"arxiv","id":"2405.03176","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.03176","created_at":"2026-07-05T08:15:59Z"},{"alias_kind":"arxiv_version","alias_value":"2405.03176v1","created_at":"2026-07-05T08:15:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.03176","created_at":"2026-07-05T08:15:59Z"},{"alias_kind":"pith_short_12","alias_value":"CO3CPZRM6EBP","created_at":"2026-07-05T08:15:59Z"},{"alias_kind":"pith_short_16","alias_value":"CO3CPZRM6EBPKALX","created_at":"2026-07-05T08:15:59Z"},{"alias_kind":"pith_short_8","alias_value":"CO3CPZRM","created_at":"2026-07-05T08:15:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:CO3CPZRM6EBPKALXKAQDY4MSVL","target":"record","payload":{"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"},"canonical_sha256":"13b627e62cf102f5017750203c7192aad9045b00b41019a1c67ddd6ab5393c31","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"},"source_kind":"arxiv","source_id":"2405.03176","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-05T08:15:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2vi0KtAgQp8Zajb5lotsFxCLF5PDnmzimQWrtX74m9IaUs4ujDbPbHwIS6uBxB8P4VLaLrUpUPxP7fyY4T4XCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T12:04:11.701616Z"},"content_sha256":"7c316a9efe014e7885f71b478e40a0aefc7cf42372204d4079e8b7f18817bc52","schema_version":"1.0","event_id":"sha256:7c316a9efe014e7885f71b478e40a0aefc7cf42372204d4079e8b7f18817bc52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:CO3CPZRM6EBPKALXKAQDY4MSVL","target":"graph","payload":{"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"},"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-05T08:15:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UshPFsfAZTRVGFm462Apbq/RKliCz3zz37vS+InutSKiwEscShcol8eD87kDKX+FniOrHcY0NJn8uJb2MGgcCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T12:04:11.702109Z"},"content_sha256":"24e4d5b4a0f171b8ec82ff615a94cc84e0099289d60cb8673d89caff97cd065f","schema_version":"1.0","event_id":"sha256:24e4d5b4a0f171b8ec82ff615a94cc84e0099289d60cb8673d89caff97cd065f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CO3CPZRM6EBPKALXKAQDY4MSVL/bundle.json","state_url":"https://pith.science/pith/CO3CPZRM6EBPKALXKAQDY4MSVL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CO3CPZRM6EBPKALXKAQDY4MSVL/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-23T12:04:11Z","links":{"resolver":"https://pith.science/pith/CO3CPZRM6EBPKALXKAQDY4MSVL","bundle":"https://pith.science/pith/CO3CPZRM6EBPKALXKAQDY4MSVL/bundle.json","state":"https://pith.science/pith/CO3CPZRM6EBPKALXKAQDY4MSVL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CO3CPZRM6EBPKALXKAQDY4MSVL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:CO3CPZRM6EBPKALXKAQDY4MSVL","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":"80a5ebfe27839c67fafe5edf5005e7c6b2da8a567d76ce4c188a11a02d9ca78e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2024-05-06T05:57:46Z","title_canon_sha256":"79a1e363cf3a4172fdcf89e9849e08da0b96aacd345d928161ce3e136bc6d014"},"schema_version":"1.0","source":{"id":"2405.03176","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.03176","created_at":"2026-07-05T08:15:59Z"},{"alias_kind":"arxiv_version","alias_value":"2405.03176v1","created_at":"2026-07-05T08:15:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.03176","created_at":"2026-07-05T08:15:59Z"},{"alias_kind":"pith_short_12","alias_value":"CO3CPZRM6EBP","created_at":"2026-07-05T08:15:59Z"},{"alias_kind":"pith_short_16","alias_value":"CO3CPZRM6EBPKALX","created_at":"2026-07-05T08:15:59Z"},{"alias_kind":"pith_short_8","alias_value":"CO3CPZRM","created_at":"2026-07-05T08:15:59Z"}],"graph_snapshots":[{"event_id":"sha256:24e4d5b4a0f171b8ec82ff615a94cc84e0099289d60cb8673d89caff97cd065f","target":"graph","created_at":"2026-07-05T08:15:59Z","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/2405.03176/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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, ","authors_text":"Jinyao Xie, Jiongzhi Zheng, Kun He, Yuxuan Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2024-05-06T05:57:46Z","title":"FIMP-HGA: A Novel Approach to Addressing the Partitioning Min-Max Weighted Matching Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.03176","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:7c316a9efe014e7885f71b478e40a0aefc7cf42372204d4079e8b7f18817bc52","target":"record","created_at":"2026-07-05T08:15:59Z","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":"80a5ebfe27839c67fafe5edf5005e7c6b2da8a567d76ce4c188a11a02d9ca78e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2024-05-06T05:57:46Z","title_canon_sha256":"79a1e363cf3a4172fdcf89e9849e08da0b96aacd345d928161ce3e136bc6d014"},"schema_version":"1.0","source":{"id":"2405.03176","kind":"arxiv","version":1}},"canonical_sha256":"13b627e62cf102f5017750203c7192aad9045b00b41019a1c67ddd6ab5393c31","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13b627e62cf102f5017750203c7192aad9045b00b41019a1c67ddd6ab5393c31","first_computed_at":"2026-07-05T08:15:59.867018Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:15:59.867018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TqahJYaiyMv3fmr4l3W80wD8nVOYqvSze1Jiyvs1Gt07Q4IFn8y8Q6MSZZ/6GfTXiifNOYn2ob02UHG/vnyTCg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:15:59.867524Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.03176","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c316a9efe014e7885f71b478e40a0aefc7cf42372204d4079e8b7f18817bc52","sha256:24e4d5b4a0f171b8ec82ff615a94cc84e0099289d60cb8673d89caff97cd065f"],"state_sha256":"3637dd044af027990e88ad83361a5b39cf56faa78e489febcbd4f75009b92e5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w79D6wx3jnuS/3LR8pAeBK8piFhYTjMsNmlYaxl12bL/ROGwI2wI6AkZP13Vgrp2wnpCE+LSzZlOIaJxTVxjCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T12:04:11.705861Z","bundle_sha256":"283c3d168ea598b5dc8d20447ce67ab5f3a7f5e936e342415f8a1f8d26f98816"}}