{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:V4MUSEP65YO7SLWRB6ZL6Q2O75","short_pith_number":"pith:V4MUSEP6","schema_version":"1.0","canonical_sha256":"af194911feee1df92ed10fb2bf434eff7da58d7443cd4e9761abd2e13a522b82","source":{"kind":"arxiv","id":"1312.3552","version":1},"attestation_state":"computed","paper":{"title":"Counting Popular Matchings in House Allocation Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nitesh Jha, Rupam Acharyya, Sourav Chakraborty","submitted_at":"2013-12-12T17:21:20Z","abstract_excerpt":"We study the problem of counting the number of popular matchings in a given instance. A popular matching instance consists of agents A and houses H, where each agent ranks a subset of houses according to their preferences. A matching is an assignment of agents to houses. A matching M is more popular than matching M' if the number of agents that prefer M to M' is more than the number of people that prefer M' to M. A matching M is called popular if there exists no matching more popular than M. McDermid and Irving gave a poly-time algorithm for counting the number of popular matchings when the pr"},"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":"1312.3552","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-12T17:21:20Z","cross_cats_sorted":[],"title_canon_sha256":"6c48c56bafe76c5cadd84a634561f3d873a32aa5537805cc88f6f00412f023b7","abstract_canon_sha256":"419d9f9df36fad7c93c8cebc388a5dcd6ef28c7f5094bee1595c92d9f7416a25"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:50.572221Z","signature_b64":"YTcb7cq5bJMwDv15PdXuF7bYgh9BfcS0Z2/J3ErTVL4pNp+6H48+Y+L+Em02h/L6l9+8x3fIYznmCNASvwo2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af194911feee1df92ed10fb2bf434eff7da58d7443cd4e9761abd2e13a522b82","last_reissued_at":"2026-05-18T03:04:50.571452Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:50.571452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting Popular Matchings in House Allocation Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nitesh Jha, Rupam Acharyya, Sourav Chakraborty","submitted_at":"2013-12-12T17:21:20Z","abstract_excerpt":"We study the problem of counting the number of popular matchings in a given instance. A popular matching instance consists of agents A and houses H, where each agent ranks a subset of houses according to their preferences. A matching is an assignment of agents to houses. A matching M is more popular than matching M' if the number of agents that prefer M to M' is more than the number of people that prefer M' to M. A matching M is called popular if there exists no matching more popular than M. McDermid and Irving gave a poly-time algorithm for counting the number of popular matchings when the pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3552","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":"1312.3552","created_at":"2026-05-18T03:04:50.571586+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.3552v1","created_at":"2026-05-18T03:04:50.571586+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3552","created_at":"2026-05-18T03:04:50.571586+00:00"},{"alias_kind":"pith_short_12","alias_value":"V4MUSEP65YO7","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"V4MUSEP65YO7SLWR","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"V4MUSEP6","created_at":"2026-05-18T12:28:04.890932+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/V4MUSEP65YO7SLWRB6ZL6Q2O75","json":"https://pith.science/pith/V4MUSEP65YO7SLWRB6ZL6Q2O75.json","graph_json":"https://pith.science/api/pith-number/V4MUSEP65YO7SLWRB6ZL6Q2O75/graph.json","events_json":"https://pith.science/api/pith-number/V4MUSEP65YO7SLWRB6ZL6Q2O75/events.json","paper":"https://pith.science/paper/V4MUSEP6"},"agent_actions":{"view_html":"https://pith.science/pith/V4MUSEP65YO7SLWRB6ZL6Q2O75","download_json":"https://pith.science/pith/V4MUSEP65YO7SLWRB6ZL6Q2O75.json","view_paper":"https://pith.science/paper/V4MUSEP6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.3552&json=true","fetch_graph":"https://pith.science/api/pith-number/V4MUSEP65YO7SLWRB6ZL6Q2O75/graph.json","fetch_events":"https://pith.science/api/pith-number/V4MUSEP65YO7SLWRB6ZL6Q2O75/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V4MUSEP65YO7SLWRB6ZL6Q2O75/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V4MUSEP65YO7SLWRB6ZL6Q2O75/action/storage_attestation","attest_author":"https://pith.science/pith/V4MUSEP65YO7SLWRB6ZL6Q2O75/action/author_attestation","sign_citation":"https://pith.science/pith/V4MUSEP65YO7SLWRB6ZL6Q2O75/action/citation_signature","submit_replication":"https://pith.science/pith/V4MUSEP65YO7SLWRB6ZL6Q2O75/action/replication_record"}},"created_at":"2026-05-18T03:04:50.571586+00:00","updated_at":"2026-05-18T03:04:50.571586+00:00"}