{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WVI3IJM4ZGEA46XEZDSCTETLEK","short_pith_number":"pith:WVI3IJM4","canonical_record":{"source":{"id":"1801.01803","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-01-05T15:53:28Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"de4588ee17aae3afbb7ae58c617bde6a3e39b306cca60d7625b963387a471d7d","abstract_canon_sha256":"637d43be2da9c3af92da47a26f331f34f7289e89e6a4bdbdad2db49b39dee616"},"schema_version":"1.0"},"canonical_sha256":"b551b4259cc9880e7ae4c8e429926b229c52f03e5e2ed1d62c1cc9688a1247a7","source":{"kind":"arxiv","id":"1801.01803","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.01803","created_at":"2026-05-18T00:26:40Z"},{"alias_kind":"arxiv_version","alias_value":"1801.01803v1","created_at":"2026-05-18T00:26:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01803","created_at":"2026-05-18T00:26:40Z"},{"alias_kind":"pith_short_12","alias_value":"WVI3IJM4ZGEA","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WVI3IJM4ZGEA46XE","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WVI3IJM4","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WVI3IJM4ZGEA46XEZDSCTETLEK","target":"record","payload":{"canonical_record":{"source":{"id":"1801.01803","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-01-05T15:53:28Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"de4588ee17aae3afbb7ae58c617bde6a3e39b306cca60d7625b963387a471d7d","abstract_canon_sha256":"637d43be2da9c3af92da47a26f331f34f7289e89e6a4bdbdad2db49b39dee616"},"schema_version":"1.0"},"canonical_sha256":"b551b4259cc9880e7ae4c8e429926b229c52f03e5e2ed1d62c1cc9688a1247a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:40.937058Z","signature_b64":"6uTloPuODXVBGjXIgUgwh7MSswVhAw1rW8gUNL3Gda9vyEO1NZasqcunTUrYJU7tJan0a4ypKU6uInU/zuEEBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b551b4259cc9880e7ae4c8e429926b229c52f03e5e2ed1d62c1cc9688a1247a7","last_reissued_at":"2026-05-18T00:26:40.936489Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:40.936489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.01803","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:26:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zq4cYQquFMtr99PrJuT6jB33ZDNQCg17791LZTp/nNc5kdM1bwOK9FwSXyycGp/Wou1WatdJnoQjIKlRZFq7Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:45:24.075928Z"},"content_sha256":"b489155d952ad94d4782525e0474c5c0a701c08b3042411c000ec0a5cd3ba0f0","schema_version":"1.0","event_id":"sha256:b489155d952ad94d4782525e0474c5c0a701c08b3042411c000ec0a5cd3ba0f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WVI3IJM4ZGEA46XEZDSCTETLEK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Abhishek Sinha, Elif Uysal-Biyikoglu, Eytan Modiano, Igor Kadota, Rahul Singh","submitted_at":"2018-01-05T15:53:28Z","abstract_excerpt":"We consider a wireless broadcast network with a base station sending time-sensitive information to a number of clients through unreliable channels. The Age of Information (AoI), namely the amount of time that elapsed since the most recently delivered packet was generated, captures the freshness of the information. We formulate a discrete-time decision problem to find a transmission scheduling policy that minimizes the expected weighted sum AoI of the clients in the network.\n  We first show that in symmetric networks a Greedy policy, which transmits the packet with highest current age, is optim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01803","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:26:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n4wi9FJL1NUElo88U/2HUptQurKFUDWVpCMJBMcTHgOUq32ezdpHBz+SCJjS12L8jkllcik1etcrfYMnUu6cBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:45:24.076651Z"},"content_sha256":"7bd61447bfbe1ae7f8411390806008581aa8a46e6b5f831911d405fc72dc7a8b","schema_version":"1.0","event_id":"sha256:7bd61447bfbe1ae7f8411390806008581aa8a46e6b5f831911d405fc72dc7a8b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WVI3IJM4ZGEA46XEZDSCTETLEK/bundle.json","state_url":"https://pith.science/pith/WVI3IJM4ZGEA46XEZDSCTETLEK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WVI3IJM4ZGEA46XEZDSCTETLEK/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-08T16:45:24Z","links":{"resolver":"https://pith.science/pith/WVI3IJM4ZGEA46XEZDSCTETLEK","bundle":"https://pith.science/pith/WVI3IJM4ZGEA46XEZDSCTETLEK/bundle.json","state":"https://pith.science/pith/WVI3IJM4ZGEA46XEZDSCTETLEK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WVI3IJM4ZGEA46XEZDSCTETLEK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WVI3IJM4ZGEA46XEZDSCTETLEK","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":"637d43be2da9c3af92da47a26f331f34f7289e89e6a4bdbdad2db49b39dee616","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-01-05T15:53:28Z","title_canon_sha256":"de4588ee17aae3afbb7ae58c617bde6a3e39b306cca60d7625b963387a471d7d"},"schema_version":"1.0","source":{"id":"1801.01803","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.01803","created_at":"2026-05-18T00:26:40Z"},{"alias_kind":"arxiv_version","alias_value":"1801.01803v1","created_at":"2026-05-18T00:26:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01803","created_at":"2026-05-18T00:26:40Z"},{"alias_kind":"pith_short_12","alias_value":"WVI3IJM4ZGEA","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WVI3IJM4ZGEA46XE","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WVI3IJM4","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:7bd61447bfbe1ae7f8411390806008581aa8a46e6b5f831911d405fc72dc7a8b","target":"graph","created_at":"2026-05-18T00:26:40Z","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 a wireless broadcast network with a base station sending time-sensitive information to a number of clients through unreliable channels. The Age of Information (AoI), namely the amount of time that elapsed since the most recently delivered packet was generated, captures the freshness of the information. We formulate a discrete-time decision problem to find a transmission scheduling policy that minimizes the expected weighted sum AoI of the clients in the network.\n  We first show that in symmetric networks a Greedy policy, which transmits the packet with highest current age, is optim","authors_text":"Abhishek Sinha, Elif Uysal-Biyikoglu, Eytan Modiano, Igor Kadota, Rahul Singh","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-01-05T15:53:28Z","title":"Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01803","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:b489155d952ad94d4782525e0474c5c0a701c08b3042411c000ec0a5cd3ba0f0","target":"record","created_at":"2026-05-18T00:26:40Z","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":"637d43be2da9c3af92da47a26f331f34f7289e89e6a4bdbdad2db49b39dee616","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-01-05T15:53:28Z","title_canon_sha256":"de4588ee17aae3afbb7ae58c617bde6a3e39b306cca60d7625b963387a471d7d"},"schema_version":"1.0","source":{"id":"1801.01803","kind":"arxiv","version":1}},"canonical_sha256":"b551b4259cc9880e7ae4c8e429926b229c52f03e5e2ed1d62c1cc9688a1247a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b551b4259cc9880e7ae4c8e429926b229c52f03e5e2ed1d62c1cc9688a1247a7","first_computed_at":"2026-05-18T00:26:40.936489Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:40.936489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6uTloPuODXVBGjXIgUgwh7MSswVhAw1rW8gUNL3Gda9vyEO1NZasqcunTUrYJU7tJan0a4ypKU6uInU/zuEEBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:40.937058Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.01803","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b489155d952ad94d4782525e0474c5c0a701c08b3042411c000ec0a5cd3ba0f0","sha256:7bd61447bfbe1ae7f8411390806008581aa8a46e6b5f831911d405fc72dc7a8b"],"state_sha256":"caf2c26e1c1de49f6de4afef8a6b6a3a6d250b3c0bcffc23454044db2d4ced07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YBnsZ03JTqWnFLCK4UV4nTEUylBWHqd47WgtUxBhpg5UaP2oL/EoIPoWE/fYNkCjaUDKmWtn/IsIO/6VoOyiAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T16:45:24.079715Z","bundle_sha256":"b9d7fe539a04e36fb1cbbce9c153337a56ec33224794f0fbc4821034b916680d"}}