{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SD7Z4DGQBF2YCGQMXDPXHHTXAL","short_pith_number":"pith:SD7Z4DGQ","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"},"canonical_sha256":"90ff9e0cd00975811a0cb8df739e7702ca06bd31d45f146c723b8731ec95d73b","source":{"kind":"arxiv","id":"1501.00216","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00216","created_at":"2026-05-18T02:30:09Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00216v1","created_at":"2026-05-18T02:30:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00216","created_at":"2026-05-18T02:30:09Z"},{"alias_kind":"pith_short_12","alias_value":"SD7Z4DGQBF2Y","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SD7Z4DGQBF2YCGQM","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SD7Z4DGQ","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SD7Z4DGQBF2YCGQMXDPXHHTXAL","target":"record","payload":{"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"},"canonical_sha256":"90ff9e0cd00975811a0cb8df739e7702ca06bd31d45f146c723b8731ec95d73b","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"},"source_kind":"arxiv","source_id":"1501.00216","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-18T02:30:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0WECzOZW1eTemDY4aWbTLQ4f6OH00Jsa1LASC02H9H/uArnKN9r4gc4/815CLQprhvrvoB4mn9WIdRBrdOTSAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:09:55.422419Z"},"content_sha256":"2b557f2c1b0f681135956f3b3659aaf170840eeb9adbb88244e361586c4c06be","schema_version":"1.0","event_id":"sha256:2b557f2c1b0f681135956f3b3659aaf170840eeb9adbb88244e361586c4c06be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SD7Z4DGQBF2YCGQMXDPXHHTXAL","target":"graph","payload":{"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"},"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-18T02:30:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LI1qrsuKaJcuwZqcYa7a9XwfMNJbEeycGfR7eakSRbZ72YRkb3QIxRj4ReKruRmivB3FYTeqjBevsRUl7L1pAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:09:55.423051Z"},"content_sha256":"ac7c2f9732fb18d3419b6b2d0a64f4674d5eaf3c2753654ee21ef100e200f80a","schema_version":"1.0","event_id":"sha256:ac7c2f9732fb18d3419b6b2d0a64f4674d5eaf3c2753654ee21ef100e200f80a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SD7Z4DGQBF2YCGQMXDPXHHTXAL/bundle.json","state_url":"https://pith.science/pith/SD7Z4DGQBF2YCGQMXDPXHHTXAL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SD7Z4DGQBF2YCGQMXDPXHHTXAL/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-05-30T06:09:55Z","links":{"resolver":"https://pith.science/pith/SD7Z4DGQBF2YCGQMXDPXHHTXAL","bundle":"https://pith.science/pith/SD7Z4DGQBF2YCGQMXDPXHHTXAL/bundle.json","state":"https://pith.science/pith/SD7Z4DGQBF2YCGQMXDPXHHTXAL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SD7Z4DGQBF2YCGQMXDPXHHTXAL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SD7Z4DGQBF2YCGQMXDPXHHTXAL","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":"8e731ce9088c674ff0f920b0815a78815973a3327b0f397bad08007155be4e39","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-12-31T22:00:11Z","title_canon_sha256":"548b10a1625b3e3dbc1cab09949e3209ef23f23aa7bcdc777ebd015df2ed0a4d"},"schema_version":"1.0","source":{"id":"1501.00216","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00216","created_at":"2026-05-18T02:30:09Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00216v1","created_at":"2026-05-18T02:30:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00216","created_at":"2026-05-18T02:30:09Z"},{"alias_kind":"pith_short_12","alias_value":"SD7Z4DGQBF2Y","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SD7Z4DGQBF2YCGQM","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SD7Z4DGQ","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:ac7c2f9732fb18d3419b6b2d0a64f4674d5eaf3c2753654ee21ef100e200f80a","target":"graph","created_at":"2026-05-18T02:30:09Z","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 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","authors_text":"Anand Seetharam, Bo Jiang, Don Towsley, Jim Kurose, Mostafa Dehghan, Ramesh Sitaraman, Theodoros Salonidis, Ting He","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-12-31T22:00:11Z","title":"On the Complexity of Optimal Routing and Content Caching in Heterogeneous Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00216","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:2b557f2c1b0f681135956f3b3659aaf170840eeb9adbb88244e361586c4c06be","target":"record","created_at":"2026-05-18T02:30:09Z","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":"8e731ce9088c674ff0f920b0815a78815973a3327b0f397bad08007155be4e39","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-12-31T22:00:11Z","title_canon_sha256":"548b10a1625b3e3dbc1cab09949e3209ef23f23aa7bcdc777ebd015df2ed0a4d"},"schema_version":"1.0","source":{"id":"1501.00216","kind":"arxiv","version":1}},"canonical_sha256":"90ff9e0cd00975811a0cb8df739e7702ca06bd31d45f146c723b8731ec95d73b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90ff9e0cd00975811a0cb8df739e7702ca06bd31d45f146c723b8731ec95d73b","first_computed_at":"2026-05-18T02:30:09.839242Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:09.839242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tP1qZuozy1EdAXu+U8Yr+RYV9QsxQkmAMEDSjSV/EEv9gzdYQLAV9/f6i8NcQQN337L60pEhQDOQNMG1H0QQBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:09.839692Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.00216","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b557f2c1b0f681135956f3b3659aaf170840eeb9adbb88244e361586c4c06be","sha256:ac7c2f9732fb18d3419b6b2d0a64f4674d5eaf3c2753654ee21ef100e200f80a"],"state_sha256":"7501f39b295d12eaba977d329585ee4dcb0f6e809c9ff443a4e1b004934f6b01"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B6xXHJphH7VdGfrdNyyxJo6gS+0iFgdbPcgwUYd4kbrgqnTEsdNnacpeHfYC/dXKV3NeQRnkHBDqxahVS7OhCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:09:55.426329Z","bundle_sha256":"046f623ebda44493ab67f423b3decd1c927cb8afb157cdd1fca72bedf562ddd7"}}