{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RL5NPLUAOHIZQHSWAJWSX3UCDI","short_pith_number":"pith:RL5NPLUA","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"},"canonical_sha256":"8afad7ae8071d1981e56026d2bee821a09730d37f35f618e13a9d0ccdff64162","source":{"kind":"arxiv","id":"1905.10809","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10809","created_at":"2026-05-17T23:44:42Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10809v2","created_at":"2026-05-17T23:44:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10809","created_at":"2026-05-17T23:44:42Z"},{"alias_kind":"pith_short_12","alias_value":"RL5NPLUAOHIZ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RL5NPLUAOHIZQHSW","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RL5NPLUA","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RL5NPLUAOHIZQHSWAJWSX3UCDI","target":"record","payload":{"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"},"canonical_sha256":"8afad7ae8071d1981e56026d2bee821a09730d37f35f618e13a9d0ccdff64162","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"},"source_kind":"arxiv","source_id":"1905.10809","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-05-17T23:44:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A/730r425YA0JY0SVJyIv2paUOg2ZjEOeA2svek62JS0bmJvtD2JdT+3XMHUUhL0gdUBtLTiv7ts3G7iKrDkCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T09:08:42.742223Z"},"content_sha256":"f65f4934ecb02634befb3e0d4254522b9df59a2acc98648da3cd7a3d33278b7a","schema_version":"1.0","event_id":"sha256:f65f4934ecb02634befb3e0d4254522b9df59a2acc98648da3cd7a3d33278b7a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RL5NPLUAOHIZQHSWAJWSX3UCDI","target":"graph","payload":{"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"},"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-05-17T23:44:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xLIsovhL0tD2vIkMmoDVQ4upqA8SoPTmFAQZJDRcrpMDA4KyEGrBjTtOvBPjgk3EYN73ddHVfrWs+y/dA5g2DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T09:08:42.742593Z"},"content_sha256":"c786f8213a2c94cc32bea10a753b2c96dd945da7b5495b1859bb2a90abf1aa8f","schema_version":"1.0","event_id":"sha256:c786f8213a2c94cc32bea10a753b2c96dd945da7b5495b1859bb2a90abf1aa8f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RL5NPLUAOHIZQHSWAJWSX3UCDI/bundle.json","state_url":"https://pith.science/pith/RL5NPLUAOHIZQHSWAJWSX3UCDI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RL5NPLUAOHIZQHSWAJWSX3UCDI/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-06-24T09:08:42Z","links":{"resolver":"https://pith.science/pith/RL5NPLUAOHIZQHSWAJWSX3UCDI","bundle":"https://pith.science/pith/RL5NPLUAOHIZQHSWAJWSX3UCDI/bundle.json","state":"https://pith.science/pith/RL5NPLUAOHIZQHSWAJWSX3UCDI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RL5NPLUAOHIZQHSWAJWSX3UCDI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RL5NPLUAOHIZQHSWAJWSX3UCDI","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":"8ccef1245db828be10ca955ff2c5d51ada4c43340077a858184bb4ed2d5127b8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-26T14:52:44Z","title_canon_sha256":"100046fbfdfa1c3bcec4165d0967cb7a3baaf00a08864c295deed45c18d18da4"},"schema_version":"1.0","source":{"id":"1905.10809","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10809","created_at":"2026-05-17T23:44:42Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10809v2","created_at":"2026-05-17T23:44:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10809","created_at":"2026-05-17T23:44:42Z"},{"alias_kind":"pith_short_12","alias_value":"RL5NPLUAOHIZ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RL5NPLUAOHIZQHSW","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RL5NPLUA","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:c786f8213a2c94cc32bea10a753b2c96dd945da7b5495b1859bb2a90abf1aa8f","target":"graph","created_at":"2026-05-17T23:44:42Z","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"},"paper":{"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 ","authors_text":"Tung-Wei Kuo","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-26T14:52:44Z","title":"Minimum Age TDMA Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10809","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:f65f4934ecb02634befb3e0d4254522b9df59a2acc98648da3cd7a3d33278b7a","target":"record","created_at":"2026-05-17T23:44:42Z","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":"8ccef1245db828be10ca955ff2c5d51ada4c43340077a858184bb4ed2d5127b8","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-26T14:52:44Z","title_canon_sha256":"100046fbfdfa1c3bcec4165d0967cb7a3baaf00a08864c295deed45c18d18da4"},"schema_version":"1.0","source":{"id":"1905.10809","kind":"arxiv","version":2}},"canonical_sha256":"8afad7ae8071d1981e56026d2bee821a09730d37f35f618e13a9d0ccdff64162","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8afad7ae8071d1981e56026d2bee821a09730d37f35f618e13a9d0ccdff64162","first_computed_at":"2026-05-17T23:44:42.063761Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:42.063761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WI3Ls66z6ZBpI1jEd9/5MSS/JPUhpmFniTPECENT240+RNgXvA+k9b6rNgbdA+T3ZSu5Zli/dqvRpdbzl9tRAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:42.064215Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.10809","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f65f4934ecb02634befb3e0d4254522b9df59a2acc98648da3cd7a3d33278b7a","sha256:c786f8213a2c94cc32bea10a753b2c96dd945da7b5495b1859bb2a90abf1aa8f"],"state_sha256":"289205fcb350f882d0b527a12d60a5da289b3ceb5d1fac95e70681634ca749e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y2u3z5yOlGLc2r05+MIuU4Qq2yg649gc223q3F6eXVZy+QDcz0i81ZXiSKh0aUmZwnag405+NS2q1zh+DAu4Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T09:08:42.744494Z","bundle_sha256":"fae9e78a6dbf315e83c55055808a979270b688420e3119042798f58b1939e7ba"}}