{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:5JRODKJDBLC4JAESFUEMTN72JO","short_pith_number":"pith:5JRODKJD","schema_version":"1.0","canonical_sha256":"ea62e1a9230ac5c480922d08c9b7fa4ba7cbd926f55d2df109002546ca932e25","source":{"kind":"arxiv","id":"2203.05656","version":3},"attestation_state":"computed","paper":{"title":"Minimizing the AoI in Resource-Constrained Multi-Source Relaying Systems: Dynamic and Learning-based Scheduling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Abolfazl Zakeri, Marian Codreanu, Markus Leinonen, Mohammad Moltafet","submitted_at":"2022-03-10T21:46:40Z","abstract_excerpt":"We consider a multi-source relaying system where independent sources randomly generate status update packets which are sent to the destination with the aid of a relay through unreliable links. We develop transmission scheduling policies to minimize the weighted sum average age of information (AoI) subject to transmission capacity and long-run average resource constraints. We formulate a stochastic control optimization problem and solve it using a constrained Markov decision process (CMDP) approach and a drift-plus-penalty method. The CMDP problem is solved by transforming it into an MDP proble"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2203.05656","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2022-03-10T21:46:40Z","cross_cats_sorted":[],"title_canon_sha256":"116d1bddf4b23a6fa3034a38944fd1705534cb6844f9e6cedf6857a320d4467c","abstract_canon_sha256":"4372a8069d7f62fce4e76b660c23bba4fdeb1f9ee1969257887e7fd5d52ad20b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:31:13.348325Z","signature_b64":"V/LCMfDOAShGvVlhzDZ79NpSHXXrdndPuxq0kIBypDh5j61ChaBxhijph5v+KgFVV1w9QwkwdkWyumk/kM4iDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea62e1a9230ac5c480922d08c9b7fa4ba7cbd926f55d2df109002546ca932e25","last_reissued_at":"2026-07-05T05:31:13.347786Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:31:13.347786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimizing the AoI in Resource-Constrained Multi-Source Relaying Systems: Dynamic and Learning-based Scheduling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Abolfazl Zakeri, Marian Codreanu, Markus Leinonen, Mohammad Moltafet","submitted_at":"2022-03-10T21:46:40Z","abstract_excerpt":"We consider a multi-source relaying system where independent sources randomly generate status update packets which are sent to the destination with the aid of a relay through unreliable links. We develop transmission scheduling policies to minimize the weighted sum average age of information (AoI) subject to transmission capacity and long-run average resource constraints. We formulate a stochastic control optimization problem and solve it using a constrained Markov decision process (CMDP) approach and a drift-plus-penalty method. The CMDP problem is solved by transforming it into an MDP proble"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.05656","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2203.05656/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2203.05656","created_at":"2026-07-05T05:31:13.347851+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.05656v3","created_at":"2026-07-05T05:31:13.347851+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.05656","created_at":"2026-07-05T05:31:13.347851+00:00"},{"alias_kind":"pith_short_12","alias_value":"5JRODKJDBLC4","created_at":"2026-07-05T05:31:13.347851+00:00"},{"alias_kind":"pith_short_16","alias_value":"5JRODKJDBLC4JAES","created_at":"2026-07-05T05:31:13.347851+00:00"},{"alias_kind":"pith_short_8","alias_value":"5JRODKJD","created_at":"2026-07-05T05:31:13.347851+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5JRODKJDBLC4JAESFUEMTN72JO","json":"https://pith.science/pith/5JRODKJDBLC4JAESFUEMTN72JO.json","graph_json":"https://pith.science/api/pith-number/5JRODKJDBLC4JAESFUEMTN72JO/graph.json","events_json":"https://pith.science/api/pith-number/5JRODKJDBLC4JAESFUEMTN72JO/events.json","paper":"https://pith.science/paper/5JRODKJD"},"agent_actions":{"view_html":"https://pith.science/pith/5JRODKJDBLC4JAESFUEMTN72JO","download_json":"https://pith.science/pith/5JRODKJDBLC4JAESFUEMTN72JO.json","view_paper":"https://pith.science/paper/5JRODKJD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.05656&json=true","fetch_graph":"https://pith.science/api/pith-number/5JRODKJDBLC4JAESFUEMTN72JO/graph.json","fetch_events":"https://pith.science/api/pith-number/5JRODKJDBLC4JAESFUEMTN72JO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5JRODKJDBLC4JAESFUEMTN72JO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5JRODKJDBLC4JAESFUEMTN72JO/action/storage_attestation","attest_author":"https://pith.science/pith/5JRODKJDBLC4JAESFUEMTN72JO/action/author_attestation","sign_citation":"https://pith.science/pith/5JRODKJDBLC4JAESFUEMTN72JO/action/citation_signature","submit_replication":"https://pith.science/pith/5JRODKJDBLC4JAESFUEMTN72JO/action/replication_record"}},"created_at":"2026-07-05T05:31:13.347851+00:00","updated_at":"2026-07-05T05:31:13.347851+00:00"}