{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7VOHOMVTQ75XUNJ36FVLUF6KOY","short_pith_number":"pith:7VOHOMVT","canonical_record":{"source":{"id":"1410.4240","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-15T21:43:04Z","cross_cats_sorted":[],"title_canon_sha256":"7a5669959e714addaada4315cad8e2cceb4968eb5aa7072b320ca0a39dbd8585","abstract_canon_sha256":"4e6e679a25c19c0358fc348f5f31e703dad97ffcbd297f73197acf685f301c65"},"schema_version":"1.0"},"canonical_sha256":"fd5c7732b387fb7a353bf16aba17ca7631f961e5d658e83bc0f9766652cfa58f","source":{"kind":"arxiv","id":"1410.4240","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4240","created_at":"2026-05-18T02:39:56Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4240v1","created_at":"2026-05-18T02:39:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4240","created_at":"2026-05-18T02:39:56Z"},{"alias_kind":"pith_short_12","alias_value":"7VOHOMVTQ75X","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7VOHOMVTQ75XUNJ3","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7VOHOMVT","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7VOHOMVTQ75XUNJ36FVLUF6KOY","target":"record","payload":{"canonical_record":{"source":{"id":"1410.4240","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-15T21:43:04Z","cross_cats_sorted":[],"title_canon_sha256":"7a5669959e714addaada4315cad8e2cceb4968eb5aa7072b320ca0a39dbd8585","abstract_canon_sha256":"4e6e679a25c19c0358fc348f5f31e703dad97ffcbd297f73197acf685f301c65"},"schema_version":"1.0"},"canonical_sha256":"fd5c7732b387fb7a353bf16aba17ca7631f961e5d658e83bc0f9766652cfa58f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:56.595449Z","signature_b64":"KOvrA6dX0BE8XqqKZov1qjNn6r0U4gLyxNsieBCL+YAYbEN+2BepFsZTPWsHjxO8qqRIYBGeUChKUs9UVsgCBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd5c7732b387fb7a353bf16aba17ca7631f961e5d658e83bc0f9766652cfa58f","last_reissued_at":"2026-05-18T02:39:56.595012Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:56.595012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.4240","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-18T02:39:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lElj3fV6AvWTsM2ofwuHQrlfNTBCoHuYe9OJ8juOUsaP9txCVp5erX+3fzWhajYLMNklSCVQE6nx2oFbdc1ICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:04:24.409059Z"},"content_sha256":"810fb6cc4c39bfd42e5fd27713218fe44694a199627fc6e0bf1978bf1b1e913b","schema_version":"1.0","event_id":"sha256:810fb6cc4c39bfd42e5fd27713218fe44694a199627fc6e0bf1978bf1b1e913b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7VOHOMVTQ75XUNJ36FVLUF6KOY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Network Design Algorithms via Hierarchical Decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Seeun Umboh","submitted_at":"2014-10-15T21:43:04Z","abstract_excerpt":"We develop a new approach for online network design and obtain improved competitive ratios for several problems. Our approach gives natural deterministic algorithms and simple analyses. At the heart of our work is a novel application of embeddings into hierarchically well-separated trees (HSTs) to the analysis of online network design algorithms --- we charge the cost of the algorithm to the cost of the optimal solution on any HST embedding of the terminals. This analysis technique is widely applicable to many problems and gives a unified framework for online network design.\n  In a sense, our "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4240","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-18T02:39:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m+elyLBfVmfS4gxHwBlPnmryuHedaoIAQNZ1COXv0ULDE+JAX5b+4TNZigArC9GGDzGWVKwlej9udDuASwAlDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T23:04:24.409750Z"},"content_sha256":"16f6ae9521ecf01001d8f7e0357800080f16b20374f4957662cabb9da9fabb0a","schema_version":"1.0","event_id":"sha256:16f6ae9521ecf01001d8f7e0357800080f16b20374f4957662cabb9da9fabb0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7VOHOMVTQ75XUNJ36FVLUF6KOY/bundle.json","state_url":"https://pith.science/pith/7VOHOMVTQ75XUNJ36FVLUF6KOY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7VOHOMVTQ75XUNJ36FVLUF6KOY/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-04T23:04:24Z","links":{"resolver":"https://pith.science/pith/7VOHOMVTQ75XUNJ36FVLUF6KOY","bundle":"https://pith.science/pith/7VOHOMVTQ75XUNJ36FVLUF6KOY/bundle.json","state":"https://pith.science/pith/7VOHOMVTQ75XUNJ36FVLUF6KOY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7VOHOMVTQ75XUNJ36FVLUF6KOY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7VOHOMVTQ75XUNJ36FVLUF6KOY","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":"4e6e679a25c19c0358fc348f5f31e703dad97ffcbd297f73197acf685f301c65","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-15T21:43:04Z","title_canon_sha256":"7a5669959e714addaada4315cad8e2cceb4968eb5aa7072b320ca0a39dbd8585"},"schema_version":"1.0","source":{"id":"1410.4240","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4240","created_at":"2026-05-18T02:39:56Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4240v1","created_at":"2026-05-18T02:39:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4240","created_at":"2026-05-18T02:39:56Z"},{"alias_kind":"pith_short_12","alias_value":"7VOHOMVTQ75X","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7VOHOMVTQ75XUNJ3","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7VOHOMVT","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:16f6ae9521ecf01001d8f7e0357800080f16b20374f4957662cabb9da9fabb0a","target":"graph","created_at":"2026-05-18T02:39:56Z","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":"We develop a new approach for online network design and obtain improved competitive ratios for several problems. Our approach gives natural deterministic algorithms and simple analyses. At the heart of our work is a novel application of embeddings into hierarchically well-separated trees (HSTs) to the analysis of online network design algorithms --- we charge the cost of the algorithm to the cost of the optimal solution on any HST embedding of the terminals. This analysis technique is widely applicable to many problems and gives a unified framework for online network design.\n  In a sense, our ","authors_text":"Seeun Umboh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-15T21:43:04Z","title":"Online Network Design Algorithms via Hierarchical Decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4240","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:810fb6cc4c39bfd42e5fd27713218fe44694a199627fc6e0bf1978bf1b1e913b","target":"record","created_at":"2026-05-18T02:39:56Z","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":"4e6e679a25c19c0358fc348f5f31e703dad97ffcbd297f73197acf685f301c65","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-15T21:43:04Z","title_canon_sha256":"7a5669959e714addaada4315cad8e2cceb4968eb5aa7072b320ca0a39dbd8585"},"schema_version":"1.0","source":{"id":"1410.4240","kind":"arxiv","version":1}},"canonical_sha256":"fd5c7732b387fb7a353bf16aba17ca7631f961e5d658e83bc0f9766652cfa58f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd5c7732b387fb7a353bf16aba17ca7631f961e5d658e83bc0f9766652cfa58f","first_computed_at":"2026-05-18T02:39:56.595012Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:56.595012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KOvrA6dX0BE8XqqKZov1qjNn6r0U4gLyxNsieBCL+YAYbEN+2BepFsZTPWsHjxO8qqRIYBGeUChKUs9UVsgCBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:56.595449Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.4240","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:810fb6cc4c39bfd42e5fd27713218fe44694a199627fc6e0bf1978bf1b1e913b","sha256:16f6ae9521ecf01001d8f7e0357800080f16b20374f4957662cabb9da9fabb0a"],"state_sha256":"ef79cadc2e8ef5fa1a0ac3c5ae638c63e3e16a6c82990c821b04ff5570c17ebe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l1NAEgBXOXaLZpFzc/cvMt9ulIZZhVuXlElNgw3tqEmGwbEaIRzPQUAgRWj3FtOU0UXWwOEVZd9R5xJo1ZUuCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T23:04:24.414405Z","bundle_sha256":"10c88ac9b52800b62e6567b340bf6f094ab7085278181e295eca190a3b7b5766"}}