{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:SXYDIKRZPVCA7BF25WIJYBVHCH","short_pith_number":"pith:SXYDIKRZ","schema_version":"1.0","canonical_sha256":"95f0342a397d440f84baed909c06a711fd705425e9211660c36fff8cff63933d","source":{"kind":"arxiv","id":"2311.12176","version":1},"attestation_state":"computed","paper":{"title":"Covert Online Decision Making: From Sequential Hypothesis Testing to Stochastic Bandits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Matthieu R. Bloch, Meng-Che Chang","submitted_at":"2023-11-20T20:43:49Z","abstract_excerpt":"We study the problem of covert online decision-making in which an agent attempts to identify a parameter governing a system by probing the system while escaping detection from an adversary. The system is modeled as a Markov kernel whose input is controlled by the agent and whose two outputs are observed by the agent and the adversary, respectively. This problem is motivated by applications such as covert sensing or covert radar, in which one tries to perform a sensing task without arousing suspicion by an adversary monitoring the environment for the presence of sensing signals. Specifically, w"},"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":"2311.12176","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2023-11-20T20:43:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b7a14842f19857147b2a7a927fac3de9998c39f9af2a69452cd3553a4f3c8084","abstract_canon_sha256":"1c20aba25e2026ad1454212f57c5a52b567e5be663fbdde0d031cfabd9618584"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:15:01.660614Z","signature_b64":"20LPZKfKR/3vw3aUuKpydUEPuH5HNU3ART88ctrozFuYCkj4rGwtfgpuY0jNFmwBUn2Gs0+mds4tlhzYCVqMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95f0342a397d440f84baed909c06a711fd705425e9211660c36fff8cff63933d","last_reissued_at":"2026-07-05T07:15:01.660148Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:15:01.660148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Covert Online Decision Making: From Sequential Hypothesis Testing to Stochastic Bandits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Matthieu R. Bloch, Meng-Che Chang","submitted_at":"2023-11-20T20:43:49Z","abstract_excerpt":"We study the problem of covert online decision-making in which an agent attempts to identify a parameter governing a system by probing the system while escaping detection from an adversary. The system is modeled as a Markov kernel whose input is controlled by the agent and whose two outputs are observed by the agent and the adversary, respectively. This problem is motivated by applications such as covert sensing or covert radar, in which one tries to perform a sensing task without arousing suspicion by an adversary monitoring the environment for the presence of sensing signals. Specifically, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.12176","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.12176/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2311.12176","created_at":"2026-07-05T07:15:01.660209+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.12176v1","created_at":"2026-07-05T07:15:01.660209+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.12176","created_at":"2026-07-05T07:15:01.660209+00:00"},{"alias_kind":"pith_short_12","alias_value":"SXYDIKRZPVCA","created_at":"2026-07-05T07:15:01.660209+00:00"},{"alias_kind":"pith_short_16","alias_value":"SXYDIKRZPVCA7BF2","created_at":"2026-07-05T07:15:01.660209+00:00"},{"alias_kind":"pith_short_8","alias_value":"SXYDIKRZ","created_at":"2026-07-05T07:15:01.660209+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.07101","citing_title":"Constrained Online Decision-Making: A Unified Framework","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SXYDIKRZPVCA7BF25WIJYBVHCH","json":"https://pith.science/pith/SXYDIKRZPVCA7BF25WIJYBVHCH.json","graph_json":"https://pith.science/api/pith-number/SXYDIKRZPVCA7BF25WIJYBVHCH/graph.json","events_json":"https://pith.science/api/pith-number/SXYDIKRZPVCA7BF25WIJYBVHCH/events.json","paper":"https://pith.science/paper/SXYDIKRZ"},"agent_actions":{"view_html":"https://pith.science/pith/SXYDIKRZPVCA7BF25WIJYBVHCH","download_json":"https://pith.science/pith/SXYDIKRZPVCA7BF25WIJYBVHCH.json","view_paper":"https://pith.science/paper/SXYDIKRZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.12176&json=true","fetch_graph":"https://pith.science/api/pith-number/SXYDIKRZPVCA7BF25WIJYBVHCH/graph.json","fetch_events":"https://pith.science/api/pith-number/SXYDIKRZPVCA7BF25WIJYBVHCH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SXYDIKRZPVCA7BF25WIJYBVHCH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SXYDIKRZPVCA7BF25WIJYBVHCH/action/storage_attestation","attest_author":"https://pith.science/pith/SXYDIKRZPVCA7BF25WIJYBVHCH/action/author_attestation","sign_citation":"https://pith.science/pith/SXYDIKRZPVCA7BF25WIJYBVHCH/action/citation_signature","submit_replication":"https://pith.science/pith/SXYDIKRZPVCA7BF25WIJYBVHCH/action/replication_record"}},"created_at":"2026-07-05T07:15:01.660209+00:00","updated_at":"2026-07-05T07:15:01.660209+00:00"}