{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4DJNHJSSSBFGROOMVLOZMD6BNL","short_pith_number":"pith:4DJNHJSS","canonical_record":{"source":{"id":"1905.07986","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-20T10:50:13Z","cross_cats_sorted":[],"title_canon_sha256":"7126e43796d2fdb3da7761c6c52355403ea0a5dfb1334673d99ced2dba0ad43f","abstract_canon_sha256":"a3599a09bab195d8d6aed9a43f845cbc4734809b8ab4efdd26b3d44632811901"},"schema_version":"1.0"},"canonical_sha256":"e0d2d3a652904a68b9ccaadd960fc16ac5327462ad9276501fb09d0a3127b0c3","source":{"kind":"arxiv","id":"1905.07986","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07986","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07986v1","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07986","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"pith_short_12","alias_value":"4DJNHJSSSBFG","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4DJNHJSSSBFGROOM","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4DJNHJSS","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4DJNHJSSSBFGROOMVLOZMD6BNL","target":"record","payload":{"canonical_record":{"source":{"id":"1905.07986","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-20T10:50:13Z","cross_cats_sorted":[],"title_canon_sha256":"7126e43796d2fdb3da7761c6c52355403ea0a5dfb1334673d99ced2dba0ad43f","abstract_canon_sha256":"a3599a09bab195d8d6aed9a43f845cbc4734809b8ab4efdd26b3d44632811901"},"schema_version":"1.0"},"canonical_sha256":"e0d2d3a652904a68b9ccaadd960fc16ac5327462ad9276501fb09d0a3127b0c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:47.954748Z","signature_b64":"awMhkI4bCmbCnTd7znIN5hJhS63VE1Ry007pWL6lfoQuazzSGspgUyiBiu+kqVESHBLywNszY3vb/e0lDtnnAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0d2d3a652904a68b9ccaadd960fc16ac5327462ad9276501fb09d0a3127b0c3","last_reissued_at":"2026-05-17T23:45:47.954078Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:47.954078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.07986","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-17T23:45:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LAL2RojSCLCLmStnBVqSf7EuLB425luUraG2vEPl6g73P+IffuARapXgLccWrAZKNhWGIriETGGifN+yBTeXAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:07:20.706470Z"},"content_sha256":"e6919b26d821d1877da41c1fa6bf8c074b21ff3ef0a70046b3ec5840ddc511b9","schema_version":"1.0","event_id":"sha256:e6919b26d821d1877da41c1fa6bf8c074b21ff3ef0a70046b3ec5840ddc511b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4DJNHJSSSBFGROOMVLOZMD6BNL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Online Algorithms for Dynamic Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ingmar Knof, Kilian Grage, Klaus Jansen, Sebastian Berndt, Valentin Dreismann","submitted_at":"2019-05-20T10:50:13Z","abstract_excerpt":"Online algorithms that allow a small amount of migration or recourse have been intensively studied in the last years. They are essential in the design of competitive algorithms for dynamic problems, where objects can also depart from the instance. In this work, we give a general framework to obtain so called robust online algorithms for these dynamic problems: these online algorithm achieve an asymptotic competitive ratio of $\\gamma+\\epsilon$ with migration $O(1/\\epsilon)$, where $\\gamma$ is the best known offline asymptotic approximation ratio. In order to use our framework, one only needs to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07986","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-17T23:45:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9HygkOO3bWBlZ3jVYW0sombPcUzxHdN0exjdJKobcSc3+zeS3/2j73piLJ5GzxuzcwyKnOdK8B2MxHoCXyjEBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:07:20.707105Z"},"content_sha256":"6539e85eb49399dda32a75caecc637f2aacac373590f763e89458a3d1b3e3b82","schema_version":"1.0","event_id":"sha256:6539e85eb49399dda32a75caecc637f2aacac373590f763e89458a3d1b3e3b82"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4DJNHJSSSBFGROOMVLOZMD6BNL/bundle.json","state_url":"https://pith.science/pith/4DJNHJSSSBFGROOMVLOZMD6BNL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4DJNHJSSSBFGROOMVLOZMD6BNL/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-08T13:07:20Z","links":{"resolver":"https://pith.science/pith/4DJNHJSSSBFGROOMVLOZMD6BNL","bundle":"https://pith.science/pith/4DJNHJSSSBFGROOMVLOZMD6BNL/bundle.json","state":"https://pith.science/pith/4DJNHJSSSBFGROOMVLOZMD6BNL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4DJNHJSSSBFGROOMVLOZMD6BNL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4DJNHJSSSBFGROOMVLOZMD6BNL","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":"a3599a09bab195d8d6aed9a43f845cbc4734809b8ab4efdd26b3d44632811901","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-20T10:50:13Z","title_canon_sha256":"7126e43796d2fdb3da7761c6c52355403ea0a5dfb1334673d99ced2dba0ad43f"},"schema_version":"1.0","source":{"id":"1905.07986","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07986","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07986v1","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07986","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"pith_short_12","alias_value":"4DJNHJSSSBFG","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4DJNHJSSSBFGROOM","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4DJNHJSS","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:6539e85eb49399dda32a75caecc637f2aacac373590f763e89458a3d1b3e3b82","target":"graph","created_at":"2026-05-17T23:45:47Z","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 algorithms that allow a small amount of migration or recourse have been intensively studied in the last years. They are essential in the design of competitive algorithms for dynamic problems, where objects can also depart from the instance. In this work, we give a general framework to obtain so called robust online algorithms for these dynamic problems: these online algorithm achieve an asymptotic competitive ratio of $\\gamma+\\epsilon$ with migration $O(1/\\epsilon)$, where $\\gamma$ is the best known offline asymptotic approximation ratio. In order to use our framework, one only needs to","authors_text":"Ingmar Knof, Kilian Grage, Klaus Jansen, Sebastian Berndt, Valentin Dreismann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-20T10:50:13Z","title":"Robust Online Algorithms for Dynamic Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07986","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:e6919b26d821d1877da41c1fa6bf8c074b21ff3ef0a70046b3ec5840ddc511b9","target":"record","created_at":"2026-05-17T23:45:47Z","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":"a3599a09bab195d8d6aed9a43f845cbc4734809b8ab4efdd26b3d44632811901","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-20T10:50:13Z","title_canon_sha256":"7126e43796d2fdb3da7761c6c52355403ea0a5dfb1334673d99ced2dba0ad43f"},"schema_version":"1.0","source":{"id":"1905.07986","kind":"arxiv","version":1}},"canonical_sha256":"e0d2d3a652904a68b9ccaadd960fc16ac5327462ad9276501fb09d0a3127b0c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0d2d3a652904a68b9ccaadd960fc16ac5327462ad9276501fb09d0a3127b0c3","first_computed_at":"2026-05-17T23:45:47.954078Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:47.954078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"awMhkI4bCmbCnTd7znIN5hJhS63VE1Ry007pWL6lfoQuazzSGspgUyiBiu+kqVESHBLywNszY3vb/e0lDtnnAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:47.954748Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.07986","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6919b26d821d1877da41c1fa6bf8c074b21ff3ef0a70046b3ec5840ddc511b9","sha256:6539e85eb49399dda32a75caecc637f2aacac373590f763e89458a3d1b3e3b82"],"state_sha256":"89c79c1ba2ab990dfdf34377082a8654c083784f38dcd11c83103e8cd8deb387"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d0nM9+BK5djBBa4/URrFe05kVz8PQpbYQxego5BlHzxLIb2t1r+7m4SIBmi+hKkGVMJL7blVPk7LRmALChgVCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T13:07:20.710280Z","bundle_sha256":"25ac780390b0cda551fb9404f5d0b69cd05b7b58641c915d5cb4bbecd5d0640d"}}