{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BB2UL37UZGSA2YOIJWIREUYDAI","short_pith_number":"pith:BB2UL37U","schema_version":"1.0","canonical_sha256":"087545eff4c9a40d61c84d911253030226796e2864365e45cbf6f9de9de99267","source":{"kind":"arxiv","id":"1609.07531","version":2},"attestation_state":"computed","paper":{"title":"Popular Matchings with Multiple Partners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.GT","authors_text":"F. Brandl, T. Kavitha","submitted_at":"2016-09-23T22:08:41Z","abstract_excerpt":"Our input is a bipartite graph $G = (A \\cup B,E)$ where each vertex in $A \\cup B$ has a preference list strictly ranking its neighbors. The vertices in $A$ and in $B$ are called students and courses, respectively. Each student $a$ seeks to be matched to $\\mathsf{cap}(a) \\ge 1$ courses while each course $b$ seeks $\\mathsf{cap}(b) \\ge 1$ many students to be matched to it. The Gale-Shapley algorithm computes a pairwise-stable matching (one with no blocking edge) in $G$ in linear time. We consider the problem of computing a popular matching in $G$ -- a matching $M$ is popular if $M$ cannot lose an"},"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":"1609.07531","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-09-23T22:08:41Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"7aaa21fb241e9fd64e1c655ba73d4174141fd559f04c5d38b36d7f0b7f877002","abstract_canon_sha256":"c02cdf9e750abd3b5a05c3147e381d0c381f97382b9cdf4f081657a432d9f9cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:59.814042Z","signature_b64":"J10XXA1cyUR3Q6rBUwfNfZskqKYuVt5m5mXom8WY5Cfda5ocyGStH1Z3LMUHDQjMhO0G/r3/OILyhmiKHesaDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"087545eff4c9a40d61c84d911253030226796e2864365e45cbf6f9de9de99267","last_reissued_at":"2026-05-18T00:33:59.813416Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:59.813416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Popular Matchings with Multiple Partners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.GT","authors_text":"F. Brandl, T. Kavitha","submitted_at":"2016-09-23T22:08:41Z","abstract_excerpt":"Our input is a bipartite graph $G = (A \\cup B,E)$ where each vertex in $A \\cup B$ has a preference list strictly ranking its neighbors. The vertices in $A$ and in $B$ are called students and courses, respectively. Each student $a$ seeks to be matched to $\\mathsf{cap}(a) \\ge 1$ courses while each course $b$ seeks $\\mathsf{cap}(b) \\ge 1$ many students to be matched to it. The Gale-Shapley algorithm computes a pairwise-stable matching (one with no blocking edge) in $G$ in linear time. We consider the problem of computing a popular matching in $G$ -- a matching $M$ is popular if $M$ cannot lose an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07531","kind":"arxiv","version":2},"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":"1609.07531","created_at":"2026-05-18T00:33:59.813500+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.07531v2","created_at":"2026-05-18T00:33:59.813500+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07531","created_at":"2026-05-18T00:33:59.813500+00:00"},{"alias_kind":"pith_short_12","alias_value":"BB2UL37UZGSA","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"BB2UL37UZGSA2YOI","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"BB2UL37U","created_at":"2026-05-18T12:30:07.202191+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/BB2UL37UZGSA2YOIJWIREUYDAI","json":"https://pith.science/pith/BB2UL37UZGSA2YOIJWIREUYDAI.json","graph_json":"https://pith.science/api/pith-number/BB2UL37UZGSA2YOIJWIREUYDAI/graph.json","events_json":"https://pith.science/api/pith-number/BB2UL37UZGSA2YOIJWIREUYDAI/events.json","paper":"https://pith.science/paper/BB2UL37U"},"agent_actions":{"view_html":"https://pith.science/pith/BB2UL37UZGSA2YOIJWIREUYDAI","download_json":"https://pith.science/pith/BB2UL37UZGSA2YOIJWIREUYDAI.json","view_paper":"https://pith.science/paper/BB2UL37U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.07531&json=true","fetch_graph":"https://pith.science/api/pith-number/BB2UL37UZGSA2YOIJWIREUYDAI/graph.json","fetch_events":"https://pith.science/api/pith-number/BB2UL37UZGSA2YOIJWIREUYDAI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BB2UL37UZGSA2YOIJWIREUYDAI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BB2UL37UZGSA2YOIJWIREUYDAI/action/storage_attestation","attest_author":"https://pith.science/pith/BB2UL37UZGSA2YOIJWIREUYDAI/action/author_attestation","sign_citation":"https://pith.science/pith/BB2UL37UZGSA2YOIJWIREUYDAI/action/citation_signature","submit_replication":"https://pith.science/pith/BB2UL37UZGSA2YOIJWIREUYDAI/action/replication_record"}},"created_at":"2026-05-18T00:33:59.813500+00:00","updated_at":"2026-05-18T00:33:59.813500+00:00"}