{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6SPQVQOA65IKIGUKHYVXF24BVW","short_pith_number":"pith:6SPQVQOA","canonical_record":{"source":{"id":"1707.04316","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-07-13T20:53:33Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2e174dc3662c50ba2d3d121b709f37b62f865e3a6b20fd80ec46f371c3faa407","abstract_canon_sha256":"b4414729b22a8998fe0191c7d7371aca46b83c81302193b62cb0fc106ef6ef5a"},"schema_version":"1.0"},"canonical_sha256":"f49f0ac1c0f750a41a8a3e2b72eb81adb75674a4bd8b790fec960aa0d06c614d","source":{"kind":"arxiv","id":"1707.04316","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04316","created_at":"2026-05-18T00:22:59Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04316v3","created_at":"2026-05-18T00:22:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04316","created_at":"2026-05-18T00:22:59Z"},{"alias_kind":"pith_short_12","alias_value":"6SPQVQOA65IK","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6SPQVQOA65IKIGUK","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6SPQVQOA","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6SPQVQOA65IKIGUKHYVXF24BVW","target":"record","payload":{"canonical_record":{"source":{"id":"1707.04316","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-07-13T20:53:33Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2e174dc3662c50ba2d3d121b709f37b62f865e3a6b20fd80ec46f371c3faa407","abstract_canon_sha256":"b4414729b22a8998fe0191c7d7371aca46b83c81302193b62cb0fc106ef6ef5a"},"schema_version":"1.0"},"canonical_sha256":"f49f0ac1c0f750a41a8a3e2b72eb81adb75674a4bd8b790fec960aa0d06c614d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:59.145688Z","signature_b64":"PlawPlV7GuMgDDnUquNo5FggzQ6bs9EBFbr3yuDCqDlcPuEsMCRAJijZ69CuvqZBe1c4+4oqceWg9ETipMSVCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f49f0ac1c0f750a41a8a3e2b72eb81adb75674a4bd8b790fec960aa0d06c614d","last_reissued_at":"2026-05-18T00:22:59.145062Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:59.145062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.04316","source_version":3,"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:22:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FB52x1AAzTxzk3nZfEZLJtqK463Va/POPEYn5rEQvemGXAgd6LGmlrXNGZW8VhMD1ULwViVvXwb+E3z6VVFGCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:26:52.229118Z"},"content_sha256":"a3c819afc4522144df220f1ca8d171fb18d50ee31c6e6e77ccd5dbc03b2e6d03","schema_version":"1.0","event_id":"sha256:a3c819afc4522144df220f1ca8d171fb18d50ee31c6e6e77ccd5dbc03b2e6d03"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6SPQVQOA65IKIGUKHYVXF24BVW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How hard is it to satisfy (almost) all roommates?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Danny Hermelin, Harel Yedidsion, Jiehua Chen, Manuel Sorge","submitted_at":"2017-07-13T20:53:33Z","abstract_excerpt":"The classic Stable Roommates problem (which is the non-bipartite generalization of the well-known Stable Marriage problem) asks whether there is a stable matching for a given set of agents, i.e. a partitioning of the agents into disjoint pairs such that no two agents induce a blocking pair. Herein, each agent has a preference list denoting who it prefers to have as a partner, and two agents are blocking if they prefer to be with each other rather than with their assigned partners. Since stable matchings may not be unique, we study an NP-hard optimization variant of Stable Roommates, called Ega"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04316","kind":"arxiv","version":3},"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:22:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LZBkNfqUC5jQudGkf2R4cKj0KuDVFd1vlKTD7xuTJlBiOETI0uj+lmcEsjy8sL2Gj36C8EGIj3wSjsW6xPRNCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:26:52.229477Z"},"content_sha256":"f9fe93ec769fc2a4700f9af9e01134bd9e9df94288d2a16e6b85c4853d82aecd","schema_version":"1.0","event_id":"sha256:f9fe93ec769fc2a4700f9af9e01134bd9e9df94288d2a16e6b85c4853d82aecd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6SPQVQOA65IKIGUKHYVXF24BVW/bundle.json","state_url":"https://pith.science/pith/6SPQVQOA65IKIGUKHYVXF24BVW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6SPQVQOA65IKIGUKHYVXF24BVW/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-05T16:26:52Z","links":{"resolver":"https://pith.science/pith/6SPQVQOA65IKIGUKHYVXF24BVW","bundle":"https://pith.science/pith/6SPQVQOA65IKIGUKHYVXF24BVW/bundle.json","state":"https://pith.science/pith/6SPQVQOA65IKIGUKHYVXF24BVW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6SPQVQOA65IKIGUKHYVXF24BVW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6SPQVQOA65IKIGUKHYVXF24BVW","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":"b4414729b22a8998fe0191c7d7371aca46b83c81302193b62cb0fc106ef6ef5a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-07-13T20:53:33Z","title_canon_sha256":"2e174dc3662c50ba2d3d121b709f37b62f865e3a6b20fd80ec46f371c3faa407"},"schema_version":"1.0","source":{"id":"1707.04316","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04316","created_at":"2026-05-18T00:22:59Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04316v3","created_at":"2026-05-18T00:22:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04316","created_at":"2026-05-18T00:22:59Z"},{"alias_kind":"pith_short_12","alias_value":"6SPQVQOA65IK","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6SPQVQOA65IKIGUK","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6SPQVQOA","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:f9fe93ec769fc2a4700f9af9e01134bd9e9df94288d2a16e6b85c4853d82aecd","target":"graph","created_at":"2026-05-18T00:22:59Z","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":"The classic Stable Roommates problem (which is the non-bipartite generalization of the well-known Stable Marriage problem) asks whether there is a stable matching for a given set of agents, i.e. a partitioning of the agents into disjoint pairs such that no two agents induce a blocking pair. Herein, each agent has a preference list denoting who it prefers to have as a partner, and two agents are blocking if they prefer to be with each other rather than with their assigned partners. Since stable matchings may not be unique, we study an NP-hard optimization variant of Stable Roommates, called Ega","authors_text":"Danny Hermelin, Harel Yedidsion, Jiehua Chen, Manuel Sorge","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-07-13T20:53:33Z","title":"How hard is it to satisfy (almost) all roommates?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04316","kind":"arxiv","version":3},"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:a3c819afc4522144df220f1ca8d171fb18d50ee31c6e6e77ccd5dbc03b2e6d03","target":"record","created_at":"2026-05-18T00:22:59Z","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":"b4414729b22a8998fe0191c7d7371aca46b83c81302193b62cb0fc106ef6ef5a","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-07-13T20:53:33Z","title_canon_sha256":"2e174dc3662c50ba2d3d121b709f37b62f865e3a6b20fd80ec46f371c3faa407"},"schema_version":"1.0","source":{"id":"1707.04316","kind":"arxiv","version":3}},"canonical_sha256":"f49f0ac1c0f750a41a8a3e2b72eb81adb75674a4bd8b790fec960aa0d06c614d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f49f0ac1c0f750a41a8a3e2b72eb81adb75674a4bd8b790fec960aa0d06c614d","first_computed_at":"2026-05-18T00:22:59.145062Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:59.145062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PlawPlV7GuMgDDnUquNo5FggzQ6bs9EBFbr3yuDCqDlcPuEsMCRAJijZ69CuvqZBe1c4+4oqceWg9ETipMSVCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:59.145688Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.04316","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3c819afc4522144df220f1ca8d171fb18d50ee31c6e6e77ccd5dbc03b2e6d03","sha256:f9fe93ec769fc2a4700f9af9e01134bd9e9df94288d2a16e6b85c4853d82aecd"],"state_sha256":"36e0b6ce5623c5ddf1d9ef2959a31d11427bd508c3b6574b3443340ef0b7dd1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rSmbOcygP1VEOKG1i0IckdbExgXRjhH8FKxxMQY50ADdQb0TIjoudJjIpiUhFJOgbQKucPGlHnu8QxVhZJ9FDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T16:26:52.231625Z","bundle_sha256":"5770514752cdf77db4dc9db35faffa751ddf8fe46064c5de11518ed46b35e259"}}