{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RUO2D45JMANGV5BS3QPBNMGJWW","short_pith_number":"pith:RUO2D45J","canonical_record":{"source":{"id":"1602.01560","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-04T05:24:01Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"9b8cc8addbbf3cfcbfc61587ebfd7f69bfe5bea047e71ded7cbe2c1c1308b42e","abstract_canon_sha256":"7373c2e35384337b93731a96a984ac2dc6954331a437f6f98a2db7d68b11069f"},"schema_version":"1.0"},"canonical_sha256":"8d1da1f3a9601a6af432dc1e16b0c9b5b20a847979f2d034cc9127f54fd2f514","source":{"kind":"arxiv","id":"1602.01560","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01560","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01560v1","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01560","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"RUO2D45JMANG","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RUO2D45JMANGV5BS","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RUO2D45J","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RUO2D45JMANGV5BS3QPBNMGJWW","target":"record","payload":{"canonical_record":{"source":{"id":"1602.01560","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-04T05:24:01Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"9b8cc8addbbf3cfcbfc61587ebfd7f69bfe5bea047e71ded7cbe2c1c1308b42e","abstract_canon_sha256":"7373c2e35384337b93731a96a984ac2dc6954331a437f6f98a2db7d68b11069f"},"schema_version":"1.0"},"canonical_sha256":"8d1da1f3a9601a6af432dc1e16b0c9b5b20a847979f2d034cc9127f54fd2f514","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:18.642266Z","signature_b64":"XkB62mBzkE6Th6/ORu3lqB8AaeNhK1WH9tDEvTJIs1rS5J+Ti/uN0pgYaf/ST7xpEImwzFdNe4ICEf0XU57gBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d1da1f3a9601a6af432dc1e16b0c9b5b20a847979f2d034cc9127f54fd2f514","last_reissued_at":"2026-05-18T01:21:18.641815Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:18.641815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.01560","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-18T01:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FOPqq+T9UqwjCvDt/mPZdWsscZlZzDd55Lq40rlnBNaGGTd161/OW/aER1ayp7t40Vvo1XJRQngJlkbdYt4OBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:31:23.339930Z"},"content_sha256":"e53001a589f8f9fb65e12512db43ff4543da8623f63dd973b1dedbfdb0ddc77a","schema_version":"1.0","event_id":"sha256:e53001a589f8f9fb65e12512db43ff4543da8623f63dd973b1dedbfdb0ddc77a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RUO2D45JMANGV5BS3QPBNMGJWW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online energy efficient packet scheduling for a common deadline with and without energy harvesting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Aditya Deshmukh, Rahul Vaze","submitted_at":"2016-02-04T05:24:01Z","abstract_excerpt":"The problem of online packet scheduling to minimize the required conventional grid energy for transmitting a fixed number of packets given a common deadline is considered. The total number of packets arriving within the deadline is known, but the packet arrival times are unknown, and can be arbitrary. The proposed algorithm tries to finish the transmission of each packet assuming all future packets are going to arrive at equal time intervals within the left-over time. The proposed online algorithm is shown to have competitive ratio that is logarithmic in the number of packet arrivals. The hybr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01560","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-18T01:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VrMEuT8dmKi0iynjRGB05jBr1IXXI8VkqZzBORj60GnahZ5wXbjYefVpbx/1iPhAroEl16CXbfjKaHVW3WQsBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:31:23.340297Z"},"content_sha256":"41c84bafccc9a33100cb5d5ca80e546c54877cc5db4ec14fc06c46d19fe809dd","schema_version":"1.0","event_id":"sha256:41c84bafccc9a33100cb5d5ca80e546c54877cc5db4ec14fc06c46d19fe809dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RUO2D45JMANGV5BS3QPBNMGJWW/bundle.json","state_url":"https://pith.science/pith/RUO2D45JMANGV5BS3QPBNMGJWW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RUO2D45JMANGV5BS3QPBNMGJWW/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-26T01:31:23Z","links":{"resolver":"https://pith.science/pith/RUO2D45JMANGV5BS3QPBNMGJWW","bundle":"https://pith.science/pith/RUO2D45JMANGV5BS3QPBNMGJWW/bundle.json","state":"https://pith.science/pith/RUO2D45JMANGV5BS3QPBNMGJWW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RUO2D45JMANGV5BS3QPBNMGJWW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RUO2D45JMANGV5BS3QPBNMGJWW","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":"7373c2e35384337b93731a96a984ac2dc6954331a437f6f98a2db7d68b11069f","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-04T05:24:01Z","title_canon_sha256":"9b8cc8addbbf3cfcbfc61587ebfd7f69bfe5bea047e71ded7cbe2c1c1308b42e"},"schema_version":"1.0","source":{"id":"1602.01560","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01560","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01560v1","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01560","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"RUO2D45JMANG","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RUO2D45JMANGV5BS","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RUO2D45J","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:41c84bafccc9a33100cb5d5ca80e546c54877cc5db4ec14fc06c46d19fe809dd","target":"graph","created_at":"2026-05-18T01:21:18Z","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":"The problem of online packet scheduling to minimize the required conventional grid energy for transmitting a fixed number of packets given a common deadline is considered. The total number of packets arriving within the deadline is known, but the packet arrival times are unknown, and can be arbitrary. The proposed algorithm tries to finish the transmission of each packet assuming all future packets are going to arrive at equal time intervals within the left-over time. The proposed online algorithm is shown to have competitive ratio that is logarithmic in the number of packet arrivals. The hybr","authors_text":"Aditya Deshmukh, Rahul Vaze","cross_cats":["cs.DS","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-04T05:24:01Z","title":"Online energy efficient packet scheduling for a common deadline with and without energy harvesting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01560","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:e53001a589f8f9fb65e12512db43ff4543da8623f63dd973b1dedbfdb0ddc77a","target":"record","created_at":"2026-05-18T01:21:18Z","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":"7373c2e35384337b93731a96a984ac2dc6954331a437f6f98a2db7d68b11069f","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-02-04T05:24:01Z","title_canon_sha256":"9b8cc8addbbf3cfcbfc61587ebfd7f69bfe5bea047e71ded7cbe2c1c1308b42e"},"schema_version":"1.0","source":{"id":"1602.01560","kind":"arxiv","version":1}},"canonical_sha256":"8d1da1f3a9601a6af432dc1e16b0c9b5b20a847979f2d034cc9127f54fd2f514","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d1da1f3a9601a6af432dc1e16b0c9b5b20a847979f2d034cc9127f54fd2f514","first_computed_at":"2026-05-18T01:21:18.641815Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:18.641815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XkB62mBzkE6Th6/ORu3lqB8AaeNhK1WH9tDEvTJIs1rS5J+Ti/uN0pgYaf/ST7xpEImwzFdNe4ICEf0XU57gBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:18.642266Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.01560","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e53001a589f8f9fb65e12512db43ff4543da8623f63dd973b1dedbfdb0ddc77a","sha256:41c84bafccc9a33100cb5d5ca80e546c54877cc5db4ec14fc06c46d19fe809dd"],"state_sha256":"6fdbeb9c1a76da75a9bb4f456252421fe024294ea93b053c60eb3ed16583865f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RWI03wNwOTSWsCDxEp4Je0dVxwflDbRpRu5DyROs9Nr9BG2IYhTtbBaV3SgMavsGqCMLNOXVCfXdwSYRk5XbDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T01:31:23.342320Z","bundle_sha256":"fef90e3ed946c43d7691bdeaf95f76e68ba5a5680697c3816218ad7d8699bb15"}}