{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UDJBROSZIOKJCFEAUVQQRJD4TE","short_pith_number":"pith:UDJBROSZ","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"},"canonical_sha256":"a0d218ba594394911480a56108a47c9933dc764304f1fc13a0aa8c0d4c632f53","source":{"kind":"arxiv","id":"1710.11462","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.11462","created_at":"2026-05-18T00:06:56Z"},{"alias_kind":"arxiv_version","alias_value":"1710.11462v2","created_at":"2026-05-18T00:06:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11462","created_at":"2026-05-18T00:06:56Z"},{"alias_kind":"pith_short_12","alias_value":"UDJBROSZIOKJ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UDJBROSZIOKJCFEA","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UDJBROSZ","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UDJBROSZIOKJCFEAUVQQRJD4TE","target":"record","payload":{"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"},"canonical_sha256":"a0d218ba594394911480a56108a47c9933dc764304f1fc13a0aa8c0d4c632f53","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"},"source_kind":"arxiv","source_id":"1710.11462","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:06:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GknbJ2O/SfxgLeUXFVQcqqLu+f2HGN5wIpbwi8dLOpTyMMEzjJJh/kB0LhYT6D0q+Epgg8xxsiW79FRE5H/pCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T19:44:44.279902Z"},"content_sha256":"69e9167981a1edbb15de8adcd0f0f8c69b775b5014de8fdf6dc8b67724aac01b","schema_version":"1.0","event_id":"sha256:69e9167981a1edbb15de8adcd0f0f8c69b775b5014de8fdf6dc8b67724aac01b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UDJBROSZIOKJCFEAUVQQRJD4TE","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:06:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kQmSMEiifDQMR9xYYcPVZlG2FBsi7WIEbklrny9Y20E+SfFAtdSVvN8z/ZOb9ne6QtRnhWeEeWWjpSs9xIVFDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T19:44:44.280243Z"},"content_sha256":"6992381754046cc50e6912b9f2fae4c7811c8685c6f3480025db0e783367cdbb","schema_version":"1.0","event_id":"sha256:6992381754046cc50e6912b9f2fae4c7811c8685c6f3480025db0e783367cdbb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UDJBROSZIOKJCFEAUVQQRJD4TE/bundle.json","state_url":"https://pith.science/pith/UDJBROSZIOKJCFEAUVQQRJD4TE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UDJBROSZIOKJCFEAUVQQRJD4TE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T19:44:44Z","links":{"resolver":"https://pith.science/pith/UDJBROSZIOKJCFEAUVQQRJD4TE","bundle":"https://pith.science/pith/UDJBROSZIOKJCFEAUVQQRJD4TE/bundle.json","state":"https://pith.science/pith/UDJBROSZIOKJCFEAUVQQRJD4TE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UDJBROSZIOKJCFEAUVQQRJD4TE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UDJBROSZIOKJCFEAUVQQRJD4TE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"04d5f157a314c90dfe319fde6424f4ec9f238d58ad2d418be98fcbaf47bda169","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-31T13:35:56Z","title_canon_sha256":"4f153f2d5105b3e2871ed36860467ebdfce2eefbc4b67fba47b38a8536de3602"},"schema_version":"1.0","source":{"id":"1710.11462","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.11462","created_at":"2026-05-18T00:06:56Z"},{"alias_kind":"arxiv_version","alias_value":"1710.11462v2","created_at":"2026-05-18T00:06:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11462","created_at":"2026-05-18T00:06:56Z"},{"alias_kind":"pith_short_12","alias_value":"UDJBROSZIOKJ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UDJBROSZIOKJCFEA","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UDJBROSZ","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:6992381754046cc50e6912b9f2fae4c7811c8685c6f3480025db0e783367cdbb","target":"graph","created_at":"2026-05-18T00:06:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Katarzyna Paluch, Pratik Ghosal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-31T13:35:56Z","title":"Manipulation Strategies for the Rank Maximal Matching Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.11462","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:69e9167981a1edbb15de8adcd0f0f8c69b775b5014de8fdf6dc8b67724aac01b","target":"record","created_at":"2026-05-18T00:06:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"04d5f157a314c90dfe319fde6424f4ec9f238d58ad2d418be98fcbaf47bda169","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-31T13:35:56Z","title_canon_sha256":"4f153f2d5105b3e2871ed36860467ebdfce2eefbc4b67fba47b38a8536de3602"},"schema_version":"1.0","source":{"id":"1710.11462","kind":"arxiv","version":2}},"canonical_sha256":"a0d218ba594394911480a56108a47c9933dc764304f1fc13a0aa8c0d4c632f53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0d218ba594394911480a56108a47c9933dc764304f1fc13a0aa8c0d4c632f53","first_computed_at":"2026-05-18T00:06:56.355332Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:56.355332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u/DWi3xbopFlLuF24nqzOYwkHmhxSmhWjflZKwydUwOvyBT169na+i9MC7PxfX6HYM7Hw58jd0pCbbo9na8wCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:56.355824Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.11462","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69e9167981a1edbb15de8adcd0f0f8c69b775b5014de8fdf6dc8b67724aac01b","sha256:6992381754046cc50e6912b9f2fae4c7811c8685c6f3480025db0e783367cdbb"],"state_sha256":"6a3968c42601881f2e4d7553237abdc7378b7b47813d33caa2d57dc2dbf86524"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MlYiQaDR5VWg4HZhgymBgq74iQPlsEnA9T4Upuzs+6+4+MKPmW5lyIw01RCDCoM8V1LHgdW5xtK0aBATCPBiBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T19:44:44.282208Z","bundle_sha256":"fffa37e21825e6e5cae1dd72b9823275d6d71022eddf30a99dda6b97137c0781"}}