{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:472IVA3NA6WUNU2P5EKXBYLWYW","short_pith_number":"pith:472IVA3N","schema_version":"1.0","canonical_sha256":"e7f48a836d07ad46d34fe91570e176c58989d8adc920885a9ee1bc8af3f73da4","source":{"kind":"arxiv","id":"1302.4426","version":1},"attestation_state":"computed","paper":{"title":"A new algorithm for Many to Many Matching with Demands and Capacities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fatemeh Rajabi-Alni","submitted_at":"2013-02-18T20:54:05Z","abstract_excerpt":"Let A={a_1,a_2,...,a_s} and {b_1,b_2,...,b_t} with s+r=n, the many to many point matching with demands and capacities matches each point a_i in A to at least alpha_i and at most alpha_i points in B, and each point b_j in B to at least beta_j and at most beta_j points in A for all 1 <= i <= s and 1 <= j <= t. In this paper, we present an O(n^4) time and O(n) space algorithm for this problem."},"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":"1302.4426","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-18T20:54:05Z","cross_cats_sorted":[],"title_canon_sha256":"72bd1104a11adad8632b7e3f05625b59391f5104e46288484e44cb91c68ae432","abstract_canon_sha256":"09c9a529f45c97faa80b50fdf1318cff0989c4dc62efa720028000d453263577"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:14.620486Z","signature_b64":"yNslkUjHjkcLJfM6N4xL7bToT1krOh8nJT8poF2yqHwHimafvDLbPjeF6dUVT11BVxI8l1Gnc5FMjdfbQ3AoCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7f48a836d07ad46d34fe91570e176c58989d8adc920885a9ee1bc8af3f73da4","last_reissued_at":"2026-05-18T03:33:14.619807Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:14.619807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new algorithm for Many to Many Matching with Demands and Capacities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fatemeh Rajabi-Alni","submitted_at":"2013-02-18T20:54:05Z","abstract_excerpt":"Let A={a_1,a_2,...,a_s} and {b_1,b_2,...,b_t} with s+r=n, the many to many point matching with demands and capacities matches each point a_i in A to at least alpha_i and at most alpha_i points in B, and each point b_j in B to at least beta_j and at most beta_j points in A for all 1 <= i <= s and 1 <= j <= t. In this paper, we present an O(n^4) time and O(n) space algorithm for this problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4426","kind":"arxiv","version":1},"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":"1302.4426","created_at":"2026-05-18T03:33:14.619918+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.4426v1","created_at":"2026-05-18T03:33:14.619918+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4426","created_at":"2026-05-18T03:33:14.619918+00:00"},{"alias_kind":"pith_short_12","alias_value":"472IVA3NA6WU","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"472IVA3NA6WUNU2P","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"472IVA3N","created_at":"2026-05-18T12:27:32.513160+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/472IVA3NA6WUNU2P5EKXBYLWYW","json":"https://pith.science/pith/472IVA3NA6WUNU2P5EKXBYLWYW.json","graph_json":"https://pith.science/api/pith-number/472IVA3NA6WUNU2P5EKXBYLWYW/graph.json","events_json":"https://pith.science/api/pith-number/472IVA3NA6WUNU2P5EKXBYLWYW/events.json","paper":"https://pith.science/paper/472IVA3N"},"agent_actions":{"view_html":"https://pith.science/pith/472IVA3NA6WUNU2P5EKXBYLWYW","download_json":"https://pith.science/pith/472IVA3NA6WUNU2P5EKXBYLWYW.json","view_paper":"https://pith.science/paper/472IVA3N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.4426&json=true","fetch_graph":"https://pith.science/api/pith-number/472IVA3NA6WUNU2P5EKXBYLWYW/graph.json","fetch_events":"https://pith.science/api/pith-number/472IVA3NA6WUNU2P5EKXBYLWYW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/472IVA3NA6WUNU2P5EKXBYLWYW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/472IVA3NA6WUNU2P5EKXBYLWYW/action/storage_attestation","attest_author":"https://pith.science/pith/472IVA3NA6WUNU2P5EKXBYLWYW/action/author_attestation","sign_citation":"https://pith.science/pith/472IVA3NA6WUNU2P5EKXBYLWYW/action/citation_signature","submit_replication":"https://pith.science/pith/472IVA3NA6WUNU2P5EKXBYLWYW/action/replication_record"}},"created_at":"2026-05-18T03:33:14.619918+00:00","updated_at":"2026-05-18T03:33:14.619918+00:00"}