{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:I3V54PFA5QQGUPLORSUOUZ3FT6","short_pith_number":"pith:I3V54PFA","canonical_record":{"source":{"id":"2201.10049","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-01-25T02:22:38Z","cross_cats_sorted":[],"title_canon_sha256":"d5ba8f98bb638599fb149a5b6bd64c1e446755fc44b86bf12c9032a71a2d15b9","abstract_canon_sha256":"10a882b752fba6157426a22e0c32030d4ee2c2fec338cf74a769b9875c0042b8"},"schema_version":"1.0"},"canonical_sha256":"46ebde3ca0ec206a3d6e8ca8ea67659fab569105c13c08ef61f75d76b465cd99","source":{"kind":"arxiv","id":"2201.10049","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.10049","created_at":"2026-07-05T03:51:14Z"},{"alias_kind":"arxiv_version","alias_value":"2201.10049v1","created_at":"2026-07-05T03:51:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.10049","created_at":"2026-07-05T03:51:14Z"},{"alias_kind":"pith_short_12","alias_value":"I3V54PFA5QQG","created_at":"2026-07-05T03:51:14Z"},{"alias_kind":"pith_short_16","alias_value":"I3V54PFA5QQGUPLO","created_at":"2026-07-05T03:51:14Z"},{"alias_kind":"pith_short_8","alias_value":"I3V54PFA","created_at":"2026-07-05T03:51:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:I3V54PFA5QQGUPLORSUOUZ3FT6","target":"record","payload":{"canonical_record":{"source":{"id":"2201.10049","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-01-25T02:22:38Z","cross_cats_sorted":[],"title_canon_sha256":"d5ba8f98bb638599fb149a5b6bd64c1e446755fc44b86bf12c9032a71a2d15b9","abstract_canon_sha256":"10a882b752fba6157426a22e0c32030d4ee2c2fec338cf74a769b9875c0042b8"},"schema_version":"1.0"},"canonical_sha256":"46ebde3ca0ec206a3d6e8ca8ea67659fab569105c13c08ef61f75d76b465cd99","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:51:14.891535Z","signature_b64":"J7tCQ7lspjbXkzUVMAvoJ0jCZJzbjuPL8+NVAqgg389e+zG2+9iY517Otg8ALU37Lb8inMN3+6Q66Sfji8tbAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46ebde3ca0ec206a3d6e8ca8ea67659fab569105c13c08ef61f75d76b465cd99","last_reissued_at":"2026-07-05T03:51:14.891084Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:51:14.891084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2201.10049","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-05T03:51:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/T8wld10eubRxGsqFILledfpUCw68UgMB5yOi65mwKTng8PSXtGTMnXT0J1uYATxRA+h5mj7B00Dd3EdXfqTAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T20:20:20.220733Z"},"content_sha256":"8767816175e7ae401ec1baad89ced6cc0a0db39ece02466dc34a17ef4d922330","schema_version":"1.0","event_id":"sha256:8767816175e7ae401ec1baad89ced6cc0a0db39ece02466dc34a17ef4d922330"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:I3V54PFA5QQGUPLORSUOUZ3FT6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Algorithm for the Partitioning Min-Max Weighted Matching Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jinyao Xie, Jiongzhi Zheng, Kun He, Yuxuan Wang","submitted_at":"2022-01-25T02:22:38Z","abstract_excerpt":"The Partitioning Min-Max Weighted Matching (PMMWM) problem is an NP-hard problem that combines the problem of partitioning a group of vertices of a bipartite graph into disjoint subsets with limited size and the classical Min-Max Weighted Matching (MMWM) problem. Kress et al. proposed this problem in 2015 and they also provided several algorithms, among which MP$_{\\text{LS}}$ is the state-of-the-art. In this work, we observe there is a time bottleneck in the matching phase of MP$_{\\text{LS}}$. Hence, we optimize the redundant operations during the matching iterations, and propose an efficient "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.10049","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/2201.10049/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-05T03:51:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"umWN5BS2E4LUaPcjTbfFXrvisbD7l1LS5fO33Hlcgv2Z/rWd8nbqFDAEnuKrj4EQeBe74n+mYSToaPXT+3wiBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T20:20:20.221317Z"},"content_sha256":"85bc49796e75b35e46b3d57282eb924dc71b7472815571f26713bf84db257da3","schema_version":"1.0","event_id":"sha256:85bc49796e75b35e46b3d57282eb924dc71b7472815571f26713bf84db257da3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I3V54PFA5QQGUPLORSUOUZ3FT6/bundle.json","state_url":"https://pith.science/pith/I3V54PFA5QQGUPLORSUOUZ3FT6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I3V54PFA5QQGUPLORSUOUZ3FT6/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-23T20:20:20Z","links":{"resolver":"https://pith.science/pith/I3V54PFA5QQGUPLORSUOUZ3FT6","bundle":"https://pith.science/pith/I3V54PFA5QQGUPLORSUOUZ3FT6/bundle.json","state":"https://pith.science/pith/I3V54PFA5QQGUPLORSUOUZ3FT6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I3V54PFA5QQGUPLORSUOUZ3FT6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:I3V54PFA5QQGUPLORSUOUZ3FT6","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":"10a882b752fba6157426a22e0c32030d4ee2c2fec338cf74a769b9875c0042b8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-01-25T02:22:38Z","title_canon_sha256":"d5ba8f98bb638599fb149a5b6bd64c1e446755fc44b86bf12c9032a71a2d15b9"},"schema_version":"1.0","source":{"id":"2201.10049","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.10049","created_at":"2026-07-05T03:51:14Z"},{"alias_kind":"arxiv_version","alias_value":"2201.10049v1","created_at":"2026-07-05T03:51:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.10049","created_at":"2026-07-05T03:51:14Z"},{"alias_kind":"pith_short_12","alias_value":"I3V54PFA5QQG","created_at":"2026-07-05T03:51:14Z"},{"alias_kind":"pith_short_16","alias_value":"I3V54PFA5QQGUPLO","created_at":"2026-07-05T03:51:14Z"},{"alias_kind":"pith_short_8","alias_value":"I3V54PFA","created_at":"2026-07-05T03:51:14Z"}],"graph_snapshots":[{"event_id":"sha256:85bc49796e75b35e46b3d57282eb924dc71b7472815571f26713bf84db257da3","target":"graph","created_at":"2026-07-05T03:51:14Z","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/2201.10049/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 is an NP-hard problem that combines the problem of partitioning a group of vertices of a bipartite graph into disjoint subsets with limited size and the classical Min-Max Weighted Matching (MMWM) problem. Kress et al. proposed this problem in 2015 and they also provided several algorithms, among which MP$_{\\text{LS}}$ is the state-of-the-art. In this work, we observe there is a time bottleneck in the matching phase of MP$_{\\text{LS}}$. Hence, we optimize the redundant operations during the matching iterations, and propose an efficient ","authors_text":"Jinyao Xie, Jiongzhi Zheng, Kun He, Yuxuan Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-01-25T02:22:38Z","title":"An Efficient Algorithm for the Partitioning Min-Max Weighted Matching Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.10049","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:8767816175e7ae401ec1baad89ced6cc0a0db39ece02466dc34a17ef4d922330","target":"record","created_at":"2026-07-05T03:51:14Z","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":"10a882b752fba6157426a22e0c32030d4ee2c2fec338cf74a769b9875c0042b8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-01-25T02:22:38Z","title_canon_sha256":"d5ba8f98bb638599fb149a5b6bd64c1e446755fc44b86bf12c9032a71a2d15b9"},"schema_version":"1.0","source":{"id":"2201.10049","kind":"arxiv","version":1}},"canonical_sha256":"46ebde3ca0ec206a3d6e8ca8ea67659fab569105c13c08ef61f75d76b465cd99","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46ebde3ca0ec206a3d6e8ca8ea67659fab569105c13c08ef61f75d76b465cd99","first_computed_at":"2026-07-05T03:51:14.891084Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:51:14.891084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J7tCQ7lspjbXkzUVMAvoJ0jCZJzbjuPL8+NVAqgg389e+zG2+9iY517Otg8ALU37Lb8inMN3+6Q66Sfji8tbAw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:51:14.891535Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.10049","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8767816175e7ae401ec1baad89ced6cc0a0db39ece02466dc34a17ef4d922330","sha256:85bc49796e75b35e46b3d57282eb924dc71b7472815571f26713bf84db257da3"],"state_sha256":"309cfee40f76a923124db011d3ad9d2a501dc819db0e417a3e0aa6821aebd131"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N/7t0hcKx+u3kTIzRtzNEZ1SXLZpS2ojlB9z8HaKHsFUHRbk4solFX34hUqKus16vctjOxhT0oDplThZHSmRCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T20:20:20.226484Z","bundle_sha256":"c3d1abc9072bcbc6f933eec61f81ee75ce40e8df7d4465a0fda2d99395069ee0"}}