{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:J6WE5O33E7QU3GCK6GCT4UM75W","short_pith_number":"pith:J6WE5O33","canonical_record":{"source":{"id":"1404.0142","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-01T06:44:21Z","cross_cats_sorted":["cs.SY","math.IT","math.OC"],"title_canon_sha256":"5828b5c9c39d05674287b0dca671c11fadd570fb3a2bf62b66065adc3416fb16","abstract_canon_sha256":"56e39da758136416621ec8fa195f55a43de6a7eab30ee3e33c7feee31b30f587"},"schema_version":"1.0"},"canonical_sha256":"4fac4ebb7b27e14d984af1853e519fedbb6137d49ae6f6a5c4fe923117479c52","source":{"kind":"arxiv","id":"1404.0142","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0142","created_at":"2026-05-18T02:55:05Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0142v1","created_at":"2026-05-18T02:55:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0142","created_at":"2026-05-18T02:55:05Z"},{"alias_kind":"pith_short_12","alias_value":"J6WE5O33E7QU","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"J6WE5O33E7QU3GCK","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"J6WE5O33","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:J6WE5O33E7QU3GCK6GCT4UM75W","target":"record","payload":{"canonical_record":{"source":{"id":"1404.0142","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-01T06:44:21Z","cross_cats_sorted":["cs.SY","math.IT","math.OC"],"title_canon_sha256":"5828b5c9c39d05674287b0dca671c11fadd570fb3a2bf62b66065adc3416fb16","abstract_canon_sha256":"56e39da758136416621ec8fa195f55a43de6a7eab30ee3e33c7feee31b30f587"},"schema_version":"1.0"},"canonical_sha256":"4fac4ebb7b27e14d984af1853e519fedbb6137d49ae6f6a5c4fe923117479c52","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:05.032577Z","signature_b64":"hOQympU5PWcX8MY8mglF/JjFCxPE7P1C1xNzgG2CzXD+WCJNrQtWiPN92AuilY3g0HcglHoMStUHmliD1zUECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fac4ebb7b27e14d984af1853e519fedbb6137d49ae6f6a5c4fe923117479c52","last_reissued_at":"2026-05-18T02:55:05.032074Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:05.032074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.0142","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:55:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0dFddGXT+2GgjA5zxahse7RBPOF6ww2hizXzN2u/0JjTGVU0BlJXF5hWt/urzn+IG0Ec9m8L8VQ2HFIRz3NXDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:01:41.750117Z"},"content_sha256":"aab81f4c4cb7af84aab4c7813e99be3222f82f0ca4a2cba2e89ec607bafd1ed9","schema_version":"1.0","event_id":"sha256:aab81f4c4cb7af84aab4c7813e99be3222f82f0ca4a2cba2e89ec607bafd1ed9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:J6WE5O33E7QU3GCK6GCT4UM75W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information-Theoretic Bounds for Performance of Resource-Constrained Communication Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Albert Y.S. Lam, Victor O.K. Li, Yanhui Geng","submitted_at":"2014-04-01T06:44:21Z","abstract_excerpt":"Resource-constrained systems are prevalent in communications. Such a system is composed of many components but only some of them can be allocated with resources such as time slots. According to the amount of information about the system, algorithms are employed to allocate resources and the overall system performance depends on the result of resource allocation. We do not always have complete information, and thus, the system performance may not be satisfactory. In this work, we propose a general model for the resource-constrained communication systems. We draw the relationship between system "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0142","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:55:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vJ+SWD3M9PSmagadTeI41jHMgM+ft9c1qBBhRWv/czclcnl09xeJr3DQdywv580GSNkCNq6k0zpGnbbpW41JAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:01:41.750486Z"},"content_sha256":"c5b41e823877ab26ef72628a7fe150e5e5fe73876e8c5e9da9643570777f7b5f","schema_version":"1.0","event_id":"sha256:c5b41e823877ab26ef72628a7fe150e5e5fe73876e8c5e9da9643570777f7b5f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J6WE5O33E7QU3GCK6GCT4UM75W/bundle.json","state_url":"https://pith.science/pith/J6WE5O33E7QU3GCK6GCT4UM75W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J6WE5O33E7QU3GCK6GCT4UM75W/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-01T11:01:41Z","links":{"resolver":"https://pith.science/pith/J6WE5O33E7QU3GCK6GCT4UM75W","bundle":"https://pith.science/pith/J6WE5O33E7QU3GCK6GCT4UM75W/bundle.json","state":"https://pith.science/pith/J6WE5O33E7QU3GCK6GCT4UM75W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J6WE5O33E7QU3GCK6GCT4UM75W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:J6WE5O33E7QU3GCK6GCT4UM75W","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":"56e39da758136416621ec8fa195f55a43de6a7eab30ee3e33c7feee31b30f587","cross_cats_sorted":["cs.SY","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-01T06:44:21Z","title_canon_sha256":"5828b5c9c39d05674287b0dca671c11fadd570fb3a2bf62b66065adc3416fb16"},"schema_version":"1.0","source":{"id":"1404.0142","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.0142","created_at":"2026-05-18T02:55:05Z"},{"alias_kind":"arxiv_version","alias_value":"1404.0142v1","created_at":"2026-05-18T02:55:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.0142","created_at":"2026-05-18T02:55:05Z"},{"alias_kind":"pith_short_12","alias_value":"J6WE5O33E7QU","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"J6WE5O33E7QU3GCK","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"J6WE5O33","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:c5b41e823877ab26ef72628a7fe150e5e5fe73876e8c5e9da9643570777f7b5f","target":"graph","created_at":"2026-05-18T02:55:05Z","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":"Resource-constrained systems are prevalent in communications. Such a system is composed of many components but only some of them can be allocated with resources such as time slots. According to the amount of information about the system, algorithms are employed to allocate resources and the overall system performance depends on the result of resource allocation. We do not always have complete information, and thus, the system performance may not be satisfactory. In this work, we propose a general model for the resource-constrained communication systems. We draw the relationship between system ","authors_text":"Albert Y.S. Lam, Victor O.K. Li, Yanhui Geng","cross_cats":["cs.SY","math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-01T06:44:21Z","title":"Information-Theoretic Bounds for Performance of Resource-Constrained Communication Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.0142","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:aab81f4c4cb7af84aab4c7813e99be3222f82f0ca4a2cba2e89ec607bafd1ed9","target":"record","created_at":"2026-05-18T02:55:05Z","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":"56e39da758136416621ec8fa195f55a43de6a7eab30ee3e33c7feee31b30f587","cross_cats_sorted":["cs.SY","math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-01T06:44:21Z","title_canon_sha256":"5828b5c9c39d05674287b0dca671c11fadd570fb3a2bf62b66065adc3416fb16"},"schema_version":"1.0","source":{"id":"1404.0142","kind":"arxiv","version":1}},"canonical_sha256":"4fac4ebb7b27e14d984af1853e519fedbb6137d49ae6f6a5c4fe923117479c52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4fac4ebb7b27e14d984af1853e519fedbb6137d49ae6f6a5c4fe923117479c52","first_computed_at":"2026-05-18T02:55:05.032074Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:05.032074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hOQympU5PWcX8MY8mglF/JjFCxPE7P1C1xNzgG2CzXD+WCJNrQtWiPN92AuilY3g0HcglHoMStUHmliD1zUECg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:05.032577Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.0142","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aab81f4c4cb7af84aab4c7813e99be3222f82f0ca4a2cba2e89ec607bafd1ed9","sha256:c5b41e823877ab26ef72628a7fe150e5e5fe73876e8c5e9da9643570777f7b5f"],"state_sha256":"ff80dac296f883765ae572f2df995eee259b78da957916207596cb5ffa81f1e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CtlpFfGIlU5vtwd1Xs+l7rb2X57IJSLEwN7P6vI6xtvsNBhmZspWa/0/bZS++Cs1r1LWmoPGSdR9LPBOYrXPAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T11:01:41.752456Z","bundle_sha256":"e5465cedb3435dcb4a515355d204eaa56adac4ef79caabe57e3369adbc9aa8d3"}}