{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WZYS3IS7M2BJWQ4QTCGICD2F4F","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":"2dc848aa9eb599f90ddc54521cb4ac3cc90e4a4d2157d14207846f7fa9804fad","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-04T12:50:01Z","title_canon_sha256":"f785810848f2d746bcd5b889814c1afc0893883182f9d0b76f7ed425fe3bfbec"},"schema_version":"1.0","source":{"id":"1908.01334","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.01334","created_at":"2026-07-05T00:22:02Z"},{"alias_kind":"arxiv_version","alias_value":"1908.01334v6","created_at":"2026-07-05T00:22:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01334","created_at":"2026-07-05T00:22:02Z"},{"alias_kind":"pith_short_12","alias_value":"WZYS3IS7M2BJ","created_at":"2026-07-05T00:22:02Z"},{"alias_kind":"pith_short_16","alias_value":"WZYS3IS7M2BJWQ4Q","created_at":"2026-07-05T00:22:02Z"},{"alias_kind":"pith_short_8","alias_value":"WZYS3IS7","created_at":"2026-07-05T00:22:02Z"}],"graph_snapshots":[{"event_id":"sha256:58982719f25a2c644d4b5ffbea69143fd2e28651a1ff443a29e5dfc1e05d0d54","target":"graph","created_at":"2026-07-05T00:22:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.01334/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we study how to collect fresh data in time-varying networks with power constrained users. We measure data freshness from the perspective of the central controller by using the metric Age of Information, namely the time elapsed since the generation time-stamp of the freshest information. We wonder what is the minimum AoI performance the network can achieve and how to design scheduling algorithms to approach it. To answer these questions when scheduling decisions are restricted to bandwidth constraint, we first decouple the multi-user scheduling problem into a single user constrai","authors_text":"Haoyue Tang, Jian Song, Jintao Wang, Linqi Song","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-04T12:50:01Z","title":"Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01334","kind":"arxiv","version":6},"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:562bc0f93202c10889db48331cfaf6304e211c783b1d046716a5d86de75adc51","target":"record","created_at":"2026-07-05T00:22:02Z","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":"2dc848aa9eb599f90ddc54521cb4ac3cc90e4a4d2157d14207846f7fa9804fad","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-04T12:50:01Z","title_canon_sha256":"f785810848f2d746bcd5b889814c1afc0893883182f9d0b76f7ed425fe3bfbec"},"schema_version":"1.0","source":{"id":"1908.01334","kind":"arxiv","version":6}},"canonical_sha256":"b6712da25f66829b4390988c810f45e1642147a6dddec697cf98cc15185428ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6712da25f66829b4390988c810f45e1642147a6dddec697cf98cc15185428ac","first_computed_at":"2026-07-05T00:22:02.460746Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:22:02.460746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J+V8gxPlMerSQ283awrtIR1FsPJquoe/Ka6hzpbcXc7rIVKGiUfefUEE5Vv6yxFdVtHZkoA3TJ5ebSCGI5umBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:22:02.461201Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.01334","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:562bc0f93202c10889db48331cfaf6304e211c783b1d046716a5d86de75adc51","sha256:58982719f25a2c644d4b5ffbea69143fd2e28651a1ff443a29e5dfc1e05d0d54"],"state_sha256":"224f64e5c409fd2a2f59b0580635dbff42a5e094f6ffbc02d27b3edfd7af1403"}