{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:E56EK2D3B3V6TQBNFXGZN4D2A5","short_pith_number":"pith:E56EK2D3","schema_version":"1.0","canonical_sha256":"277c45687b0eebe9c02d2dcd96f07a077d2e9223dca9a93f10f947cc9642dd47","source":{"kind":"arxiv","id":"1702.01083","version":3},"attestation_state":"computed","paper":{"title":"An O(n^2) algorithm for Many-To-Many Matching of Points with Demands in One Dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alireza Bagheri, Fatemeh Rajabi-Alni","submitted_at":"2017-02-03T17:20:21Z","abstract_excerpt":"Given two point sets S and T, we study the many-to-many matching with demands problem (MMD problem) which is a generalization of the many-to-many matching problem (MM problem). In an MMD, each point of one set must be matched to a given number of the points of the other set (each point has a demand). In this paper we consider a special case of MMD problem, the one-dimensional MMD (OMMD), where the input point sets S and T lie on the line. That is, the cost of matching a pair of points is equal to the distance between the two points. we present the first O(n^2)time algorithm for computing an OM"},"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":"1702.01083","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-03T17:20:21Z","cross_cats_sorted":[],"title_canon_sha256":"34305edd071652522f1be274f97cf8d8c62d5b7fa1139b901c8aa0baab66ff7b","abstract_canon_sha256":"5a66108f8a55c436405ca60df7892d57423539cf24990e071397f27d12326088"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:59.230896Z","signature_b64":"ZPlId3XxKYfyjJriQGhcn9HDSOGAChBQUEfjo0SldFmbal5ul9gbwg1bis69U0V6F0cisWW5ZzVjGD0ldUWKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"277c45687b0eebe9c02d2dcd96f07a077d2e9223dca9a93f10f947cc9642dd47","last_reissued_at":"2026-05-18T00:19:59.230412Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:59.230412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An O(n^2) algorithm for Many-To-Many Matching of Points with Demands in One Dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alireza Bagheri, Fatemeh Rajabi-Alni","submitted_at":"2017-02-03T17:20:21Z","abstract_excerpt":"Given two point sets S and T, we study the many-to-many matching with demands problem (MMD problem) which is a generalization of the many-to-many matching problem (MM problem). In an MMD, each point of one set must be matched to a given number of the points of the other set (each point has a demand). In this paper we consider a special case of MMD problem, the one-dimensional MMD (OMMD), where the input point sets S and T lie on the line. That is, the cost of matching a pair of points is equal to the distance between the two points. we present the first O(n^2)time algorithm for computing an OM"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01083","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1702.01083","created_at":"2026-05-18T00:19:59.230486+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.01083v3","created_at":"2026-05-18T00:19:59.230486+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01083","created_at":"2026-05-18T00:19:59.230486+00:00"},{"alias_kind":"pith_short_12","alias_value":"E56EK2D3B3V6","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"E56EK2D3B3V6TQBN","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"E56EK2D3","created_at":"2026-05-18T12:31:12.930513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E56EK2D3B3V6TQBNFXGZN4D2A5","json":"https://pith.science/pith/E56EK2D3B3V6TQBNFXGZN4D2A5.json","graph_json":"https://pith.science/api/pith-number/E56EK2D3B3V6TQBNFXGZN4D2A5/graph.json","events_json":"https://pith.science/api/pith-number/E56EK2D3B3V6TQBNFXGZN4D2A5/events.json","paper":"https://pith.science/paper/E56EK2D3"},"agent_actions":{"view_html":"https://pith.science/pith/E56EK2D3B3V6TQBNFXGZN4D2A5","download_json":"https://pith.science/pith/E56EK2D3B3V6TQBNFXGZN4D2A5.json","view_paper":"https://pith.science/paper/E56EK2D3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.01083&json=true","fetch_graph":"https://pith.science/api/pith-number/E56EK2D3B3V6TQBNFXGZN4D2A5/graph.json","fetch_events":"https://pith.science/api/pith-number/E56EK2D3B3V6TQBNFXGZN4D2A5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E56EK2D3B3V6TQBNFXGZN4D2A5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E56EK2D3B3V6TQBNFXGZN4D2A5/action/storage_attestation","attest_author":"https://pith.science/pith/E56EK2D3B3V6TQBNFXGZN4D2A5/action/author_attestation","sign_citation":"https://pith.science/pith/E56EK2D3B3V6TQBNFXGZN4D2A5/action/citation_signature","submit_replication":"https://pith.science/pith/E56EK2D3B3V6TQBNFXGZN4D2A5/action/replication_record"}},"created_at":"2026-05-18T00:19:59.230486+00:00","updated_at":"2026-05-18T00:19:59.230486+00:00"}