{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VBM7OX7LTLMHW6R5UGAAF6BN7J","short_pith_number":"pith:VBM7OX7L","canonical_record":{"source":{"id":"1705.09218","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-24T07:49:52Z","cross_cats_sorted":[],"title_canon_sha256":"1999a324e851eed144a8bb4b9a297e89daf2604b0a02a6f35c0fb7aab8182d50","abstract_canon_sha256":"cf0cab703bd280fc3b6f979a774e7e3976dc668ab3fbbaf56293c4509c435dfd"},"schema_version":"1.0"},"canonical_sha256":"a859f75feb9ad87b7a3da18002f82dfa7c1050c1fbe82b9cdb1ec2f4a68996ee","source":{"kind":"arxiv","id":"1705.09218","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09218","created_at":"2026-05-18T00:31:55Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09218v3","created_at":"2026-05-18T00:31:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09218","created_at":"2026-05-18T00:31:55Z"},{"alias_kind":"pith_short_12","alias_value":"VBM7OX7LTLMH","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VBM7OX7LTLMHW6R5","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VBM7OX7L","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VBM7OX7LTLMHW6R5UGAAF6BN7J","target":"record","payload":{"canonical_record":{"source":{"id":"1705.09218","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-24T07:49:52Z","cross_cats_sorted":[],"title_canon_sha256":"1999a324e851eed144a8bb4b9a297e89daf2604b0a02a6f35c0fb7aab8182d50","abstract_canon_sha256":"cf0cab703bd280fc3b6f979a774e7e3976dc668ab3fbbaf56293c4509c435dfd"},"schema_version":"1.0"},"canonical_sha256":"a859f75feb9ad87b7a3da18002f82dfa7c1050c1fbe82b9cdb1ec2f4a68996ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:55.849438Z","signature_b64":"Us6SeI20XgXT86IdJJnrU/lYB8+FKmqIh8RcjIe9UuIowIZXPqqcoPqBJvaHHaznzqrV5nxne9FcJOmRndtJAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a859f75feb9ad87b7a3da18002f82dfa7c1050c1fbe82b9cdb1ec2f4a68996ee","last_reissued_at":"2026-05-18T00:31:55.848896Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:55.848896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.09218","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:31:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OOR+W4X2i9FRMYx4qfZJyBSMB+DQ7ob2NNBSvCVStT0NWqy0vRkbLpDR57XDGS7ZJft5voRudImUoQX5RKqiDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:22:32.585713Z"},"content_sha256":"44398b90e4d91e166e469e0202dfe3552413af29fd124577a67f5e4924396bbf","schema_version":"1.0","event_id":"sha256:44398b90e4d91e166e469e0202dfe3552413af29fd124577a67f5e4924396bbf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VBM7OX7LTLMHW6R5UGAAF6BN7J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Robust Solutions to Stable Marriage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Barry O'Sullivan, Begum Genc, Gilles Simonin, Mohamed Siala","submitted_at":"2017-05-24T07:49:52Z","abstract_excerpt":"We study the notion of robustness in stable matching problems. We first define robustness by introducing (a,b)-supermatches. An $(a,b)$-supermatch is a stable matching in which if $a$ pairs break up it is possible to find another stable matching by changing the partners of those $a$ pairs and at most $b$ other pairs. In this context, we define the most robust stable matching as a $(1,b)$-supermatch where b is minimum. We show that checking whether a given stable matching is a $(1,b)$-supermatch can be done in polynomial time. Next, we use this procedure to design a constraint programming model"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09218","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:31:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JvFX3cCm+YWMahZ33ajtaS2kWJZrpM8HDqR2X2f5WPjkfpCPaYEb2dxIxjZ2wlU/de2dPg/2eM7XERAViKdrAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:22:32.586060Z"},"content_sha256":"112abbf8396c5731a192bd1cad13894634569e1574ef247c093df09349bcdade","schema_version":"1.0","event_id":"sha256:112abbf8396c5731a192bd1cad13894634569e1574ef247c093df09349bcdade"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VBM7OX7LTLMHW6R5UGAAF6BN7J/bundle.json","state_url":"https://pith.science/pith/VBM7OX7LTLMHW6R5UGAAF6BN7J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VBM7OX7LTLMHW6R5UGAAF6BN7J/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-02T11:22:32Z","links":{"resolver":"https://pith.science/pith/VBM7OX7LTLMHW6R5UGAAF6BN7J","bundle":"https://pith.science/pith/VBM7OX7LTLMHW6R5UGAAF6BN7J/bundle.json","state":"https://pith.science/pith/VBM7OX7LTLMHW6R5UGAAF6BN7J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VBM7OX7LTLMHW6R5UGAAF6BN7J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VBM7OX7LTLMHW6R5UGAAF6BN7J","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":"cf0cab703bd280fc3b6f979a774e7e3976dc668ab3fbbaf56293c4509c435dfd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-24T07:49:52Z","title_canon_sha256":"1999a324e851eed144a8bb4b9a297e89daf2604b0a02a6f35c0fb7aab8182d50"},"schema_version":"1.0","source":{"id":"1705.09218","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09218","created_at":"2026-05-18T00:31:55Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09218v3","created_at":"2026-05-18T00:31:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09218","created_at":"2026-05-18T00:31:55Z"},{"alias_kind":"pith_short_12","alias_value":"VBM7OX7LTLMH","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VBM7OX7LTLMHW6R5","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VBM7OX7L","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:112abbf8396c5731a192bd1cad13894634569e1574ef247c093df09349bcdade","target":"graph","created_at":"2026-05-18T00:31:55Z","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 study the notion of robustness in stable matching problems. We first define robustness by introducing (a,b)-supermatches. An $(a,b)$-supermatch is a stable matching in which if $a$ pairs break up it is possible to find another stable matching by changing the partners of those $a$ pairs and at most $b$ other pairs. In this context, we define the most robust stable matching as a $(1,b)$-supermatch where b is minimum. We show that checking whether a given stable matching is a $(1,b)$-supermatch can be done in polynomial time. Next, we use this procedure to design a constraint programming model","authors_text":"Barry O'Sullivan, Begum Genc, Gilles Simonin, Mohamed Siala","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-24T07:49:52Z","title":"Finding Robust Solutions to Stable Marriage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09218","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:44398b90e4d91e166e469e0202dfe3552413af29fd124577a67f5e4924396bbf","target":"record","created_at":"2026-05-18T00:31:55Z","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":"cf0cab703bd280fc3b6f979a774e7e3976dc668ab3fbbaf56293c4509c435dfd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-24T07:49:52Z","title_canon_sha256":"1999a324e851eed144a8bb4b9a297e89daf2604b0a02a6f35c0fb7aab8182d50"},"schema_version":"1.0","source":{"id":"1705.09218","kind":"arxiv","version":3}},"canonical_sha256":"a859f75feb9ad87b7a3da18002f82dfa7c1050c1fbe82b9cdb1ec2f4a68996ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a859f75feb9ad87b7a3da18002f82dfa7c1050c1fbe82b9cdb1ec2f4a68996ee","first_computed_at":"2026-05-18T00:31:55.848896Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:55.848896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Us6SeI20XgXT86IdJJnrU/lYB8+FKmqIh8RcjIe9UuIowIZXPqqcoPqBJvaHHaznzqrV5nxne9FcJOmRndtJAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:55.849438Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.09218","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44398b90e4d91e166e469e0202dfe3552413af29fd124577a67f5e4924396bbf","sha256:112abbf8396c5731a192bd1cad13894634569e1574ef247c093df09349bcdade"],"state_sha256":"7e1e89c1ae20c53718713929f3c87d0652cb69384acecb754173a6673676cfbf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cly45styk0adSzpcWt8/YB9oDLJfbf1r7fhLjTnJ7hlk5GsOAFntNb1wNJWY19UDPR//UspHWc+9/Woy98TNDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T11:22:32.588218Z","bundle_sha256":"ede598dff72cf5ae183005424e733945160f951007bfd57e365c46aaf71113f6"}}