{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HOPPD4LWQWYRF2R6I3WXRYSYTR","short_pith_number":"pith:HOPPD4LW","schema_version":"1.0","canonical_sha256":"3b9ef1f17685b112ea3e46ed78e2589c74e39e69fe3f6bc07cf5b67b28da9171","source":{"kind":"arxiv","id":"1803.01478","version":2},"attestation_state":"computed","paper":{"title":"Two-sided popular matchings in bipartite graphs with forbidden/forced elements and weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Vladlena Powers, Xingyu Zhang, Yuri Faenza","submitted_at":"2018-03-05T03:07:07Z","abstract_excerpt":"Two-sided popular matchings in bipartite graphs are a well-known generalization of stable matchings in the marriage setting, and they are especially relevant when preference lists are incomplete. In this case, the cardinality of a stable matching can be as small as half the size of a maximum matching. Popular matchings allow for assignments of larger size while still guaranteeing a certain fairness condition. In fact, stable matchings are popular matchings of minimum size, and a maximum size popular matching can be as large as twice the size of a(ny) stable matching in a given instance. The 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":"1803.01478","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-03-05T03:07:07Z","cross_cats_sorted":[],"title_canon_sha256":"84b7e7e8454b6485be30fbaf62845954d94216ab971806e214682b14d9966a20","abstract_canon_sha256":"eabf578dd31d954d7497f30b1f2c07eaf7e2a1ec49ba16c5e80ec936a9269b81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:34.012606Z","signature_b64":"X+VDkyQkLGHu96bzjr737VzRDROxNV8prjAbmFnymYU5h9k++CRNFLiTFISEjqpb1wPRelbE02GYg/A8Pky4CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b9ef1f17685b112ea3e46ed78e2589c74e39e69fe3f6bc07cf5b67b28da9171","last_reissued_at":"2026-05-18T00:21:34.011907Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:34.011907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-sided popular matchings in bipartite graphs with forbidden/forced elements and weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Vladlena Powers, Xingyu Zhang, Yuri Faenza","submitted_at":"2018-03-05T03:07:07Z","abstract_excerpt":"Two-sided popular matchings in bipartite graphs are a well-known generalization of stable matchings in the marriage setting, and they are especially relevant when preference lists are incomplete. In this case, the cardinality of a stable matching can be as small as half the size of a maximum matching. Popular matchings allow for assignments of larger size while still guaranteeing a certain fairness condition. In fact, stable matchings are popular matchings of minimum size, and a maximum size popular matching can be as large as twice the size of a(ny) stable matching in a given instance. The st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.01478","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":"1803.01478","created_at":"2026-05-18T00:21:34.012022+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.01478v2","created_at":"2026-05-18T00:21:34.012022+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.01478","created_at":"2026-05-18T00:21:34.012022+00:00"},{"alias_kind":"pith_short_12","alias_value":"HOPPD4LWQWYR","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HOPPD4LWQWYRF2R6","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HOPPD4LW","created_at":"2026-05-18T12:32:28.185984+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/HOPPD4LWQWYRF2R6I3WXRYSYTR","json":"https://pith.science/pith/HOPPD4LWQWYRF2R6I3WXRYSYTR.json","graph_json":"https://pith.science/api/pith-number/HOPPD4LWQWYRF2R6I3WXRYSYTR/graph.json","events_json":"https://pith.science/api/pith-number/HOPPD4LWQWYRF2R6I3WXRYSYTR/events.json","paper":"https://pith.science/paper/HOPPD4LW"},"agent_actions":{"view_html":"https://pith.science/pith/HOPPD4LWQWYRF2R6I3WXRYSYTR","download_json":"https://pith.science/pith/HOPPD4LWQWYRF2R6I3WXRYSYTR.json","view_paper":"https://pith.science/paper/HOPPD4LW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.01478&json=true","fetch_graph":"https://pith.science/api/pith-number/HOPPD4LWQWYRF2R6I3WXRYSYTR/graph.json","fetch_events":"https://pith.science/api/pith-number/HOPPD4LWQWYRF2R6I3WXRYSYTR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HOPPD4LWQWYRF2R6I3WXRYSYTR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HOPPD4LWQWYRF2R6I3WXRYSYTR/action/storage_attestation","attest_author":"https://pith.science/pith/HOPPD4LWQWYRF2R6I3WXRYSYTR/action/author_attestation","sign_citation":"https://pith.science/pith/HOPPD4LWQWYRF2R6I3WXRYSYTR/action/citation_signature","submit_replication":"https://pith.science/pith/HOPPD4LWQWYRF2R6I3WXRYSYTR/action/replication_record"}},"created_at":"2026-05-18T00:21:34.012022+00:00","updated_at":"2026-05-18T00:21:34.012022+00:00"}