{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:Y4BEGE3Z26X4EZF64MBVYA4WYE","short_pith_number":"pith:Y4BEGE3Z","schema_version":"1.0","canonical_sha256":"c702431379d7afc264bee3035c0396c10a93a8e77113c9e54f1e65f30077e53c","source":{"kind":"arxiv","id":"1508.05572","version":2},"attestation_state":"computed","paper":{"title":"Learning to detect an oddball target","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Nidhin Koshy Vaidhiyan, Rajesh Sundaresan","submitted_at":"2015-08-23T07:42:59Z","abstract_excerpt":"We consider the problem of detecting an odd process among a group of Poisson point processes, all having the same rate except the odd process. The actual rates of the odd and non-odd processes are unknown to the decision maker. We consider a time-slotted sequential detection scenario where, at the beginning of each slot, the decision maker can choose which process to observe during that time slot. We are interested in policies that satisfy a given constraint on the probability of false detection. We propose a generalised likelihood ratio based sequential policy which, via suitable thresholding"},"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":"1508.05572","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-08-23T07:42:59Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8245ea562f0e55a5b635fb0d3f9e5304d7aa30d23fd16d4c80f5e4e4fd2319af","abstract_canon_sha256":"238e1e76b358da2b03f0b4570c8bec99797744d77b9c8058b9fd879b14fc76dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:18.240554Z","signature_b64":"WLWZPEAPikx7IqeZ9/DSQcvXfF8dy2m796UTrUthya5U3dTUMzgyx1GNRdeYrE7hAS0oLX2XzQ/9m3KJbQcJCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c702431379d7afc264bee3035c0396c10a93a8e77113c9e54f1e65f30077e53c","last_reissued_at":"2026-05-18T01:32:18.239807Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:18.239807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to detect an oddball target","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Nidhin Koshy Vaidhiyan, Rajesh Sundaresan","submitted_at":"2015-08-23T07:42:59Z","abstract_excerpt":"We consider the problem of detecting an odd process among a group of Poisson point processes, all having the same rate except the odd process. The actual rates of the odd and non-odd processes are unknown to the decision maker. We consider a time-slotted sequential detection scenario where, at the beginning of each slot, the decision maker can choose which process to observe during that time slot. We are interested in policies that satisfy a given constraint on the probability of false detection. We propose a generalised likelihood ratio based sequential policy which, via suitable thresholding"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05572","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":"1508.05572","created_at":"2026-05-18T01:32:18.239911+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.05572v2","created_at":"2026-05-18T01:32:18.239911+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05572","created_at":"2026-05-18T01:32:18.239911+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y4BEGE3Z26X4","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y4BEGE3Z26X4EZF6","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y4BEGE3Z","created_at":"2026-05-18T12:29:50.041715+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/Y4BEGE3Z26X4EZF64MBVYA4WYE","json":"https://pith.science/pith/Y4BEGE3Z26X4EZF64MBVYA4WYE.json","graph_json":"https://pith.science/api/pith-number/Y4BEGE3Z26X4EZF64MBVYA4WYE/graph.json","events_json":"https://pith.science/api/pith-number/Y4BEGE3Z26X4EZF64MBVYA4WYE/events.json","paper":"https://pith.science/paper/Y4BEGE3Z"},"agent_actions":{"view_html":"https://pith.science/pith/Y4BEGE3Z26X4EZF64MBVYA4WYE","download_json":"https://pith.science/pith/Y4BEGE3Z26X4EZF64MBVYA4WYE.json","view_paper":"https://pith.science/paper/Y4BEGE3Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.05572&json=true","fetch_graph":"https://pith.science/api/pith-number/Y4BEGE3Z26X4EZF64MBVYA4WYE/graph.json","fetch_events":"https://pith.science/api/pith-number/Y4BEGE3Z26X4EZF64MBVYA4WYE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y4BEGE3Z26X4EZF64MBVYA4WYE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y4BEGE3Z26X4EZF64MBVYA4WYE/action/storage_attestation","attest_author":"https://pith.science/pith/Y4BEGE3Z26X4EZF64MBVYA4WYE/action/author_attestation","sign_citation":"https://pith.science/pith/Y4BEGE3Z26X4EZF64MBVYA4WYE/action/citation_signature","submit_replication":"https://pith.science/pith/Y4BEGE3Z26X4EZF64MBVYA4WYE/action/replication_record"}},"created_at":"2026-05-18T01:32:18.239911+00:00","updated_at":"2026-05-18T01:32:18.239911+00:00"}