{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DN7A3DN7246MWQRDKR5JITKMZN","short_pith_number":"pith:DN7A3DN7","canonical_record":{"source":{"id":"1803.08189","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-22T01:09:15Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"f6b83f2ed8f6f6ac2da19c5bce1047e7cf6cf938a23d758f90d7d1c50af2d526","abstract_canon_sha256":"d46ce63f7790bd273e5d16e8cdb26ca333019e32d6436c0a90fed99583aa4d7f"},"schema_version":"1.0"},"canonical_sha256":"1b7e0d8dbfd73ccb4223547a944d4ccb7e4f7cc72bf2dafa5dafb4924f88e961","source":{"kind":"arxiv","id":"1803.08189","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.08189","created_at":"2026-05-18T00:20:23Z"},{"alias_kind":"arxiv_version","alias_value":"1803.08189v1","created_at":"2026-05-18T00:20:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08189","created_at":"2026-05-18T00:20:23Z"},{"alias_kind":"pith_short_12","alias_value":"DN7A3DN7246M","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DN7A3DN7246MWQRD","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DN7A3DN7","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DN7A3DN7246MWQRDKR5JITKMZN","target":"record","payload":{"canonical_record":{"source":{"id":"1803.08189","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-22T01:09:15Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"f6b83f2ed8f6f6ac2da19c5bce1047e7cf6cf938a23d758f90d7d1c50af2d526","abstract_canon_sha256":"d46ce63f7790bd273e5d16e8cdb26ca333019e32d6436c0a90fed99583aa4d7f"},"schema_version":"1.0"},"canonical_sha256":"1b7e0d8dbfd73ccb4223547a944d4ccb7e4f7cc72bf2dafa5dafb4924f88e961","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:23.480400Z","signature_b64":"bbOAtLMePZNnadDR3EzJ81AIsOnbYKB0cW85aYn9+B00UKEJcMFc6fnN9ktZexapbPWTw+fcZxEutCUm2u9kCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b7e0d8dbfd73ccb4223547a944d4ccb7e4f7cc72bf2dafa5dafb4924f88e961","last_reissued_at":"2026-05-18T00:20:23.479903Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:23.479903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.08189","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-18T00:20:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PnzB9MI5Rb29uEX4oppscVjtN8jsu+LPUMave5/6+L9M6d71yu0Lj5or2GxaftvyKJiKEykhSbWCbA1d496TAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:07:10.827946Z"},"content_sha256":"b6a0480b882fc5d678fb38cc2cd69332cc83379739ca1339b99ba2d67f1ebe65","schema_version":"1.0","event_id":"sha256:b6a0480b882fc5d678fb38cc2cd69332cc83379739ca1339b99ba2d67f1ebe65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DN7A3DN7246MWQRDKR5JITKMZN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Can Decentralized Status Update Achieve Universally Near-Optimal Age-of-Information in Wireless Multiaccess Channels?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Bhaskar Krishnamachari, Sheng Zhou, Zhisheng Niu, Zhiyuan Jiang","submitted_at":"2018-03-22T01:09:15Z","abstract_excerpt":"In an Internet-of-Things system where status data are collected from sensors and actuators for time-critical applications, the freshness of data is vital and can be quantified by the recently proposed age-of-information (AoI) metric. In this paper, we first consider a general scenario where multiple terminals share a common channel to transmit or receive randomly generated status packets. The optimal scheduling problem to minimize AoI is formulated as a restless multi-armed bandit problem. To solve the problem efficiently, we derive the Whittle's index in closed-form and establish the indexabi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08189","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-18T00:20:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9JNBirgySfhFy+DyaesXfgV33Y/PJGPBm/mQH8AeJ6FJa7VXWxYWStQQqSG+DAD3OUOQ2JWspXggvS/11kRDCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T05:07:10.828306Z"},"content_sha256":"6f349270226f7af765f59f0b323f04263590e89ac40746ca0a2126c5f84b39c4","schema_version":"1.0","event_id":"sha256:6f349270226f7af765f59f0b323f04263590e89ac40746ca0a2126c5f84b39c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DN7A3DN7246MWQRDKR5JITKMZN/bundle.json","state_url":"https://pith.science/pith/DN7A3DN7246MWQRDKR5JITKMZN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DN7A3DN7246MWQRDKR5JITKMZN/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-28T05:07:10Z","links":{"resolver":"https://pith.science/pith/DN7A3DN7246MWQRDKR5JITKMZN","bundle":"https://pith.science/pith/DN7A3DN7246MWQRDKR5JITKMZN/bundle.json","state":"https://pith.science/pith/DN7A3DN7246MWQRDKR5JITKMZN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DN7A3DN7246MWQRDKR5JITKMZN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DN7A3DN7246MWQRDKR5JITKMZN","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":"d46ce63f7790bd273e5d16e8cdb26ca333019e32d6436c0a90fed99583aa4d7f","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-22T01:09:15Z","title_canon_sha256":"f6b83f2ed8f6f6ac2da19c5bce1047e7cf6cf938a23d758f90d7d1c50af2d526"},"schema_version":"1.0","source":{"id":"1803.08189","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.08189","created_at":"2026-05-18T00:20:23Z"},{"alias_kind":"arxiv_version","alias_value":"1803.08189v1","created_at":"2026-05-18T00:20:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.08189","created_at":"2026-05-18T00:20:23Z"},{"alias_kind":"pith_short_12","alias_value":"DN7A3DN7246M","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DN7A3DN7246MWQRD","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DN7A3DN7","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:6f349270226f7af765f59f0b323f04263590e89ac40746ca0a2126c5f84b39c4","target":"graph","created_at":"2026-05-18T00:20:23Z","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 an Internet-of-Things system where status data are collected from sensors and actuators for time-critical applications, the freshness of data is vital and can be quantified by the recently proposed age-of-information (AoI) metric. In this paper, we first consider a general scenario where multiple terminals share a common channel to transmit or receive randomly generated status packets. The optimal scheduling problem to minimize AoI is formulated as a restless multi-armed bandit problem. To solve the problem efficiently, we derive the Whittle's index in closed-form and establish the indexabi","authors_text":"Bhaskar Krishnamachari, Sheng Zhou, Zhisheng Niu, Zhiyuan Jiang","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-22T01:09:15Z","title":"Can Decentralized Status Update Achieve Universally Near-Optimal Age-of-Information in Wireless Multiaccess Channels?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.08189","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:b6a0480b882fc5d678fb38cc2cd69332cc83379739ca1339b99ba2d67f1ebe65","target":"record","created_at":"2026-05-18T00:20:23Z","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":"d46ce63f7790bd273e5d16e8cdb26ca333019e32d6436c0a90fed99583aa4d7f","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-22T01:09:15Z","title_canon_sha256":"f6b83f2ed8f6f6ac2da19c5bce1047e7cf6cf938a23d758f90d7d1c50af2d526"},"schema_version":"1.0","source":{"id":"1803.08189","kind":"arxiv","version":1}},"canonical_sha256":"1b7e0d8dbfd73ccb4223547a944d4ccb7e4f7cc72bf2dafa5dafb4924f88e961","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b7e0d8dbfd73ccb4223547a944d4ccb7e4f7cc72bf2dafa5dafb4924f88e961","first_computed_at":"2026-05-18T00:20:23.479903Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:23.479903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bbOAtLMePZNnadDR3EzJ81AIsOnbYKB0cW85aYn9+B00UKEJcMFc6fnN9ktZexapbPWTw+fcZxEutCUm2u9kCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:23.480400Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.08189","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6a0480b882fc5d678fb38cc2cd69332cc83379739ca1339b99ba2d67f1ebe65","sha256:6f349270226f7af765f59f0b323f04263590e89ac40746ca0a2126c5f84b39c4"],"state_sha256":"29698343ccea74f0fb760a5a879493fe4c963719e4a111ae73c47e22684e1507"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BP3ZNsdgVM5DzzOP0jWwuaZfDO0+lzwOpf4ARns1qVETyQtpsp5TAr25gqvbxHqqGd40AYTXoO6XltjOnz4QBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T05:07:10.830278Z","bundle_sha256":"319e75c5286d60f70e1aeab32d63dbcfdee8707b7347302768a84d271e7e7e18"}}