{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MGA73A4AWY2APJGWQ4HCUYXFLU","short_pith_number":"pith:MGA73A4A","schema_version":"1.0","canonical_sha256":"6181fd8380b63407a4d6870e2a62e55d04b0af30cb4b6d7e230f75b8e8641640","source":{"kind":"arxiv","id":"1708.05999","version":1},"attestation_state":"computed","paper":{"title":"Jointly Optimal Routing and Caching for Arbitrary Network Topologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Edmund Yeh, Stratis Ioannidis","submitted_at":"2017-08-20T18:12:49Z","abstract_excerpt":"We study a problem of fundamental importance to ICNs, namely, minimizing routing costs by jointly optimizing caching and routing decisions over an arbitrary network topology. We consider both source routing and hop-by-hop routing settings. The respective offline problems are NP-hard. Nevertheless, we show that there exist polynomial time approximation algorithms producing solutions within a constant approximation from the optimal. We also produce distributed, adaptive algorithms with the same approximation guarantees. We simulate our adaptive algorithms over a broad array of different topologi"},"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":"1708.05999","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-08-20T18:12:49Z","cross_cats_sorted":[],"title_canon_sha256":"13e4d0bd5172e68de82d155579ac4682d7a2f24d514735c628fabcdde4762195","abstract_canon_sha256":"59c9dd883df170954fcfe4a0fa25d2bfd8f80ca6948e95850f06b55abfda1b90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:43.578249Z","signature_b64":"/KydQeAfeSBQlsCGIOFEZeLhIaS7+iZ4R2fPcSPYYa3h5TjARdxJgjCFLjABWfxQ5z5R3YtFwX6xFRQb5u9mBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6181fd8380b63407a4d6870e2a62e55d04b0af30cb4b6d7e230f75b8e8641640","last_reissued_at":"2026-05-18T00:37:43.577420Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:43.577420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Jointly Optimal Routing and Caching for Arbitrary Network Topologies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Edmund Yeh, Stratis Ioannidis","submitted_at":"2017-08-20T18:12:49Z","abstract_excerpt":"We study a problem of fundamental importance to ICNs, namely, minimizing routing costs by jointly optimizing caching and routing decisions over an arbitrary network topology. We consider both source routing and hop-by-hop routing settings. The respective offline problems are NP-hard. Nevertheless, we show that there exist polynomial time approximation algorithms producing solutions within a constant approximation from the optimal. We also produce distributed, adaptive algorithms with the same approximation guarantees. We simulate our adaptive algorithms over a broad array of different topologi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05999","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":"1708.05999","created_at":"2026-05-18T00:37:43.577565+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.05999v1","created_at":"2026-05-18T00:37:43.577565+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05999","created_at":"2026-05-18T00:37:43.577565+00:00"},{"alias_kind":"pith_short_12","alias_value":"MGA73A4AWY2A","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MGA73A4AWY2APJGW","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MGA73A4A","created_at":"2026-05-18T12:31:31.346846+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/MGA73A4AWY2APJGWQ4HCUYXFLU","json":"https://pith.science/pith/MGA73A4AWY2APJGWQ4HCUYXFLU.json","graph_json":"https://pith.science/api/pith-number/MGA73A4AWY2APJGWQ4HCUYXFLU/graph.json","events_json":"https://pith.science/api/pith-number/MGA73A4AWY2APJGWQ4HCUYXFLU/events.json","paper":"https://pith.science/paper/MGA73A4A"},"agent_actions":{"view_html":"https://pith.science/pith/MGA73A4AWY2APJGWQ4HCUYXFLU","download_json":"https://pith.science/pith/MGA73A4AWY2APJGWQ4HCUYXFLU.json","view_paper":"https://pith.science/paper/MGA73A4A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.05999&json=true","fetch_graph":"https://pith.science/api/pith-number/MGA73A4AWY2APJGWQ4HCUYXFLU/graph.json","fetch_events":"https://pith.science/api/pith-number/MGA73A4AWY2APJGWQ4HCUYXFLU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MGA73A4AWY2APJGWQ4HCUYXFLU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MGA73A4AWY2APJGWQ4HCUYXFLU/action/storage_attestation","attest_author":"https://pith.science/pith/MGA73A4AWY2APJGWQ4HCUYXFLU/action/author_attestation","sign_citation":"https://pith.science/pith/MGA73A4AWY2APJGWQ4HCUYXFLU/action/citation_signature","submit_replication":"https://pith.science/pith/MGA73A4AWY2APJGWQ4HCUYXFLU/action/replication_record"}},"created_at":"2026-05-18T00:37:43.577565+00:00","updated_at":"2026-05-18T00:37:43.577565+00:00"}