{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UPSVSACQ6ECTC4PEC6VOBRG6OZ","short_pith_number":"pith:UPSVSACQ","schema_version":"1.0","canonical_sha256":"a3e5590050f1053171e417aae0c4de7656bb47f01ff04cd92b943a6430fa490e","source":{"kind":"arxiv","id":"1902.01461","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1902.01461","created_at":"2026-05-17T23:54:38.645052+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.01461v2","created_at":"2026-05-17T23:54:38.645052+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01461","created_at":"2026-05-17T23:54:38.645052+00:00"},{"alias_kind":"pith_short_12","alias_value":"UPSVSACQ6ECT","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"UPSVSACQ6ECTC4PE","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"UPSVSACQ","created_at":"2026-05-18T12:33:30.264802+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.01707","citing_title":"On Adaptivity Gaps of Influence Maximization under the Independent Cascade Model with Full Adoption Feedback","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UPSVSACQ6ECTC4PEC6VOBRG6OZ","json":"https://pith.science/pith/UPSVSACQ6ECTC4PEC6VOBRG6OZ.json","graph_json":"https://pith.science/api/pith-number/UPSVSACQ6ECTC4PEC6VOBRG6OZ/graph.json","events_json":"https://pith.science/api/pith-number/UPSVSACQ6ECTC4PEC6VOBRG6OZ/events.json","paper":"https://pith.science/paper/UPSVSACQ"},"agent_actions":{"view_html":"https://pith.science/pith/UPSVSACQ6ECTC4PEC6VOBRG6OZ","download_json":"https://pith.science/pith/UPSVSACQ6ECTC4PEC6VOBRG6OZ.json","view_paper":"https://pith.science/paper/UPSVSACQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.01461&json=true","fetch_graph":"https://pith.science/api/pith-number/UPSVSACQ6ECTC4PEC6VOBRG6OZ/graph.json","fetch_events":"https://pith.science/api/pith-number/UPSVSACQ6ECTC4PEC6VOBRG6OZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UPSVSACQ6ECTC4PEC6VOBRG6OZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UPSVSACQ6ECTC4PEC6VOBRG6OZ/action/storage_attestation","attest_author":"https://pith.science/pith/UPSVSACQ6ECTC4PEC6VOBRG6OZ/action/author_attestation","sign_citation":"https://pith.science/pith/UPSVSACQ6ECTC4PEC6VOBRG6OZ/action/citation_signature","submit_replication":"https://pith.science/pith/UPSVSACQ6ECTC4PEC6VOBRG6OZ/action/replication_record"}},"created_at":"2026-05-17T23:54:38.645052+00:00","updated_at":"2026-05-17T23:54:38.645052+00:00"}