{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UDJBROSZIOKJCFEAUVQQRJD4TE","short_pith_number":"pith:UDJBROSZ","schema_version":"1.0","canonical_sha256":"a0d218ba594394911480a56108a47c9933dc764304f1fc13a0aa8c0d4c632f53","source":{"kind":"arxiv","id":"1710.11462","version":2},"attestation_state":"computed","paper":{"title":"Manipulation Strategies for the Rank Maximal Matching Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Katarzyna Paluch, Pratik Ghosal","submitted_at":"2017-10-31T13:35:56Z","abstract_excerpt":"We consider manipulation strategies for the rank-maximal matching problem. In the rank-maximal matching problem we are given a bipartite graph $G = (A \\cup P, E)$ such that $A$ denotes a set of applicants and $P$ a set of posts. Each applicant $a \\in A$ has a preference list over the set of his neighbours in $G$, possibly involving ties. Preference lists are represented by ranks on the edges - an edge $(a,p)$ has rank $i$, denoted as $rank(a,p)=i$, if post $p$ belongs to one of $a$'s $i$-th choices. A rank-maximal matching is one in which the maximum number of applicants is matched to their ra"},"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":"1710.11462","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-31T13:35:56Z","cross_cats_sorted":[],"title_canon_sha256":"4f153f2d5105b3e2871ed36860467ebdfce2eefbc4b67fba47b38a8536de3602","abstract_canon_sha256":"04d5f157a314c90dfe319fde6424f4ec9f238d58ad2d418be98fcbaf47bda169"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:56.355824Z","signature_b64":"u/DWi3xbopFlLuF24nqzOYwkHmhxSmhWjflZKwydUwOvyBT169na+i9MC7PxfX6HYM7Hw58jd0pCbbo9na8wCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0d218ba594394911480a56108a47c9933dc764304f1fc13a0aa8c0d4c632f53","last_reissued_at":"2026-05-18T00:06:56.355332Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:56.355332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Manipulation Strategies for the Rank Maximal Matching Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Katarzyna Paluch, Pratik Ghosal","submitted_at":"2017-10-31T13:35:56Z","abstract_excerpt":"We consider manipulation strategies for the rank-maximal matching problem. In the rank-maximal matching problem we are given a bipartite graph $G = (A \\cup P, E)$ such that $A$ denotes a set of applicants and $P$ a set of posts. Each applicant $a \\in A$ has a preference list over the set of his neighbours in $G$, possibly involving ties. Preference lists are represented by ranks on the edges - an edge $(a,p)$ has rank $i$, denoted as $rank(a,p)=i$, if post $p$ belongs to one of $a$'s $i$-th choices. A rank-maximal matching is one in which the maximum number of applicants is matched to their ra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.11462","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":"1710.11462","created_at":"2026-05-18T00:06:56.355409+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.11462v2","created_at":"2026-05-18T00:06:56.355409+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11462","created_at":"2026-05-18T00:06:56.355409+00:00"},{"alias_kind":"pith_short_12","alias_value":"UDJBROSZIOKJ","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"UDJBROSZIOKJCFEA","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"UDJBROSZ","created_at":"2026-05-18T12:31:46.661854+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/UDJBROSZIOKJCFEAUVQQRJD4TE","json":"https://pith.science/pith/UDJBROSZIOKJCFEAUVQQRJD4TE.json","graph_json":"https://pith.science/api/pith-number/UDJBROSZIOKJCFEAUVQQRJD4TE/graph.json","events_json":"https://pith.science/api/pith-number/UDJBROSZIOKJCFEAUVQQRJD4TE/events.json","paper":"https://pith.science/paper/UDJBROSZ"},"agent_actions":{"view_html":"https://pith.science/pith/UDJBROSZIOKJCFEAUVQQRJD4TE","download_json":"https://pith.science/pith/UDJBROSZIOKJCFEAUVQQRJD4TE.json","view_paper":"https://pith.science/paper/UDJBROSZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.11462&json=true","fetch_graph":"https://pith.science/api/pith-number/UDJBROSZIOKJCFEAUVQQRJD4TE/graph.json","fetch_events":"https://pith.science/api/pith-number/UDJBROSZIOKJCFEAUVQQRJD4TE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UDJBROSZIOKJCFEAUVQQRJD4TE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UDJBROSZIOKJCFEAUVQQRJD4TE/action/storage_attestation","attest_author":"https://pith.science/pith/UDJBROSZIOKJCFEAUVQQRJD4TE/action/author_attestation","sign_citation":"https://pith.science/pith/UDJBROSZIOKJCFEAUVQQRJD4TE/action/citation_signature","submit_replication":"https://pith.science/pith/UDJBROSZIOKJCFEAUVQQRJD4TE/action/replication_record"}},"created_at":"2026-05-18T00:06:56.355409+00:00","updated_at":"2026-05-18T00:06:56.355409+00:00"}