{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YWVS4J66PECJXJ3XMIHZJILRS2","short_pith_number":"pith:YWVS4J66","canonical_record":{"source":{"id":"1809.01711","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-05T19:57:39Z","cross_cats_sorted":[],"title_canon_sha256":"8b8afd1066ec77fc5c688bab86c5baa16aa7c038b722f7283f7222d0048cb90e","abstract_canon_sha256":"dbd12d93196a4869d9b979abdfdb057584bafe9f6e6731fd30b7aadc3ab510cd"},"schema_version":"1.0"},"canonical_sha256":"c5ab2e27de79049ba777620f94a17196a3ccf096aff2b982654f7e0f1efd509e","source":{"kind":"arxiv","id":"1809.01711","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.01711","created_at":"2026-05-18T00:06:22Z"},{"alias_kind":"arxiv_version","alias_value":"1809.01711v1","created_at":"2026-05-18T00:06:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01711","created_at":"2026-05-18T00:06:22Z"},{"alias_kind":"pith_short_12","alias_value":"YWVS4J66PECJ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YWVS4J66PECJXJ3X","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YWVS4J66","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YWVS4J66PECJXJ3XMIHZJILRS2","target":"record","payload":{"canonical_record":{"source":{"id":"1809.01711","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-05T19:57:39Z","cross_cats_sorted":[],"title_canon_sha256":"8b8afd1066ec77fc5c688bab86c5baa16aa7c038b722f7283f7222d0048cb90e","abstract_canon_sha256":"dbd12d93196a4869d9b979abdfdb057584bafe9f6e6731fd30b7aadc3ab510cd"},"schema_version":"1.0"},"canonical_sha256":"c5ab2e27de79049ba777620f94a17196a3ccf096aff2b982654f7e0f1efd509e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:22.104452Z","signature_b64":"YQW0O9P4QO8pMgu/+5nUvfYvu3kLNaQQmNEdNCY54PJllVygml6QeSmxV4Nzt+MitlCIhowIqVL78ZN6LGyYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5ab2e27de79049ba777620f94a17196a3ccf096aff2b982654f7e0f1efd509e","last_reissued_at":"2026-05-18T00:06:22.103835Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:22.103835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.01711","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-05-18T00:06:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"25yk3ktKLmRBA96O9DyuvbvpmreU9yfwyqcs2lp3PPiw53I5DJoceiUQ4BOmQu4jBKT+EDwc1jVlOluYbzjrBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:21:41.555116Z"},"content_sha256":"271f65864a7e77ae6c0106d9b12d3f4d429c8308f51035545d76996e8aed1e02","schema_version":"1.0","event_id":"sha256:271f65864a7e77ae6c0106d9b12d3f4d429c8308f51035545d76996e8aed1e02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YWVS4J66PECJXJ3XMIHZJILRS2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal On-Off Control for a Class of Discrete Event Systems with Real-Time Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dingde Jiang, Lei Miao, Lijian Xu","submitted_at":"2018-09-05T19:57:39Z","abstract_excerpt":"This paper studies an optimal ON-OFF control problem for a class of discrete event systems with real-time constraints. Our goal is to minimize the overall costs, including the operating cost and the wake-up cost, while still guaranteeing the deadline of each individual task. In particular, we consider the homogeneous case in which it takes the same amount of time to serve each task and each task needs to be served by d seconds upon arrival. The problem involves two subproblems: (i) finding the best time to wake up the system and (ii) finding the best time to let the system go to sleep. We stud"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01711","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"},"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-18T00:06:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3YjeyDHl1Nk2W9Aw5pD4wByWWosDVH1zdSLgHfN6cyNs2gNwDo2a/W/JjPQTCB4Qj+jmIdEAPdMvocuSbfZIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:21:41.555477Z"},"content_sha256":"6f0bf83e109dd41fe7d6b4c5a442b864269fe5de788d14d4a7e95a24af3223e4","schema_version":"1.0","event_id":"sha256:6f0bf83e109dd41fe7d6b4c5a442b864269fe5de788d14d4a7e95a24af3223e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YWVS4J66PECJXJ3XMIHZJILRS2/bundle.json","state_url":"https://pith.science/pith/YWVS4J66PECJXJ3XMIHZJILRS2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YWVS4J66PECJXJ3XMIHZJILRS2/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-03T01:21:41Z","links":{"resolver":"https://pith.science/pith/YWVS4J66PECJXJ3XMIHZJILRS2","bundle":"https://pith.science/pith/YWVS4J66PECJXJ3XMIHZJILRS2/bundle.json","state":"https://pith.science/pith/YWVS4J66PECJXJ3XMIHZJILRS2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YWVS4J66PECJXJ3XMIHZJILRS2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YWVS4J66PECJXJ3XMIHZJILRS2","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":"dbd12d93196a4869d9b979abdfdb057584bafe9f6e6731fd30b7aadc3ab510cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-05T19:57:39Z","title_canon_sha256":"8b8afd1066ec77fc5c688bab86c5baa16aa7c038b722f7283f7222d0048cb90e"},"schema_version":"1.0","source":{"id":"1809.01711","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.01711","created_at":"2026-05-18T00:06:22Z"},{"alias_kind":"arxiv_version","alias_value":"1809.01711v1","created_at":"2026-05-18T00:06:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.01711","created_at":"2026-05-18T00:06:22Z"},{"alias_kind":"pith_short_12","alias_value":"YWVS4J66PECJ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YWVS4J66PECJXJ3X","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YWVS4J66","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:6f0bf83e109dd41fe7d6b4c5a442b864269fe5de788d14d4a7e95a24af3223e4","target":"graph","created_at":"2026-05-18T00:06:22Z","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":"This paper studies an optimal ON-OFF control problem for a class of discrete event systems with real-time constraints. Our goal is to minimize the overall costs, including the operating cost and the wake-up cost, while still guaranteeing the deadline of each individual task. In particular, we consider the homogeneous case in which it takes the same amount of time to serve each task and each task needs to be served by d seconds upon arrival. The problem involves two subproblems: (i) finding the best time to wake up the system and (ii) finding the best time to let the system go to sleep. We stud","authors_text":"Dingde Jiang, Lei Miao, Lijian Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-05T19:57:39Z","title":"Optimal On-Off Control for a Class of Discrete Event Systems with Real-Time Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.01711","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:271f65864a7e77ae6c0106d9b12d3f4d429c8308f51035545d76996e8aed1e02","target":"record","created_at":"2026-05-18T00:06:22Z","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":"dbd12d93196a4869d9b979abdfdb057584bafe9f6e6731fd30b7aadc3ab510cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-05T19:57:39Z","title_canon_sha256":"8b8afd1066ec77fc5c688bab86c5baa16aa7c038b722f7283f7222d0048cb90e"},"schema_version":"1.0","source":{"id":"1809.01711","kind":"arxiv","version":1}},"canonical_sha256":"c5ab2e27de79049ba777620f94a17196a3ccf096aff2b982654f7e0f1efd509e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5ab2e27de79049ba777620f94a17196a3ccf096aff2b982654f7e0f1efd509e","first_computed_at":"2026-05-18T00:06:22.103835Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:22.103835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YQW0O9P4QO8pMgu/+5nUvfYvu3kLNaQQmNEdNCY54PJllVygml6QeSmxV4Nzt+MitlCIhowIqVL78ZN6LGyYCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:22.104452Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.01711","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:271f65864a7e77ae6c0106d9b12d3f4d429c8308f51035545d76996e8aed1e02","sha256:6f0bf83e109dd41fe7d6b4c5a442b864269fe5de788d14d4a7e95a24af3223e4"],"state_sha256":"46cb153b84c01321e0ba4302c782d03f5197e0f24f01513b7520ab33a3080ed3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mQbPqzbXYTTTNK7vVHu2tzyL8i/C7GDRNk+2LY9BxRrEkBUUoZvDx0rE6dTZIox6jvvR4sTHJgc/w5H98ZC3Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:21:41.557630Z","bundle_sha256":"1be5e4cb838adb0166d70f02ff8adf557a4cbb404da2c02a9a0d7a3e94a2cd04"}}