{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WHLQ46YLPHUCAU3EN6MMIBUN7Q","short_pith_number":"pith:WHLQ46YL","canonical_record":{"source":{"id":"1704.08835","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-28T08:04:06Z","cross_cats_sorted":[],"title_canon_sha256":"6ba750810f5aaf53b3caf6c2650f37032d3b7f8f7e3594e3b35769354ba70a84","abstract_canon_sha256":"303501ac73b52995c1d03165fc0e3a1fdb3ead6880c746c8da2f582132703bb1"},"schema_version":"1.0"},"canonical_sha256":"b1d70e7b0b79e82053646f98c4068dfc19497f879c46bf5439ea7d1c5befb492","source":{"kind":"arxiv","id":"1704.08835","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08835","created_at":"2026-05-18T00:45:25Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08835v1","created_at":"2026-05-18T00:45:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08835","created_at":"2026-05-18T00:45:25Z"},{"alias_kind":"pith_short_12","alias_value":"WHLQ46YLPHUC","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WHLQ46YLPHUCAU3E","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WHLQ46YL","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WHLQ46YLPHUCAU3EN6MMIBUN7Q","target":"record","payload":{"canonical_record":{"source":{"id":"1704.08835","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-28T08:04:06Z","cross_cats_sorted":[],"title_canon_sha256":"6ba750810f5aaf53b3caf6c2650f37032d3b7f8f7e3594e3b35769354ba70a84","abstract_canon_sha256":"303501ac73b52995c1d03165fc0e3a1fdb3ead6880c746c8da2f582132703bb1"},"schema_version":"1.0"},"canonical_sha256":"b1d70e7b0b79e82053646f98c4068dfc19497f879c46bf5439ea7d1c5befb492","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:25.163437Z","signature_b64":"oeonOVNS4TllOkosd4RAr9WTKcJO+O+gKS43/xl05hARkaYnp3LT3R0y9NTFs//l5K8tcgX/Rca2p7q3/1WOAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1d70e7b0b79e82053646f98c4068dfc19497f879c46bf5439ea7d1c5befb492","last_reissued_at":"2026-05-18T00:45:25.162911Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:25.162911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.08835","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:45:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ywT8fTAgGZLDfsgGBzjQj9ZDu61Qaj1iyoVvWHt8hc80OTIvWsqkbzDHM+vQgIA5Is2NQLBTcIbRKLmjlUWxDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:55:24.169817Z"},"content_sha256":"08830213f9a8da4be535f02f7d0aef776a16e65f66e4d63e8f2cda6d28979cfe","schema_version":"1.0","event_id":"sha256:08830213f9a8da4be535f02f7d0aef776a16e65f66e4d63e8f2cda6d28979cfe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WHLQ46YLPHUCAU3EN6MMIBUN7Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relaxing the Irrevocability Requirement for Online Graph Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Joan Boyar, Kim S. Larsen, Lene M. Favrholdt, Michal Kotrb\\v{c}\\'ik","submitted_at":"2017-04-28T08:04:06Z","abstract_excerpt":"Online graph problems are considered in models where the irrevocability requirement is relaxed. Motivated by practical examples where, for example, there is a cost associated with building a facility and no extra cost associated with doing it later, we consider the Late Accept model, where a request can be accepted at a later point, but any acceptance is irrevocable. Similarly, we also consider a Late Reject model, where an accepted request can later be rejected, but any rejection is irrevocable (this is sometimes called preemption). Finally, we consider the Late Accept/Reject model, where lat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08835","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:45:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7qUt3KMtvo+CtRBGmDiguPGFZVp/aZT7nd/+Zg/Cw9d6GH5M/NGyLU8L7BmKtNNtt2hD9hJB2dz7F1W5+i/RAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:55:24.170162Z"},"content_sha256":"bb1916bf3579ef47091ab7aa8d4ce206ea08ebd68a7faf11b7be00be7924b229","schema_version":"1.0","event_id":"sha256:bb1916bf3579ef47091ab7aa8d4ce206ea08ebd68a7faf11b7be00be7924b229"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WHLQ46YLPHUCAU3EN6MMIBUN7Q/bundle.json","state_url":"https://pith.science/pith/WHLQ46YLPHUCAU3EN6MMIBUN7Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WHLQ46YLPHUCAU3EN6MMIBUN7Q/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-20T08:55:24Z","links":{"resolver":"https://pith.science/pith/WHLQ46YLPHUCAU3EN6MMIBUN7Q","bundle":"https://pith.science/pith/WHLQ46YLPHUCAU3EN6MMIBUN7Q/bundle.json","state":"https://pith.science/pith/WHLQ46YLPHUCAU3EN6MMIBUN7Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WHLQ46YLPHUCAU3EN6MMIBUN7Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WHLQ46YLPHUCAU3EN6MMIBUN7Q","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":"303501ac73b52995c1d03165fc0e3a1fdb3ead6880c746c8da2f582132703bb1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-28T08:04:06Z","title_canon_sha256":"6ba750810f5aaf53b3caf6c2650f37032d3b7f8f7e3594e3b35769354ba70a84"},"schema_version":"1.0","source":{"id":"1704.08835","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.08835","created_at":"2026-05-18T00:45:25Z"},{"alias_kind":"arxiv_version","alias_value":"1704.08835v1","created_at":"2026-05-18T00:45:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08835","created_at":"2026-05-18T00:45:25Z"},{"alias_kind":"pith_short_12","alias_value":"WHLQ46YLPHUC","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WHLQ46YLPHUCAU3E","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WHLQ46YL","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:bb1916bf3579ef47091ab7aa8d4ce206ea08ebd68a7faf11b7be00be7924b229","target":"graph","created_at":"2026-05-18T00:45:25Z","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":"Online graph problems are considered in models where the irrevocability requirement is relaxed. Motivated by practical examples where, for example, there is a cost associated with building a facility and no extra cost associated with doing it later, we consider the Late Accept model, where a request can be accepted at a later point, but any acceptance is irrevocable. Similarly, we also consider a Late Reject model, where an accepted request can later be rejected, but any rejection is irrevocable (this is sometimes called preemption). Finally, we consider the Late Accept/Reject model, where lat","authors_text":"Joan Boyar, Kim S. Larsen, Lene M. Favrholdt, Michal Kotrb\\v{c}\\'ik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-28T08:04:06Z","title":"Relaxing the Irrevocability Requirement for Online Graph Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08835","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:08830213f9a8da4be535f02f7d0aef776a16e65f66e4d63e8f2cda6d28979cfe","target":"record","created_at":"2026-05-18T00:45:25Z","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":"303501ac73b52995c1d03165fc0e3a1fdb3ead6880c746c8da2f582132703bb1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-28T08:04:06Z","title_canon_sha256":"6ba750810f5aaf53b3caf6c2650f37032d3b7f8f7e3594e3b35769354ba70a84"},"schema_version":"1.0","source":{"id":"1704.08835","kind":"arxiv","version":1}},"canonical_sha256":"b1d70e7b0b79e82053646f98c4068dfc19497f879c46bf5439ea7d1c5befb492","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1d70e7b0b79e82053646f98c4068dfc19497f879c46bf5439ea7d1c5befb492","first_computed_at":"2026-05-18T00:45:25.162911Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:25.162911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oeonOVNS4TllOkosd4RAr9WTKcJO+O+gKS43/xl05hARkaYnp3LT3R0y9NTFs//l5K8tcgX/Rca2p7q3/1WOAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:25.163437Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.08835","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08830213f9a8da4be535f02f7d0aef776a16e65f66e4d63e8f2cda6d28979cfe","sha256:bb1916bf3579ef47091ab7aa8d4ce206ea08ebd68a7faf11b7be00be7924b229"],"state_sha256":"694007f4bdc018cdec7b81da989fa67dc3c7edb2b955fbe353a622ef84940243"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mOonpUZ9L6DRIklcx8zrlyI+phWa7h6gaYY6fQ3POf6thzhdD99/CoGLQndxxW2+Gk2XtbBLrWMhC9Fu5GloCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T08:55:24.172060Z","bundle_sha256":"3156a97cbf58cb214d4c9ea0fa46e8ecb40d3ecc37cabfd87490eeefcd93f880"}}