{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:E56EK2D3B3V6TQBNFXGZN4D2A5","short_pith_number":"pith:E56EK2D3","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"},"canonical_sha256":"277c45687b0eebe9c02d2dcd96f07a077d2e9223dca9a93f10f947cc9642dd47","source":{"kind":"arxiv","id":"1702.01083","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01083","created_at":"2026-05-18T00:19:59Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01083v3","created_at":"2026-05-18T00:19:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01083","created_at":"2026-05-18T00:19:59Z"},{"alias_kind":"pith_short_12","alias_value":"E56EK2D3B3V6","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"E56EK2D3B3V6TQBN","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"E56EK2D3","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:E56EK2D3B3V6TQBNFXGZN4D2A5","target":"record","payload":{"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"},"canonical_sha256":"277c45687b0eebe9c02d2dcd96f07a077d2e9223dca9a93f10f947cc9642dd47","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"},"source_kind":"arxiv","source_id":"1702.01083","source_version":3,"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-05-18T00:19:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0gcsWy4D2DO4ZPuS0cfyA3W4aG6R5gYNRyH8z96BK6xLAY3+0W3QVaTSODZLLmKORaJ+WohViJfLJ+Zc2rFhAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T04:03:45.417740Z"},"content_sha256":"51bb7b135cb00cc35ef1a0ec403d01d1c76acd87a5d2bbf0d3a548858cfda5e2","schema_version":"1.0","event_id":"sha256:51bb7b135cb00cc35ef1a0ec403d01d1c76acd87a5d2bbf0d3a548858cfda5e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:E56EK2D3B3V6TQBNFXGZN4D2A5","target":"graph","payload":{"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"},"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-05-18T00:19:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PuapQ4dyEiBBTuT/llAO9TKigcN1tBD34ZgQWSxxP+j7HThqq7nNkTb2Tmu7hmMh636fkBiq85judKynEV/sCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T04:03:45.418289Z"},"content_sha256":"28e07bd32de14ad47f61632ae984addc5010b9502f11e40dd85da0832dc66eaa","schema_version":"1.0","event_id":"sha256:28e07bd32de14ad47f61632ae984addc5010b9502f11e40dd85da0832dc66eaa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E56EK2D3B3V6TQBNFXGZN4D2A5/bundle.json","state_url":"https://pith.science/pith/E56EK2D3B3V6TQBNFXGZN4D2A5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E56EK2D3B3V6TQBNFXGZN4D2A5/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-06-07T04:03:45Z","links":{"resolver":"https://pith.science/pith/E56EK2D3B3V6TQBNFXGZN4D2A5","bundle":"https://pith.science/pith/E56EK2D3B3V6TQBNFXGZN4D2A5/bundle.json","state":"https://pith.science/pith/E56EK2D3B3V6TQBNFXGZN4D2A5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E56EK2D3B3V6TQBNFXGZN4D2A5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:E56EK2D3B3V6TQBNFXGZN4D2A5","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":"5a66108f8a55c436405ca60df7892d57423539cf24990e071397f27d12326088","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-03T17:20:21Z","title_canon_sha256":"34305edd071652522f1be274f97cf8d8c62d5b7fa1139b901c8aa0baab66ff7b"},"schema_version":"1.0","source":{"id":"1702.01083","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01083","created_at":"2026-05-18T00:19:59Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01083v3","created_at":"2026-05-18T00:19:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01083","created_at":"2026-05-18T00:19:59Z"},{"alias_kind":"pith_short_12","alias_value":"E56EK2D3B3V6","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"E56EK2D3B3V6TQBN","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"E56EK2D3","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:28e07bd32de14ad47f61632ae984addc5010b9502f11e40dd85da0832dc66eaa","target":"graph","created_at":"2026-05-18T00:19:59Z","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":"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","authors_text":"Alireza Bagheri, Fatemeh Rajabi-Alni","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-03T17:20:21Z","title":"An O(n^2) algorithm for Many-To-Many Matching of Points with Demands in One Dimension"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01083","kind":"arxiv","version":3},"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:51bb7b135cb00cc35ef1a0ec403d01d1c76acd87a5d2bbf0d3a548858cfda5e2","target":"record","created_at":"2026-05-18T00:19:59Z","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":"5a66108f8a55c436405ca60df7892d57423539cf24990e071397f27d12326088","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-03T17:20:21Z","title_canon_sha256":"34305edd071652522f1be274f97cf8d8c62d5b7fa1139b901c8aa0baab66ff7b"},"schema_version":"1.0","source":{"id":"1702.01083","kind":"arxiv","version":3}},"canonical_sha256":"277c45687b0eebe9c02d2dcd96f07a077d2e9223dca9a93f10f947cc9642dd47","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"277c45687b0eebe9c02d2dcd96f07a077d2e9223dca9a93f10f947cc9642dd47","first_computed_at":"2026-05-18T00:19:59.230412Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:59.230412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZPlId3XxKYfyjJriQGhcn9HDSOGAChBQUEfjo0SldFmbal5ul9gbwg1bis69U0V6F0cisWW5ZzVjGD0ldUWKCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:59.230896Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.01083","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51bb7b135cb00cc35ef1a0ec403d01d1c76acd87a5d2bbf0d3a548858cfda5e2","sha256:28e07bd32de14ad47f61632ae984addc5010b9502f11e40dd85da0832dc66eaa"],"state_sha256":"7d0ae0f425d3ac5552d8c041eea09421a005b326f0da7c11fbc7d13fdf9ffb67"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CVf1Idc5KkcH3WLT8Bjy7gtdIiwP0x0SKnA7js9Bl2B9C0Qb2mTO1l5Ebv3pMiaIaN9bwYzeZbk2wF3OjZ/VAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T04:03:45.421905Z","bundle_sha256":"b1a2a541474409729195f5faf6dddd22008ad91e0d6d29200f391f83fe1758b0"}}