{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4O2IKAOX7NEKJWFEEGWMQTDVQ7","short_pith_number":"pith:4O2IKAOX","canonical_record":{"source":{"id":"1801.03422","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-10T15:37:37Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"ec544743e47b8efd5cd7d411e374308649ecc6029b68af199d267f0656a2be5e","abstract_canon_sha256":"3241397f0ce9886e6d0fa6eec405af902f56cec28e6cf261425fbf2e96551db5"},"schema_version":"1.0"},"canonical_sha256":"e3b48501d7fb48a4d8a421acc84c7587c509cbefeb27157980c5389c2d6a0c45","source":{"kind":"arxiv","id":"1801.03422","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.03422","created_at":"2026-05-18T00:18:25Z"},{"alias_kind":"arxiv_version","alias_value":"1801.03422v2","created_at":"2026-05-18T00:18:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03422","created_at":"2026-05-18T00:18:25Z"},{"alias_kind":"pith_short_12","alias_value":"4O2IKAOX7NEK","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4O2IKAOX7NEKJWFE","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4O2IKAOX","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4O2IKAOX7NEKJWFEEGWMQTDVQ7","target":"record","payload":{"canonical_record":{"source":{"id":"1801.03422","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-10T15:37:37Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"ec544743e47b8efd5cd7d411e374308649ecc6029b68af199d267f0656a2be5e","abstract_canon_sha256":"3241397f0ce9886e6d0fa6eec405af902f56cec28e6cf261425fbf2e96551db5"},"schema_version":"1.0"},"canonical_sha256":"e3b48501d7fb48a4d8a421acc84c7587c509cbefeb27157980c5389c2d6a0c45","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:25.357436Z","signature_b64":"/gXNNpcsixMRFK/Myw0RFYyKFPgr9w5F4H9FZFHQRN8n9Dh0r1KEUSixllPHw9dv6F9OuwuSLPStPszxY4KrDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3b48501d7fb48a4d8a421acc84c7587c509cbefeb27157980c5389c2d6a0c45","last_reissued_at":"2026-05-18T00:18:25.356843Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:25.356843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.03422","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-18T00:18:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cOktbVxJrC+0UTB89ZkCt97dTwoiP6M0o9zeFUih3Sd6X/ua1RB1pAjUaQgDSbr+QHxu3D6iG/6wvB9NaJZpBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:08:18.592177Z"},"content_sha256":"c4a42eaba75aae624b73fd1dd365762a2f6edb6518731089e883416949072840","schema_version":"1.0","event_id":"sha256:c4a42eaba75aae624b73fd1dd365762a2f6edb6518731089e883416949072840"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4O2IKAOX7NEKJWFEEGWMQTDVQ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Age of Information: Whittle Index for Scheduling Stochastic Arrivals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT"],"primary_cat":"math.OC","authors_text":"Yu-Pin Hsu","submitted_at":"2018-01-10T15:37:37Z","abstract_excerpt":"Age of information is a new concept that characterizes the freshness of information at end devices. This paper studies the age of information from a scheduling perspective. We consider a wireless broadcast network where a base-station updates many users on stochastic information arrivals. Suppose that only one user can be updated for each time. In this context, we aim at developing a transmission scheduling algorithm for minimizing the long-run average age. To develop a low-complexity transmission scheduling algorithm, we apply the Whittle's framework for restless bandits. We successfully deri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03422","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-18T00:18:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jRsIGxAhz3R4MxUg0M+sEApmbAXct8A2b9JcGhcOJCpyXnqpmkDqQIl0tZsOJ2a6EszG0o3Dn0k9zUGFxiiEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:08:18.592915Z"},"content_sha256":"8e92a39ac3d5838ac383c06e0c660e5304f1b8ca7cbb78c5419cf4b44a8325c2","schema_version":"1.0","event_id":"sha256:8e92a39ac3d5838ac383c06e0c660e5304f1b8ca7cbb78c5419cf4b44a8325c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4O2IKAOX7NEKJWFEEGWMQTDVQ7/bundle.json","state_url":"https://pith.science/pith/4O2IKAOX7NEKJWFEEGWMQTDVQ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4O2IKAOX7NEKJWFEEGWMQTDVQ7/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-07T14:08:18Z","links":{"resolver":"https://pith.science/pith/4O2IKAOX7NEKJWFEEGWMQTDVQ7","bundle":"https://pith.science/pith/4O2IKAOX7NEKJWFEEGWMQTDVQ7/bundle.json","state":"https://pith.science/pith/4O2IKAOX7NEKJWFEEGWMQTDVQ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4O2IKAOX7NEKJWFEEGWMQTDVQ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4O2IKAOX7NEKJWFEEGWMQTDVQ7","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":"3241397f0ce9886e6d0fa6eec405af902f56cec28e6cf261425fbf2e96551db5","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-10T15:37:37Z","title_canon_sha256":"ec544743e47b8efd5cd7d411e374308649ecc6029b68af199d267f0656a2be5e"},"schema_version":"1.0","source":{"id":"1801.03422","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.03422","created_at":"2026-05-18T00:18:25Z"},{"alias_kind":"arxiv_version","alias_value":"1801.03422v2","created_at":"2026-05-18T00:18:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03422","created_at":"2026-05-18T00:18:25Z"},{"alias_kind":"pith_short_12","alias_value":"4O2IKAOX7NEK","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4O2IKAOX7NEKJWFE","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4O2IKAOX","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:8e92a39ac3d5838ac383c06e0c660e5304f1b8ca7cbb78c5419cf4b44a8325c2","target":"graph","created_at":"2026-05-18T00:18:25Z","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":"Age of information is a new concept that characterizes the freshness of information at end devices. This paper studies the age of information from a scheduling perspective. We consider a wireless broadcast network where a base-station updates many users on stochastic information arrivals. Suppose that only one user can be updated for each time. In this context, we aim at developing a transmission scheduling algorithm for minimizing the long-run average age. To develop a low-complexity transmission scheduling algorithm, we apply the Whittle's framework for restless bandits. We successfully deri","authors_text":"Yu-Pin Hsu","cross_cats":["cs.IT","cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-10T15:37:37Z","title":"Age of Information: Whittle Index for Scheduling Stochastic Arrivals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03422","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:c4a42eaba75aae624b73fd1dd365762a2f6edb6518731089e883416949072840","target":"record","created_at":"2026-05-18T00:18:25Z","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":"3241397f0ce9886e6d0fa6eec405af902f56cec28e6cf261425fbf2e96551db5","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-10T15:37:37Z","title_canon_sha256":"ec544743e47b8efd5cd7d411e374308649ecc6029b68af199d267f0656a2be5e"},"schema_version":"1.0","source":{"id":"1801.03422","kind":"arxiv","version":2}},"canonical_sha256":"e3b48501d7fb48a4d8a421acc84c7587c509cbefeb27157980c5389c2d6a0c45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e3b48501d7fb48a4d8a421acc84c7587c509cbefeb27157980c5389c2d6a0c45","first_computed_at":"2026-05-18T00:18:25.356843Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:25.356843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/gXNNpcsixMRFK/Myw0RFYyKFPgr9w5F4H9FZFHQRN8n9Dh0r1KEUSixllPHw9dv6F9OuwuSLPStPszxY4KrDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:25.357436Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.03422","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4a42eaba75aae624b73fd1dd365762a2f6edb6518731089e883416949072840","sha256:8e92a39ac3d5838ac383c06e0c660e5304f1b8ca7cbb78c5419cf4b44a8325c2"],"state_sha256":"afa0739e8c124dbf54aa5076ea4caeb328b6e72b722270d7e262b22d0a368f8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e1HCIufZvkc1aICnFY/8SyksVgjPhDMGUC4FD67lWoL7Cw2pK+MUIm5sffqoKgHIBMxgpdShTPcQgAPGT+VoAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:08:18.596785Z","bundle_sha256":"afef93526860c426158b2a2dcceb9b705a593b409a22500d0be57966df1059a6"}}