{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:PBBYPNFIRWLL2P4YR2XQHCBWRD","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":"0a13139f269655846173fd8be82620c370985a63868c7de07197c6aad3b3f752","cross_cats_sorted":["cs.NI","eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-07-06T05:29:36Z","title_canon_sha256":"f8381081c1f6eb6be335ad7243b4e576145e05a0a859cf5efb4ae5b658cd3de7"},"schema_version":"1.0","source":{"id":"2007.02531","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.02531","created_at":"2026-07-05T02:18:16Z"},{"alias_kind":"arxiv_version","alias_value":"2007.02531v2","created_at":"2026-07-05T02:18:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.02531","created_at":"2026-07-05T02:18:16Z"},{"alias_kind":"pith_short_12","alias_value":"PBBYPNFIRWLL","created_at":"2026-07-05T02:18:16Z"},{"alias_kind":"pith_short_16","alias_value":"PBBYPNFIRWLL2P4Y","created_at":"2026-07-05T02:18:16Z"},{"alias_kind":"pith_short_8","alias_value":"PBBYPNFI","created_at":"2026-07-05T02:18:16Z"}],"graph_snapshots":[{"event_id":"sha256:ad09492e3e6d3109d90c90d740ed20a4ef7afc6627ab06ceb654ae2aa29bb9ee","target":"graph","created_at":"2026-07-05T02:18:16Z","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/2007.02531/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we investigate the age minimization problem for a two-hop relay system, under a resource constraint on the average number of forwarding operations at the relay. We first design an optimal policy by modelling the considered scheduling problem as a constrained Markov decision process (CMDP) problem. Based on the observed multi-threshold structure of the optimal policy, we then devise a low-complexity double threshold relaying (DTR) policy with only two thresholds, one for relay's AoI and the other one for the age gain between destination and relay. We derive approximate closed-for","authors_text":"Branka Vucetic, He Chen, Qian Wang, Yifan Gu, Yonghui Li","cross_cats":["cs.NI","eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-07-06T05:29:36Z","title":"Optimizing Information Freshness in Two-Hop Status Update Systems under a Resource Constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.02531","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:b995c1ec80e0cd2724fd06869c47bcd02b4c6577aa73f70b480e178a3b772baf","target":"record","created_at":"2026-07-05T02:18:16Z","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":"0a13139f269655846173fd8be82620c370985a63868c7de07197c6aad3b3f752","cross_cats_sorted":["cs.NI","eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-07-06T05:29:36Z","title_canon_sha256":"f8381081c1f6eb6be335ad7243b4e576145e05a0a859cf5efb4ae5b658cd3de7"},"schema_version":"1.0","source":{"id":"2007.02531","kind":"arxiv","version":2}},"canonical_sha256":"784387b4a88d96bd3f988eaf03883688e9d2c645751293a00e49813f639531b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"784387b4a88d96bd3f988eaf03883688e9d2c645751293a00e49813f639531b4","first_computed_at":"2026-07-05T02:18:16.437506Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:18:16.437506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zxF7z0aJLj7KFN7cC6348a//R4FPxBtx+RuJWdn6pJo0OsNTXSiAOC94TmYSzlA5o8JZMt+s2Qf63PobixA2CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:18:16.437908Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.02531","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b995c1ec80e0cd2724fd06869c47bcd02b4c6577aa73f70b480e178a3b772baf","sha256:ad09492e3e6d3109d90c90d740ed20a4ef7afc6627ab06ceb654ae2aa29bb9ee"],"state_sha256":"55bf404917fe916cd347d0c6753217d59901551a8fe4c8034ff50ebd42294235"}