{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ZFPVZ2B6VC7ZF7M3JPYMDWK623","short_pith_number":"pith:ZFPVZ2B6","schema_version":"1.0","canonical_sha256":"c95f5ce83ea8bf92fd9b4bf0c1d95ed6df3aba9982f7814db2bd89527974018f","source":{"kind":"arxiv","id":"1606.05034","version":1},"attestation_state":"computed","paper":{"title":"Search and Placement in Tiered Cache Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Daniel S. Menasch\\'e, Don Towsley, Edmundo de Souza e Silva, Guilherme Domingues, Rosa M. M. Le\\~ao","submitted_at":"2016-06-16T03:09:39Z","abstract_excerpt":"Content distribution networks have been extremely successful in today's Internet. Despite their success, there are still a number of scalability and performance challenges that motivate clean slate solutions for content dissemination, such as content centric networking. In this paper, we address two of the fundamental problems faced by any content dissemination system: content search and content placement.\n  We consider a multi-tiered, multi-domain hierarchical system wherein random walks are used to cope with the tradeoff between exploitation of known paths towards custodians versus opportuni"},"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":"1606.05034","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-06-16T03:09:39Z","cross_cats_sorted":[],"title_canon_sha256":"f8096c534675835c204af5dfbe1fe1e3539a49a6fb32e33082fc9d9b4dfe0d51","abstract_canon_sha256":"bc2092b274ccc94b03eaf54f799aca7007c39afddedc983a66c9587cc14dde63"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:56.154963Z","signature_b64":"V9j8AMowXlWOeDWOzBjQDkYdD472e9W9HyeEsOjnEInO2nADLHT0nHEm+6Xsa3GNutkOFmxLEAx6DPxkEDM4Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c95f5ce83ea8bf92fd9b4bf0c1d95ed6df3aba9982f7814db2bd89527974018f","last_reissued_at":"2026-05-17T23:51:56.154366Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:56.154366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Search and Placement in Tiered Cache Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Daniel S. Menasch\\'e, Don Towsley, Edmundo de Souza e Silva, Guilherme Domingues, Rosa M. M. Le\\~ao","submitted_at":"2016-06-16T03:09:39Z","abstract_excerpt":"Content distribution networks have been extremely successful in today's Internet. Despite their success, there are still a number of scalability and performance challenges that motivate clean slate solutions for content dissemination, such as content centric networking. In this paper, we address two of the fundamental problems faced by any content dissemination system: content search and content placement.\n  We consider a multi-tiered, multi-domain hierarchical system wherein random walks are used to cope with the tradeoff between exploitation of known paths towards custodians versus opportuni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05034","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":"1606.05034","created_at":"2026-05-17T23:51:56.154456+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.05034v1","created_at":"2026-05-17T23:51:56.154456+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05034","created_at":"2026-05-17T23:51:56.154456+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZFPVZ2B6VC7Z","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZFPVZ2B6VC7ZF7M3","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZFPVZ2B6","created_at":"2026-05-18T12:30:53.716459+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/ZFPVZ2B6VC7ZF7M3JPYMDWK623","json":"https://pith.science/pith/ZFPVZ2B6VC7ZF7M3JPYMDWK623.json","graph_json":"https://pith.science/api/pith-number/ZFPVZ2B6VC7ZF7M3JPYMDWK623/graph.json","events_json":"https://pith.science/api/pith-number/ZFPVZ2B6VC7ZF7M3JPYMDWK623/events.json","paper":"https://pith.science/paper/ZFPVZ2B6"},"agent_actions":{"view_html":"https://pith.science/pith/ZFPVZ2B6VC7ZF7M3JPYMDWK623","download_json":"https://pith.science/pith/ZFPVZ2B6VC7ZF7M3JPYMDWK623.json","view_paper":"https://pith.science/paper/ZFPVZ2B6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.05034&json=true","fetch_graph":"https://pith.science/api/pith-number/ZFPVZ2B6VC7ZF7M3JPYMDWK623/graph.json","fetch_events":"https://pith.science/api/pith-number/ZFPVZ2B6VC7ZF7M3JPYMDWK623/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZFPVZ2B6VC7ZF7M3JPYMDWK623/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZFPVZ2B6VC7ZF7M3JPYMDWK623/action/storage_attestation","attest_author":"https://pith.science/pith/ZFPVZ2B6VC7ZF7M3JPYMDWK623/action/author_attestation","sign_citation":"https://pith.science/pith/ZFPVZ2B6VC7ZF7M3JPYMDWK623/action/citation_signature","submit_replication":"https://pith.science/pith/ZFPVZ2B6VC7ZF7M3JPYMDWK623/action/replication_record"}},"created_at":"2026-05-17T23:51:56.154456+00:00","updated_at":"2026-05-17T23:51:56.154456+00:00"}