{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TPL4NIRTJUP3PM4TOXXPATGLXM","short_pith_number":"pith:TPL4NIRT","schema_version":"1.0","canonical_sha256":"9bd7c6a2334d1fb7b39375eef04ccbbb3dd21658e7292aeb51819e70f27728e9","source":{"kind":"arxiv","id":"2605.16140","version":1},"attestation_state":"computed","paper":{"title":"Covert Bayesian Quickest Change Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Under joint false-alarm and expected covertness budget constraints, the average detection delay in Bayesian quickest change detection admits a tight second-order asymptotic characterization as the false-alarm probability tends to zero.","cross_cats":["cs.SY","eess.SY","math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Matthieu R. Bloch, Yun-Feng Lo","submitted_at":"2026-05-15T16:19:29Z","abstract_excerpt":"We investigate the problem of covert quickest change detection in a Bayesian and infinite-horizon setting. A legitimate entity seeks to detect a change in the state of a discrete memoryless channel as quickly as possible by actively probing it. Simultaneously, the entity must ensure its probing remains covert from an adversary monitoring the channel for active sensing. We introduce the expected covertness budget (ECB) as an analytically tractable covertness metric that bounds from above the relative entropy between the observation sequences induced by active and passive sensing. Under constrai"},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.16140","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-05-15T16:19:29Z","cross_cats_sorted":["cs.SY","eess.SY","math.IT","math.ST","stat.TH"],"title_canon_sha256":"4971d8d6126e871fdb1bbe1b07c46a85e8acf566a9e6493a9c474fc260c42160","abstract_canon_sha256":"64fd857e625b085de4ef59541fe4315f24bb68c771455366bcf7739a71577274"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:54.716527Z","signature_b64":"zXEOajslCIjyectbePMJaOjlAPp0WiqMoiJR0Ohy5a10UnnaFHJIudn+azIIXHuIlvClxxH16+qMBELLbb3LBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bd7c6a2334d1fb7b39375eef04ccbbb3dd21658e7292aeb51819e70f27728e9","last_reissued_at":"2026-05-20T00:01:54.715659Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:54.715659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Covert Bayesian Quickest Change Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Under joint false-alarm and expected covertness budget constraints, the average detection delay in Bayesian quickest change detection admits a tight second-order asymptotic characterization as the false-alarm probability tends to zero.","cross_cats":["cs.SY","eess.SY","math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Matthieu R. Bloch, Yun-Feng Lo","submitted_at":"2026-05-15T16:19:29Z","abstract_excerpt":"We investigate the problem of covert quickest change detection in a Bayesian and infinite-horizon setting. A legitimate entity seeks to detect a change in the state of a discrete memoryless channel as quickly as possible by actively probing it. Simultaneously, the entity must ensure its probing remains covert from an adversary monitoring the channel for active sensing. We introduce the expected covertness budget (ECB) as an analytically tractable covertness metric that bounds from above the relative entropy between the observation sequences induced by active and passive sensing. Under constrai"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Under constraints on both the probability of false alarm (PFA) and the ECB, we establish a second-order asymptotic converse bound on the average detection delay as the PFA constraint approaches zero, for any positive ECB constraint, explicitly quantifying the maximum square-root-order covert sensing gain possible.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The expected covertness budget (ECB) is an analytically tractable metric that upper-bounds the relative entropy between observation sequences induced by active versus passive sensing; this premise is used to formulate the constrained optimization and to obtain the second-order asymptotic characterization.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Derives second-order asymptotic converse and matching achievability bounds on average detection delay for covert Bayesian quickest change detection under PFA and ECB constraints, quantifying square-root-order covert sensing gain.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Under joint false-alarm and expected covertness budget constraints, the average detection delay in Bayesian quickest change detection admits a tight second-order asymptotic characterization as the false-alarm probability tends to zero.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"85d04d2cb207a4c1b72d0720b37856fad5bb5f6913a65dc7bd6efcfd840bb6e4"},"source":{"id":"2605.16140","kind":"arxiv","version":1},"verdict":{"id":"398170e7-afcd-42ee-a71a-9a048a774b36","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T19:00:02.374000Z","strongest_claim":"Under constraints on both the probability of false alarm (PFA) and the ECB, we establish a second-order asymptotic converse bound on the average detection delay as the PFA constraint approaches zero, for any positive ECB constraint, explicitly quantifying the maximum square-root-order covert sensing gain possible.","one_line_summary":"Derives second-order asymptotic converse and matching achievability bounds on average detection delay for covert Bayesian quickest change detection under PFA and ECB constraints, quantifying square-root-order covert sensing gain.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The expected covertness budget (ECB) is an analytically tractable metric that upper-bounds the relative entropy between observation sequences induced by active versus passive sensing; this premise is used to formulate the constrained optimization and to obtain the second-order asymptotic characterization.","pith_extraction_headline":"Under joint false-alarm and expected covertness budget constraints, the average detection delay in Bayesian quickest change detection admits a tight second-order asymptotic characterization as the false-alarm probability tends to zero."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16140/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T19:31:18.991813Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T19:10:45.191106Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"cited_work_retraction","ran_at":"2026-05-19T18:22:03.837535Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:31.049409Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T16:41:55.453160Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"348122c44ba5f4ef6a43cbe370ad4b30b4919ead35a21374533441716cad8d02"},"references":{"count":35,"sample":[{"doi":"","year":2003,"title":"Information-theoretic an alysis of information hiding,","work_id":"cb33a2eb-d647-4589-9efd-240362ea3a12","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2007,"title":"A capacity result for batch steganography,","work_id":"c2df5f9d-1003-4c70-b2b5-a862e0097d2b","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2008,"title":"Perfectly secure steganography: Capacity, error exponents, and code constructions,","work_id":"441563b4-794a-454b-82fd-23d849af7f96","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1921,"title":"Limits of reliable c ommunication with low probability of detection on AWGN channels,","work_id":"0471de0f-95f1-4ded-8f37-a96d5203d924","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2016,"title":"Covert communication over noisy channels: A resolvability perspective,","work_id":"1f32e79e-18a3-4531-9bc8-ff26302a9e36","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":35,"snapshot_sha256":"31eb2886b06ed83980458c9e213055b9a7e429f66dae744a3e701690a9ca1421","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":"2605.16140","created_at":"2026-05-20T00:01:54.715775+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.16140v1","created_at":"2026-05-20T00:01:54.715775+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16140","created_at":"2026-05-20T00:01:54.715775+00:00"},{"alias_kind":"pith_short_12","alias_value":"TPL4NIRTJUP3","created_at":"2026-05-20T00:01:54.715775+00:00"},{"alias_kind":"pith_short_16","alias_value":"TPL4NIRTJUP3PM4T","created_at":"2026-05-20T00:01:54.715775+00:00"},{"alias_kind":"pith_short_8","alias_value":"TPL4NIRT","created_at":"2026-05-20T00:01:54.715775+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TPL4NIRTJUP3PM4TOXXPATGLXM","json":"https://pith.science/pith/TPL4NIRTJUP3PM4TOXXPATGLXM.json","graph_json":"https://pith.science/api/pith-number/TPL4NIRTJUP3PM4TOXXPATGLXM/graph.json","events_json":"https://pith.science/api/pith-number/TPL4NIRTJUP3PM4TOXXPATGLXM/events.json","paper":"https://pith.science/paper/TPL4NIRT"},"agent_actions":{"view_html":"https://pith.science/pith/TPL4NIRTJUP3PM4TOXXPATGLXM","download_json":"https://pith.science/pith/TPL4NIRTJUP3PM4TOXXPATGLXM.json","view_paper":"https://pith.science/paper/TPL4NIRT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.16140&json=true","fetch_graph":"https://pith.science/api/pith-number/TPL4NIRTJUP3PM4TOXXPATGLXM/graph.json","fetch_events":"https://pith.science/api/pith-number/TPL4NIRTJUP3PM4TOXXPATGLXM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TPL4NIRTJUP3PM4TOXXPATGLXM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TPL4NIRTJUP3PM4TOXXPATGLXM/action/storage_attestation","attest_author":"https://pith.science/pith/TPL4NIRTJUP3PM4TOXXPATGLXM/action/author_attestation","sign_citation":"https://pith.science/pith/TPL4NIRTJUP3PM4TOXXPATGLXM/action/citation_signature","submit_replication":"https://pith.science/pith/TPL4NIRTJUP3PM4TOXXPATGLXM/action/replication_record"}},"created_at":"2026-05-20T00:01:54.715775+00:00","updated_at":"2026-05-20T00:01:54.715775+00:00"}