{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RL5NPLUAOHIZQHSWAJWSX3UCDI","short_pith_number":"pith:RL5NPLUA","schema_version":"1.0","canonical_sha256":"8afad7ae8071d1981e56026d2bee821a09730d37f35f618e13a9d0ccdff64162","source":{"kind":"arxiv","id":"1905.10809","version":2},"attestation_state":"computed","paper":{"title":"Minimum Age TDMA Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Tung-Wei Kuo","submitted_at":"2019-05-26T14:52:44Z","abstract_excerpt":"We consider a transmission scheduling problem in which multiple systems receive update information through a shared Time Division Multiple Access (TDMA) channel. To provide timely delivery of update information, the problem asks for a schedule that minimizes the overall age of information. We call this problem the Min-Age problem. This problem is first studied by He \\textit{et al.} [IEEE Trans. Inform. Theory, 2018], who identified several special cases where the problem can be solved optimally in polynomial time. Our contribution is threefold. First, we introduce a new job scheduling problem "},"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.10809","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-26T14:52:44Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"100046fbfdfa1c3bcec4165d0967cb7a3baaf00a08864c295deed45c18d18da4","abstract_canon_sha256":"8ccef1245db828be10ca955ff2c5d51ada4c43340077a858184bb4ed2d5127b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:42.064215Z","signature_b64":"WI3Ls66z6ZBpI1jEd9/5MSS/JPUhpmFniTPECENT240+RNgXvA+k9b6rNgbdA+T3ZSu5Zli/dqvRpdbzl9tRAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8afad7ae8071d1981e56026d2bee821a09730d37f35f618e13a9d0ccdff64162","last_reissued_at":"2026-05-17T23:44:42.063761Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:42.063761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum Age TDMA Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DS","authors_text":"Tung-Wei Kuo","submitted_at":"2019-05-26T14:52:44Z","abstract_excerpt":"We consider a transmission scheduling problem in which multiple systems receive update information through a shared Time Division Multiple Access (TDMA) channel. To provide timely delivery of update information, the problem asks for a schedule that minimizes the overall age of information. We call this problem the Min-Age problem. This problem is first studied by He \\textit{et al.} [IEEE Trans. Inform. Theory, 2018], who identified several special cases where the problem can be solved optimally in polynomial time. Our contribution is threefold. First, we introduce a new job scheduling problem "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10809","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":""},"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.10809","created_at":"2026-05-17T23:44:42.063834+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.10809v2","created_at":"2026-05-17T23:44:42.063834+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10809","created_at":"2026-05-17T23:44:42.063834+00:00"},{"alias_kind":"pith_short_12","alias_value":"RL5NPLUAOHIZ","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"RL5NPLUAOHIZQHSW","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"RL5NPLUA","created_at":"2026-05-18T12:33:27.125529+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/RL5NPLUAOHIZQHSWAJWSX3UCDI","json":"https://pith.science/pith/RL5NPLUAOHIZQHSWAJWSX3UCDI.json","graph_json":"https://pith.science/api/pith-number/RL5NPLUAOHIZQHSWAJWSX3UCDI/graph.json","events_json":"https://pith.science/api/pith-number/RL5NPLUAOHIZQHSWAJWSX3UCDI/events.json","paper":"https://pith.science/paper/RL5NPLUA"},"agent_actions":{"view_html":"https://pith.science/pith/RL5NPLUAOHIZQHSWAJWSX3UCDI","download_json":"https://pith.science/pith/RL5NPLUAOHIZQHSWAJWSX3UCDI.json","view_paper":"https://pith.science/paper/RL5NPLUA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.10809&json=true","fetch_graph":"https://pith.science/api/pith-number/RL5NPLUAOHIZQHSWAJWSX3UCDI/graph.json","fetch_events":"https://pith.science/api/pith-number/RL5NPLUAOHIZQHSWAJWSX3UCDI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RL5NPLUAOHIZQHSWAJWSX3UCDI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RL5NPLUAOHIZQHSWAJWSX3UCDI/action/storage_attestation","attest_author":"https://pith.science/pith/RL5NPLUAOHIZQHSWAJWSX3UCDI/action/author_attestation","sign_citation":"https://pith.science/pith/RL5NPLUAOHIZQHSWAJWSX3UCDI/action/citation_signature","submit_replication":"https://pith.science/pith/RL5NPLUAOHIZQHSWAJWSX3UCDI/action/replication_record"}},"created_at":"2026-05-17T23:44:42.063834+00:00","updated_at":"2026-05-17T23:44:42.063834+00:00"}