{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IIRXMVN35A3QIDFT2Q2HZUOQVP","short_pith_number":"pith:IIRXMVN3","schema_version":"1.0","canonical_sha256":"42237655bbe837040cb3d4347cd1d0abca5c4e3c10a4f371d6065ab116911ed9","source":{"kind":"arxiv","id":"1904.03015","version":7},"attestation_state":"computed","paper":{"title":"A faster algorithm for the limited-capacity many-to-many point matching in one dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alireza Bagheri, Behrouz Minaei-Bidgoli, Fatemeh Rajabi-Alni","submitted_at":"2019-04-04T06:22:09Z","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1904.03015","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-04-04T06:22:09Z","cross_cats_sorted":[],"title_canon_sha256":"72617c0da29018dc6c79db1cf7452dc9adbb6f99ba405c3c602a8b7a96712bdd","abstract_canon_sha256":"f821a97608f54615970aa9b0efcb10e86ccedb293c90b185f52b270ca44361fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:28:49.681479Z","signature_b64":"9ErLvKh2VkNgpgvQOKsBccRRfKfF/YWqAeNUpr5M7iRXZhu3XUducvI9lfw0ENAUpENj8k3dAkEY5lH0KelXCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42237655bbe837040cb3d4347cd1d0abca5c4e3c10a4f371d6065ab116911ed9","last_reissued_at":"2026-07-05T06:28:49.681073Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:28:49.681073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A faster algorithm for the limited-capacity many-to-many point matching in one dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alireza Bagheri, Behrouz Minaei-Bidgoli, Fatemeh Rajabi-Alni","submitted_at":"2019-04-04T06:22:09Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03015","kind":"arxiv","version":7},"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/1904.03015/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.03015","created_at":"2026-07-05T06:28:49.681128+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.03015v7","created_at":"2026-07-05T06:28:49.681128+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03015","created_at":"2026-07-05T06:28:49.681128+00:00"},{"alias_kind":"pith_short_12","alias_value":"IIRXMVN35A3Q","created_at":"2026-07-05T06:28:49.681128+00:00"},{"alias_kind":"pith_short_16","alias_value":"IIRXMVN35A3QIDFT","created_at":"2026-07-05T06:28:49.681128+00:00"},{"alias_kind":"pith_short_8","alias_value":"IIRXMVN3","created_at":"2026-07-05T06:28:49.681128+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.02033","citing_title":"Fine-Grained Bounds for Courcelle's Theorem","ref_index":48,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IIRXMVN35A3QIDFT2Q2HZUOQVP","json":"https://pith.science/pith/IIRXMVN35A3QIDFT2Q2HZUOQVP.json","graph_json":"https://pith.science/api/pith-number/IIRXMVN35A3QIDFT2Q2HZUOQVP/graph.json","events_json":"https://pith.science/api/pith-number/IIRXMVN35A3QIDFT2Q2HZUOQVP/events.json","paper":"https://pith.science/paper/IIRXMVN3"},"agent_actions":{"view_html":"https://pith.science/pith/IIRXMVN35A3QIDFT2Q2HZUOQVP","download_json":"https://pith.science/pith/IIRXMVN35A3QIDFT2Q2HZUOQVP.json","view_paper":"https://pith.science/paper/IIRXMVN3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.03015&json=true","fetch_graph":"https://pith.science/api/pith-number/IIRXMVN35A3QIDFT2Q2HZUOQVP/graph.json","fetch_events":"https://pith.science/api/pith-number/IIRXMVN35A3QIDFT2Q2HZUOQVP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IIRXMVN35A3QIDFT2Q2HZUOQVP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IIRXMVN35A3QIDFT2Q2HZUOQVP/action/storage_attestation","attest_author":"https://pith.science/pith/IIRXMVN35A3QIDFT2Q2HZUOQVP/action/author_attestation","sign_citation":"https://pith.science/pith/IIRXMVN35A3QIDFT2Q2HZUOQVP/action/citation_signature","submit_replication":"https://pith.science/pith/IIRXMVN35A3QIDFT2Q2HZUOQVP/action/replication_record"}},"created_at":"2026-07-05T06:28:49.681128+00:00","updated_at":"2026-07-05T06:28:49.681128+00:00"}