{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SINO3DT3DEKP4VE73JUB6APCHV","short_pith_number":"pith:SINO3DT3","schema_version":"1.0","canonical_sha256":"921aed8e7b1914fe549fda681f01e23d78d2d3f6e79a02cd8600012b3769478f","source":{"kind":"arxiv","id":"1904.07131","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.07131","created_at":"2026-05-17T23:48:35.180325+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.07131v1","created_at":"2026-05-17T23:48:35.180325+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.07131","created_at":"2026-05-17T23:48:35.180325+00:00"},{"alias_kind":"pith_short_12","alias_value":"SINO3DT3DEKP","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"SINO3DT3DEKP4VE7","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"SINO3DT3","created_at":"2026-05-18T12:33:27.125529+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SINO3DT3DEKP4VE73JUB6APCHV","json":"https://pith.science/pith/SINO3DT3DEKP4VE73JUB6APCHV.json","graph_json":"https://pith.science/api/pith-number/SINO3DT3DEKP4VE73JUB6APCHV/graph.json","events_json":"https://pith.science/api/pith-number/SINO3DT3DEKP4VE73JUB6APCHV/events.json","paper":"https://pith.science/paper/SINO3DT3"},"agent_actions":{"view_html":"https://pith.science/pith/SINO3DT3DEKP4VE73JUB6APCHV","download_json":"https://pith.science/pith/SINO3DT3DEKP4VE73JUB6APCHV.json","view_paper":"https://pith.science/paper/SINO3DT3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.07131&json=true","fetch_graph":"https://pith.science/api/pith-number/SINO3DT3DEKP4VE73JUB6APCHV/graph.json","fetch_events":"https://pith.science/api/pith-number/SINO3DT3DEKP4VE73JUB6APCHV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SINO3DT3DEKP4VE73JUB6APCHV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SINO3DT3DEKP4VE73JUB6APCHV/action/storage_attestation","attest_author":"https://pith.science/pith/SINO3DT3DEKP4VE73JUB6APCHV/action/author_attestation","sign_citation":"https://pith.science/pith/SINO3DT3DEKP4VE73JUB6APCHV/action/citation_signature","submit_replication":"https://pith.science/pith/SINO3DT3DEKP4VE73JUB6APCHV/action/replication_record"}},"created_at":"2026-05-17T23:48:35.180325+00:00","updated_at":"2026-05-17T23:48:35.180325+00:00"}