{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WW3WLY3XSHUYM3JDNNXNCSIXIJ","short_pith_number":"pith:WW3WLY3X","schema_version":"1.0","canonical_sha256":"b5b765e37791e9866d236b6ed14917425060ccaac2a8c84b4e3f2e3916d9a86e","source":{"kind":"arxiv","id":"1805.11473","version":2},"attestation_state":"computed","paper":{"title":"Popular Matchings and Limits to Tractability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Telikepalli Kavitha, Vladlena Powers, Xingyu Zhang, Yuri Faenza","submitted_at":"2018-05-26T16:13:25Z","abstract_excerpt":"We consider popular matching problems in both bipartite and non-bipartite graphs with strict preference lists. It is known that every stable matching is a min-size popular matching. A subclass of max-size popular matchings called dominant matchings has been well-studied in bipartite graphs: they always exist and there is a simple linear time algorithm to find one.\n  We show that stable and dominant matchings are the only two tractable subclasses of popular matchings in bipartite graphs; more precisely, we show that it is NP-complete to decide if $G$ admits a popular matching that is neither st"},"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":"1805.11473","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-05-26T16:13:25Z","cross_cats_sorted":[],"title_canon_sha256":"cef9182684bfe35d5c00a8685f1564dd3645d00c99b57e1321a152caa99b3cce","abstract_canon_sha256":"fa42dca895386394da3d5d618b299f8f15ce3e319b03d7a8d449b448bc6e5572"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:36.704128Z","signature_b64":"NnPmyjb6MKELAg+1C9rOLOCwLjwkYtqZSRm+fidl8NSye/7HiM8xBtLjIaiIVZPDyduNyRlYBVM0Y8cmiF7/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5b765e37791e9866d236b6ed14917425060ccaac2a8c84b4e3f2e3916d9a86e","last_reissued_at":"2026-05-18T00:13:36.703494Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:36.703494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Popular Matchings and Limits to Tractability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Telikepalli Kavitha, Vladlena Powers, Xingyu Zhang, Yuri Faenza","submitted_at":"2018-05-26T16:13:25Z","abstract_excerpt":"We consider popular matching problems in both bipartite and non-bipartite graphs with strict preference lists. It is known that every stable matching is a min-size popular matching. A subclass of max-size popular matchings called dominant matchings has been well-studied in bipartite graphs: they always exist and there is a simple linear time algorithm to find one.\n  We show that stable and dominant matchings are the only two tractable subclasses of popular matchings in bipartite graphs; more precisely, we show that it is NP-complete to decide if $G$ admits a popular matching that is neither st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11473","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":"1805.11473","created_at":"2026-05-18T00:13:36.703574+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.11473v2","created_at":"2026-05-18T00:13:36.703574+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11473","created_at":"2026-05-18T00:13:36.703574+00:00"},{"alias_kind":"pith_short_12","alias_value":"WW3WLY3XSHUY","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WW3WLY3XSHUYM3JD","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WW3WLY3X","created_at":"2026-05-18T12:33:01.666342+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/WW3WLY3XSHUYM3JDNNXNCSIXIJ","json":"https://pith.science/pith/WW3WLY3XSHUYM3JDNNXNCSIXIJ.json","graph_json":"https://pith.science/api/pith-number/WW3WLY3XSHUYM3JDNNXNCSIXIJ/graph.json","events_json":"https://pith.science/api/pith-number/WW3WLY3XSHUYM3JDNNXNCSIXIJ/events.json","paper":"https://pith.science/paper/WW3WLY3X"},"agent_actions":{"view_html":"https://pith.science/pith/WW3WLY3XSHUYM3JDNNXNCSIXIJ","download_json":"https://pith.science/pith/WW3WLY3XSHUYM3JDNNXNCSIXIJ.json","view_paper":"https://pith.science/paper/WW3WLY3X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.11473&json=true","fetch_graph":"https://pith.science/api/pith-number/WW3WLY3XSHUYM3JDNNXNCSIXIJ/graph.json","fetch_events":"https://pith.science/api/pith-number/WW3WLY3XSHUYM3JDNNXNCSIXIJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WW3WLY3XSHUYM3JDNNXNCSIXIJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WW3WLY3XSHUYM3JDNNXNCSIXIJ/action/storage_attestation","attest_author":"https://pith.science/pith/WW3WLY3XSHUYM3JDNNXNCSIXIJ/action/author_attestation","sign_citation":"https://pith.science/pith/WW3WLY3XSHUYM3JDNNXNCSIXIJ/action/citation_signature","submit_replication":"https://pith.science/pith/WW3WLY3XSHUYM3JDNNXNCSIXIJ/action/replication_record"}},"created_at":"2026-05-18T00:13:36.703574+00:00","updated_at":"2026-05-18T00:13:36.703574+00:00"}