{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BSUBTY62DEYA3733P3MC33NLCJ","short_pith_number":"pith:BSUBTY62","schema_version":"1.0","canonical_sha256":"0ca819e3da19300dff7b7ed82dedab12447664a2f324e8016810687df5818f57","source":{"kind":"arxiv","id":"1811.10737","version":1},"attestation_state":"computed","paper":{"title":"Dissecting Latency in the Internet's Fiber Infrastructure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ankit Singla, Balakrishnan Chandrasekaran, Bruce M. Maggs, Debopam Bhattacherjee, Gregory Laughlin, Ilker Nadi Bozkurt, Philip Brighten Godfrey, Waqar Aqeel","submitted_at":"2018-11-26T23:17:08Z","abstract_excerpt":"The recent publication of the `InterTubes' map of long-haul fiber-optic cables in the contiguous United States invites an exciting question: how much faster would the Internet be if routes were chosen to minimize latency? Previous measurement campaigns suggest the following rule of thumb for estimating Internet latency: multiply line-of-sight distance by 2.1, then divide by the speed of light in fiber. But a simple computation of shortest-path lengths through the conduits in the InterTubes map suggests that the conversion factor for all pairs of the 120 largest population centers in the U.S.\\ "},"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":"1811.10737","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-26T23:17:08Z","cross_cats_sorted":[],"title_canon_sha256":"0354e8d34ea9a44423ddb4ef31b5f294862379d1c4dc8610c35c25db19c56ba6","abstract_canon_sha256":"6d3fcf6f4d10b2facaa0eea4029f1a8260d8b6ef104b3f46e211b8f82a8ddec6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:47.681443Z","signature_b64":"e2bO3cL8Nku0a36Bv7RSCYiwtolcAjTPuy9obZ0SX68/OaE4qbXTSAfdcfBzHDj1mpr9oV/jEnkRwjdOpZHgDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ca819e3da19300dff7b7ed82dedab12447664a2f324e8016810687df5818f57","last_reissued_at":"2026-05-17T23:59:47.680889Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:47.680889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dissecting Latency in the Internet's Fiber Infrastructure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ankit Singla, Balakrishnan Chandrasekaran, Bruce M. Maggs, Debopam Bhattacherjee, Gregory Laughlin, Ilker Nadi Bozkurt, Philip Brighten Godfrey, Waqar Aqeel","submitted_at":"2018-11-26T23:17:08Z","abstract_excerpt":"The recent publication of the `InterTubes' map of long-haul fiber-optic cables in the contiguous United States invites an exciting question: how much faster would the Internet be if routes were chosen to minimize latency? Previous measurement campaigns suggest the following rule of thumb for estimating Internet latency: multiply line-of-sight distance by 2.1, then divide by the speed of light in fiber. But a simple computation of shortest-path lengths through the conduits in the InterTubes map suggests that the conversion factor for all pairs of the 120 largest population centers in the U.S.\\ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10737","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":"1811.10737","created_at":"2026-05-17T23:59:47.680973+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.10737v1","created_at":"2026-05-17T23:59:47.680973+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10737","created_at":"2026-05-17T23:59:47.680973+00:00"},{"alias_kind":"pith_short_12","alias_value":"BSUBTY62DEYA","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BSUBTY62DEYA3733","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BSUBTY62","created_at":"2026-05-18T12:32:16.446611+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.08455","citing_title":"SKYLINK: Scalable and Resilient Link Management in LEO Satellite Network","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BSUBTY62DEYA3733P3MC33NLCJ","json":"https://pith.science/pith/BSUBTY62DEYA3733P3MC33NLCJ.json","graph_json":"https://pith.science/api/pith-number/BSUBTY62DEYA3733P3MC33NLCJ/graph.json","events_json":"https://pith.science/api/pith-number/BSUBTY62DEYA3733P3MC33NLCJ/events.json","paper":"https://pith.science/paper/BSUBTY62"},"agent_actions":{"view_html":"https://pith.science/pith/BSUBTY62DEYA3733P3MC33NLCJ","download_json":"https://pith.science/pith/BSUBTY62DEYA3733P3MC33NLCJ.json","view_paper":"https://pith.science/paper/BSUBTY62","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.10737&json=true","fetch_graph":"https://pith.science/api/pith-number/BSUBTY62DEYA3733P3MC33NLCJ/graph.json","fetch_events":"https://pith.science/api/pith-number/BSUBTY62DEYA3733P3MC33NLCJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BSUBTY62DEYA3733P3MC33NLCJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BSUBTY62DEYA3733P3MC33NLCJ/action/storage_attestation","attest_author":"https://pith.science/pith/BSUBTY62DEYA3733P3MC33NLCJ/action/author_attestation","sign_citation":"https://pith.science/pith/BSUBTY62DEYA3733P3MC33NLCJ/action/citation_signature","submit_replication":"https://pith.science/pith/BSUBTY62DEYA3733P3MC33NLCJ/action/replication_record"}},"created_at":"2026-05-17T23:59:47.680973+00:00","updated_at":"2026-05-17T23:59:47.680973+00:00"}