{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:UPSVSACQ6ECTC4PEC6VOBRG6OZ","short_pith_number":"pith:UPSVSACQ","canonical_record":{"source":{"id":"1902.01461","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-04T21:24:43Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"15fb76730e6bb0c1b55a3021e2702296efd0604479da9543e8a836d1d4f44fd5","abstract_canon_sha256":"57841afd3a8a4b5e1370684bafebf98d0a93e1342100095c148d080b53ee0052"},"schema_version":"1.0"},"canonical_sha256":"a3e5590050f1053171e417aae0c4de7656bb47f01ff04cd92b943a6430fa490e","source":{"kind":"arxiv","id":"1902.01461","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01461","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01461v2","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01461","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"pith_short_12","alias_value":"UPSVSACQ6ECT","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UPSVSACQ6ECTC4PE","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UPSVSACQ","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:UPSVSACQ6ECTC4PEC6VOBRG6OZ","target":"record","payload":{"canonical_record":{"source":{"id":"1902.01461","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-04T21:24:43Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"15fb76730e6bb0c1b55a3021e2702296efd0604479da9543e8a836d1d4f44fd5","abstract_canon_sha256":"57841afd3a8a4b5e1370684bafebf98d0a93e1342100095c148d080b53ee0052"},"schema_version":"1.0"},"canonical_sha256":"a3e5590050f1053171e417aae0c4de7656bb47f01ff04cd92b943a6430fa490e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:38.645526Z","signature_b64":"rX5aKfpyaiOkQylo4WIlrpo8dHM55v47f6J0aowvjCaqBAkS1xFHK3FSk0q+vEGQwXoWeNqXQpVPeulI8+n9BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3e5590050f1053171e417aae0c4de7656bb47f01ff04cd92b943a6430fa490e","last_reissued_at":"2026-05-17T23:54:38.644959Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:38.644959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.01461","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-17T23:54:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a2t7FXQo0vxEK3UfkrPxw+GXkyK8OEOYNSab4VInmWs/UBSj97jnNYcr2HGste+I1CLkn9vhZxRZSLl6o6ZjAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:17:55.290091Z"},"content_sha256":"753de20761f50b0b7b08b03b03a6586ea6413234071afe93bcc6c99bfa2d23ab","schema_version":"1.0","event_id":"sha256:753de20761f50b0b7b08b03b03a6586ea6413234071afe93bcc6c99bfa2d23ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:UPSVSACQ6ECTC4PEC6VOBRG6OZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"(Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Domagoj Bradac, Goran Zuzic, Sahil Singla","submitted_at":"2019-02-04T21:24:43Z","abstract_excerpt":"Consider a kidney-exchange application where we want to find a max-matching in a random graph. To find whether an edge $e$ exists, we need to perform an expensive test, in which case the edge $e$ appears independently with a \\emph{known} probability $p_e$. Given a budget on the total cost of the tests, our goal is to find a testing strategy that maximizes the expected maximum matching size.\n  The above application is an example of the stochastic probing problem. In general the optimal stochastic probing strategy is difficult to find because it is \\emph{adaptive}---decides on the next edge to p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01461","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-17T23:54:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jepbxWj5Piw83U3nNH/dbcpCAJxQIC53j2/JujeDHu/EIHtok0MUbkSpzaasnndy2hgUmd5+SR19Hk96d5elBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:17:55.290804Z"},"content_sha256":"9a8824aa18c8931a2355775a72c754c6f49d57cfc252d2d09fecd94bcbc696d5","schema_version":"1.0","event_id":"sha256:9a8824aa18c8931a2355775a72c754c6f49d57cfc252d2d09fecd94bcbc696d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UPSVSACQ6ECTC4PEC6VOBRG6OZ/bundle.json","state_url":"https://pith.science/pith/UPSVSACQ6ECTC4PEC6VOBRG6OZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UPSVSACQ6ECTC4PEC6VOBRG6OZ/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-27T03:17:55Z","links":{"resolver":"https://pith.science/pith/UPSVSACQ6ECTC4PEC6VOBRG6OZ","bundle":"https://pith.science/pith/UPSVSACQ6ECTC4PEC6VOBRG6OZ/bundle.json","state":"https://pith.science/pith/UPSVSACQ6ECTC4PEC6VOBRG6OZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UPSVSACQ6ECTC4PEC6VOBRG6OZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UPSVSACQ6ECTC4PEC6VOBRG6OZ","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":"57841afd3a8a4b5e1370684bafebf98d0a93e1342100095c148d080b53ee0052","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-04T21:24:43Z","title_canon_sha256":"15fb76730e6bb0c1b55a3021e2702296efd0604479da9543e8a836d1d4f44fd5"},"schema_version":"1.0","source":{"id":"1902.01461","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01461","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01461v2","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01461","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"pith_short_12","alias_value":"UPSVSACQ6ECT","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UPSVSACQ6ECTC4PE","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UPSVSACQ","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:9a8824aa18c8931a2355775a72c754c6f49d57cfc252d2d09fecd94bcbc696d5","target":"graph","created_at":"2026-05-17T23:54:38Z","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":"Consider a kidney-exchange application where we want to find a max-matching in a random graph. To find whether an edge $e$ exists, we need to perform an expensive test, in which case the edge $e$ appears independently with a \\emph{known} probability $p_e$. Given a budget on the total cost of the tests, our goal is to find a testing strategy that maximizes the expected maximum matching size.\n  The above application is an example of the stochastic probing problem. In general the optimal stochastic probing strategy is difficult to find because it is \\emph{adaptive}---decides on the next edge to p","authors_text":"Domagoj Bradac, Goran Zuzic, Sahil Singla","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-04T21:24:43Z","title":"(Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01461","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:753de20761f50b0b7b08b03b03a6586ea6413234071afe93bcc6c99bfa2d23ab","target":"record","created_at":"2026-05-17T23:54:38Z","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":"57841afd3a8a4b5e1370684bafebf98d0a93e1342100095c148d080b53ee0052","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-04T21:24:43Z","title_canon_sha256":"15fb76730e6bb0c1b55a3021e2702296efd0604479da9543e8a836d1d4f44fd5"},"schema_version":"1.0","source":{"id":"1902.01461","kind":"arxiv","version":2}},"canonical_sha256":"a3e5590050f1053171e417aae0c4de7656bb47f01ff04cd92b943a6430fa490e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3e5590050f1053171e417aae0c4de7656bb47f01ff04cd92b943a6430fa490e","first_computed_at":"2026-05-17T23:54:38.644959Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:38.644959Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rX5aKfpyaiOkQylo4WIlrpo8dHM55v47f6J0aowvjCaqBAkS1xFHK3FSk0q+vEGQwXoWeNqXQpVPeulI8+n9BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:38.645526Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.01461","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:753de20761f50b0b7b08b03b03a6586ea6413234071afe93bcc6c99bfa2d23ab","sha256:9a8824aa18c8931a2355775a72c754c6f49d57cfc252d2d09fecd94bcbc696d5"],"state_sha256":"04d31a3313dda722a0870806b968a3ba9b06c514fe4637873ba5af3d7cf1561d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mfjg04ngB/B2e742CZaByf6rSbYXf1Y5MdwpLr1EuafMh69COwt2SkpcGEogtPW8rp2P2GuB7IJ/xqaQ9sJrDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:17:55.294590Z","bundle_sha256":"ca2626dc72ac6cb98a2f64a90a7f4140a529b5b97213e2ea0bb2a291d00e8e03"}}