{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:35KZHY7W7QNFZC3YUL5CIVX3F5","short_pith_number":"pith:35KZHY7W","schema_version":"1.0","canonical_sha256":"df5593e3f6fc1a5c8b78a2fa2456fb2f7acdb169cc7317fe7530b9d996961e93","source":{"kind":"arxiv","id":"1009.2591","version":1},"attestation_state":"computed","paper":{"title":"Popularity at Minimum Cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Meghana Nasre, Prajakta Nimbhorkar, Telikepalli Kavitha","submitted_at":"2010-09-14T08:31:31Z","abstract_excerpt":"We consider an extension of the {\\em popular matching} problem in this paper. The input to the popular matching problem is a bipartite graph G = (A U B,E), where A is a set of people, B is a set of items, and each person a belonging to A ranks a subset of items in an order of preference, with ties allowed. The popular matching problem seeks to compute a matching M* between people and items such that there is no matching M where more people are happier with M than with M*. Such a matching M* is called a popular matching. However, there are simple instances where no popular matching exists.\n  He"},"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":"1009.2591","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-14T08:31:31Z","cross_cats_sorted":[],"title_canon_sha256":"9875a9eb09a103c631b47a0f139d6e48698f6ab53211525493678f54b67b0e64","abstract_canon_sha256":"ad047a55290db9b40665e9205b6605fb3694b936212de4978738f5fac743bc7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:56.768664Z","signature_b64":"bj4XJViiT4n0siEfDI/tPQr2xVUBc0Fo4En778mPqIGIPbsdamvIG96JpK5saHy/eMRRrvwZUUAfkpZ1+cIYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df5593e3f6fc1a5c8b78a2fa2456fb2f7acdb169cc7317fe7530b9d996961e93","last_reissued_at":"2026-05-18T04:40:56.768090Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:56.768090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Popularity at Minimum Cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Meghana Nasre, Prajakta Nimbhorkar, Telikepalli Kavitha","submitted_at":"2010-09-14T08:31:31Z","abstract_excerpt":"We consider an extension of the {\\em popular matching} problem in this paper. The input to the popular matching problem is a bipartite graph G = (A U B,E), where A is a set of people, B is a set of items, and each person a belonging to A ranks a subset of items in an order of preference, with ties allowed. The popular matching problem seeks to compute a matching M* between people and items such that there is no matching M where more people are happier with M than with M*. Such a matching M* is called a popular matching. However, there are simple instances where no popular matching exists.\n  He"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.2591","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":"1009.2591","created_at":"2026-05-18T04:40:56.768183+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.2591v1","created_at":"2026-05-18T04:40:56.768183+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.2591","created_at":"2026-05-18T04:40:56.768183+00:00"},{"alias_kind":"pith_short_12","alias_value":"35KZHY7W7QNF","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"35KZHY7W7QNFZC3Y","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"35KZHY7W","created_at":"2026-05-18T12:26:03.138858+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/35KZHY7W7QNFZC3YUL5CIVX3F5","json":"https://pith.science/pith/35KZHY7W7QNFZC3YUL5CIVX3F5.json","graph_json":"https://pith.science/api/pith-number/35KZHY7W7QNFZC3YUL5CIVX3F5/graph.json","events_json":"https://pith.science/api/pith-number/35KZHY7W7QNFZC3YUL5CIVX3F5/events.json","paper":"https://pith.science/paper/35KZHY7W"},"agent_actions":{"view_html":"https://pith.science/pith/35KZHY7W7QNFZC3YUL5CIVX3F5","download_json":"https://pith.science/pith/35KZHY7W7QNFZC3YUL5CIVX3F5.json","view_paper":"https://pith.science/paper/35KZHY7W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.2591&json=true","fetch_graph":"https://pith.science/api/pith-number/35KZHY7W7QNFZC3YUL5CIVX3F5/graph.json","fetch_events":"https://pith.science/api/pith-number/35KZHY7W7QNFZC3YUL5CIVX3F5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/35KZHY7W7QNFZC3YUL5CIVX3F5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/35KZHY7W7QNFZC3YUL5CIVX3F5/action/storage_attestation","attest_author":"https://pith.science/pith/35KZHY7W7QNFZC3YUL5CIVX3F5/action/author_attestation","sign_citation":"https://pith.science/pith/35KZHY7W7QNFZC3YUL5CIVX3F5/action/citation_signature","submit_replication":"https://pith.science/pith/35KZHY7W7QNFZC3YUL5CIVX3F5/action/replication_record"}},"created_at":"2026-05-18T04:40:56.768183+00:00","updated_at":"2026-05-18T04:40:56.768183+00:00"}