{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:SD7Z4DGQBF2YCGQMXDPXHHTXAL","short_pith_number":"pith:SD7Z4DGQ","schema_version":"1.0","canonical_sha256":"90ff9e0cd00975811a0cb8df739e7702ca06bd31d45f146c723b8731ec95d73b","source":{"kind":"arxiv","id":"1501.00216","version":1},"attestation_state":"computed","paper":{"title":"On the Complexity of Optimal Routing and Content Caching in Heterogeneous Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Anand Seetharam, Bo Jiang, Don Towsley, Jim Kurose, Mostafa Dehghan, Ramesh Sitaraman, Theodoros Salonidis, Ting He","submitted_at":"2014-12-31T22:00:11Z","abstract_excerpt":"We investigate the problem of optimal request routing and content caching in a heterogeneous network supporting in-network content caching with the goal of minimizing average content access delay. Here, content can either be accessed directly from a back-end server (where content resides permanently) or be obtained from one of multiple in-network caches. To access a piece of content, a user must decide whether to route its request to a cache or to the back-end server. Additionally, caches must decide which content to cache. We investigate the problem complexity of two problem formulations, whe"},"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":"1501.00216","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-12-31T22:00:11Z","cross_cats_sorted":[],"title_canon_sha256":"548b10a1625b3e3dbc1cab09949e3209ef23f23aa7bcdc777ebd015df2ed0a4d","abstract_canon_sha256":"8e731ce9088c674ff0f920b0815a78815973a3327b0f397bad08007155be4e39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:09.839692Z","signature_b64":"tP1qZuozy1EdAXu+U8Yr+RYV9QsxQkmAMEDSjSV/EEv9gzdYQLAV9/f6i8NcQQN337L60pEhQDOQNMG1H0QQBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90ff9e0cd00975811a0cb8df739e7702ca06bd31d45f146c723b8731ec95d73b","last_reissued_at":"2026-05-18T02:30:09.839242Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:09.839242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of Optimal Routing and Content Caching in Heterogeneous Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Anand Seetharam, Bo Jiang, Don Towsley, Jim Kurose, Mostafa Dehghan, Ramesh Sitaraman, Theodoros Salonidis, Ting He","submitted_at":"2014-12-31T22:00:11Z","abstract_excerpt":"We investigate the problem of optimal request routing and content caching in a heterogeneous network supporting in-network content caching with the goal of minimizing average content access delay. Here, content can either be accessed directly from a back-end server (where content resides permanently) or be obtained from one of multiple in-network caches. To access a piece of content, a user must decide whether to route its request to a cache or to the back-end server. Additionally, caches must decide which content to cache. We investigate the problem complexity of two problem formulations, whe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00216","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":"1501.00216","created_at":"2026-05-18T02:30:09.839307+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.00216v1","created_at":"2026-05-18T02:30:09.839307+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00216","created_at":"2026-05-18T02:30:09.839307+00:00"},{"alias_kind":"pith_short_12","alias_value":"SD7Z4DGQBF2Y","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"SD7Z4DGQBF2YCGQM","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"SD7Z4DGQ","created_at":"2026-05-18T12:28:49.207871+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/SD7Z4DGQBF2YCGQMXDPXHHTXAL","json":"https://pith.science/pith/SD7Z4DGQBF2YCGQMXDPXHHTXAL.json","graph_json":"https://pith.science/api/pith-number/SD7Z4DGQBF2YCGQMXDPXHHTXAL/graph.json","events_json":"https://pith.science/api/pith-number/SD7Z4DGQBF2YCGQMXDPXHHTXAL/events.json","paper":"https://pith.science/paper/SD7Z4DGQ"},"agent_actions":{"view_html":"https://pith.science/pith/SD7Z4DGQBF2YCGQMXDPXHHTXAL","download_json":"https://pith.science/pith/SD7Z4DGQBF2YCGQMXDPXHHTXAL.json","view_paper":"https://pith.science/paper/SD7Z4DGQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.00216&json=true","fetch_graph":"https://pith.science/api/pith-number/SD7Z4DGQBF2YCGQMXDPXHHTXAL/graph.json","fetch_events":"https://pith.science/api/pith-number/SD7Z4DGQBF2YCGQMXDPXHHTXAL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SD7Z4DGQBF2YCGQMXDPXHHTXAL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SD7Z4DGQBF2YCGQMXDPXHHTXAL/action/storage_attestation","attest_author":"https://pith.science/pith/SD7Z4DGQBF2YCGQMXDPXHHTXAL/action/author_attestation","sign_citation":"https://pith.science/pith/SD7Z4DGQBF2YCGQMXDPXHHTXAL/action/citation_signature","submit_replication":"https://pith.science/pith/SD7Z4DGQBF2YCGQMXDPXHHTXAL/action/replication_record"}},"created_at":"2026-05-18T02:30:09.839307+00:00","updated_at":"2026-05-18T02:30:09.839307+00:00"}