{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KXEQMJ5OLJFJSJYSJK5GFOJSBN","short_pith_number":"pith:KXEQMJ5O","canonical_record":{"source":{"id":"1704.02659","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-04-09T20:53:10Z","cross_cats_sorted":[],"title_canon_sha256":"82faafba883d2ede606f00044c4dbfcc5c2e03bbe32f4e09cc3a9d106b1837e3","abstract_canon_sha256":"338794c76987785daf5fdadaf4f93ed7c38506f52d9a2cf69e7a5516411d6053"},"schema_version":"1.0"},"canonical_sha256":"55c90627ae5a4a9927124aba62b9320b438139c1c46242cde94b09ea9980d608","source":{"kind":"arxiv","id":"1704.02659","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02659","created_at":"2026-05-17T23:42:59Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02659v2","created_at":"2026-05-17T23:42:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02659","created_at":"2026-05-17T23:42:59Z"},{"alias_kind":"pith_short_12","alias_value":"KXEQMJ5OLJFJ","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KXEQMJ5OLJFJSJYS","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KXEQMJ5O","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KXEQMJ5OLJFJSJYSJK5GFOJSBN","target":"record","payload":{"canonical_record":{"source":{"id":"1704.02659","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-04-09T20:53:10Z","cross_cats_sorted":[],"title_canon_sha256":"82faafba883d2ede606f00044c4dbfcc5c2e03bbe32f4e09cc3a9d106b1837e3","abstract_canon_sha256":"338794c76987785daf5fdadaf4f93ed7c38506f52d9a2cf69e7a5516411d6053"},"schema_version":"1.0"},"canonical_sha256":"55c90627ae5a4a9927124aba62b9320b438139c1c46242cde94b09ea9980d608","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:59.198290Z","signature_b64":"LofhwBeeubpCubjqNrE3P0C+E0++92pFZHiAvNcNGx86w3zARuPHHMHr2tBN3bvyH8Q9S/L5o8WE1CnnPaGyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55c90627ae5a4a9927124aba62b9320b438139c1c46242cde94b09ea9980d608","last_reissued_at":"2026-05-17T23:42:59.197923Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:59.197923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.02659","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:42:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FKRfrdc5Na+G17ITQLY2PdwqEhWQoczrByE74nNWVWy6lbdqyhgMQSaVaD8k5dVOLyzCBDwLHfdXEQGSJoEXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T07:31:37.534203Z"},"content_sha256":"541d019d8865f8b248fb2dd543aa93f172d94c9bd93a86674b1508d3dfbeba17","schema_version":"1.0","event_id":"sha256:541d019d8865f8b248fb2dd543aa93f172d94c9bd93a86674b1508d3dfbeba17"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KXEQMJ5OLJFJSJYSJK5GFOJSBN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight Bounds on Online Checkpointing Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Achiya Bar-On, Adi Shamir, Eyal Ronen, Itai Dinur, Nathan Keller, Orr Dunkelman, Rani Hod","submitted_at":"2017-04-09T20:53:10Z","abstract_excerpt":"The problem of online checkpointing is a classical problem with numerous applications which had been studied in various forms for almost 50 years. In the simplest version of this problem, a user has to maintain $k$ memorized checkpoints during a long computation, where the only allowed operation is to move one of the checkpoints from its old time to the current time, and his goal is to keep the checkpoints as evenly spread out as possible at all times.\n  Bringmann et al. studied this problem as a special case of an online/offline optimization problem in which the deviation from uniformity is m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02659","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:42:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0RASPt/Nf8u9OFUQNQqa/a6lG6skXFsS1qktzfnPRNsNFWRQhZE0z0GhchT4iyiMqTO/O2eohKPDw19nJ34MAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T07:31:37.534571Z"},"content_sha256":"6c589c6ddf1b9a570039126736ff778898505c69f6939d8eaae4649e94356068","schema_version":"1.0","event_id":"sha256:6c589c6ddf1b9a570039126736ff778898505c69f6939d8eaae4649e94356068"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KXEQMJ5OLJFJSJYSJK5GFOJSBN/bundle.json","state_url":"https://pith.science/pith/KXEQMJ5OLJFJSJYSJK5GFOJSBN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KXEQMJ5OLJFJSJYSJK5GFOJSBN/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-25T07:31:37Z","links":{"resolver":"https://pith.science/pith/KXEQMJ5OLJFJSJYSJK5GFOJSBN","bundle":"https://pith.science/pith/KXEQMJ5OLJFJSJYSJK5GFOJSBN/bundle.json","state":"https://pith.science/pith/KXEQMJ5OLJFJSJYSJK5GFOJSBN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KXEQMJ5OLJFJSJYSJK5GFOJSBN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KXEQMJ5OLJFJSJYSJK5GFOJSBN","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":"338794c76987785daf5fdadaf4f93ed7c38506f52d9a2cf69e7a5516411d6053","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-04-09T20:53:10Z","title_canon_sha256":"82faafba883d2ede606f00044c4dbfcc5c2e03bbe32f4e09cc3a9d106b1837e3"},"schema_version":"1.0","source":{"id":"1704.02659","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02659","created_at":"2026-05-17T23:42:59Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02659v2","created_at":"2026-05-17T23:42:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02659","created_at":"2026-05-17T23:42:59Z"},{"alias_kind":"pith_short_12","alias_value":"KXEQMJ5OLJFJ","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KXEQMJ5OLJFJSJYS","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KXEQMJ5O","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:6c589c6ddf1b9a570039126736ff778898505c69f6939d8eaae4649e94356068","target":"graph","created_at":"2026-05-17T23:42:59Z","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 checkpointing is a classical problem with numerous applications which had been studied in various forms for almost 50 years. In the simplest version of this problem, a user has to maintain $k$ memorized checkpoints during a long computation, where the only allowed operation is to move one of the checkpoints from its old time to the current time, and his goal is to keep the checkpoints as evenly spread out as possible at all times.\n  Bringmann et al. studied this problem as a special case of an online/offline optimization problem in which the deviation from uniformity is m","authors_text":"Achiya Bar-On, Adi Shamir, Eyal Ronen, Itai Dinur, Nathan Keller, Orr Dunkelman, Rani Hod","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-04-09T20:53:10Z","title":"Tight Bounds on Online Checkpointing Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02659","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:541d019d8865f8b248fb2dd543aa93f172d94c9bd93a86674b1508d3dfbeba17","target":"record","created_at":"2026-05-17T23:42:59Z","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":"338794c76987785daf5fdadaf4f93ed7c38506f52d9a2cf69e7a5516411d6053","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-04-09T20:53:10Z","title_canon_sha256":"82faafba883d2ede606f00044c4dbfcc5c2e03bbe32f4e09cc3a9d106b1837e3"},"schema_version":"1.0","source":{"id":"1704.02659","kind":"arxiv","version":2}},"canonical_sha256":"55c90627ae5a4a9927124aba62b9320b438139c1c46242cde94b09ea9980d608","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55c90627ae5a4a9927124aba62b9320b438139c1c46242cde94b09ea9980d608","first_computed_at":"2026-05-17T23:42:59.197923Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:59.197923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LofhwBeeubpCubjqNrE3P0C+E0++92pFZHiAvNcNGx86w3zARuPHHMHr2tBN3bvyH8Q9S/L5o8WE1CnnPaGyBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:59.198290Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.02659","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:541d019d8865f8b248fb2dd543aa93f172d94c9bd93a86674b1508d3dfbeba17","sha256:6c589c6ddf1b9a570039126736ff778898505c69f6939d8eaae4649e94356068"],"state_sha256":"9d05081edee46947f3769d7ac7c96a60611d9887c316567a3d8b925b8c2151c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zc/WbO5DsBJmbA4/YgBe2ozqLHvP19PRV5GAztiOhoAnG3bXKYIRr72L3fpAgZKL1vSA5g0SX3hlczooWK0QCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T07:31:37.536573Z","bundle_sha256":"74284f50fb6c161570ee3077d76cf26de485dc2cfd8c937ad2130ea3b6a2b3c6"}}