{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WTIBF75JXGCF4JHIOWZAKBKJ3G","short_pith_number":"pith:WTIBF75J","schema_version":"1.0","canonical_sha256":"b4d012ffa9b9845e24e875b2050549d9a0b7b43b27990b2c9bacb914994a52de","source":{"kind":"arxiv","id":"1411.1190","version":1},"attestation_state":"computed","paper":{"title":"Towards an optimal decision strategy of visual search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.NC","authors_text":"Bo Chen, Pietro Perona","submitted_at":"2014-11-05T08:53:19Z","abstract_excerpt":"Searching for objects amongst clutter is a key ability of visual systems. Speed and accuracy are often crucial: how can the visual system trade off these competing quantities for optimal performance in different tasks? How does the trade-off depend on target appearance and scene complexity? We show that the optimal tradeoff strategy may be cast as the solution to a partially observable Markov decision process (POMDP) and computed by a dynamic programming procedure. However, this procedure is computationally intensive when the visual scene becomes too cluttered. Therefore, we also conjecture an"},"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":"1411.1190","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2014-11-05T08:53:19Z","cross_cats_sorted":[],"title_canon_sha256":"631b403b36d4c5fdd0cc8b495b6e80a58aec6faf49121271856814a83df21a77","abstract_canon_sha256":"5aa9bb6038e9ff29367a25b409e2f9d45ce4b24f97ee6009652fe1acdc7597c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:36.095365Z","signature_b64":"yCJA5TYoDRruccoijEna9tDZSKRtj1fK6aPDQTHznXI+QcoOUculqzn8uYSowBCPbnapwmMcH3kEl0OYAsEOBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4d012ffa9b9845e24e875b2050549d9a0b7b43b27990b2c9bacb914994a52de","last_reissued_at":"2026-05-18T02:38:36.094925Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:36.094925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards an optimal decision strategy of visual search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.NC","authors_text":"Bo Chen, Pietro Perona","submitted_at":"2014-11-05T08:53:19Z","abstract_excerpt":"Searching for objects amongst clutter is a key ability of visual systems. Speed and accuracy are often crucial: how can the visual system trade off these competing quantities for optimal performance in different tasks? How does the trade-off depend on target appearance and scene complexity? We show that the optimal tradeoff strategy may be cast as the solution to a partially observable Markov decision process (POMDP) and computed by a dynamic programming procedure. However, this procedure is computationally intensive when the visual scene becomes too cluttered. Therefore, we also conjecture an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1190","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":""},"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":"1411.1190","created_at":"2026-05-18T02:38:36.094987+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.1190v1","created_at":"2026-05-18T02:38:36.094987+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1190","created_at":"2026-05-18T02:38:36.094987+00:00"},{"alias_kind":"pith_short_12","alias_value":"WTIBF75JXGCF","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WTIBF75JXGCF4JHI","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WTIBF75J","created_at":"2026-05-18T12:28:54.890064+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/WTIBF75JXGCF4JHIOWZAKBKJ3G","json":"https://pith.science/pith/WTIBF75JXGCF4JHIOWZAKBKJ3G.json","graph_json":"https://pith.science/api/pith-number/WTIBF75JXGCF4JHIOWZAKBKJ3G/graph.json","events_json":"https://pith.science/api/pith-number/WTIBF75JXGCF4JHIOWZAKBKJ3G/events.json","paper":"https://pith.science/paper/WTIBF75J"},"agent_actions":{"view_html":"https://pith.science/pith/WTIBF75JXGCF4JHIOWZAKBKJ3G","download_json":"https://pith.science/pith/WTIBF75JXGCF4JHIOWZAKBKJ3G.json","view_paper":"https://pith.science/paper/WTIBF75J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.1190&json=true","fetch_graph":"https://pith.science/api/pith-number/WTIBF75JXGCF4JHIOWZAKBKJ3G/graph.json","fetch_events":"https://pith.science/api/pith-number/WTIBF75JXGCF4JHIOWZAKBKJ3G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WTIBF75JXGCF4JHIOWZAKBKJ3G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WTIBF75JXGCF4JHIOWZAKBKJ3G/action/storage_attestation","attest_author":"https://pith.science/pith/WTIBF75JXGCF4JHIOWZAKBKJ3G/action/author_attestation","sign_citation":"https://pith.science/pith/WTIBF75JXGCF4JHIOWZAKBKJ3G/action/citation_signature","submit_replication":"https://pith.science/pith/WTIBF75JXGCF4JHIOWZAKBKJ3G/action/replication_record"}},"created_at":"2026-05-18T02:38:36.094987+00:00","updated_at":"2026-05-18T02:38:36.094987+00:00"}