{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MGA73A4AWY2APJGWQ4HCUYXFLU","short_pith_number":"pith:MGA73A4A","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"},"canonical_sha256":"6181fd8380b63407a4d6870e2a62e55d04b0af30cb4b6d7e230f75b8e8641640","source":{"kind":"arxiv","id":"1708.05999","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05999","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05999v1","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05999","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"MGA73A4AWY2A","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MGA73A4AWY2APJGW","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MGA73A4A","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MGA73A4AWY2APJGWQ4HCUYXFLU","target":"record","payload":{"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"},"canonical_sha256":"6181fd8380b63407a4d6870e2a62e55d04b0af30cb4b6d7e230f75b8e8641640","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"},"source_kind":"arxiv","source_id":"1708.05999","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-18T00:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CfGfd8h8OGDgSUYaOoX90LbUN3SJo0my4pV3OOuncDayTJS40WqgwE+yYo3UDi1cXC38H02I8S+pNqv2njQOAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:14:07.403622Z"},"content_sha256":"b4b0420d8c55beab52edbb4a5a67c2b66358b95113f065c17610f973bb023aa4","schema_version":"1.0","event_id":"sha256:b4b0420d8c55beab52edbb4a5a67c2b66358b95113f065c17610f973bb023aa4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MGA73A4AWY2APJGWQ4HCUYXFLU","target":"graph","payload":{"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"},"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-18T00:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s2z/xxGuBEH9bY9CB0NGqTuTKI5R3uBQxECF6ngNaGDrkVC5gEBAWzL+4EDFkpNVMvivVy6HTl9aJt44AWDyAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:14:07.403972Z"},"content_sha256":"32f6f900a4056459dc8fea409483bcd02d5690c99e4603fe0541308b576e518b","schema_version":"1.0","event_id":"sha256:32f6f900a4056459dc8fea409483bcd02d5690c99e4603fe0541308b576e518b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MGA73A4AWY2APJGWQ4HCUYXFLU/bundle.json","state_url":"https://pith.science/pith/MGA73A4AWY2APJGWQ4HCUYXFLU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MGA73A4AWY2APJGWQ4HCUYXFLU/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-02T03:14:07Z","links":{"resolver":"https://pith.science/pith/MGA73A4AWY2APJGWQ4HCUYXFLU","bundle":"https://pith.science/pith/MGA73A4AWY2APJGWQ4HCUYXFLU/bundle.json","state":"https://pith.science/pith/MGA73A4AWY2APJGWQ4HCUYXFLU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MGA73A4AWY2APJGWQ4HCUYXFLU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MGA73A4AWY2APJGWQ4HCUYXFLU","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":"59c9dd883df170954fcfe4a0fa25d2bfd8f80ca6948e95850f06b55abfda1b90","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-08-20T18:12:49Z","title_canon_sha256":"13e4d0bd5172e68de82d155579ac4682d7a2f24d514735c628fabcdde4762195"},"schema_version":"1.0","source":{"id":"1708.05999","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05999","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05999v1","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05999","created_at":"2026-05-18T00:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"MGA73A4AWY2A","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MGA73A4AWY2APJGW","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MGA73A4A","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:32f6f900a4056459dc8fea409483bcd02d5690c99e4603fe0541308b576e518b","target":"graph","created_at":"2026-05-18T00:37:43Z","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 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","authors_text":"Edmund Yeh, Stratis Ioannidis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-08-20T18:12:49Z","title":"Jointly Optimal Routing and Caching for Arbitrary Network Topologies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05999","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:b4b0420d8c55beab52edbb4a5a67c2b66358b95113f065c17610f973bb023aa4","target":"record","created_at":"2026-05-18T00:37:43Z","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":"59c9dd883df170954fcfe4a0fa25d2bfd8f80ca6948e95850f06b55abfda1b90","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-08-20T18:12:49Z","title_canon_sha256":"13e4d0bd5172e68de82d155579ac4682d7a2f24d514735c628fabcdde4762195"},"schema_version":"1.0","source":{"id":"1708.05999","kind":"arxiv","version":1}},"canonical_sha256":"6181fd8380b63407a4d6870e2a62e55d04b0af30cb4b6d7e230f75b8e8641640","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6181fd8380b63407a4d6870e2a62e55d04b0af30cb4b6d7e230f75b8e8641640","first_computed_at":"2026-05-18T00:37:43.577420Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:43.577420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/KydQeAfeSBQlsCGIOFEZeLhIaS7+iZ4R2fPcSPYYa3h5TjARdxJgjCFLjABWfxQ5z5R3YtFwX6xFRQb5u9mBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:43.578249Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.05999","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4b0420d8c55beab52edbb4a5a67c2b66358b95113f065c17610f973bb023aa4","sha256:32f6f900a4056459dc8fea409483bcd02d5690c99e4603fe0541308b576e518b"],"state_sha256":"30f1b371b191fccb0aa6cb7626513c01f18c417e096fc2199fa4dc4937353001"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5eOA4NjTkxPJtoGmH2aqPGRVP9QrD08KGObyPU7rLqBPbq/mO30YjrNouQR+WeD5w5PGMjqDAkesQUaIan5FAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T03:14:07.405911Z","bundle_sha256":"4f9378716f4f39d36f2eab3aace9eef285e97bde16a696976e4cfaf16408ef42"}}