{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3GJKFXQJQOWPANU7CATZRZ3P7L","short_pith_number":"pith:3GJKFXQJ","canonical_record":{"source":{"id":"1804.00553","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-30T11:15:22Z","cross_cats_sorted":[],"title_canon_sha256":"5abefa5b7f995707e83e7291c535ed47bc65ce3f853f9750eac7949d21528ce7","abstract_canon_sha256":"3e66161cd6078af73a39649f4e4821420b16aca9e0aca63a931c9664c8c7178e"},"schema_version":"1.0"},"canonical_sha256":"d992a2de0983acf0369f102798e76ffada8191d7faf17164c283675dd5084ed6","source":{"kind":"arxiv","id":"1804.00553","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.00553","created_at":"2026-05-17T23:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"1804.00553v4","created_at":"2026-05-17T23:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00553","created_at":"2026-05-17T23:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"3GJKFXQJQOWP","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3GJKFXQJQOWPANU7","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3GJKFXQJ","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3GJKFXQJQOWPANU7CATZRZ3P7L","target":"record","payload":{"canonical_record":{"source":{"id":"1804.00553","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-30T11:15:22Z","cross_cats_sorted":[],"title_canon_sha256":"5abefa5b7f995707e83e7291c535ed47bc65ce3f853f9750eac7949d21528ce7","abstract_canon_sha256":"3e66161cd6078af73a39649f4e4821420b16aca9e0aca63a931c9664c8c7178e"},"schema_version":"1.0"},"canonical_sha256":"d992a2de0983acf0369f102798e76ffada8191d7faf17164c283675dd5084ed6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:19.358771Z","signature_b64":"hpS9eZSGgK3JjojSZ98UjjetsVHFUAMjit/3F60icOZepX95HwQq3HMtqU9E4XN/LpENiD9M0KCK8c/Zk9ovCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d992a2de0983acf0369f102798e76ffada8191d7faf17164c283675dd5084ed6","last_reissued_at":"2026-05-17T23:58:19.358184Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:19.358184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.00553","source_version":4,"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-17T23:58:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fE50jGC3tY1UJQihoQZZ//UB0BGP3EhaP15YVF624/+jemMTW1i8BTzx4ImnqzbLi5ZZEMoi+KIzDSvAFSDoAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:49:30.122250Z"},"content_sha256":"ef357c54f6e7a0a51c9259a4a4733ca8f4928ce92bd6dab9186fe9c698fe8e45","schema_version":"1.0","event_id":"sha256:ef357c54f6e7a0a51c9259a4a4733ca8f4928ce92bd6dab9186fe9c698fe8e45"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3GJKFXQJQOWPANU7CATZRZ3P7L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Stable Matchings that are Robust to Errors in the Input","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Tung Mai, Vijay V. Vazirani","submitted_at":"2018-03-30T11:15:22Z","abstract_excerpt":"We study the problem of finding solutions to the stable matching problem that are robust to errors in the input and we obtain a polynomial time algorithm for a special class of errors. In the process, we also initiate work on a new structural question concerning the stable matching problem, namely finding relationships between the lattices of solutions of two \"nearby\" instances.\n  Our main algorithmic result is the following: We identify a polynomially large class of errors, $D$, that can be introduced in a stable matching instance. Given an instance $A$ of stable matching, let $B$ be the rand"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00553","kind":"arxiv","version":4},"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-17T23:58:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3J5a8LssuNevXIp9zYkMpSB31N08BfQcASdrxDoN6zwCqrnn2YgH8CnZkV5nWWqBPqARHM+HJEhIrKk0rr4rDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:49:30.122860Z"},"content_sha256":"adf221cd0c6f5f1665aab13c9f361852a7f03568225141f7c50672fecafba3dc","schema_version":"1.0","event_id":"sha256:adf221cd0c6f5f1665aab13c9f361852a7f03568225141f7c50672fecafba3dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3GJKFXQJQOWPANU7CATZRZ3P7L/bundle.json","state_url":"https://pith.science/pith/3GJKFXQJQOWPANU7CATZRZ3P7L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3GJKFXQJQOWPANU7CATZRZ3P7L/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-05-30T16:49:30Z","links":{"resolver":"https://pith.science/pith/3GJKFXQJQOWPANU7CATZRZ3P7L","bundle":"https://pith.science/pith/3GJKFXQJQOWPANU7CATZRZ3P7L/bundle.json","state":"https://pith.science/pith/3GJKFXQJQOWPANU7CATZRZ3P7L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3GJKFXQJQOWPANU7CATZRZ3P7L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3GJKFXQJQOWPANU7CATZRZ3P7L","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":"3e66161cd6078af73a39649f4e4821420b16aca9e0aca63a931c9664c8c7178e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-30T11:15:22Z","title_canon_sha256":"5abefa5b7f995707e83e7291c535ed47bc65ce3f853f9750eac7949d21528ce7"},"schema_version":"1.0","source":{"id":"1804.00553","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.00553","created_at":"2026-05-17T23:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"1804.00553v4","created_at":"2026-05-17T23:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00553","created_at":"2026-05-17T23:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"3GJKFXQJQOWP","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3GJKFXQJQOWPANU7","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3GJKFXQJ","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:adf221cd0c6f5f1665aab13c9f361852a7f03568225141f7c50672fecafba3dc","target":"graph","created_at":"2026-05-17T23:58:19Z","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 problem of finding solutions to the stable matching problem that are robust to errors in the input and we obtain a polynomial time algorithm for a special class of errors. In the process, we also initiate work on a new structural question concerning the stable matching problem, namely finding relationships between the lattices of solutions of two \"nearby\" instances.\n  Our main algorithmic result is the following: We identify a polynomially large class of errors, $D$, that can be introduced in a stable matching instance. Given an instance $A$ of stable matching, let $B$ be the rand","authors_text":"Tung Mai, Vijay V. Vazirani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-30T11:15:22Z","title":"Finding Stable Matchings that are Robust to Errors in the Input"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00553","kind":"arxiv","version":4},"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:ef357c54f6e7a0a51c9259a4a4733ca8f4928ce92bd6dab9186fe9c698fe8e45","target":"record","created_at":"2026-05-17T23:58:19Z","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":"3e66161cd6078af73a39649f4e4821420b16aca9e0aca63a931c9664c8c7178e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-30T11:15:22Z","title_canon_sha256":"5abefa5b7f995707e83e7291c535ed47bc65ce3f853f9750eac7949d21528ce7"},"schema_version":"1.0","source":{"id":"1804.00553","kind":"arxiv","version":4}},"canonical_sha256":"d992a2de0983acf0369f102798e76ffada8191d7faf17164c283675dd5084ed6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d992a2de0983acf0369f102798e76ffada8191d7faf17164c283675dd5084ed6","first_computed_at":"2026-05-17T23:58:19.358184Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:19.358184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hpS9eZSGgK3JjojSZ98UjjetsVHFUAMjit/3F60icOZepX95HwQq3HMtqU9E4XN/LpENiD9M0KCK8c/Zk9ovCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:19.358771Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.00553","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef357c54f6e7a0a51c9259a4a4733ca8f4928ce92bd6dab9186fe9c698fe8e45","sha256:adf221cd0c6f5f1665aab13c9f361852a7f03568225141f7c50672fecafba3dc"],"state_sha256":"ab69490d2032c9e5d51589079a2ea9bad0eeaac59be44e504c96ec9334d78078"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j8fJXWWjzOeI1vMMz/fP+8WHL/AEQN8iRmQEa6n4NLNWvE1YiQAoaiYfARDhEK90G+AXknz05OA28tIBN6GpDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:49:30.125271Z","bundle_sha256":"45cb36e0509122cabb65f19e57cca077e32542a0b890d9a63e8cc80fd911cf63"}}