{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:KKJSFHOVKJIYOZI4YONSZ5POMK","short_pith_number":"pith:KKJSFHOV","schema_version":"1.0","canonical_sha256":"5293229dd5525187651cc39b2cf5ee6291da5766c0e1e6208bc8e35c69f1b39f","source":{"kind":"arxiv","id":"1101.0021","version":1},"attestation_state":"computed","paper":{"title":"Popular b-matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Katarzyna Paluch","submitted_at":"2010-12-29T23:32:39Z","abstract_excerpt":"Suppose that each member of a set of agents has a preference list of a subset of houses, possibly involving ties and each agent and house has their capacity denoting the maximum number of correspondingly agents/houses that can be matched to him/her/it. We want to find a matching $M$, for which there is no other matching $M'$ such that more agents prefer $M'$ to $M$ than $M$ to $M'$. (What it means that an agent prefers one matching to the other is explained in the paper.) Popular matchings have been studied quite extensively, especially in the one-to-one setting. We provide a characterization "},"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":"1101.0021","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-29T23:32:39Z","cross_cats_sorted":[],"title_canon_sha256":"c65fa27d92f6a9b7c7142e2c6a5484eaa905e0fcfe411eb41ab6da23f8a308f1","abstract_canon_sha256":"b70a8f45859c36722c7fef565a07172d4bcd06aef799402cbe8b18c403f9d810"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:11.191900Z","signature_b64":"Lp6QvNRsGuLHE5zUT66vN/mHmQ+29M7gutP/EMD37QJqNSK7S2vxBKHpXjoAHTBX5N+UR8SnGdt1hVx8loUDAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5293229dd5525187651cc39b2cf5ee6291da5766c0e1e6208bc8e35c69f1b39f","last_reissued_at":"2026-05-18T04:32:11.191396Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:11.191396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Popular b-matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Katarzyna Paluch","submitted_at":"2010-12-29T23:32:39Z","abstract_excerpt":"Suppose that each member of a set of agents has a preference list of a subset of houses, possibly involving ties and each agent and house has their capacity denoting the maximum number of correspondingly agents/houses that can be matched to him/her/it. We want to find a matching $M$, for which there is no other matching $M'$ such that more agents prefer $M'$ to $M$ than $M$ to $M'$. (What it means that an agent prefers one matching to the other is explained in the paper.) Popular matchings have been studied quite extensively, especially in the one-to-one setting. We provide a characterization "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.0021","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":"1101.0021","created_at":"2026-05-18T04:32:11.191493+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.0021v1","created_at":"2026-05-18T04:32:11.191493+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.0021","created_at":"2026-05-18T04:32:11.191493+00:00"},{"alias_kind":"pith_short_12","alias_value":"KKJSFHOVKJIY","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"KKJSFHOVKJIYOZI4","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"KKJSFHOV","created_at":"2026-05-18T12:26:09.077623+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/KKJSFHOVKJIYOZI4YONSZ5POMK","json":"https://pith.science/pith/KKJSFHOVKJIYOZI4YONSZ5POMK.json","graph_json":"https://pith.science/api/pith-number/KKJSFHOVKJIYOZI4YONSZ5POMK/graph.json","events_json":"https://pith.science/api/pith-number/KKJSFHOVKJIYOZI4YONSZ5POMK/events.json","paper":"https://pith.science/paper/KKJSFHOV"},"agent_actions":{"view_html":"https://pith.science/pith/KKJSFHOVKJIYOZI4YONSZ5POMK","download_json":"https://pith.science/pith/KKJSFHOVKJIYOZI4YONSZ5POMK.json","view_paper":"https://pith.science/paper/KKJSFHOV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.0021&json=true","fetch_graph":"https://pith.science/api/pith-number/KKJSFHOVKJIYOZI4YONSZ5POMK/graph.json","fetch_events":"https://pith.science/api/pith-number/KKJSFHOVKJIYOZI4YONSZ5POMK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KKJSFHOVKJIYOZI4YONSZ5POMK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KKJSFHOVKJIYOZI4YONSZ5POMK/action/storage_attestation","attest_author":"https://pith.science/pith/KKJSFHOVKJIYOZI4YONSZ5POMK/action/author_attestation","sign_citation":"https://pith.science/pith/KKJSFHOVKJIYOZI4YONSZ5POMK/action/citation_signature","submit_replication":"https://pith.science/pith/KKJSFHOVKJIYOZI4YONSZ5POMK/action/replication_record"}},"created_at":"2026-05-18T04:32:11.191493+00:00","updated_at":"2026-05-18T04:32:11.191493+00:00"}