{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SINO3DT3DEKP4VE73JUB6APCHV","short_pith_number":"pith:SINO3DT3","canonical_record":{"source":{"id":"1904.07131","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-15T15:36:20Z","cross_cats_sorted":[],"title_canon_sha256":"ada6afcfe43a0853b4fb8c16aaafc431f80d056f07d2e372759afd46f2055f2c","abstract_canon_sha256":"3351f482ab16a81f3b5c76fdf894c55f24d3fc44248dcf9baba87975e0e2d9c3"},"schema_version":"1.0"},"canonical_sha256":"921aed8e7b1914fe549fda681f01e23d78d2d3f6e79a02cd8600012b3769478f","source":{"kind":"arxiv","id":"1904.07131","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.07131","created_at":"2026-05-17T23:48:35Z"},{"alias_kind":"arxiv_version","alias_value":"1904.07131v1","created_at":"2026-05-17T23:48:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07131","created_at":"2026-05-17T23:48:35Z"},{"alias_kind":"pith_short_12","alias_value":"SINO3DT3DEKP","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SINO3DT3DEKP4VE7","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SINO3DT3","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SINO3DT3DEKP4VE73JUB6APCHV","target":"record","payload":{"canonical_record":{"source":{"id":"1904.07131","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-15T15:36:20Z","cross_cats_sorted":[],"title_canon_sha256":"ada6afcfe43a0853b4fb8c16aaafc431f80d056f07d2e372759afd46f2055f2c","abstract_canon_sha256":"3351f482ab16a81f3b5c76fdf894c55f24d3fc44248dcf9baba87975e0e2d9c3"},"schema_version":"1.0"},"canonical_sha256":"921aed8e7b1914fe549fda681f01e23d78d2d3f6e79a02cd8600012b3769478f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:35.180744Z","signature_b64":"edU8CgRqxdZb+qOUVQRaOmowZprZXXzxmNPUy8YPhDqAS/oKFJ1peB7jgE+X5MDz69YzAirPnKzRIaDFlLM/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"921aed8e7b1914fe549fda681f01e23d78d2d3f6e79a02cd8600012b3769478f","last_reissued_at":"2026-05-17T23:48:35.180226Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:35.180226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.07131","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:48:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aOFZ45qK7K5M9Lt18kasFqyXv0Q3Gu9hqHdCDGtMfhBqhOQajExR3+cOsMrnAyV7435GkTIBPA++nkaKdNx4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:18:09.729800Z"},"content_sha256":"8a918d20cbdbbd0c6b2d12878fbefd5b950fe1f9c8a58a5d02aba5ac0cd5de9a","schema_version":"1.0","event_id":"sha256:8a918d20cbdbbd0c6b2d12878fbefd5b950fe1f9c8a58a5d02aba5ac0cd5de9a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SINO3DT3DEKP4VE73JUB6APCHV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"General Framework for Metric Optimization Problems with Delay or with Deadlines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Noam Touitou, Yossi Azar","submitted_at":"2019-04-15T15:36:20Z","abstract_excerpt":"In this paper, we present a framework used to construct and analyze algorithms for online optimization problems with deadlines or with delay over a metric space. Using this framework, we present algorithms for several different problems. We present an $O(D^{2})$-competitive deterministic algorithm for online multilevel aggregation with delay on a tree of depth $D$, an exponential improvement over the $O(D^{4}2^{D})$-competitive algorithm of Bienkowski et al. (ESA '16), where the only previously-known improvement was for the special case of deadlines by Buchbinder et al. (SODA '17). We also pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07131","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:48:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k/I0P2jtIaWdxE5kRpNG/mAMKwVS+vBEa/VX0NBn5KMCzYWoCitDs5cJSh+4LxrYEp0UG2AfNwnJMOzzU3p2Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:18:09.730156Z"},"content_sha256":"1a38c5d6ce2ed4ced4ef760a1680c4b9f2a5ea0095667f7f72f60a2818a4bdb5","schema_version":"1.0","event_id":"sha256:1a38c5d6ce2ed4ced4ef760a1680c4b9f2a5ea0095667f7f72f60a2818a4bdb5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SINO3DT3DEKP4VE73JUB6APCHV/bundle.json","state_url":"https://pith.science/pith/SINO3DT3DEKP4VE73JUB6APCHV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SINO3DT3DEKP4VE73JUB6APCHV/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-05-27T23:18:09Z","links":{"resolver":"https://pith.science/pith/SINO3DT3DEKP4VE73JUB6APCHV","bundle":"https://pith.science/pith/SINO3DT3DEKP4VE73JUB6APCHV/bundle.json","state":"https://pith.science/pith/SINO3DT3DEKP4VE73JUB6APCHV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SINO3DT3DEKP4VE73JUB6APCHV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SINO3DT3DEKP4VE73JUB6APCHV","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":"3351f482ab16a81f3b5c76fdf894c55f24d3fc44248dcf9baba87975e0e2d9c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-15T15:36:20Z","title_canon_sha256":"ada6afcfe43a0853b4fb8c16aaafc431f80d056f07d2e372759afd46f2055f2c"},"schema_version":"1.0","source":{"id":"1904.07131","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.07131","created_at":"2026-05-17T23:48:35Z"},{"alias_kind":"arxiv_version","alias_value":"1904.07131v1","created_at":"2026-05-17T23:48:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07131","created_at":"2026-05-17T23:48:35Z"},{"alias_kind":"pith_short_12","alias_value":"SINO3DT3DEKP","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SINO3DT3DEKP4VE7","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SINO3DT3","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:1a38c5d6ce2ed4ced4ef760a1680c4b9f2a5ea0095667f7f72f60a2818a4bdb5","target":"graph","created_at":"2026-05-17T23:48:35Z","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":"In this paper, we present a framework used to construct and analyze algorithms for online optimization problems with deadlines or with delay over a metric space. Using this framework, we present algorithms for several different problems. We present an $O(D^{2})$-competitive deterministic algorithm for online multilevel aggregation with delay on a tree of depth $D$, an exponential improvement over the $O(D^{4}2^{D})$-competitive algorithm of Bienkowski et al. (ESA '16), where the only previously-known improvement was for the special case of deadlines by Buchbinder et al. (SODA '17). We also pre","authors_text":"Noam Touitou, Yossi Azar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-15T15:36:20Z","title":"General Framework for Metric Optimization Problems with Delay or with Deadlines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.07131","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:8a918d20cbdbbd0c6b2d12878fbefd5b950fe1f9c8a58a5d02aba5ac0cd5de9a","target":"record","created_at":"2026-05-17T23:48:35Z","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":"3351f482ab16a81f3b5c76fdf894c55f24d3fc44248dcf9baba87975e0e2d9c3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-15T15:36:20Z","title_canon_sha256":"ada6afcfe43a0853b4fb8c16aaafc431f80d056f07d2e372759afd46f2055f2c"},"schema_version":"1.0","source":{"id":"1904.07131","kind":"arxiv","version":1}},"canonical_sha256":"921aed8e7b1914fe549fda681f01e23d78d2d3f6e79a02cd8600012b3769478f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"921aed8e7b1914fe549fda681f01e23d78d2d3f6e79a02cd8600012b3769478f","first_computed_at":"2026-05-17T23:48:35.180226Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:35.180226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"edU8CgRqxdZb+qOUVQRaOmowZprZXXzxmNPUy8YPhDqAS/oKFJ1peB7jgE+X5MDz69YzAirPnKzRIaDFlLM/AA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:35.180744Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.07131","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a918d20cbdbbd0c6b2d12878fbefd5b950fe1f9c8a58a5d02aba5ac0cd5de9a","sha256:1a38c5d6ce2ed4ced4ef760a1680c4b9f2a5ea0095667f7f72f60a2818a4bdb5"],"state_sha256":"75a49dced3cce9accb540689e6bc63cea07b5a12c190c712144b306ac4e27d06"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kN8+lDeyVGtUJIwTmWmqn+Kv8x8dcpYkRFJRaKfjuQCxMC2Lw2LDSkI4DVe2Gpde2YT6euCMdnijmZzhhpZ6Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:18:09.732274Z","bundle_sha256":"aad58102226fdbe70aa98bc91cc876bc19fce22dc0ee07495be27c5d76a0c97d"}}