{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:5JRODKJDBLC4JAESFUEMTN72JO","short_pith_number":"pith:5JRODKJD","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"},"canonical_sha256":"ea62e1a9230ac5c480922d08c9b7fa4ba7cbd926f55d2df109002546ca932e25","source":{"kind":"arxiv","id":"2203.05656","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.05656","created_at":"2026-07-05T05:31:13Z"},{"alias_kind":"arxiv_version","alias_value":"2203.05656v3","created_at":"2026-07-05T05:31:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.05656","created_at":"2026-07-05T05:31:13Z"},{"alias_kind":"pith_short_12","alias_value":"5JRODKJDBLC4","created_at":"2026-07-05T05:31:13Z"},{"alias_kind":"pith_short_16","alias_value":"5JRODKJDBLC4JAES","created_at":"2026-07-05T05:31:13Z"},{"alias_kind":"pith_short_8","alias_value":"5JRODKJD","created_at":"2026-07-05T05:31:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:5JRODKJDBLC4JAESFUEMTN72JO","target":"record","payload":{"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"},"canonical_sha256":"ea62e1a9230ac5c480922d08c9b7fa4ba7cbd926f55d2df109002546ca932e25","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"},"source_kind":"arxiv","source_id":"2203.05656","source_version":3,"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-07-05T05:31:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xQh4IfLVY0bSeX/AmWQHsrKugegmBzgh1f+T+uN7CUZxRs7oLp2RyOw1HnRKcWkfiEz1bYq2TryS/DjMPbnuCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T06:01:46.309932Z"},"content_sha256":"2459059e004d14894d79f7c1aefdc0b17cb1c0dbed3e65fb0458f33f7047c6e2","schema_version":"1.0","event_id":"sha256:2459059e004d14894d79f7c1aefdc0b17cb1c0dbed3e65fb0458f33f7047c6e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:5JRODKJDBLC4JAESFUEMTN72JO","target":"graph","payload":{"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"},"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-07-05T05:31:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dqJmzEW3c/0SUwKtJD7eWmPh1JCscu0oysIMbvjYW5XjoBHzKNeiKQci3svikLObBTgjcKTlMd3sKviXO8gRAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T06:01:46.310588Z"},"content_sha256":"ad163cd863d13f564d5e987118e44e03a7baa9519eddd643cedee707ef6aebac","schema_version":"1.0","event_id":"sha256:ad163cd863d13f564d5e987118e44e03a7baa9519eddd643cedee707ef6aebac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5JRODKJDBLC4JAESFUEMTN72JO/bundle.json","state_url":"https://pith.science/pith/5JRODKJDBLC4JAESFUEMTN72JO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5JRODKJDBLC4JAESFUEMTN72JO/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-07-09T06:01:46Z","links":{"resolver":"https://pith.science/pith/5JRODKJDBLC4JAESFUEMTN72JO","bundle":"https://pith.science/pith/5JRODKJDBLC4JAESFUEMTN72JO/bundle.json","state":"https://pith.science/pith/5JRODKJDBLC4JAESFUEMTN72JO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5JRODKJDBLC4JAESFUEMTN72JO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:5JRODKJDBLC4JAESFUEMTN72JO","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":"4372a8069d7f62fce4e76b660c23bba4fdeb1f9ee1969257887e7fd5d52ad20b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2022-03-10T21:46:40Z","title_canon_sha256":"116d1bddf4b23a6fa3034a38944fd1705534cb6844f9e6cedf6857a320d4467c"},"schema_version":"1.0","source":{"id":"2203.05656","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.05656","created_at":"2026-07-05T05:31:13Z"},{"alias_kind":"arxiv_version","alias_value":"2203.05656v3","created_at":"2026-07-05T05:31:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.05656","created_at":"2026-07-05T05:31:13Z"},{"alias_kind":"pith_short_12","alias_value":"5JRODKJDBLC4","created_at":"2026-07-05T05:31:13Z"},{"alias_kind":"pith_short_16","alias_value":"5JRODKJDBLC4JAES","created_at":"2026-07-05T05:31:13Z"},{"alias_kind":"pith_short_8","alias_value":"5JRODKJD","created_at":"2026-07-05T05:31:13Z"}],"graph_snapshots":[{"event_id":"sha256:ad163cd863d13f564d5e987118e44e03a7baa9519eddd643cedee707ef6aebac","target":"graph","created_at":"2026-07-05T05:31:13Z","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/2203.05656/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Abolfazl Zakeri, Marian Codreanu, Markus Leinonen, Mohammad Moltafet","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2022-03-10T21:46:40Z","title":"Minimizing the AoI in Resource-Constrained Multi-Source Relaying Systems: Dynamic and Learning-based Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.05656","kind":"arxiv","version":3},"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:2459059e004d14894d79f7c1aefdc0b17cb1c0dbed3e65fb0458f33f7047c6e2","target":"record","created_at":"2026-07-05T05:31:13Z","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":"4372a8069d7f62fce4e76b660c23bba4fdeb1f9ee1969257887e7fd5d52ad20b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2022-03-10T21:46:40Z","title_canon_sha256":"116d1bddf4b23a6fa3034a38944fd1705534cb6844f9e6cedf6857a320d4467c"},"schema_version":"1.0","source":{"id":"2203.05656","kind":"arxiv","version":3}},"canonical_sha256":"ea62e1a9230ac5c480922d08c9b7fa4ba7cbd926f55d2df109002546ca932e25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea62e1a9230ac5c480922d08c9b7fa4ba7cbd926f55d2df109002546ca932e25","first_computed_at":"2026-07-05T05:31:13.347786Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:31:13.347786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V/LCMfDOAShGvVlhzDZ79NpSHXXrdndPuxq0kIBypDh5j61ChaBxhijph5v+KgFVV1w9QwkwdkWyumk/kM4iDw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:31:13.348325Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.05656","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2459059e004d14894d79f7c1aefdc0b17cb1c0dbed3e65fb0458f33f7047c6e2","sha256:ad163cd863d13f564d5e987118e44e03a7baa9519eddd643cedee707ef6aebac"],"state_sha256":"10935a23a2be70075273e54f94a735d6214a98ea7ed8fba051388395c1382888"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RbmmObU5rD5kTy4X4BCVfsHGLkNLXj+MiKYXa9RdbJMAG+lrpbldoeq84C3JFIUz08kfW0XpcF9jSTFdgaTiCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T06:01:46.313935Z","bundle_sha256":"d329d6bb2327837669ee0221b0ae42e50962516811355e440023ac03f763f46b"}}