{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:MGDIBXVBFPCBG4ZT5UTWKN6EWU","short_pith_number":"pith:MGDIBXVB","canonical_record":{"source":{"id":"2109.07524","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2021-09-15T18:39:07Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"008272c50b873d651f0d5e01dd5620a26fee7468e58cda92547451b287e240b5","abstract_canon_sha256":"e4d81a68ccad6d1c54eb20303faecc5a16c4283cd65892e0024c34932a30a9ee"},"schema_version":"1.0"},"canonical_sha256":"618680dea12bc4137333ed276537c4b504cb66cfb13adb5e30414e7c7f00461c","source":{"kind":"arxiv","id":"2109.07524","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.07524","created_at":"2026-07-05T03:14:58Z"},{"alias_kind":"arxiv_version","alias_value":"2109.07524v1","created_at":"2026-07-05T03:14:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.07524","created_at":"2026-07-05T03:14:58Z"},{"alias_kind":"pith_short_12","alias_value":"MGDIBXVBFPCB","created_at":"2026-07-05T03:14:58Z"},{"alias_kind":"pith_short_16","alias_value":"MGDIBXVBFPCBG4ZT","created_at":"2026-07-05T03:14:58Z"},{"alias_kind":"pith_short_8","alias_value":"MGDIBXVB","created_at":"2026-07-05T03:14:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:MGDIBXVBFPCBG4ZT5UTWKN6EWU","target":"record","payload":{"canonical_record":{"source":{"id":"2109.07524","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2021-09-15T18:39:07Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"008272c50b873d651f0d5e01dd5620a26fee7468e58cda92547451b287e240b5","abstract_canon_sha256":"e4d81a68ccad6d1c54eb20303faecc5a16c4283cd65892e0024c34932a30a9ee"},"schema_version":"1.0"},"canonical_sha256":"618680dea12bc4137333ed276537c4b504cb66cfb13adb5e30414e7c7f00461c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:14:58.007870Z","signature_b64":"vLDSn3xwCayieIRu38cf5gd+6Bht1u0h8HDGPHeoTM4yO05Etp/vCK1KMV4Clw/zX9+Sw+2EfvAcdFpwLIh2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"618680dea12bc4137333ed276537c4b504cb66cfb13adb5e30414e7c7f00461c","last_reissued_at":"2026-07-05T03:14:58.007440Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:14:58.007440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2109.07524","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:14:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"svR/06OjQ9ga7MmlD5sqPNta6u38nNpfAGUGaBfyUWrY+diwu73UpjaVDbkC6QcQ/vZzpDukfhLCb60NhxEADQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T07:47:09.065439Z"},"content_sha256":"3258182b3a702228bf79003a9f74eaf8eb5ab4718526751145e469bccb7864a3","schema_version":"1.0","event_id":"sha256:3258182b3a702228bf79003a9f74eaf8eb5ab4718526751145e469bccb7864a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:MGDIBXVBFPCBG4ZT5UTWKN6EWU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Anil Maheshwari, Michiel Smid, Sayan Bandyapadhyay","submitted_at":"2021-09-15T18:39:07Z","abstract_excerpt":"Given two sets $S$ and $T$ of points in the plane, of total size $n$, a {many-to-many} matching between $S$ and $T$ is a set of pairs $(p,q)$ such that $p\\in S$, $q\\in T$ and for each $r\\in S\\cup T$, $r$ appears in at least one such pair. The {cost of a pair} $(p,q)$ is the (Euclidean) distance between $p$ and $q$. In the {minimum-cost many-to-many matching} problem, the goal is to compute a many-to-many matching such that the sum of the costs of the pairs is minimized. This problem is a restricted version of minimum-weight edge cover in a bipartite graph, and hence can be solved in $O(n^3)$ t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.07524","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/2109.07524/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:14:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WM/QEG10Tt2C9at8Mywr8bBjar/0p36wP9Df5Vp40ne+D+Igcj82WpKS8PIFc8W3O7rbELPw6i1aUO9fQjSOBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T07:47:09.065949Z"},"content_sha256":"0a81c9143f2ff18a03ff2098758aa8049723cc025208a37f0849aa9412b3afb1","schema_version":"1.0","event_id":"sha256:0a81c9143f2ff18a03ff2098758aa8049723cc025208a37f0849aa9412b3afb1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MGDIBXVBFPCBG4ZT5UTWKN6EWU/bundle.json","state_url":"https://pith.science/pith/MGDIBXVBFPCBG4ZT5UTWKN6EWU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MGDIBXVBFPCBG4ZT5UTWKN6EWU/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-21T07:47:09Z","links":{"resolver":"https://pith.science/pith/MGDIBXVBFPCBG4ZT5UTWKN6EWU","bundle":"https://pith.science/pith/MGDIBXVBFPCBG4ZT5UTWKN6EWU/bundle.json","state":"https://pith.science/pith/MGDIBXVBFPCBG4ZT5UTWKN6EWU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MGDIBXVBFPCBG4ZT5UTWKN6EWU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:MGDIBXVBFPCBG4ZT5UTWKN6EWU","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":"e4d81a68ccad6d1c54eb20303faecc5a16c4283cd65892e0024c34932a30a9ee","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2021-09-15T18:39:07Z","title_canon_sha256":"008272c50b873d651f0d5e01dd5620a26fee7468e58cda92547451b287e240b5"},"schema_version":"1.0","source":{"id":"2109.07524","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.07524","created_at":"2026-07-05T03:14:58Z"},{"alias_kind":"arxiv_version","alias_value":"2109.07524v1","created_at":"2026-07-05T03:14:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.07524","created_at":"2026-07-05T03:14:58Z"},{"alias_kind":"pith_short_12","alias_value":"MGDIBXVBFPCB","created_at":"2026-07-05T03:14:58Z"},{"alias_kind":"pith_short_16","alias_value":"MGDIBXVBFPCBG4ZT","created_at":"2026-07-05T03:14:58Z"},{"alias_kind":"pith_short_8","alias_value":"MGDIBXVB","created_at":"2026-07-05T03:14:58Z"}],"graph_snapshots":[{"event_id":"sha256:0a81c9143f2ff18a03ff2098758aa8049723cc025208a37f0849aa9412b3afb1","target":"graph","created_at":"2026-07-05T03:14:58Z","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/2109.07524/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given two sets $S$ and $T$ of points in the plane, of total size $n$, a {many-to-many} matching between $S$ and $T$ is a set of pairs $(p,q)$ such that $p\\in S$, $q\\in T$ and for each $r\\in S\\cup T$, $r$ appears in at least one such pair. The {cost of a pair} $(p,q)$ is the (Euclidean) distance between $p$ and $q$. In the {minimum-cost many-to-many matching} problem, the goal is to compute a many-to-many matching such that the sum of the costs of the pairs is minimized. This problem is a restricted version of minimum-weight edge cover in a bipartite graph, and hence can be solved in $O(n^3)$ t","authors_text":"Anil Maheshwari, Michiel Smid, Sayan Bandyapadhyay","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2021-09-15T18:39:07Z","title":"Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.07524","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:3258182b3a702228bf79003a9f74eaf8eb5ab4718526751145e469bccb7864a3","target":"record","created_at":"2026-07-05T03:14:58Z","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":"e4d81a68ccad6d1c54eb20303faecc5a16c4283cd65892e0024c34932a30a9ee","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2021-09-15T18:39:07Z","title_canon_sha256":"008272c50b873d651f0d5e01dd5620a26fee7468e58cda92547451b287e240b5"},"schema_version":"1.0","source":{"id":"2109.07524","kind":"arxiv","version":1}},"canonical_sha256":"618680dea12bc4137333ed276537c4b504cb66cfb13adb5e30414e7c7f00461c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"618680dea12bc4137333ed276537c4b504cb66cfb13adb5e30414e7c7f00461c","first_computed_at":"2026-07-05T03:14:58.007440Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:14:58.007440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vLDSn3xwCayieIRu38cf5gd+6Bht1u0h8HDGPHeoTM4yO05Etp/vCK1KMV4Clw/zX9+Sw+2EfvAcdFpwLIh2BA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:14:58.007870Z","signed_message":"canonical_sha256_bytes"},"source_id":"2109.07524","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3258182b3a702228bf79003a9f74eaf8eb5ab4718526751145e469bccb7864a3","sha256:0a81c9143f2ff18a03ff2098758aa8049723cc025208a37f0849aa9412b3afb1"],"state_sha256":"775c64c570ee926c2103eb5fce136c7cd5928b920a05265f98c0c0e5c0fdce1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+UXvL1Pr91b/A5HbR7Ex3Yg6l8yrpwqCYHvvKj2qDlgdCO83QzNcn7C28jIskFnyuhyqoMmXMIaO/JMZUWeKAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T07:47:09.070187Z","bundle_sha256":"4a091911d76aefbbdf654e1bdd38314742ca95a08d2142ae65efb45e09d309b8"}}