{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:3HPY62BGDCFOQGYNXZFTNY6KX4","short_pith_number":"pith:3HPY62BG","canonical_record":{"source":{"id":"2201.03502","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-01-10T17:58:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"644e5a3e95a78de9789fea023bd8c402d5ae39fe44947c3743408323a05538f5","abstract_canon_sha256":"0af56a8d14776d47b959bbac5000ee8a3d256169f62fa1b822de952636421796"},"schema_version":"1.0"},"canonical_sha256":"d9df8f6826188ae81b0dbe4b36e3cabf19a60ac9c77abdecfd14213a5d248928","source":{"kind":"arxiv","id":"2201.03502","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.03502","created_at":"2026-07-05T03:47:30Z"},{"alias_kind":"arxiv_version","alias_value":"2201.03502v2","created_at":"2026-07-05T03:47:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.03502","created_at":"2026-07-05T03:47:30Z"},{"alias_kind":"pith_short_12","alias_value":"3HPY62BGDCFO","created_at":"2026-07-05T03:47:30Z"},{"alias_kind":"pith_short_16","alias_value":"3HPY62BGDCFOQGYN","created_at":"2026-07-05T03:47:30Z"},{"alias_kind":"pith_short_8","alias_value":"3HPY62BG","created_at":"2026-07-05T03:47:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:3HPY62BGDCFOQGYNXZFTNY6KX4","target":"record","payload":{"canonical_record":{"source":{"id":"2201.03502","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-01-10T17:58:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"644e5a3e95a78de9789fea023bd8c402d5ae39fe44947c3743408323a05538f5","abstract_canon_sha256":"0af56a8d14776d47b959bbac5000ee8a3d256169f62fa1b822de952636421796"},"schema_version":"1.0"},"canonical_sha256":"d9df8f6826188ae81b0dbe4b36e3cabf19a60ac9c77abdecfd14213a5d248928","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:47:30.753744Z","signature_b64":"LnkCmkqjIbbZGBxgnHIrYPEV8AjJIMWNMHyZQXGCsO0+KW/8CCQyzXU793KYCt372G/RJt89EM9UP8U7f7SICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9df8f6826188ae81b0dbe4b36e3cabf19a60ac9c77abdecfd14213a5d248928","last_reissued_at":"2026-07-05T03:47:30.753257Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:47:30.753257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2201.03502","source_version":2,"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-05T03:47:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x2T3dpG+ZOg7MzeuCbIHxDnZewBtROwXV8XVhaSPChi57VyN6/2Rzz1jXZOhNDvjfsMLgqwu6lu8xNZntdX4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T04:01:04.243607Z"},"content_sha256":"19b6a1ee1a2459da1bf134867e7e35729477e7ed848254a2e3067e3882cb55db","schema_version":"1.0","event_id":"sha256:19b6a1ee1a2459da1bf134867e7e35729477e7ed848254a2e3067e3882cb55db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:3HPY62BGDCFOQGYNXZFTNY6KX4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"3-Competitive Policy for Minimizing Age of Information in Multi-Source M/G/1 Queuing Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kumar Saurav","submitted_at":"2022-01-10T17:58:51Z","abstract_excerpt":"We consider a multi-source network with a common monitor, where fresh updates are generated at each source, following a Poisson process. At any time, at most one source can transmit its update to the monitor, and transmission time for updates of each source follows some general distribution. The goal is to find a causal scheduling policy such that at any time, the latest update available at each source is fresh. In this paper, we quantify freshness using the age of information (AoI) metric, and propose a randomized policy, which we show is 3-competitive with respect to Pareto-optimal policies "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.03502","kind":"arxiv","version":2},"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/2201.03502/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-05T03:47:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"50g2AD9trOj9diYGDZBGoFTLwf7CIBp+li/4Mlz2on+kTjzB43s+BobOw+AkprD/lIyiF74e1rLZP6g7vu1tCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T04:01:04.244134Z"},"content_sha256":"fbf6b6f5805d310a3256ed9c80e628b8658a026972d8b41c704b19b85d1f0388","schema_version":"1.0","event_id":"sha256:fbf6b6f5805d310a3256ed9c80e628b8658a026972d8b41c704b19b85d1f0388"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3HPY62BGDCFOQGYNXZFTNY6KX4/bundle.json","state_url":"https://pith.science/pith/3HPY62BGDCFOQGYNXZFTNY6KX4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3HPY62BGDCFOQGYNXZFTNY6KX4/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-08-12T04:01:04Z","links":{"resolver":"https://pith.science/pith/3HPY62BGDCFOQGYNXZFTNY6KX4","bundle":"https://pith.science/pith/3HPY62BGDCFOQGYNXZFTNY6KX4/bundle.json","state":"https://pith.science/pith/3HPY62BGDCFOQGYNXZFTNY6KX4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3HPY62BGDCFOQGYNXZFTNY6KX4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:3HPY62BGDCFOQGYNXZFTNY6KX4","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":"0af56a8d14776d47b959bbac5000ee8a3d256169f62fa1b822de952636421796","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-01-10T17:58:51Z","title_canon_sha256":"644e5a3e95a78de9789fea023bd8c402d5ae39fe44947c3743408323a05538f5"},"schema_version":"1.0","source":{"id":"2201.03502","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.03502","created_at":"2026-07-05T03:47:30Z"},{"alias_kind":"arxiv_version","alias_value":"2201.03502v2","created_at":"2026-07-05T03:47:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.03502","created_at":"2026-07-05T03:47:30Z"},{"alias_kind":"pith_short_12","alias_value":"3HPY62BGDCFO","created_at":"2026-07-05T03:47:30Z"},{"alias_kind":"pith_short_16","alias_value":"3HPY62BGDCFOQGYN","created_at":"2026-07-05T03:47:30Z"},{"alias_kind":"pith_short_8","alias_value":"3HPY62BG","created_at":"2026-07-05T03:47:30Z"}],"graph_snapshots":[{"event_id":"sha256:fbf6b6f5805d310a3256ed9c80e628b8658a026972d8b41c704b19b85d1f0388","target":"graph","created_at":"2026-07-05T03:47:30Z","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/2201.03502/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider a multi-source network with a common monitor, where fresh updates are generated at each source, following a Poisson process. At any time, at most one source can transmit its update to the monitor, and transmission time for updates of each source follows some general distribution. The goal is to find a causal scheduling policy such that at any time, the latest update available at each source is fresh. In this paper, we quantify freshness using the age of information (AoI) metric, and propose a randomized policy, which we show is 3-competitive with respect to Pareto-optimal policies ","authors_text":"Kumar Saurav","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-01-10T17:58:51Z","title":"3-Competitive Policy for Minimizing Age of Information in Multi-Source M/G/1 Queuing Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.03502","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:19b6a1ee1a2459da1bf134867e7e35729477e7ed848254a2e3067e3882cb55db","target":"record","created_at":"2026-07-05T03:47:30Z","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":"0af56a8d14776d47b959bbac5000ee8a3d256169f62fa1b822de952636421796","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2022-01-10T17:58:51Z","title_canon_sha256":"644e5a3e95a78de9789fea023bd8c402d5ae39fe44947c3743408323a05538f5"},"schema_version":"1.0","source":{"id":"2201.03502","kind":"arxiv","version":2}},"canonical_sha256":"d9df8f6826188ae81b0dbe4b36e3cabf19a60ac9c77abdecfd14213a5d248928","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9df8f6826188ae81b0dbe4b36e3cabf19a60ac9c77abdecfd14213a5d248928","first_computed_at":"2026-07-05T03:47:30.753257Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:47:30.753257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LnkCmkqjIbbZGBxgnHIrYPEV8AjJIMWNMHyZQXGCsO0+KW/8CCQyzXU793KYCt372G/RJt89EM9UP8U7f7SICA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:47:30.753744Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.03502","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19b6a1ee1a2459da1bf134867e7e35729477e7ed848254a2e3067e3882cb55db","sha256:fbf6b6f5805d310a3256ed9c80e628b8658a026972d8b41c704b19b85d1f0388"],"state_sha256":"06f26045aec9550db665dd30eda93b4145d7241551dca9a3db4b7d84759c7857"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X0BCEa4Edny63D+MFobSFeDo2Ej/Gszt6oJwRx4v/eCvK4Gj4qNLvzvy8gGqJZrJg6vTiPsnc2wInLN9jZMZBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T04:01:04.249818Z","bundle_sha256":"1d59968eb85ea7122fd1e2564ee6a6e517d8ac730c03cd28f8edb1629f259624"}}