{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UVNEFTTPCJU7GVNUACWB2LCJFW","short_pith_number":"pith:UVNEFTTP","canonical_record":{"source":{"id":"1605.08616","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-27T12:57:01Z","cross_cats_sorted":[],"title_canon_sha256":"0d4ee9356b6e6504b5129a4b60161cf9ba5492c3fbc229cf6361c35656cd267a","abstract_canon_sha256":"137aaae6363d4f9291ad51e43c4b68d8bafd493a80cb44ae8b2679860007c1a3"},"schema_version":"1.0"},"canonical_sha256":"a55a42ce6f1269f355b400ac1d2c492dbcdf6e4f65cdeab6eab710793c99cb91","source":{"kind":"arxiv","id":"1605.08616","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08616","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08616v1","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08616","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"pith_short_12","alias_value":"UVNEFTTPCJU7","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UVNEFTTPCJU7GVNU","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UVNEFTTP","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UVNEFTTPCJU7GVNUACWB2LCJFW","target":"record","payload":{"canonical_record":{"source":{"id":"1605.08616","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-27T12:57:01Z","cross_cats_sorted":[],"title_canon_sha256":"0d4ee9356b6e6504b5129a4b60161cf9ba5492c3fbc229cf6361c35656cd267a","abstract_canon_sha256":"137aaae6363d4f9291ad51e43c4b68d8bafd493a80cb44ae8b2679860007c1a3"},"schema_version":"1.0"},"canonical_sha256":"a55a42ce6f1269f355b400ac1d2c492dbcdf6e4f65cdeab6eab710793c99cb91","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:29.496435Z","signature_b64":"/TCi3/aqu/PGdAwQJq/mNYkh6qcjvzOLYun6pYUfXRJHj9ztdrhAgMFhAa94v1Ur/rjzVubAOW6HQ5hx6+n0CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a55a42ce6f1269f355b400ac1d2c492dbcdf6e4f65cdeab6eab710793c99cb91","last_reissued_at":"2026-05-18T01:13:29.495722Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:29.495722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.08616","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-05-18T01:13:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hIpTQV/jFZamzZC4pzpvTRKXBrxSfyF5SwAgAbFSPQd5Xnn9U/cJNvZII0+6AuWN56+wESPZbqn8lKIrp6cOAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:23:53.694598Z"},"content_sha256":"bee26c73a1f634b037303d198d2d671e450e5f619596540dc3fbef487d11b506","schema_version":"1.0","event_id":"sha256:bee26c73a1f634b037303d198d2d671e450e5f619596540dc3fbef487d11b506"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UVNEFTTPCJU7GVNUACWB2LCJFW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum-expectation matching under recourse","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jo\\~ao Pedro Pedroso, Shiro Ikeda","submitted_at":"2016-05-27T12:57:01Z","abstract_excerpt":"This paper addresses the problem of maximizing the expected size of a matching in the case of unreliable vertices and/or edges. The assumption is that upon failure, remaining vertices that have not been matched may be subject to a new assignment. This process may be repeated a given number of times, and the objective is to end with the overall maximum number of matched vertices.\n  The origin of this problem is in kidney exchange programs, going on in several countries, where a vertex is an incompatible patient-donor pair; the objective is to match these pairs so as to maximize the number of se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08616","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":""},"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-18T01:13:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DZC/FFQeSfAZzClcI/FQK8VdX0tAV2cDuULqStyy8P4TdgC2DujkHOKe7r6/MtMMA3gQ9/CDpGW0ZffPs1MdBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:23:53.694953Z"},"content_sha256":"d0b0bc858de8a75f8c62617d96f1b90cb9a3fbc734b2e6ca639296b87278aa4d","schema_version":"1.0","event_id":"sha256:d0b0bc858de8a75f8c62617d96f1b90cb9a3fbc734b2e6ca639296b87278aa4d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UVNEFTTPCJU7GVNUACWB2LCJFW/bundle.json","state_url":"https://pith.science/pith/UVNEFTTPCJU7GVNUACWB2LCJFW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UVNEFTTPCJU7GVNUACWB2LCJFW/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-04T15:23:53Z","links":{"resolver":"https://pith.science/pith/UVNEFTTPCJU7GVNUACWB2LCJFW","bundle":"https://pith.science/pith/UVNEFTTPCJU7GVNUACWB2LCJFW/bundle.json","state":"https://pith.science/pith/UVNEFTTPCJU7GVNUACWB2LCJFW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UVNEFTTPCJU7GVNUACWB2LCJFW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UVNEFTTPCJU7GVNUACWB2LCJFW","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":"137aaae6363d4f9291ad51e43c4b68d8bafd493a80cb44ae8b2679860007c1a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-27T12:57:01Z","title_canon_sha256":"0d4ee9356b6e6504b5129a4b60161cf9ba5492c3fbc229cf6361c35656cd267a"},"schema_version":"1.0","source":{"id":"1605.08616","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08616","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08616v1","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08616","created_at":"2026-05-18T01:13:29Z"},{"alias_kind":"pith_short_12","alias_value":"UVNEFTTPCJU7","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UVNEFTTPCJU7GVNU","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UVNEFTTP","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:d0b0bc858de8a75f8c62617d96f1b90cb9a3fbc734b2e6ca639296b87278aa4d","target":"graph","created_at":"2026-05-18T01:13:29Z","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":"This paper addresses the problem of maximizing the expected size of a matching in the case of unreliable vertices and/or edges. The assumption is that upon failure, remaining vertices that have not been matched may be subject to a new assignment. This process may be repeated a given number of times, and the objective is to end with the overall maximum number of matched vertices.\n  The origin of this problem is in kidney exchange programs, going on in several countries, where a vertex is an incompatible patient-donor pair; the objective is to match these pairs so as to maximize the number of se","authors_text":"Jo\\~ao Pedro Pedroso, Shiro Ikeda","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-27T12:57:01Z","title":"Maximum-expectation matching under recourse"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08616","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:bee26c73a1f634b037303d198d2d671e450e5f619596540dc3fbef487d11b506","target":"record","created_at":"2026-05-18T01:13:29Z","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":"137aaae6363d4f9291ad51e43c4b68d8bafd493a80cb44ae8b2679860007c1a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-27T12:57:01Z","title_canon_sha256":"0d4ee9356b6e6504b5129a4b60161cf9ba5492c3fbc229cf6361c35656cd267a"},"schema_version":"1.0","source":{"id":"1605.08616","kind":"arxiv","version":1}},"canonical_sha256":"a55a42ce6f1269f355b400ac1d2c492dbcdf6e4f65cdeab6eab710793c99cb91","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a55a42ce6f1269f355b400ac1d2c492dbcdf6e4f65cdeab6eab710793c99cb91","first_computed_at":"2026-05-18T01:13:29.495722Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:29.495722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/TCi3/aqu/PGdAwQJq/mNYkh6qcjvzOLYun6pYUfXRJHj9ztdrhAgMFhAa94v1Ur/rjzVubAOW6HQ5hx6+n0CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:29.496435Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.08616","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bee26c73a1f634b037303d198d2d671e450e5f619596540dc3fbef487d11b506","sha256:d0b0bc858de8a75f8c62617d96f1b90cb9a3fbc734b2e6ca639296b87278aa4d"],"state_sha256":"e8ac58d3cfa39d4d89da52c40fc2cefb2d16cd13d999f68a1a516301f4c02825"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vErbjOEHlrAH5akR11idCwu4HI6IoWPXLY1fKesFdeC7W/1NpajkW4zJHNYTya2jnJ4Et6V38WR6KW1CzUJBDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T15:23:53.697404Z","bundle_sha256":"fceb620ad729e63d9eb4c0e33fee11341818ce847488d5796ac0aacc5ed77609"}}