{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:2X3XVKZWC7GR4JLNB55VPWRF6G","short_pith_number":"pith:2X3XVKZW","canonical_record":{"source":{"id":"2110.02555","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-10-06T07:54:53Z","cross_cats_sorted":[],"title_canon_sha256":"0c667d664c5644655a5798c576ca1d705d0d147c19ec4b233ce8effc95b787f8","abstract_canon_sha256":"e2b8a80b46c9b1f7b5ebda207a864f8016c69cc96b01a55f2b5daff1e891b4cd"},"schema_version":"1.0"},"canonical_sha256":"d5f77aab3617cd1e256d0f7b57da25f181195acdd0b10dedb11a63896bba9347","source":{"kind":"arxiv","id":"2110.02555","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.02555","created_at":"2026-07-05T03:20:27Z"},{"alias_kind":"arxiv_version","alias_value":"2110.02555v1","created_at":"2026-07-05T03:20:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.02555","created_at":"2026-07-05T03:20:27Z"},{"alias_kind":"pith_short_12","alias_value":"2X3XVKZWC7GR","created_at":"2026-07-05T03:20:27Z"},{"alias_kind":"pith_short_16","alias_value":"2X3XVKZWC7GR4JLN","created_at":"2026-07-05T03:20:27Z"},{"alias_kind":"pith_short_8","alias_value":"2X3XVKZW","created_at":"2026-07-05T03:20:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:2X3XVKZWC7GR4JLNB55VPWRF6G","target":"record","payload":{"canonical_record":{"source":{"id":"2110.02555","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-10-06T07:54:53Z","cross_cats_sorted":[],"title_canon_sha256":"0c667d664c5644655a5798c576ca1d705d0d147c19ec4b233ce8effc95b787f8","abstract_canon_sha256":"e2b8a80b46c9b1f7b5ebda207a864f8016c69cc96b01a55f2b5daff1e891b4cd"},"schema_version":"1.0"},"canonical_sha256":"d5f77aab3617cd1e256d0f7b57da25f181195acdd0b10dedb11a63896bba9347","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:20:27.648638Z","signature_b64":"23xeuJrHLSQ5EIbR369z7hEVDZkIbNeNrWrAZDqNQ7Qz8bmNB7hJL2R2ZSfy28y+Vd7JSaaiH9QCvVxGTu0iAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5f77aab3617cd1e256d0f7b57da25f181195acdd0b10dedb11a63896bba9347","last_reissued_at":"2026-07-05T03:20:27.648256Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:20:27.648256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2110.02555","source_version":1,"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-07-05T03:20:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fxL2ePrxl4kOcrzLUXz8AKUMsdikiFudSZkmFNekk4hNyZOym/2ZKQUKrOkpqMA7+MtUu/NSAYw9ryrjTmLBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T07:59:59.947384Z"},"content_sha256":"3c9feb74a74bd9e12f9a7c82d5d5a05d91b8677b67d9359f7af064aaf2ae3a5e","schema_version":"1.0","event_id":"sha256:3c9feb74a74bd9e12f9a7c82d5d5a05d91b8677b67d9359f7af064aaf2ae3a5e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:2X3XVKZWC7GR4JLNB55VPWRF6G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Profile-based optimal stable matchings in the Roommates problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Manlove, Sofia Simola","submitted_at":"2021-10-06T07:54:53Z","abstract_excerpt":"The stable roommates problem can admit multiple different stable matchings. We have different criteria for deciding which one is optimal, but computing those is often NP-hard.\n  We show that the problem of finding generous or rank-maximal stable matchings in an instance of the roommates problem with incomplete lists is NP-hard even when the preference lists are at most length 3. We show that just maximising the number of first choices or minimising the number of last choices is NP-hard with the short preference lists.\n  We show that the number of $R^{th}$ choices, where $R$ is the minimum-regr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.02555","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2110.02555/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:20:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CGx7zXNLWThjHSu58Q8gIpPAHsj3w1CSiD1dGyL8020vRksmm2kR0HcJtvlfhXqUR7+BHAQe9YJZrXMl2wtvAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T07:59:59.947910Z"},"content_sha256":"5056233151ab3f6671cbbb34f49eb35e7261500bd2fd2a7f4db146737ab71b77","schema_version":"1.0","event_id":"sha256:5056233151ab3f6671cbbb34f49eb35e7261500bd2fd2a7f4db146737ab71b77"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2X3XVKZWC7GR4JLNB55VPWRF6G/bundle.json","state_url":"https://pith.science/pith/2X3XVKZWC7GR4JLNB55VPWRF6G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2X3XVKZWC7GR4JLNB55VPWRF6G/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-08-19T07:59:59Z","links":{"resolver":"https://pith.science/pith/2X3XVKZWC7GR4JLNB55VPWRF6G","bundle":"https://pith.science/pith/2X3XVKZWC7GR4JLNB55VPWRF6G/bundle.json","state":"https://pith.science/pith/2X3XVKZWC7GR4JLNB55VPWRF6G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2X3XVKZWC7GR4JLNB55VPWRF6G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:2X3XVKZWC7GR4JLNB55VPWRF6G","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":"e2b8a80b46c9b1f7b5ebda207a864f8016c69cc96b01a55f2b5daff1e891b4cd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-10-06T07:54:53Z","title_canon_sha256":"0c667d664c5644655a5798c576ca1d705d0d147c19ec4b233ce8effc95b787f8"},"schema_version":"1.0","source":{"id":"2110.02555","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.02555","created_at":"2026-07-05T03:20:27Z"},{"alias_kind":"arxiv_version","alias_value":"2110.02555v1","created_at":"2026-07-05T03:20:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.02555","created_at":"2026-07-05T03:20:27Z"},{"alias_kind":"pith_short_12","alias_value":"2X3XVKZWC7GR","created_at":"2026-07-05T03:20:27Z"},{"alias_kind":"pith_short_16","alias_value":"2X3XVKZWC7GR4JLN","created_at":"2026-07-05T03:20:27Z"},{"alias_kind":"pith_short_8","alias_value":"2X3XVKZW","created_at":"2026-07-05T03:20:27Z"}],"graph_snapshots":[{"event_id":"sha256:5056233151ab3f6671cbbb34f49eb35e7261500bd2fd2a7f4db146737ab71b77","target":"graph","created_at":"2026-07-05T03:20:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2110.02555/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The stable roommates problem can admit multiple different stable matchings. We have different criteria for deciding which one is optimal, but computing those is often NP-hard.\n  We show that the problem of finding generous or rank-maximal stable matchings in an instance of the roommates problem with incomplete lists is NP-hard even when the preference lists are at most length 3. We show that just maximising the number of first choices or minimising the number of last choices is NP-hard with the short preference lists.\n  We show that the number of $R^{th}$ choices, where $R$ is the minimum-regr","authors_text":"David Manlove, Sofia Simola","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-10-06T07:54:53Z","title":"Profile-based optimal stable matchings in the Roommates problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.02555","kind":"arxiv","version":1},"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:3c9feb74a74bd9e12f9a7c82d5d5a05d91b8677b67d9359f7af064aaf2ae3a5e","target":"record","created_at":"2026-07-05T03:20:27Z","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":"e2b8a80b46c9b1f7b5ebda207a864f8016c69cc96b01a55f2b5daff1e891b4cd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-10-06T07:54:53Z","title_canon_sha256":"0c667d664c5644655a5798c576ca1d705d0d147c19ec4b233ce8effc95b787f8"},"schema_version":"1.0","source":{"id":"2110.02555","kind":"arxiv","version":1}},"canonical_sha256":"d5f77aab3617cd1e256d0f7b57da25f181195acdd0b10dedb11a63896bba9347","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5f77aab3617cd1e256d0f7b57da25f181195acdd0b10dedb11a63896bba9347","first_computed_at":"2026-07-05T03:20:27.648256Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:20:27.648256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"23xeuJrHLSQ5EIbR369z7hEVDZkIbNeNrWrAZDqNQ7Qz8bmNB7hJL2R2ZSfy28y+Vd7JSaaiH9QCvVxGTu0iAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:20:27.648638Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.02555","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c9feb74a74bd9e12f9a7c82d5d5a05d91b8677b67d9359f7af064aaf2ae3a5e","sha256:5056233151ab3f6671cbbb34f49eb35e7261500bd2fd2a7f4db146737ab71b77"],"state_sha256":"adb044de25418ac3f711ac189cb4267a8a2a816592d5e72a6575e399f694c362"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bi5m7EA/x/+3hIK+l5YwkDRJDr+JrxQ36UNyuMO2CIqjW/0Oc4KUF41Hhwp6sYAs5DstvRitGo7ikuNU74JwAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T07:59:59.952767Z","bundle_sha256":"639de0b1fec78794580f3e7c63332942ece37b10d26d506299752d8965e9deeb"}}