{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:2KX5DFDLR6JPKDWADPFRLEKGGZ","short_pith_number":"pith:2KX5DFDL","canonical_record":{"source":{"id":"2310.14257","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-10-22T10:46:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d4c353e283a914aa94684153eb485c4865657dff865be93d3bb052566f1ff9e3","abstract_canon_sha256":"79f8f85d6dbb563d9c27684c74ef93e5589d4b79173b444921993a11cf6e4a23"},"schema_version":"1.0"},"canonical_sha256":"d2afd1946b8f92f50ec01bcb159146367707c1889361a20584877ec7fc9b6df9","source":{"kind":"arxiv","id":"2310.14257","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.14257","created_at":"2026-07-05T07:03:41Z"},{"alias_kind":"arxiv_version","alias_value":"2310.14257v1","created_at":"2026-07-05T07:03:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.14257","created_at":"2026-07-05T07:03:41Z"},{"alias_kind":"pith_short_12","alias_value":"2KX5DFDLR6JP","created_at":"2026-07-05T07:03:41Z"},{"alias_kind":"pith_short_16","alias_value":"2KX5DFDLR6JPKDWA","created_at":"2026-07-05T07:03:41Z"},{"alias_kind":"pith_short_8","alias_value":"2KX5DFDL","created_at":"2026-07-05T07:03:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:2KX5DFDLR6JPKDWADPFRLEKGGZ","target":"record","payload":{"canonical_record":{"source":{"id":"2310.14257","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-10-22T10:46:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d4c353e283a914aa94684153eb485c4865657dff865be93d3bb052566f1ff9e3","abstract_canon_sha256":"79f8f85d6dbb563d9c27684c74ef93e5589d4b79173b444921993a11cf6e4a23"},"schema_version":"1.0"},"canonical_sha256":"d2afd1946b8f92f50ec01bcb159146367707c1889361a20584877ec7fc9b6df9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:03:41.885629Z","signature_b64":"pW20Zc5qNg4lL8m/5TYoQzLqHSqEDDMcfHkkwy9f4/KgJ2Cpw7so9m/vRaFC0X3OK2HDorKk4/2ZkyOcvl2PDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2afd1946b8f92f50ec01bcb159146367707c1889361a20584877ec7fc9b6df9","last_reissued_at":"2026-07-05T07:03:41.885225Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:03:41.885225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2310.14257","source_version":1,"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-05T07:03:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ETEyUuNA8xt3nWfc6PiPdhfbKgi0Cca/OOp1wnJmW89vjbMxRwf59EJ8Bi0SCKm7qfp3j7SpS7s0cTmNzrQAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T09:28:58.345854Z"},"content_sha256":"148d97db6bb9f50b316185cfe932f246b6cf0ba2283b4ab4efa2af59257d25f9","schema_version":"1.0","event_id":"sha256:148d97db6bb9f50b316185cfe932f246b6cf0ba2283b4ab4efa2af59257d25f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:2KX5DFDLR6JPKDWADPFRLEKGGZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimizing Age of Information under Latency and Throughput Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ashok Kumar Reddy Chavva, Kumar Saurav","submitted_at":"2023-10-22T10:46:57Z","abstract_excerpt":"We consider a scheduling problem pertinent to a base station (BS) that serves heterogeneous users (UEs). We focus on a downlink model, with users that are either interested in large throughput, low latency (the time difference between the packet arrival at the BS, and reception at the UE), or low age-of-information (AoI, the difference between the current time and the arrival time of the latest packet at the BS that has been received at the UE). In each time step, the BS may serve a limited number of UEs. The objective is to find a scheduling algorithm that meets the individual service require"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.14257","kind":"arxiv","version":1},"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/2310.14257/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-05T07:03:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pVNjU70qfZjbo1Mud8sVcw5d+QvD4Mh9w5fcL39oSf9VgqPkVNHXtgC3TV8Al/AGSS5sx+pFZQNyzms7EP63DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T09:28:58.346685Z"},"content_sha256":"4785d28d6434a1d22a4b88b2e8e6b9a30d883b96ae606336532c67ebf5f32615","schema_version":"1.0","event_id":"sha256:4785d28d6434a1d22a4b88b2e8e6b9a30d883b96ae606336532c67ebf5f32615"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2KX5DFDLR6JPKDWADPFRLEKGGZ/bundle.json","state_url":"https://pith.science/pith/2KX5DFDLR6JPKDWADPFRLEKGGZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2KX5DFDLR6JPKDWADPFRLEKGGZ/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-12T09:28:58Z","links":{"resolver":"https://pith.science/pith/2KX5DFDLR6JPKDWADPFRLEKGGZ","bundle":"https://pith.science/pith/2KX5DFDLR6JPKDWADPFRLEKGGZ/bundle.json","state":"https://pith.science/pith/2KX5DFDLR6JPKDWADPFRLEKGGZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2KX5DFDLR6JPKDWADPFRLEKGGZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:2KX5DFDLR6JPKDWADPFRLEKGGZ","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":"79f8f85d6dbb563d9c27684c74ef93e5589d4b79173b444921993a11cf6e4a23","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-10-22T10:46:57Z","title_canon_sha256":"d4c353e283a914aa94684153eb485c4865657dff865be93d3bb052566f1ff9e3"},"schema_version":"1.0","source":{"id":"2310.14257","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.14257","created_at":"2026-07-05T07:03:41Z"},{"alias_kind":"arxiv_version","alias_value":"2310.14257v1","created_at":"2026-07-05T07:03:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.14257","created_at":"2026-07-05T07:03:41Z"},{"alias_kind":"pith_short_12","alias_value":"2KX5DFDLR6JP","created_at":"2026-07-05T07:03:41Z"},{"alias_kind":"pith_short_16","alias_value":"2KX5DFDLR6JPKDWA","created_at":"2026-07-05T07:03:41Z"},{"alias_kind":"pith_short_8","alias_value":"2KX5DFDL","created_at":"2026-07-05T07:03:41Z"}],"graph_snapshots":[{"event_id":"sha256:4785d28d6434a1d22a4b88b2e8e6b9a30d883b96ae606336532c67ebf5f32615","target":"graph","created_at":"2026-07-05T07:03:41Z","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/2310.14257/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider a scheduling problem pertinent to a base station (BS) that serves heterogeneous users (UEs). We focus on a downlink model, with users that are either interested in large throughput, low latency (the time difference between the packet arrival at the BS, and reception at the UE), or low age-of-information (AoI, the difference between the current time and the arrival time of the latest packet at the BS that has been received at the UE). In each time step, the BS may serve a limited number of UEs. The objective is to find a scheduling algorithm that meets the individual service require","authors_text":"Ashok Kumar Reddy Chavva, Kumar Saurav","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-10-22T10:46:57Z","title":"Minimizing Age of Information under Latency and Throughput Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.14257","kind":"arxiv","version":1},"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:148d97db6bb9f50b316185cfe932f246b6cf0ba2283b4ab4efa2af59257d25f9","target":"record","created_at":"2026-07-05T07:03:41Z","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":"79f8f85d6dbb563d9c27684c74ef93e5589d4b79173b444921993a11cf6e4a23","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-10-22T10:46:57Z","title_canon_sha256":"d4c353e283a914aa94684153eb485c4865657dff865be93d3bb052566f1ff9e3"},"schema_version":"1.0","source":{"id":"2310.14257","kind":"arxiv","version":1}},"canonical_sha256":"d2afd1946b8f92f50ec01bcb159146367707c1889361a20584877ec7fc9b6df9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2afd1946b8f92f50ec01bcb159146367707c1889361a20584877ec7fc9b6df9","first_computed_at":"2026-07-05T07:03:41.885225Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:03:41.885225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pW20Zc5qNg4lL8m/5TYoQzLqHSqEDDMcfHkkwy9f4/KgJ2Cpw7so9m/vRaFC0X3OK2HDorKk4/2ZkyOcvl2PDg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:03:41.885629Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.14257","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:148d97db6bb9f50b316185cfe932f246b6cf0ba2283b4ab4efa2af59257d25f9","sha256:4785d28d6434a1d22a4b88b2e8e6b9a30d883b96ae606336532c67ebf5f32615"],"state_sha256":"0398605e38c557eb19c10b50d9dd15519639059ad837ca00b78722118470066f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/NkdaO6MzOmWt81pGJI4quIy17KtFN72uH3GgyRf8NJogbaOyztS76UvjpBw5jd7V5HoewfK7Maw0pf1ofaZCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T09:28:58.352676Z","bundle_sha256":"acb34d346da4c7a825a35e38a5fdbb8d5337e0403cad0f43e7b4cc75fe160647"}}