{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2W7KIXI63TMQGXKDXEYSMXJOQK","short_pith_number":"pith:2W7KIXI6","schema_version":"1.0","canonical_sha256":"d5bea45d1edcd9035d43b931265d2e82afd4b001f734129f82c36736ffb388d6","source":{"kind":"arxiv","id":"1501.03446","version":2},"attestation_state":"computed","paper":{"title":"Flexible Content Placement in Cache Networks using Reinforced Counters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Daniel S. Menasche, Edmundo de Souza e Silva, Guilherme Domingues, Rosa M. M. Leao","submitted_at":"2015-01-14T19:05:52Z","abstract_excerpt":"In this paper we study the problem of content placement in a cache network. We consider a network where routing of requests is based on random walks. Content placement is done using a novel mechanism referred to as reinforced counters. To each content we associate a counter, which is incremented every time the content is requested, and which is decremented at a fixed rate. We model and analyze this mechanism, tuning its parameters so as to achieve desired performance goals for a single cache or for a cache network. We also show that the optimal static content placement, without reinforced coun"},"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.03446","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-01-14T19:05:52Z","cross_cats_sorted":[],"title_canon_sha256":"c4968aa68756ceb15721c00fbf99ce341ec8a11603878b5a39c91236b6c6ca3e","abstract_canon_sha256":"8b6d32dc534a6c7cedc62bdeca5fbf35b73b102a4f791be3dedbbbf7026f2199"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:51.366381Z","signature_b64":"fTy6jwmWPbAgTo93LvZCTteUyBiJfkKqjuOWNT05RD+XbXUWMg1wV0TfTV69N7tftpg8GjSC4xAsz+/39YhJAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5bea45d1edcd9035d43b931265d2e82afd4b001f734129f82c36736ffb388d6","last_reissued_at":"2026-05-18T02:21:51.365693Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:51.365693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Flexible Content Placement in Cache Networks using Reinforced Counters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Daniel S. Menasche, Edmundo de Souza e Silva, Guilherme Domingues, Rosa M. M. Leao","submitted_at":"2015-01-14T19:05:52Z","abstract_excerpt":"In this paper we study the problem of content placement in a cache network. We consider a network where routing of requests is based on random walks. Content placement is done using a novel mechanism referred to as reinforced counters. To each content we associate a counter, which is incremented every time the content is requested, and which is decremented at a fixed rate. We model and analyze this mechanism, tuning its parameters so as to achieve desired performance goals for a single cache or for a cache network. We also show that the optimal static content placement, without reinforced coun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.03446","kind":"arxiv","version":2},"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.03446","created_at":"2026-05-18T02:21:51.365805+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.03446v2","created_at":"2026-05-18T02:21:51.365805+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03446","created_at":"2026-05-18T02:21:51.365805+00:00"},{"alias_kind":"pith_short_12","alias_value":"2W7KIXI63TMQ","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"2W7KIXI63TMQGXKD","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"2W7KIXI6","created_at":"2026-05-18T12:29:02.477457+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/2W7KIXI63TMQGXKDXEYSMXJOQK","json":"https://pith.science/pith/2W7KIXI63TMQGXKDXEYSMXJOQK.json","graph_json":"https://pith.science/api/pith-number/2W7KIXI63TMQGXKDXEYSMXJOQK/graph.json","events_json":"https://pith.science/api/pith-number/2W7KIXI63TMQGXKDXEYSMXJOQK/events.json","paper":"https://pith.science/paper/2W7KIXI6"},"agent_actions":{"view_html":"https://pith.science/pith/2W7KIXI63TMQGXKDXEYSMXJOQK","download_json":"https://pith.science/pith/2W7KIXI63TMQGXKDXEYSMXJOQK.json","view_paper":"https://pith.science/paper/2W7KIXI6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.03446&json=true","fetch_graph":"https://pith.science/api/pith-number/2W7KIXI63TMQGXKDXEYSMXJOQK/graph.json","fetch_events":"https://pith.science/api/pith-number/2W7KIXI63TMQGXKDXEYSMXJOQK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2W7KIXI63TMQGXKDXEYSMXJOQK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2W7KIXI63TMQGXKDXEYSMXJOQK/action/storage_attestation","attest_author":"https://pith.science/pith/2W7KIXI63TMQGXKDXEYSMXJOQK/action/author_attestation","sign_citation":"https://pith.science/pith/2W7KIXI63TMQGXKDXEYSMXJOQK/action/citation_signature","submit_replication":"https://pith.science/pith/2W7KIXI63TMQGXKDXEYSMXJOQK/action/replication_record"}},"created_at":"2026-05-18T02:21:51.365805+00:00","updated_at":"2026-05-18T02:21:51.365805+00:00"}