{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:AL4PN7ZHZVSIIIK7N2VSCNDLS4","short_pith_number":"pith:AL4PN7ZH","schema_version":"1.0","canonical_sha256":"02f8f6ff27cd6484215f6eab21346b9731ecaa058a2c82e5da8d1af773d971fd","source":{"kind":"arxiv","id":"1104.2580","version":2},"attestation_state":"computed","paper":{"title":"Hypothesize and Bound: A Computational Focus of Attention Mechanism for Simultaneous N-D Segmentation, Pose Estimation and Classification Using Shape Priors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.GR","cs.LG"],"primary_cat":"cs.CV","authors_text":"Diego Rother, Ren\\'e Vidal, Simon Sch\\\"utz","submitted_at":"2011-04-13T18:59:52Z","abstract_excerpt":"Given the ever increasing bandwidth of the visual information available to many intelligent systems, it is becoming essential to endow them with a sense of what is worthwhile their attention and what can be safely disregarded. This article presents a general mathematical framework to efficiently allocate the available computational resources to process the parts of the input that are relevant to solve a given perceptual problem. By this we mean to find the hypothesis H (i.e., the state of the world) that maximizes a function L(H), representing how well each hypothesis \"explains\" the input. Giv"},"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":"1104.2580","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2011-04-13T18:59:52Z","cross_cats_sorted":["cs.CG","cs.GR","cs.LG"],"title_canon_sha256":"0394e368547e75cffdec6bd336f01507ac94f32aa68c82398e6691d21cd87a72","abstract_canon_sha256":"154b60af449a82accefcae2d648444dda1cf08308cb5d11629b2c4bfa6060ddc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:35.921289Z","signature_b64":"yjwZImSYmDkKCdB2Krl7yj1/gcNBSoXTC9k97BtgdnCWMvESwwEL8pxYvaIvbRpZr0OqCl9mJvkduDF8CrTvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02f8f6ff27cd6484215f6eab21346b9731ecaa058a2c82e5da8d1af773d971fd","last_reissued_at":"2026-05-18T04:15:35.920856Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:35.920856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypothesize and Bound: A Computational Focus of Attention Mechanism for Simultaneous N-D Segmentation, Pose Estimation and Classification Using Shape Priors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.GR","cs.LG"],"primary_cat":"cs.CV","authors_text":"Diego Rother, Ren\\'e Vidal, Simon Sch\\\"utz","submitted_at":"2011-04-13T18:59:52Z","abstract_excerpt":"Given the ever increasing bandwidth of the visual information available to many intelligent systems, it is becoming essential to endow them with a sense of what is worthwhile their attention and what can be safely disregarded. This article presents a general mathematical framework to efficiently allocate the available computational resources to process the parts of the input that are relevant to solve a given perceptual problem. By this we mean to find the hypothesis H (i.e., the state of the world) that maximizes a function L(H), representing how well each hypothesis \"explains\" the input. Giv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2580","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":"1104.2580","created_at":"2026-05-18T04:15:35.920918+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.2580v2","created_at":"2026-05-18T04:15:35.920918+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2580","created_at":"2026-05-18T04:15:35.920918+00:00"},{"alias_kind":"pith_short_12","alias_value":"AL4PN7ZHZVSI","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"AL4PN7ZHZVSIIIK7","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"AL4PN7ZH","created_at":"2026-05-18T12:26:24.575870+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/AL4PN7ZHZVSIIIK7N2VSCNDLS4","json":"https://pith.science/pith/AL4PN7ZHZVSIIIK7N2VSCNDLS4.json","graph_json":"https://pith.science/api/pith-number/AL4PN7ZHZVSIIIK7N2VSCNDLS4/graph.json","events_json":"https://pith.science/api/pith-number/AL4PN7ZHZVSIIIK7N2VSCNDLS4/events.json","paper":"https://pith.science/paper/AL4PN7ZH"},"agent_actions":{"view_html":"https://pith.science/pith/AL4PN7ZHZVSIIIK7N2VSCNDLS4","download_json":"https://pith.science/pith/AL4PN7ZHZVSIIIK7N2VSCNDLS4.json","view_paper":"https://pith.science/paper/AL4PN7ZH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.2580&json=true","fetch_graph":"https://pith.science/api/pith-number/AL4PN7ZHZVSIIIK7N2VSCNDLS4/graph.json","fetch_events":"https://pith.science/api/pith-number/AL4PN7ZHZVSIIIK7N2VSCNDLS4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AL4PN7ZHZVSIIIK7N2VSCNDLS4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AL4PN7ZHZVSIIIK7N2VSCNDLS4/action/storage_attestation","attest_author":"https://pith.science/pith/AL4PN7ZHZVSIIIK7N2VSCNDLS4/action/author_attestation","sign_citation":"https://pith.science/pith/AL4PN7ZHZVSIIIK7N2VSCNDLS4/action/citation_signature","submit_replication":"https://pith.science/pith/AL4PN7ZHZVSIIIK7N2VSCNDLS4/action/replication_record"}},"created_at":"2026-05-18T04:15:35.920918+00:00","updated_at":"2026-05-18T04:15:35.920918+00:00"}