{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:AL4PN7ZHZVSIIIK7N2VSCNDLS4","short_pith_number":"pith:AL4PN7ZH","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"},"canonical_sha256":"02f8f6ff27cd6484215f6eab21346b9731ecaa058a2c82e5da8d1af773d971fd","source":{"kind":"arxiv","id":"1104.2580","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2580","created_at":"2026-05-18T04:15:35Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2580v2","created_at":"2026-05-18T04:15:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2580","created_at":"2026-05-18T04:15:35Z"},{"alias_kind":"pith_short_12","alias_value":"AL4PN7ZHZVSI","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AL4PN7ZHZVSIIIK7","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AL4PN7ZH","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:AL4PN7ZHZVSIIIK7N2VSCNDLS4","target":"record","payload":{"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"},"canonical_sha256":"02f8f6ff27cd6484215f6eab21346b9731ecaa058a2c82e5da8d1af773d971fd","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"},"source_kind":"arxiv","source_id":"1104.2580","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:15:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1O07WaSOWDesjos6WBodv9kQWktyLjRqMoXE6LUDyEAqwFa6U8drH8HE1E79e4f6Te4sJSWuPCtzqyt6uSzvCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T00:32:01.042200Z"},"content_sha256":"e8cd77a8d13f9a75364bb8cb4175141972e7d3baeeb8394b9a95c8d041ac3d97","schema_version":"1.0","event_id":"sha256:e8cd77a8d13f9a75364bb8cb4175141972e7d3baeeb8394b9a95c8d041ac3d97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:AL4PN7ZHZVSIIIK7N2VSCNDLS4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:15:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jPcjTp62T9CIW976PKq2RPV3XM5ByKwJtszxbhSYsox75B7Ynp3ruJ/j794FO3oExCPCwnk/tbydAW5xB/J5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T00:32:01.042900Z"},"content_sha256":"81cfaa5f3d289502fe453fe117a0d266fc8e606c3b092496c478c28b4a34d326","schema_version":"1.0","event_id":"sha256:81cfaa5f3d289502fe453fe117a0d266fc8e606c3b092496c478c28b4a34d326"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AL4PN7ZHZVSIIIK7N2VSCNDLS4/bundle.json","state_url":"https://pith.science/pith/AL4PN7ZHZVSIIIK7N2VSCNDLS4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AL4PN7ZHZVSIIIK7N2VSCNDLS4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T00:32:01Z","links":{"resolver":"https://pith.science/pith/AL4PN7ZHZVSIIIK7N2VSCNDLS4","bundle":"https://pith.science/pith/AL4PN7ZHZVSIIIK7N2VSCNDLS4/bundle.json","state":"https://pith.science/pith/AL4PN7ZHZVSIIIK7N2VSCNDLS4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AL4PN7ZHZVSIIIK7N2VSCNDLS4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:AL4PN7ZHZVSIIIK7N2VSCNDLS4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"154b60af449a82accefcae2d648444dda1cf08308cb5d11629b2c4bfa6060ddc","cross_cats_sorted":["cs.CG","cs.GR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2011-04-13T18:59:52Z","title_canon_sha256":"0394e368547e75cffdec6bd336f01507ac94f32aa68c82398e6691d21cd87a72"},"schema_version":"1.0","source":{"id":"1104.2580","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2580","created_at":"2026-05-18T04:15:35Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2580v2","created_at":"2026-05-18T04:15:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2580","created_at":"2026-05-18T04:15:35Z"},{"alias_kind":"pith_short_12","alias_value":"AL4PN7ZHZVSI","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AL4PN7ZHZVSIIIK7","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AL4PN7ZH","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:81cfaa5f3d289502fe453fe117a0d266fc8e606c3b092496c478c28b4a34d326","target":"graph","created_at":"2026-05-18T04:15:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Diego Rother, Ren\\'e Vidal, Simon Sch\\\"utz","cross_cats":["cs.CG","cs.GR","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2011-04-13T18:59:52Z","title":"Hypothesize and Bound: A Computational Focus of Attention Mechanism for Simultaneous N-D Segmentation, Pose Estimation and Classification Using Shape Priors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2580","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e8cd77a8d13f9a75364bb8cb4175141972e7d3baeeb8394b9a95c8d041ac3d97","target":"record","created_at":"2026-05-18T04:15:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"154b60af449a82accefcae2d648444dda1cf08308cb5d11629b2c4bfa6060ddc","cross_cats_sorted":["cs.CG","cs.GR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2011-04-13T18:59:52Z","title_canon_sha256":"0394e368547e75cffdec6bd336f01507ac94f32aa68c82398e6691d21cd87a72"},"schema_version":"1.0","source":{"id":"1104.2580","kind":"arxiv","version":2}},"canonical_sha256":"02f8f6ff27cd6484215f6eab21346b9731ecaa058a2c82e5da8d1af773d971fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02f8f6ff27cd6484215f6eab21346b9731ecaa058a2c82e5da8d1af773d971fd","first_computed_at":"2026-05-18T04:15:35.920856Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:15:35.920856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yjwZImSYmDkKCdB2Krl7yj1/gcNBSoXTC9k97BtgdnCWMvESwwEL8pxYvaIvbRpZr0OqCl9mJvkduDF8CrTvCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:15:35.921289Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.2580","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8cd77a8d13f9a75364bb8cb4175141972e7d3baeeb8394b9a95c8d041ac3d97","sha256:81cfaa5f3d289502fe453fe117a0d266fc8e606c3b092496c478c28b4a34d326"],"state_sha256":"0c71f6388ea36513d3def4a5ef7713394eefa80de421fbb09fa1ae8145df371b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vI0teSKqhYkgV09tl2DYgBrPwD3kkL5evokAFnUWy9jyhVfOomL5iV+ZTxw8ffsg+wOvBTSkNYf85aT7FPDMAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T00:32:01.047191Z","bundle_sha256":"04e2dd4fa55fefa1e4071da06eff6bc86080ef9152bd11edc0cdd92d6b4ec279"}}