{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RYWGJP4FQGFR625AXF3EUM22FD","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":"44b854201573b18057a6c6181a4df56d0a9d9bde8facf54ebdd1f2200a8e215f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-10-24T16:02:52Z","title_canon_sha256":"2c2c3b5c9c50272decc216c80070d01d1e906df51411d97e4fa0f6fda4b95d95"},"schema_version":"1.0","source":{"id":"1810.10466","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10466","created_at":"2026-05-18T00:02:23Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10466v1","created_at":"2026-05-18T00:02:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10466","created_at":"2026-05-18T00:02:23Z"},{"alias_kind":"pith_short_12","alias_value":"RYWGJP4FQGFR","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RYWGJP4FQGFR625A","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RYWGJP4F","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:2416c789929d31d6502e7e9ac32988d206afdbaba297f0ea89a76c12e3358779","target":"graph","created_at":"2026-05-18T00:02:23Z","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"},"paper":{"abstract_excerpt":"Our goal is to compare two planar point sets by finding subsets of a given size such that a minimum-weight matching between them has the smallest weight. This can be done by a translation of one set that minimizes the weight of the matching. We give efficient algorithms (a) for finding approximately optimal matchings, when the cost of a matching is the $L_p$-norm of the tuple of the Euclidean distances between the pairs of matched points, for any $p\\in [1,\\infty]$, and (b)~for constructing small-size approximate minimization (or matching) diagrams: partitions of the translation space into regi","authors_text":"Allen Xiao, Geva Kipper, G\\\"unter Rote, Haim Kaplan, Micha Sharir, Pankaj K. Agarwal, Wolfgang Mulzer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-10-24T16:02:52Z","title":"Approximate Minimum-Weight Matching with Outliers under Translation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10466","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:f796e8d320d21e648e9bc80a8d89c90a7292aa8f64037a04326b4b62bf2f7ef6","target":"record","created_at":"2026-05-18T00:02:23Z","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":"44b854201573b18057a6c6181a4df56d0a9d9bde8facf54ebdd1f2200a8e215f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-10-24T16:02:52Z","title_canon_sha256":"2c2c3b5c9c50272decc216c80070d01d1e906df51411d97e4fa0f6fda4b95d95"},"schema_version":"1.0","source":{"id":"1810.10466","kind":"arxiv","version":1}},"canonical_sha256":"8e2c64bf85818b1f6ba0b9764a335a28d35d1740fe9e7d2905e34da60136e7b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e2c64bf85818b1f6ba0b9764a335a28d35d1740fe9e7d2905e34da60136e7b6","first_computed_at":"2026-05-18T00:02:23.026513Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:23.026513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jQjeyxa4ojYxuGNrSKDuGz9g4YxqyACDqHJG4dvnxR+wJG3UrrUvS/YMC9Z232xVjciWyItav5o5HgSeYYTgCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:23.027977Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.10466","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f796e8d320d21e648e9bc80a8d89c90a7292aa8f64037a04326b4b62bf2f7ef6","sha256:2416c789929d31d6502e7e9ac32988d206afdbaba297f0ea89a76c12e3358779"],"state_sha256":"558bb85d223344ebf6b68edf2503671d2cd9a7b7ed6fb22b9eccf8d1f25c650a"}