{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:A6RXLR3Q7CDQI62K5JTC2R2UL3","short_pith_number":"pith:A6RXLR3Q","schema_version":"1.0","canonical_sha256":"07a375c770f887047b4aea662d47545ef90489d9fd20ac868419fb0a4d84ed96","source":{"kind":"arxiv","id":"1301.0902","version":1},"attestation_state":"computed","paper":{"title":"Popular Matchings -- structure and cheating strategies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Meghana Nasre","submitted_at":"2013-01-05T13:24:58Z","abstract_excerpt":"We consider the cheating strategies for the popular matchings problem. The popular matchings problem can be defined as follows: Let G = (A U P, E) be a bipartite graph where A denotes a set of agents, P denotes a set of posts and the edges in E are ranked. Each agent ranks a subset of posts in an order of preference, possibly involving ties. A matching M is popular if there exists no matching M' such that the number of agents that prefer M' to M exceeds the number of agents that prefer M to M'. Consider a centralized market where agents submit their preferences and a central authority matches "},"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":"1301.0902","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-05T13:24:58Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"866d65436feb2e64f378ec7b6b273be0d32649f89317570546c6688607bb1cac","abstract_canon_sha256":"7b3e6fec555c288b99a753a150878d479cd3c17d6f7afbd91d51ab323d17c0bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:07.436602Z","signature_b64":"o1sr9euoxRYfX99PJtXULj9tRrlw0O9gzRdTCLMtYVaNpunvefFybZlyYyM18rQIJLrH/Fegy+BY6hVugQNOBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07a375c770f887047b4aea662d47545ef90489d9fd20ac868419fb0a4d84ed96","last_reissued_at":"2026-05-18T03:37:07.435818Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:07.435818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Popular Matchings -- structure and cheating strategies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Meghana Nasre","submitted_at":"2013-01-05T13:24:58Z","abstract_excerpt":"We consider the cheating strategies for the popular matchings problem. The popular matchings problem can be defined as follows: Let G = (A U P, E) be a bipartite graph where A denotes a set of agents, P denotes a set of posts and the edges in E are ranked. Each agent ranks a subset of posts in an order of preference, possibly involving ties. A matching M is popular if there exists no matching M' such that the number of agents that prefer M' to M exceeds the number of agents that prefer M to M'. Consider a centralized market where agents submit their preferences and a central authority matches "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0902","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":"1301.0902","created_at":"2026-05-18T03:37:07.435927+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.0902v1","created_at":"2026-05-18T03:37:07.435927+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0902","created_at":"2026-05-18T03:37:07.435927+00:00"},{"alias_kind":"pith_short_12","alias_value":"A6RXLR3Q7CDQ","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"A6RXLR3Q7CDQI62K","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"A6RXLR3Q","created_at":"2026-05-18T12:27:38.830355+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/A6RXLR3Q7CDQI62K5JTC2R2UL3","json":"https://pith.science/pith/A6RXLR3Q7CDQI62K5JTC2R2UL3.json","graph_json":"https://pith.science/api/pith-number/A6RXLR3Q7CDQI62K5JTC2R2UL3/graph.json","events_json":"https://pith.science/api/pith-number/A6RXLR3Q7CDQI62K5JTC2R2UL3/events.json","paper":"https://pith.science/paper/A6RXLR3Q"},"agent_actions":{"view_html":"https://pith.science/pith/A6RXLR3Q7CDQI62K5JTC2R2UL3","download_json":"https://pith.science/pith/A6RXLR3Q7CDQI62K5JTC2R2UL3.json","view_paper":"https://pith.science/paper/A6RXLR3Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.0902&json=true","fetch_graph":"https://pith.science/api/pith-number/A6RXLR3Q7CDQI62K5JTC2R2UL3/graph.json","fetch_events":"https://pith.science/api/pith-number/A6RXLR3Q7CDQI62K5JTC2R2UL3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A6RXLR3Q7CDQI62K5JTC2R2UL3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A6RXLR3Q7CDQI62K5JTC2R2UL3/action/storage_attestation","attest_author":"https://pith.science/pith/A6RXLR3Q7CDQI62K5JTC2R2UL3/action/author_attestation","sign_citation":"https://pith.science/pith/A6RXLR3Q7CDQI62K5JTC2R2UL3/action/citation_signature","submit_replication":"https://pith.science/pith/A6RXLR3Q7CDQI62K5JTC2R2UL3/action/replication_record"}},"created_at":"2026-05-18T03:37:07.435927+00:00","updated_at":"2026-05-18T03:37:07.435927+00:00"}