{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:V7F34HJLF6GMCYZ2VGTWRDX7YO","short_pith_number":"pith:V7F34HJL","schema_version":"1.0","canonical_sha256":"afcbbe1d2b2f8cc1633aa9a7688effc3916bb5cec33b5aa8e08a44ae383786a3","source":{"kind":"arxiv","id":"1611.00052","version":1},"attestation_state":"computed","paper":{"title":"LAST but not Least: Online Spanners for Buy-at-Bulk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anupam Gupta, Kunal Talwar, R. Ravi, Seeun William Umboh","submitted_at":"2016-10-31T21:34:05Z","abstract_excerpt":"The online (uniform) buy-at-bulk network design problem asks us to design a network, where the edge-costs exhibit economy-of-scale. Previous approaches to this problem used tree- embeddings, giving us randomized algorithms. Moreover, the optimal results with a logarithmic competitive ratio requires the metric on which the network is being built to be known up-front; the competitive ratios then depend on the size of this metric (which could be much larger than the number of terminals that arrive).\n  We consider the buy-at-bulk problem in the least restrictive model where the metric is not known"},"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":"1611.00052","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-31T21:34:05Z","cross_cats_sorted":[],"title_canon_sha256":"2089ae1386b088351b435a2611cd0cc865be6b3548c95fdfd01175c000d4c763","abstract_canon_sha256":"50a85b975fdb66d1aa34dc6bf22f09048dc30b3aae076c97f40a33cd32acee67"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:41.511975Z","signature_b64":"vApff6mW/pAGtaCtYMUZTPKKcmgQ2riKnfNP0g+dp0RnsFr3FxyZB4vzAiPIYJ+g6impv83ReBBc5p4qcB83Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afcbbe1d2b2f8cc1633aa9a7688effc3916bb5cec33b5aa8e08a44ae383786a3","last_reissued_at":"2026-05-18T01:00:41.511482Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:41.511482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LAST but not Least: Online Spanners for Buy-at-Bulk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anupam Gupta, Kunal Talwar, R. Ravi, Seeun William Umboh","submitted_at":"2016-10-31T21:34:05Z","abstract_excerpt":"The online (uniform) buy-at-bulk network design problem asks us to design a network, where the edge-costs exhibit economy-of-scale. Previous approaches to this problem used tree- embeddings, giving us randomized algorithms. Moreover, the optimal results with a logarithmic competitive ratio requires the metric on which the network is being built to be known up-front; the competitive ratios then depend on the size of this metric (which could be much larger than the number of terminals that arrive).\n  We consider the buy-at-bulk problem in the least restrictive model where the metric is not known"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00052","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":"1611.00052","created_at":"2026-05-18T01:00:41.511545+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.00052v1","created_at":"2026-05-18T01:00:41.511545+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00052","created_at":"2026-05-18T01:00:41.511545+00:00"},{"alias_kind":"pith_short_12","alias_value":"V7F34HJLF6GM","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"V7F34HJLF6GMCYZ2","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"V7F34HJL","created_at":"2026-05-18T12:30:48.956258+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/V7F34HJLF6GMCYZ2VGTWRDX7YO","json":"https://pith.science/pith/V7F34HJLF6GMCYZ2VGTWRDX7YO.json","graph_json":"https://pith.science/api/pith-number/V7F34HJLF6GMCYZ2VGTWRDX7YO/graph.json","events_json":"https://pith.science/api/pith-number/V7F34HJLF6GMCYZ2VGTWRDX7YO/events.json","paper":"https://pith.science/paper/V7F34HJL"},"agent_actions":{"view_html":"https://pith.science/pith/V7F34HJLF6GMCYZ2VGTWRDX7YO","download_json":"https://pith.science/pith/V7F34HJLF6GMCYZ2VGTWRDX7YO.json","view_paper":"https://pith.science/paper/V7F34HJL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.00052&json=true","fetch_graph":"https://pith.science/api/pith-number/V7F34HJLF6GMCYZ2VGTWRDX7YO/graph.json","fetch_events":"https://pith.science/api/pith-number/V7F34HJLF6GMCYZ2VGTWRDX7YO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V7F34HJLF6GMCYZ2VGTWRDX7YO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V7F34HJLF6GMCYZ2VGTWRDX7YO/action/storage_attestation","attest_author":"https://pith.science/pith/V7F34HJLF6GMCYZ2VGTWRDX7YO/action/author_attestation","sign_citation":"https://pith.science/pith/V7F34HJLF6GMCYZ2VGTWRDX7YO/action/citation_signature","submit_replication":"https://pith.science/pith/V7F34HJLF6GMCYZ2VGTWRDX7YO/action/replication_record"}},"created_at":"2026-05-18T01:00:41.511545+00:00","updated_at":"2026-05-18T01:00:41.511545+00:00"}