{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IJA4HU4EY4XWKKNCU33GLEVH3K","short_pith_number":"pith:IJA4HU4E","canonical_record":{"source":{"id":"1610.04893","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-10-16T17:30:57Z","cross_cats_sorted":[],"title_canon_sha256":"1e2056f4670339a331938cc6cb8aae147b2315875ac0517e144fe8eaa571f4de","abstract_canon_sha256":"7b5149d534e51f976da60ee8db6eec4fc7e2c02547f902b4cba144740aedf968"},"schema_version":"1.0"},"canonical_sha256":"4241c3d384c72f6529a2a6f66592a7daad38061f483a68620eb3c7849e53ad55","source":{"kind":"arxiv","id":"1610.04893","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04893","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04893v2","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04893","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"pith_short_12","alias_value":"IJA4HU4EY4XW","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IJA4HU4EY4XWKKNC","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IJA4HU4E","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IJA4HU4EY4XWKKNCU33GLEVH3K","target":"record","payload":{"canonical_record":{"source":{"id":"1610.04893","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-10-16T17:30:57Z","cross_cats_sorted":[],"title_canon_sha256":"1e2056f4670339a331938cc6cb8aae147b2315875ac0517e144fe8eaa571f4de","abstract_canon_sha256":"7b5149d534e51f976da60ee8db6eec4fc7e2c02547f902b4cba144740aedf968"},"schema_version":"1.0"},"canonical_sha256":"4241c3d384c72f6529a2a6f66592a7daad38061f483a68620eb3c7849e53ad55","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:35.627636Z","signature_b64":"MrgI7/BKiBTBlLCiuujUvJA81ic6WJWd4a6AfhcxPNdxj7dF+qbToWzmlPAgTdIs5yazzdub+gagygQgkoX2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4241c3d384c72f6529a2a6f66592a7daad38061f483a68620eb3c7849e53ad55","last_reissued_at":"2026-05-18T01:01:35.627032Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:35.627032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.04893","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-18T01:01:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qx3Ct1BCX2AQrRQSm71A09KUkeLrDmA9TTTek7iwAkBkkJh8fpjPbVN7/UoznA3e/Y/8xybWtXQyJ7rZM6MkAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:45:08.965854Z"},"content_sha256":"b3c553e0798a4b657934cf0a59438a6d6f575bf3ef8e67276e27ff28a0e18175","schema_version":"1.0","event_id":"sha256:b3c553e0798a4b657934cf0a59438a6d6f575bf3ef8e67276e27ff28a0e18175"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IJA4HU4EY4XWKKNCU33GLEVH3K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Capacity Allocation for Sampled Networked Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"M.-A. Belabbas, Tamer Basar, Xudong Chen","submitted_at":"2016-10-16T17:30:57Z","abstract_excerpt":"We consider the problem of estimating the states of weakly coupled linear systems from sampled measurements. We assume that the total capacity available to the sensors to transmit their samples to a network manager in charge of the estimation is bounded above, and that each sample requires the same amount of communication. Our goal is then to find an optimal allocation of the capacity to the sensors so that the average estimation error is minimized. We show that when the total available channel capacity is large, this resource allocation problem can be recast as a strictly convex optimization "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04893","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-18T01:01:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LSJwBtnJ4vwpJ8u9rgErmhVHq5qU2N932TSnxO6l1LQiY6acbFexFvA5fQWJwaaCwHEjnSELfnvA4ogDa89OCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:45:08.966456Z"},"content_sha256":"e5d672ceb027497c6982f9b05ff48963bef1fb01057222a62b9b83042f314d6f","schema_version":"1.0","event_id":"sha256:e5d672ceb027497c6982f9b05ff48963bef1fb01057222a62b9b83042f314d6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IJA4HU4EY4XWKKNCU33GLEVH3K/bundle.json","state_url":"https://pith.science/pith/IJA4HU4EY4XWKKNCU33GLEVH3K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IJA4HU4EY4XWKKNCU33GLEVH3K/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-05-30T14:45:08Z","links":{"resolver":"https://pith.science/pith/IJA4HU4EY4XWKKNCU33GLEVH3K","bundle":"https://pith.science/pith/IJA4HU4EY4XWKKNCU33GLEVH3K/bundle.json","state":"https://pith.science/pith/IJA4HU4EY4XWKKNCU33GLEVH3K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IJA4HU4EY4XWKKNCU33GLEVH3K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IJA4HU4EY4XWKKNCU33GLEVH3K","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":"7b5149d534e51f976da60ee8db6eec4fc7e2c02547f902b4cba144740aedf968","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-10-16T17:30:57Z","title_canon_sha256":"1e2056f4670339a331938cc6cb8aae147b2315875ac0517e144fe8eaa571f4de"},"schema_version":"1.0","source":{"id":"1610.04893","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.04893","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"arxiv_version","alias_value":"1610.04893v2","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.04893","created_at":"2026-05-18T01:01:35Z"},{"alias_kind":"pith_short_12","alias_value":"IJA4HU4EY4XW","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IJA4HU4EY4XWKKNC","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IJA4HU4E","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:e5d672ceb027497c6982f9b05ff48963bef1fb01057222a62b9b83042f314d6f","target":"graph","created_at":"2026-05-18T01:01: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":"We consider the problem of estimating the states of weakly coupled linear systems from sampled measurements. We assume that the total capacity available to the sensors to transmit their samples to a network manager in charge of the estimation is bounded above, and that each sample requires the same amount of communication. Our goal is then to find an optimal allocation of the capacity to the sensors so that the average estimation error is minimized. We show that when the total available channel capacity is large, this resource allocation problem can be recast as a strictly convex optimization ","authors_text":"M.-A. Belabbas, Tamer Basar, Xudong Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-10-16T17:30:57Z","title":"Optimal Capacity Allocation for Sampled Networked Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.04893","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:b3c553e0798a4b657934cf0a59438a6d6f575bf3ef8e67276e27ff28a0e18175","target":"record","created_at":"2026-05-18T01:01: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":"7b5149d534e51f976da60ee8db6eec4fc7e2c02547f902b4cba144740aedf968","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-10-16T17:30:57Z","title_canon_sha256":"1e2056f4670339a331938cc6cb8aae147b2315875ac0517e144fe8eaa571f4de"},"schema_version":"1.0","source":{"id":"1610.04893","kind":"arxiv","version":2}},"canonical_sha256":"4241c3d384c72f6529a2a6f66592a7daad38061f483a68620eb3c7849e53ad55","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4241c3d384c72f6529a2a6f66592a7daad38061f483a68620eb3c7849e53ad55","first_computed_at":"2026-05-18T01:01:35.627032Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:35.627032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MrgI7/BKiBTBlLCiuujUvJA81ic6WJWd4a6AfhcxPNdxj7dF+qbToWzmlPAgTdIs5yazzdub+gagygQgkoX2BA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:35.627636Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.04893","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3c553e0798a4b657934cf0a59438a6d6f575bf3ef8e67276e27ff28a0e18175","sha256:e5d672ceb027497c6982f9b05ff48963bef1fb01057222a62b9b83042f314d6f"],"state_sha256":"aa9ea17bbe5c962a1632317376e8ee66cf3f211247db44e8841fd7a09f1baaf4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6R2bP2doStMGvG/canixVGni+DuendPFZIEU3SqHT6tR2+7X2v7nQ25Un4ds8c8fOXyWp7RM6mnn7IlW036MCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:45:08.969024Z","bundle_sha256":"878f080e847afd4570ba09d6cc85d88a7d376358239c422d4cb35da9f448a220"}}