{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:TMCDYL2OX6E3NBSSPA535T5OAA","short_pith_number":"pith:TMCDYL2O","schema_version":"1.0","canonical_sha256":"9b043c2f4ebf89b68652783bbecfae000facdc77cc6479aa011911d534cc4b64","source":{"kind":"arxiv","id":"1301.3482","version":1},"attestation_state":"computed","paper":{"title":"Many to Many Matching with Demands and Capacities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Alireza Bagheri, Fatemeh Rajabi-Alni","submitted_at":"2013-01-15T20:43:38Z","abstract_excerpt":"Let A and B be two finite sets of points with total cardinality n, the many to many point matching with demands and capacities matches each point ai in A to at least alpha'i and at most alphai points in B, and each point bj in B to at least betaj and at most beta'j points in A for all 1 <= i <= s and 1 <= j <= t. In this paper, we present an upper bound for this problem using our new polynomial 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":"1301.3482","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-15T20:43:38Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"90c150a334a87f00c588f0da0b270e7e91045858adb8ad4f31ee314a66064717","abstract_canon_sha256":"ff5655ff5a5425387f8adb38a698f08609005db25c1e3bbf7c6c3b6232500992"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:25.535283Z","signature_b64":"MGA5MGRB/+x3u+iX75wb9/XgwaBHquDn4296nSOoy5qPy/6llp+/30BcNaj0oW3ngx47PH5LNvI2juElj2E4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b043c2f4ebf89b68652783bbecfae000facdc77cc6479aa011911d534cc4b64","last_reissued_at":"2026-05-18T03:36:25.534855Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:25.534855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Many to Many Matching with Demands and Capacities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Alireza Bagheri, Fatemeh Rajabi-Alni","submitted_at":"2013-01-15T20:43:38Z","abstract_excerpt":"Let A and B be two finite sets of points with total cardinality n, the many to many point matching with demands and capacities matches each point ai in A to at least alpha'i and at most alphai points in B, and each point bj in B to at least betaj and at most beta'j points in A for all 1 <= i <= s and 1 <= j <= t. In this paper, we present an upper bound for this problem using our new polynomial time algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3482","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":"1301.3482","created_at":"2026-05-18T03:36:25.534917+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.3482v1","created_at":"2026-05-18T03:36:25.534917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3482","created_at":"2026-05-18T03:36:25.534917+00:00"},{"alias_kind":"pith_short_12","alias_value":"TMCDYL2OX6E3","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"TMCDYL2OX6E3NBSS","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"TMCDYL2O","created_at":"2026-05-18T12:28:02.375192+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/TMCDYL2OX6E3NBSSPA535T5OAA","json":"https://pith.science/pith/TMCDYL2OX6E3NBSSPA535T5OAA.json","graph_json":"https://pith.science/api/pith-number/TMCDYL2OX6E3NBSSPA535T5OAA/graph.json","events_json":"https://pith.science/api/pith-number/TMCDYL2OX6E3NBSSPA535T5OAA/events.json","paper":"https://pith.science/paper/TMCDYL2O"},"agent_actions":{"view_html":"https://pith.science/pith/TMCDYL2OX6E3NBSSPA535T5OAA","download_json":"https://pith.science/pith/TMCDYL2OX6E3NBSSPA535T5OAA.json","view_paper":"https://pith.science/paper/TMCDYL2O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.3482&json=true","fetch_graph":"https://pith.science/api/pith-number/TMCDYL2OX6E3NBSSPA535T5OAA/graph.json","fetch_events":"https://pith.science/api/pith-number/TMCDYL2OX6E3NBSSPA535T5OAA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TMCDYL2OX6E3NBSSPA535T5OAA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TMCDYL2OX6E3NBSSPA535T5OAA/action/storage_attestation","attest_author":"https://pith.science/pith/TMCDYL2OX6E3NBSSPA535T5OAA/action/author_attestation","sign_citation":"https://pith.science/pith/TMCDYL2OX6E3NBSSPA535T5OAA/action/citation_signature","submit_replication":"https://pith.science/pith/TMCDYL2OX6E3NBSSPA535T5OAA/action/replication_record"}},"created_at":"2026-05-18T03:36:25.534917+00:00","updated_at":"2026-05-18T03:36:25.534917+00:00"}