{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:H2DCKPZG67DOLFURQ5ZR47RDAE","short_pith_number":"pith:H2DCKPZG","canonical_record":{"source":{"id":"1712.07419","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-20T11:23:04Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"bfa5d368d420d6551fb9ac3685cbf64c33aa4fa55ca32a1c90ced07532f64e5c","abstract_canon_sha256":"5b93cb78534cefe7744ec2f7d43a33eba86a70fa96ebb03fd7aa171bbc9bc2a4"},"schema_version":"1.0"},"canonical_sha256":"3e86253f26f7c6e5969187731e7e2301137e1775c156b4577885bf0f1f5533ad","source":{"kind":"arxiv","id":"1712.07419","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.07419","created_at":"2026-05-18T00:05:39Z"},{"alias_kind":"arxiv_version","alias_value":"1712.07419v4","created_at":"2026-05-18T00:05:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07419","created_at":"2026-05-18T00:05:39Z"},{"alias_kind":"pith_short_12","alias_value":"H2DCKPZG67DO","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"H2DCKPZG67DOLFUR","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"H2DCKPZG","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:H2DCKPZG67DOLFURQ5ZR47RDAE","target":"record","payload":{"canonical_record":{"source":{"id":"1712.07419","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-20T11:23:04Z","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"title_canon_sha256":"bfa5d368d420d6551fb9ac3685cbf64c33aa4fa55ca32a1c90ced07532f64e5c","abstract_canon_sha256":"5b93cb78534cefe7744ec2f7d43a33eba86a70fa96ebb03fd7aa171bbc9bc2a4"},"schema_version":"1.0"},"canonical_sha256":"3e86253f26f7c6e5969187731e7e2301137e1775c156b4577885bf0f1f5533ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:39.495787Z","signature_b64":"YPqgmG0cFEwvLYCDay8xWoQKz42HDqjG+5SubYni/PatvC9hviOq5pAT3CG2LyKgAMwRNvR0gCkAKZlaFKNhCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e86253f26f7c6e5969187731e7e2301137e1775c156b4577885bf0f1f5533ad","last_reissued_at":"2026-05-18T00:05:39.495404Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:39.495404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.07419","source_version":4,"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:05:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XkbQuej6ka+Sqc4muSTTvzh7m2W7KPg5wISBlWK53QJ2WGCCCcydN9NSt4Ytf4zo0rI2cwHhHOcHtjXLBJY4Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:06:45.162381Z"},"content_sha256":"8c8eeee3e9715964e12cb064b11ad4aa75b324f21b838a74e13cc2801ae6f808","schema_version":"1.0","event_id":"sha256:8c8eeee3e9715964e12cb064b11ad4aa75b324f21b838a74e13cc2801ae6f808"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:H2DCKPZG67DOLFURQ5ZR47RDAE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scheduling Algorithms for Minimizing Age of Information in Wireless Broadcast Networks with Random Arrivals: The No-Buffer Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.NI","math.IT"],"primary_cat":"math.OC","authors_text":"Eytan Modiano, Lingjie Duan, Yu-Pin Hsu","submitted_at":"2017-12-20T11:23:04Z","abstract_excerpt":"Age of information is a new network performance metric that captures the freshness of information at end-users. This paper studies the age of information from a scheduling perspective. To that end, we consider a wireless broadcast network where a base-station (BS) is updating many users on random information arrivals under a transmission capacity constraint. For the offline case when the arrival statistics are known to the BS, we develop a structural MDP scheduling algorithm and an index scheduling algorithm, leveraging Markov decision process (MDP) techniques and the Whittle's methodology for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07419","kind":"arxiv","version":4},"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:05:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lpS/gVZ4Al6SlSdAMk8YMkuLJ6EaYXAkJZWUIc6wxz43H7ll9dcMhesfRgCYyiF83elES487ghNDmQFdOnOgAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:06:45.162745Z"},"content_sha256":"53db0d9745c2688225011b26adf13c9cccf773abaa95c1dde603dc2510be4f9d","schema_version":"1.0","event_id":"sha256:53db0d9745c2688225011b26adf13c9cccf773abaa95c1dde603dc2510be4f9d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H2DCKPZG67DOLFURQ5ZR47RDAE/bundle.json","state_url":"https://pith.science/pith/H2DCKPZG67DOLFURQ5ZR47RDAE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H2DCKPZG67DOLFURQ5ZR47RDAE/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-27T18:06:45Z","links":{"resolver":"https://pith.science/pith/H2DCKPZG67DOLFURQ5ZR47RDAE","bundle":"https://pith.science/pith/H2DCKPZG67DOLFURQ5ZR47RDAE/bundle.json","state":"https://pith.science/pith/H2DCKPZG67DOLFURQ5ZR47RDAE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H2DCKPZG67DOLFURQ5ZR47RDAE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:H2DCKPZG67DOLFURQ5ZR47RDAE","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":"5b93cb78534cefe7744ec2f7d43a33eba86a70fa96ebb03fd7aa171bbc9bc2a4","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-20T11:23:04Z","title_canon_sha256":"bfa5d368d420d6551fb9ac3685cbf64c33aa4fa55ca32a1c90ced07532f64e5c"},"schema_version":"1.0","source":{"id":"1712.07419","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.07419","created_at":"2026-05-18T00:05:39Z"},{"alias_kind":"arxiv_version","alias_value":"1712.07419v4","created_at":"2026-05-18T00:05:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07419","created_at":"2026-05-18T00:05:39Z"},{"alias_kind":"pith_short_12","alias_value":"H2DCKPZG67DO","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"H2DCKPZG67DOLFUR","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"H2DCKPZG","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:53db0d9745c2688225011b26adf13c9cccf773abaa95c1dde603dc2510be4f9d","target":"graph","created_at":"2026-05-18T00:05:39Z","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 network performance metric that captures the freshness of information at end-users. This paper studies the age of information from a scheduling perspective. To that end, we consider a wireless broadcast network where a base-station (BS) is updating many users on random information arrivals under a transmission capacity constraint. For the offline case when the arrival statistics are known to the BS, we develop a structural MDP scheduling algorithm and an index scheduling algorithm, leveraging Markov decision process (MDP) techniques and the Whittle's methodology for","authors_text":"Eytan Modiano, Lingjie Duan, 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":"2017-12-20T11:23:04Z","title":"Scheduling Algorithms for Minimizing Age of Information in Wireless Broadcast Networks with Random Arrivals: The No-Buffer Case"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07419","kind":"arxiv","version":4},"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:8c8eeee3e9715964e12cb064b11ad4aa75b324f21b838a74e13cc2801ae6f808","target":"record","created_at":"2026-05-18T00:05:39Z","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":"5b93cb78534cefe7744ec2f7d43a33eba86a70fa96ebb03fd7aa171bbc9bc2a4","cross_cats_sorted":["cs.IT","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-20T11:23:04Z","title_canon_sha256":"bfa5d368d420d6551fb9ac3685cbf64c33aa4fa55ca32a1c90ced07532f64e5c"},"schema_version":"1.0","source":{"id":"1712.07419","kind":"arxiv","version":4}},"canonical_sha256":"3e86253f26f7c6e5969187731e7e2301137e1775c156b4577885bf0f1f5533ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e86253f26f7c6e5969187731e7e2301137e1775c156b4577885bf0f1f5533ad","first_computed_at":"2026-05-18T00:05:39.495404Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:39.495404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YPqgmG0cFEwvLYCDay8xWoQKz42HDqjG+5SubYni/PatvC9hviOq5pAT3CG2LyKgAMwRNvR0gCkAKZlaFKNhCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:39.495787Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.07419","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c8eeee3e9715964e12cb064b11ad4aa75b324f21b838a74e13cc2801ae6f808","sha256:53db0d9745c2688225011b26adf13c9cccf773abaa95c1dde603dc2510be4f9d"],"state_sha256":"1fa13185e2294f71b7077039a9f32f8fa7de888efc7fd8f4856caf8e7a20bd6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ebB9ycnxRbsr076WRsQ6EFMNOb9z8CQknrf2SufjGSwELQCpiAyIVBFg2u+BqiUuZf8FXxG0iP0xOjDCNXl5DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:06:45.165767Z","bundle_sha256":"e752555f41f56ca600e324dd119713703141ca69a943ffa383cd69d88abeae11"}}