{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MASKUIHRQVWPPQTYOQQPT6GWS4","short_pith_number":"pith:MASKUIHR","schema_version":"1.0","canonical_sha256":"6024aa20f1856cf7c2787420f9f8d6970f3e0690bad0e25663242591f2758d4f","source":{"kind":"arxiv","id":"1905.13743","version":1},"attestation_state":"computed","paper":{"title":"Age of Information in G/G/1/1 Systems: Age Expressions, Bounds, Special Cases, and Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Alkan Soysal, Sennur Ulukus","submitted_at":"2019-05-31T17:54:30Z","abstract_excerpt":"We consider the age of information in G/G/1/1 systems under two service discipline models. In the first model, if a new update arrives when the service is busy, it is blocked; in the second model, a new update preempts the current update in service. For the blocking model, we first derive an exact age expression, then we propose two simple to calculate upper bounds for the average age. The first upper bound assumes the interarrival times to have log-concave distribution. The second upper bound assumes both the interarrivals and service times to have log-concave distribution. Both upper bounds "},"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":"1905.13743","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-31T17:54:30Z","cross_cats_sorted":["cs.NI","eess.SP","math.IT"],"title_canon_sha256":"a400d39f7fbc600c8d1f8050240d53865ecc591be295d8c6d62224ed30a6175b","abstract_canon_sha256":"2b0a5a75d372ac99c7b32f39ebd2164fa88e3e0cfe9f8237bc53ebff4d4dd857"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:34.071475Z","signature_b64":"0LhgDBrJVMykK8u4l2rttWs2aGXcAOXTDMPusUt1RGMmsNzye+VtMgxrIUZvkXhcgNtM1lne2VsHhzR4QKYuDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6024aa20f1856cf7c2787420f9f8d6970f3e0690bad0e25663242591f2758d4f","last_reissued_at":"2026-05-17T23:44:34.070761Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:34.070761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Age of Information in G/G/1/1 Systems: Age Expressions, Bounds, Special Cases, and Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Alkan Soysal, Sennur Ulukus","submitted_at":"2019-05-31T17:54:30Z","abstract_excerpt":"We consider the age of information in G/G/1/1 systems under two service discipline models. In the first model, if a new update arrives when the service is busy, it is blocked; in the second model, a new update preempts the current update in service. For the blocking model, we first derive an exact age expression, then we propose two simple to calculate upper bounds for the average age. The first upper bound assumes the interarrival times to have log-concave distribution. The second upper bound assumes both the interarrivals and service times to have log-concave distribution. Both upper bounds "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13743","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":""},"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":"1905.13743","created_at":"2026-05-17T23:44:34.070853+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.13743v1","created_at":"2026-05-17T23:44:34.070853+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13743","created_at":"2026-05-17T23:44:34.070853+00:00"},{"alias_kind":"pith_short_12","alias_value":"MASKUIHRQVWP","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"MASKUIHRQVWPPQTY","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"MASKUIHR","created_at":"2026-05-18T12:33:21.387695+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.05408","citing_title":"Timely Cloud Computing: Preemption and Waiting","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MASKUIHRQVWPPQTYOQQPT6GWS4","json":"https://pith.science/pith/MASKUIHRQVWPPQTYOQQPT6GWS4.json","graph_json":"https://pith.science/api/pith-number/MASKUIHRQVWPPQTYOQQPT6GWS4/graph.json","events_json":"https://pith.science/api/pith-number/MASKUIHRQVWPPQTYOQQPT6GWS4/events.json","paper":"https://pith.science/paper/MASKUIHR"},"agent_actions":{"view_html":"https://pith.science/pith/MASKUIHRQVWPPQTYOQQPT6GWS4","download_json":"https://pith.science/pith/MASKUIHRQVWPPQTYOQQPT6GWS4.json","view_paper":"https://pith.science/paper/MASKUIHR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.13743&json=true","fetch_graph":"https://pith.science/api/pith-number/MASKUIHRQVWPPQTYOQQPT6GWS4/graph.json","fetch_events":"https://pith.science/api/pith-number/MASKUIHRQVWPPQTYOQQPT6GWS4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MASKUIHRQVWPPQTYOQQPT6GWS4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MASKUIHRQVWPPQTYOQQPT6GWS4/action/storage_attestation","attest_author":"https://pith.science/pith/MASKUIHRQVWPPQTYOQQPT6GWS4/action/author_attestation","sign_citation":"https://pith.science/pith/MASKUIHRQVWPPQTYOQQPT6GWS4/action/citation_signature","submit_replication":"https://pith.science/pith/MASKUIHRQVWPPQTYOQQPT6GWS4/action/replication_record"}},"created_at":"2026-05-17T23:44:34.070853+00:00","updated_at":"2026-05-17T23:44:34.070853+00:00"}