{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ZRKKGVPABGPDGEKPUHSKB3XHVY","short_pith_number":"pith:ZRKKGVPA","canonical_record":{"source":{"id":"1110.5342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2011-10-21T17:31:39Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"9bfc44081587288d3e5d0a664b2de6ad1c6bdda55fad97e2712097cc642df397","abstract_canon_sha256":"5e0eff3ceb1029d70522b92061164171c2a3ec5c31fb7a92e3cf10ff4868b463"},"schema_version":"1.0"},"canonical_sha256":"cc54a355e0099e33114fa1e4a0eee7ae07970013f5f53bc69f907eda85aa6b60","source":{"kind":"arxiv","id":"1110.5342","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.5342","created_at":"2026-05-18T02:00:04Z"},{"alias_kind":"arxiv_version","alias_value":"1110.5342v1","created_at":"2026-05-18T02:00:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5342","created_at":"2026-05-18T02:00:04Z"},{"alias_kind":"pith_short_12","alias_value":"ZRKKGVPABGPD","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"ZRKKGVPABGPDGEKP","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"ZRKKGVPA","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ZRKKGVPABGPDGEKPUHSKB3XHVY","target":"record","payload":{"canonical_record":{"source":{"id":"1110.5342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2011-10-21T17:31:39Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"9bfc44081587288d3e5d0a664b2de6ad1c6bdda55fad97e2712097cc642df397","abstract_canon_sha256":"5e0eff3ceb1029d70522b92061164171c2a3ec5c31fb7a92e3cf10ff4868b463"},"schema_version":"1.0"},"canonical_sha256":"cc54a355e0099e33114fa1e4a0eee7ae07970013f5f53bc69f907eda85aa6b60","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:00:04.431776Z","signature_b64":"zL/xBLtD+5sGFfZe80dg3p1cALxMs/gPvJzp2k0ufsq09c+U9q7JWAXd3A73RyNlCMl4bftpgrkrbvSBoNcXBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc54a355e0099e33114fa1e4a0eee7ae07970013f5f53bc69f907eda85aa6b60","last_reissued_at":"2026-05-18T02:00:04.431258Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:00:04.431258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.5342","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:00:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p2f1T/oSAwajGzDbNNnz+gxcC9mi1KccAti2vcdwL6gkxqeNsDt6lXQljuSEL3Q0iEgLpH2Cq5Bk/i9cutveCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:41:15.150811Z"},"content_sha256":"4630ed844a88469a6ba5ab5064fe00822cb65ecd251d619d60937173c1eb1c67","schema_version":"1.0","event_id":"sha256:4630ed844a88469a6ba5ab5064fe00822cb65ecd251d619d60937173c1eb1c67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ZRKKGVPABGPDGEKPUHSKB3XHVY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Bit Allocation for Object Tracking in Bandwidth Limited Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"stat.AP","authors_text":"Engin Masazade, Pramod K. Varshney, Ruixin Niu","submitted_at":"2011-10-21T17:31:39Z","abstract_excerpt":"In this paper, we study the target tracking problem in wireless sensor networks (WSNs) using quantized sensor measurements under limited bandwidth availability. At each time step of tracking, the available bandwidth $R$ needs to be distributed among the $N$ sensors in the WSN for the next time step. The optimal solution for the bandwidth allocation problem can be obtained by using a combinatorial search which may become computationally prohibitive for large $N$ and $R$. Therefore, we develop two new computationally efficient suboptimal bandwidth distribution algorithms which are based on conve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5342","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:00:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d0iBl3hkUgRBhXXju6WRY8jFx303xKhj/bIqX9wLFjvBE057qB/7HhDkAfoi3krzU+7szznb9yrpbjlFiHrFDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:41:15.151159Z"},"content_sha256":"d569c7ad7bb08ec746ae0370a1bbe7b4042ec8e2ddcc246b4c5d4530744c5fa2","schema_version":"1.0","event_id":"sha256:d569c7ad7bb08ec746ae0370a1bbe7b4042ec8e2ddcc246b4c5d4530744c5fa2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZRKKGVPABGPDGEKPUHSKB3XHVY/bundle.json","state_url":"https://pith.science/pith/ZRKKGVPABGPDGEKPUHSKB3XHVY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZRKKGVPABGPDGEKPUHSKB3XHVY/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-03T02:41:15Z","links":{"resolver":"https://pith.science/pith/ZRKKGVPABGPDGEKPUHSKB3XHVY","bundle":"https://pith.science/pith/ZRKKGVPABGPDGEKPUHSKB3XHVY/bundle.json","state":"https://pith.science/pith/ZRKKGVPABGPDGEKPUHSKB3XHVY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZRKKGVPABGPDGEKPUHSKB3XHVY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ZRKKGVPABGPDGEKPUHSKB3XHVY","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":"5e0eff3ceb1029d70522b92061164171c2a3ec5c31fb7a92e3cf10ff4868b463","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2011-10-21T17:31:39Z","title_canon_sha256":"9bfc44081587288d3e5d0a664b2de6ad1c6bdda55fad97e2712097cc642df397"},"schema_version":"1.0","source":{"id":"1110.5342","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.5342","created_at":"2026-05-18T02:00:04Z"},{"alias_kind":"arxiv_version","alias_value":"1110.5342v1","created_at":"2026-05-18T02:00:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5342","created_at":"2026-05-18T02:00:04Z"},{"alias_kind":"pith_short_12","alias_value":"ZRKKGVPABGPD","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"ZRKKGVPABGPDGEKP","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"ZRKKGVPA","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:d569c7ad7bb08ec746ae0370a1bbe7b4042ec8e2ddcc246b4c5d4530744c5fa2","target":"graph","created_at":"2026-05-18T02:00:04Z","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 this paper, we study the target tracking problem in wireless sensor networks (WSNs) using quantized sensor measurements under limited bandwidth availability. At each time step of tracking, the available bandwidth $R$ needs to be distributed among the $N$ sensors in the WSN for the next time step. The optimal solution for the bandwidth allocation problem can be obtained by using a combinatorial search which may become computationally prohibitive for large $N$ and $R$. Therefore, we develop two new computationally efficient suboptimal bandwidth distribution algorithms which are based on conve","authors_text":"Engin Masazade, Pramod K. Varshney, Ruixin Niu","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2011-10-21T17:31:39Z","title":"Dynamic Bit Allocation for Object Tracking in Bandwidth Limited Sensor Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5342","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:4630ed844a88469a6ba5ab5064fe00822cb65ecd251d619d60937173c1eb1c67","target":"record","created_at":"2026-05-18T02:00:04Z","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":"5e0eff3ceb1029d70522b92061164171c2a3ec5c31fb7a92e3cf10ff4868b463","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2011-10-21T17:31:39Z","title_canon_sha256":"9bfc44081587288d3e5d0a664b2de6ad1c6bdda55fad97e2712097cc642df397"},"schema_version":"1.0","source":{"id":"1110.5342","kind":"arxiv","version":1}},"canonical_sha256":"cc54a355e0099e33114fa1e4a0eee7ae07970013f5f53bc69f907eda85aa6b60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc54a355e0099e33114fa1e4a0eee7ae07970013f5f53bc69f907eda85aa6b60","first_computed_at":"2026-05-18T02:00:04.431258Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:00:04.431258Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zL/xBLtD+5sGFfZe80dg3p1cALxMs/gPvJzp2k0ufsq09c+U9q7JWAXd3A73RyNlCMl4bftpgrkrbvSBoNcXBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:00:04.431776Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.5342","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4630ed844a88469a6ba5ab5064fe00822cb65ecd251d619d60937173c1eb1c67","sha256:d569c7ad7bb08ec746ae0370a1bbe7b4042ec8e2ddcc246b4c5d4530744c5fa2"],"state_sha256":"e22abbb30b738577cf21c7666677ac3e79ddcd4f052f4234cbb6450fd5673a32"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Ne8ANaMtDvbEHMy3X+K78JtiUhfdc2ThsJISQikgr/cDa17aFSp+gBRZR8pGTmZQvgMJUFcC0PjFXGpXdTECw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:41:15.153162Z","bundle_sha256":"58be33af869a9bd1376777b2673ec6d591966bc7abd311d97a923af703e9b038"}}