{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:RFFIVEZSIGGMXTI2U5Y3AB2LBN","short_pith_number":"pith:RFFIVEZS","canonical_record":{"source":{"id":"1409.7808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-27T12:58:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"00748224e55ad5a29a8affe32f7edb04b44eece221d6a68cc92f9a039a1d4e7f","abstract_canon_sha256":"50a9d83ddf2407bf95186464bb348b52c1f72158f85794d9cb8aefc8164191bc"},"schema_version":"1.0"},"canonical_sha256":"894a8a9332418ccbcd1aa771b0074b0b52b4c8afc51d261139a4fab6a46bb934","source":{"kind":"arxiv","id":"1409.7808","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7808","created_at":"2026-05-18T02:41:40Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7808v1","created_at":"2026-05-18T02:41:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7808","created_at":"2026-05-18T02:41:40Z"},{"alias_kind":"pith_short_12","alias_value":"RFFIVEZSIGGM","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RFFIVEZSIGGMXTI2","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RFFIVEZS","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:RFFIVEZSIGGMXTI2U5Y3AB2LBN","target":"record","payload":{"canonical_record":{"source":{"id":"1409.7808","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-27T12:58:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"00748224e55ad5a29a8affe32f7edb04b44eece221d6a68cc92f9a039a1d4e7f","abstract_canon_sha256":"50a9d83ddf2407bf95186464bb348b52c1f72158f85794d9cb8aefc8164191bc"},"schema_version":"1.0"},"canonical_sha256":"894a8a9332418ccbcd1aa771b0074b0b52b4c8afc51d261139a4fab6a46bb934","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:40.530604Z","signature_b64":"6UUH0Fo4GS4xc9N88cib/Bwx/w1Dx8QRaooESD/270lNFQtEI0hyoz+kYc8Zx0HG72WgIgD7Cta5pRmeu58qBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"894a8a9332418ccbcd1aa771b0074b0b52b4c8afc51d261139a4fab6a46bb934","last_reissued_at":"2026-05-18T02:41:40.529989Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:40.529989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.7808","source_version":1,"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-18T02:41:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vLRflYKs8hEq2ZnOqHZjmTQ/dz6BX3SLeau6cbIwaP6F+7hRPcnjGHjtYAwgmxm3PU1vVDiZmXqyVby5tdv5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T23:54:06.264062Z"},"content_sha256":"20a74971880ab8602de2229e9e18a71e262327fd0be42a414c3ce1a655eacc84","schema_version":"1.0","event_id":"sha256:20a74971880ab8602de2229e9e18a71e262327fd0be42a414c3ce1a655eacc84"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:RFFIVEZSIGGMXTI2U5Y3AB2LBN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Resource-Constrained Adaptive Search for Sparse Multi-Class Targets with Varying Importance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alfred O. Hero III, Beipeng Mu, Dennis Wei, Gregory E. Newstadt, Jonathan P. How","submitted_at":"2014-09-27T12:58:53Z","abstract_excerpt":"In sparse target inference problems it has been shown that significant gains can be achieved by adaptive sensing using convex criteria. We generalize previous work on adaptive sensing to (a) include multiple classes of targets with different levels of importance and (b) accommodate multiple sensor models. New optimization policies are developed to allocate a limited resource budget to simultaneously locate, classify and estimate a sparse number of targets embedded in a large space. Upper and lower bounds on the performance of the proposed policies are derived by analyzing a baseline policy, wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7808","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"},"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-18T02:41:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"essIApaQ9BG9b+4xkhYdiQUOmqaSBSLiJQ9WnMC7K8EFOmsYhLTXeLO5yM9wIG3cEZyZWydWgYpNZZU9jU+jCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T23:54:06.264736Z"},"content_sha256":"bc17d4f1f07de40da894cb4845730051338a1e6ed360db20f1fb3b0be1ca27f0","schema_version":"1.0","event_id":"sha256:bc17d4f1f07de40da894cb4845730051338a1e6ed360db20f1fb3b0be1ca27f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RFFIVEZSIGGMXTI2U5Y3AB2LBN/bundle.json","state_url":"https://pith.science/pith/RFFIVEZSIGGMXTI2U5Y3AB2LBN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RFFIVEZSIGGMXTI2U5Y3AB2LBN/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-07T23:54:06Z","links":{"resolver":"https://pith.science/pith/RFFIVEZSIGGMXTI2U5Y3AB2LBN","bundle":"https://pith.science/pith/RFFIVEZSIGGMXTI2U5Y3AB2LBN/bundle.json","state":"https://pith.science/pith/RFFIVEZSIGGMXTI2U5Y3AB2LBN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RFFIVEZSIGGMXTI2U5Y3AB2LBN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RFFIVEZSIGGMXTI2U5Y3AB2LBN","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":"50a9d83ddf2407bf95186464bb348b52c1f72158f85794d9cb8aefc8164191bc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-27T12:58:53Z","title_canon_sha256":"00748224e55ad5a29a8affe32f7edb04b44eece221d6a68cc92f9a039a1d4e7f"},"schema_version":"1.0","source":{"id":"1409.7808","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7808","created_at":"2026-05-18T02:41:40Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7808v1","created_at":"2026-05-18T02:41:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7808","created_at":"2026-05-18T02:41:40Z"},{"alias_kind":"pith_short_12","alias_value":"RFFIVEZSIGGM","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RFFIVEZSIGGMXTI2","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RFFIVEZS","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:bc17d4f1f07de40da894cb4845730051338a1e6ed360db20f1fb3b0be1ca27f0","target":"graph","created_at":"2026-05-18T02:41:40Z","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":"In sparse target inference problems it has been shown that significant gains can be achieved by adaptive sensing using convex criteria. We generalize previous work on adaptive sensing to (a) include multiple classes of targets with different levels of importance and (b) accommodate multiple sensor models. New optimization policies are developed to allocate a limited resource budget to simultaneously locate, classify and estimate a sparse number of targets embedded in a large space. Upper and lower bounds on the performance of the proposed policies are derived by analyzing a baseline policy, wh","authors_text":"Alfred O. Hero III, Beipeng Mu, Dennis Wei, Gregory E. Newstadt, Jonathan P. How","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-27T12:58:53Z","title":"Resource-Constrained Adaptive Search for Sparse Multi-Class Targets with Varying Importance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7808","kind":"arxiv","version":1},"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:20a74971880ab8602de2229e9e18a71e262327fd0be42a414c3ce1a655eacc84","target":"record","created_at":"2026-05-18T02:41:40Z","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":"50a9d83ddf2407bf95186464bb348b52c1f72158f85794d9cb8aefc8164191bc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-09-27T12:58:53Z","title_canon_sha256":"00748224e55ad5a29a8affe32f7edb04b44eece221d6a68cc92f9a039a1d4e7f"},"schema_version":"1.0","source":{"id":"1409.7808","kind":"arxiv","version":1}},"canonical_sha256":"894a8a9332418ccbcd1aa771b0074b0b52b4c8afc51d261139a4fab6a46bb934","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"894a8a9332418ccbcd1aa771b0074b0b52b4c8afc51d261139a4fab6a46bb934","first_computed_at":"2026-05-18T02:41:40.529989Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:40.529989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6UUH0Fo4GS4xc9N88cib/Bwx/w1Dx8QRaooESD/270lNFQtEI0hyoz+kYc8Zx0HG72WgIgD7Cta5pRmeu58qBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:40.530604Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.7808","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20a74971880ab8602de2229e9e18a71e262327fd0be42a414c3ce1a655eacc84","sha256:bc17d4f1f07de40da894cb4845730051338a1e6ed360db20f1fb3b0be1ca27f0"],"state_sha256":"8473ec21982777ec2f76aebc3f9b40aae62ffe434d2074c1f38d5967a4299fb2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tP+YVlO9qO9s8w9ZQvESDqfjcVzlSEMA7lG5J6f0qIb9714NI9VBT03OJlIWyZo99Y1Zn2qmefN3BoK0eax9Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T23:54:06.268830Z","bundle_sha256":"3c63ee2a63f2a886fb7c66f7244f13608ccc81afa2959de3903f3af27015da8c"}}