{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GUHKS3Y67WMHVUFILO5BYL72QT","short_pith_number":"pith:GUHKS3Y6","canonical_record":{"source":{"id":"1306.2988","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-12T23:07:27Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"f4417fb9d550090af8bacbc2e68447aecdba79d4fa2a35c8d250d05be2fd4af5","abstract_canon_sha256":"d045a716cb9b30d2db79e46f41527c9d0bc82cefc573c7b92973f86afddc5f3e"},"schema_version":"1.0"},"canonical_sha256":"350ea96f1efd987ad0a85bba1c2ffa84deabd59b7be385660b3b77dfbf7c6b20","source":{"kind":"arxiv","id":"1306.2988","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2988","created_at":"2026-05-18T03:15:17Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2988v2","created_at":"2026-05-18T03:15:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2988","created_at":"2026-05-18T03:15:17Z"},{"alias_kind":"pith_short_12","alias_value":"GUHKS3Y67WMH","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GUHKS3Y67WMHVUFI","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GUHKS3Y6","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GUHKS3Y67WMHVUFILO5BYL72QT","target":"record","payload":{"canonical_record":{"source":{"id":"1306.2988","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-12T23:07:27Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"f4417fb9d550090af8bacbc2e68447aecdba79d4fa2a35c8d250d05be2fd4af5","abstract_canon_sha256":"d045a716cb9b30d2db79e46f41527c9d0bc82cefc573c7b92973f86afddc5f3e"},"schema_version":"1.0"},"canonical_sha256":"350ea96f1efd987ad0a85bba1c2ffa84deabd59b7be385660b3b77dfbf7c6b20","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:18.000278Z","signature_b64":"hqB5LemmOOa1Bc4CX2K7CL8Uajsyr4DcsBa+u6csL6lsKimJ+2Zb4n3wNToQ6dTM83bxepofo3ZYx9R64xCrDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"350ea96f1efd987ad0a85bba1c2ffa84deabd59b7be385660b3b77dfbf7c6b20","last_reissued_at":"2026-05-18T03:15:17.999450Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:17.999450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.2988","source_version":2,"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-18T03:15:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rfAhyKadSFvRGzKlANKXongKmTS0ckIaM7gP8qErflP8v68k+GKidCw+hheHRrS7qB3tAtHujy4XMLievo8cCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:17:57.056673Z"},"content_sha256":"04577e233f27ede1ea0ca78b5ce429912bc97720b27ef9eb3e54371ce545efd1","schema_version":"1.0","event_id":"sha256:04577e233f27ede1ea0ca78b5ce429912bc97720b27ef9eb3e54371ce545efd1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GUHKS3Y67WMHVUFILO5BYL72QT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matching with our Eyes Closed","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Gagan Goel, Pushkar Tripathi","submitted_at":"2013-06-12T23:07:27Z","abstract_excerpt":"Motivated by an application in kidney exchange, we study the following query-commit problem: we are given the set of vertices of a non-bipartite graph G. The set of edges in this graph are not known ahead of time. We can query any pair of vertices to determine if they are adjacent. If the queried edge exists, we are committed to match the two endpoints. Our objective is to maximize the size of the matching.\n  This restriction in the amount of information available to the algorithm constraints us to implement myopic, greedy-like algorithms. A simple deterministic greedy algorithm achieves a fac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2988","kind":"arxiv","version":2},"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-18T03:15:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CYKSiDnkMXyeEP5CcIJvGTqpov58X7KSaGAYg3G2e5BdNZKCR54SRy15fCmsqXnor3o2po6d7rneOYn8Lbs0DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:17:57.057029Z"},"content_sha256":"bc31ef653dd07658b4d61cbaaad9a4873ca8de7f381c30c8e3d5169088236318","schema_version":"1.0","event_id":"sha256:bc31ef653dd07658b4d61cbaaad9a4873ca8de7f381c30c8e3d5169088236318"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GUHKS3Y67WMHVUFILO5BYL72QT/bundle.json","state_url":"https://pith.science/pith/GUHKS3Y67WMHVUFILO5BYL72QT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GUHKS3Y67WMHVUFILO5BYL72QT/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-03T16:17:57Z","links":{"resolver":"https://pith.science/pith/GUHKS3Y67WMHVUFILO5BYL72QT","bundle":"https://pith.science/pith/GUHKS3Y67WMHVUFILO5BYL72QT/bundle.json","state":"https://pith.science/pith/GUHKS3Y67WMHVUFILO5BYL72QT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GUHKS3Y67WMHVUFILO5BYL72QT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GUHKS3Y67WMHVUFILO5BYL72QT","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":"d045a716cb9b30d2db79e46f41527c9d0bc82cefc573c7b92973f86afddc5f3e","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-12T23:07:27Z","title_canon_sha256":"f4417fb9d550090af8bacbc2e68447aecdba79d4fa2a35c8d250d05be2fd4af5"},"schema_version":"1.0","source":{"id":"1306.2988","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2988","created_at":"2026-05-18T03:15:17Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2988v2","created_at":"2026-05-18T03:15:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2988","created_at":"2026-05-18T03:15:17Z"},{"alias_kind":"pith_short_12","alias_value":"GUHKS3Y67WMH","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GUHKS3Y67WMHVUFI","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GUHKS3Y6","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:bc31ef653dd07658b4d61cbaaad9a4873ca8de7f381c30c8e3d5169088236318","target":"graph","created_at":"2026-05-18T03:15:17Z","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":"Motivated by an application in kidney exchange, we study the following query-commit problem: we are given the set of vertices of a non-bipartite graph G. The set of edges in this graph are not known ahead of time. We can query any pair of vertices to determine if they are adjacent. If the queried edge exists, we are committed to match the two endpoints. Our objective is to maximize the size of the matching.\n  This restriction in the amount of information available to the algorithm constraints us to implement myopic, greedy-like algorithms. A simple deterministic greedy algorithm achieves a fac","authors_text":"Gagan Goel, Pushkar Tripathi","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-12T23:07:27Z","title":"Matching with our Eyes Closed"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2988","kind":"arxiv","version":2},"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:04577e233f27ede1ea0ca78b5ce429912bc97720b27ef9eb3e54371ce545efd1","target":"record","created_at":"2026-05-18T03:15:17Z","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":"d045a716cb9b30d2db79e46f41527c9d0bc82cefc573c7b92973f86afddc5f3e","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-12T23:07:27Z","title_canon_sha256":"f4417fb9d550090af8bacbc2e68447aecdba79d4fa2a35c8d250d05be2fd4af5"},"schema_version":"1.0","source":{"id":"1306.2988","kind":"arxiv","version":2}},"canonical_sha256":"350ea96f1efd987ad0a85bba1c2ffa84deabd59b7be385660b3b77dfbf7c6b20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"350ea96f1efd987ad0a85bba1c2ffa84deabd59b7be385660b3b77dfbf7c6b20","first_computed_at":"2026-05-18T03:15:17.999450Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:17.999450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hqB5LemmOOa1Bc4CX2K7CL8Uajsyr4DcsBa+u6csL6lsKimJ+2Zb4n3wNToQ6dTM83bxepofo3ZYx9R64xCrDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:18.000278Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.2988","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04577e233f27ede1ea0ca78b5ce429912bc97720b27ef9eb3e54371ce545efd1","sha256:bc31ef653dd07658b4d61cbaaad9a4873ca8de7f381c30c8e3d5169088236318"],"state_sha256":"00e58050eaab0f50524f0d1514a106f00798d58504e39da900560a2cb6f1c95f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wSyaQgtZJTG75+ScW8A7B2MFGxpI69pLGGYm3nSqJtMFvxsMU3s8nyQirHb7cqXoBBoQoGHUuzCUYEvY77uVBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:17:57.059080Z","bundle_sha256":"ff1d2b41b7b465a861ae2e485d3a829768604708614845fb6d1364307ee0ae03"}}