{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IIRXMVN35A3QIDFT2Q2HZUOQVP","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":"f821a97608f54615970aa9b0efcb10e86ccedb293c90b185f52b270ca44361fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-04-04T06:22:09Z","title_canon_sha256":"72617c0da29018dc6c79db1cf7452dc9adbb6f99ba405c3c602a8b7a96712bdd"},"schema_version":"1.0","source":{"id":"1904.03015","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.03015","created_at":"2026-07-05T06:28:49Z"},{"alias_kind":"arxiv_version","alias_value":"1904.03015v7","created_at":"2026-07-05T06:28:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03015","created_at":"2026-07-05T06:28:49Z"},{"alias_kind":"pith_short_12","alias_value":"IIRXMVN35A3Q","created_at":"2026-07-05T06:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"IIRXMVN35A3QIDFT","created_at":"2026-07-05T06:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"IIRXMVN3","created_at":"2026-07-05T06:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:859d31aef911c5a0c09be5279087e16aee00462cc512fc131af7264325639cea","target":"graph","created_at":"2026-07-05T06:28:49Z","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/1904.03015/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given two sets S and T, a limited-capacity many-to-many matching (LCMM) between S and T matches each element p in S (resp. T) to at least 1 and at most Cap(p) elements in T (resp. S), where the function Cap:S\\cup T-> Z>0 denotes the capacity of p. In this paper, we present the first linear time algorithm for finding a minimum-cost one-dimensional LCMM (OLCMM) between S and T, where S and T are points lying on a line, and the cost of matching p in S to q in T equals the l_2 distance between p,q. Our algorithm improves the previous best-known quadratic time algorithm.","authors_text":"Alireza Bagheri, Behrouz Minaei-Bidgoli, Fatemeh Rajabi-Alni","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-04-04T06:22:09Z","title":"A faster algorithm for the limited-capacity many-to-many point matching in one dimension"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03015","kind":"arxiv","version":7},"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:73b9eca3e11db68a067a3edea1250f263935963dfda204af9972d6d30e70b93c","target":"record","created_at":"2026-07-05T06:28:49Z","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":"f821a97608f54615970aa9b0efcb10e86ccedb293c90b185f52b270ca44361fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-04-04T06:22:09Z","title_canon_sha256":"72617c0da29018dc6c79db1cf7452dc9adbb6f99ba405c3c602a8b7a96712bdd"},"schema_version":"1.0","source":{"id":"1904.03015","kind":"arxiv","version":7}},"canonical_sha256":"42237655bbe837040cb3d4347cd1d0abca5c4e3c10a4f371d6065ab116911ed9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42237655bbe837040cb3d4347cd1d0abca5c4e3c10a4f371d6065ab116911ed9","first_computed_at":"2026-07-05T06:28:49.681073Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:28:49.681073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9ErLvKh2VkNgpgvQOKsBccRRfKfF/YWqAeNUpr5M7iRXZhu3XUducvI9lfw0ENAUpENj8k3dAkEY5lH0KelXCg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:28:49.681479Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.03015","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:73b9eca3e11db68a067a3edea1250f263935963dfda204af9972d6d30e70b93c","sha256:859d31aef911c5a0c09be5279087e16aee00462cc512fc131af7264325639cea"],"state_sha256":"4e3eaf6da1eb9d9e3c5b6c8e13d994a2d851e40b7e7c1a5502d4e040c551776c"}