{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2W7KIXI63TMQGXKDXEYSMXJOQK","short_pith_number":"pith:2W7KIXI6","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"},"canonical_sha256":"d5bea45d1edcd9035d43b931265d2e82afd4b001f734129f82c36736ffb388d6","source":{"kind":"arxiv","id":"1501.03446","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.03446","created_at":"2026-05-18T02:21:51Z"},{"alias_kind":"arxiv_version","alias_value":"1501.03446v2","created_at":"2026-05-18T02:21:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03446","created_at":"2026-05-18T02:21:51Z"},{"alias_kind":"pith_short_12","alias_value":"2W7KIXI63TMQ","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2W7KIXI63TMQGXKD","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2W7KIXI6","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2W7KIXI63TMQGXKDXEYSMXJOQK","target":"record","payload":{"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"},"canonical_sha256":"d5bea45d1edcd9035d43b931265d2e82afd4b001f734129f82c36736ffb388d6","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"},"source_kind":"arxiv","source_id":"1501.03446","source_version":2,"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:21:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ILEX/K116DtJ/z8vf/0GAbHcYIfOJARnE4/kf25ad+pgc3jSRkerwrZ8vv15Qn007SyDvPo4SQkMOH/o12p4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:57:00.356904Z"},"content_sha256":"f51018d2c9a85c6de1d0420f751947e1aae9b97a597d843f06e5398ce337bf72","schema_version":"1.0","event_id":"sha256:f51018d2c9a85c6de1d0420f751947e1aae9b97a597d843f06e5398ce337bf72"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2W7KIXI63TMQGXKDXEYSMXJOQK","target":"graph","payload":{"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"},"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:21:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+D/GFXTIy6Ik5JoefWAVkKMh3lpkO/VyWsOnFAamyxzbAr1GtDILiUl078lFnR/OofWAeh4/7vyh8Vd9mNaiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:57:00.357563Z"},"content_sha256":"3bbfd73bc62ef9e2099f2f8017df38ab9ab790bb275ac8bd2c9abedb70d91fbb","schema_version":"1.0","event_id":"sha256:3bbfd73bc62ef9e2099f2f8017df38ab9ab790bb275ac8bd2c9abedb70d91fbb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2W7KIXI63TMQGXKDXEYSMXJOQK/bundle.json","state_url":"https://pith.science/pith/2W7KIXI63TMQGXKDXEYSMXJOQK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2W7KIXI63TMQGXKDXEYSMXJOQK/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-02T22:57:00Z","links":{"resolver":"https://pith.science/pith/2W7KIXI63TMQGXKDXEYSMXJOQK","bundle":"https://pith.science/pith/2W7KIXI63TMQGXKDXEYSMXJOQK/bundle.json","state":"https://pith.science/pith/2W7KIXI63TMQGXKDXEYSMXJOQK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2W7KIXI63TMQGXKDXEYSMXJOQK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2W7KIXI63TMQGXKDXEYSMXJOQK","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":"8b6d32dc534a6c7cedc62bdeca5fbf35b73b102a4f791be3dedbbbf7026f2199","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-01-14T19:05:52Z","title_canon_sha256":"c4968aa68756ceb15721c00fbf99ce341ec8a11603878b5a39c91236b6c6ca3e"},"schema_version":"1.0","source":{"id":"1501.03446","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.03446","created_at":"2026-05-18T02:21:51Z"},{"alias_kind":"arxiv_version","alias_value":"1501.03446v2","created_at":"2026-05-18T02:21:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03446","created_at":"2026-05-18T02:21:51Z"},{"alias_kind":"pith_short_12","alias_value":"2W7KIXI63TMQ","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2W7KIXI63TMQGXKD","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2W7KIXI6","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:3bbfd73bc62ef9e2099f2f8017df38ab9ab790bb275ac8bd2c9abedb70d91fbb","target":"graph","created_at":"2026-05-18T02:21:51Z","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":"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","authors_text":"Daniel S. Menasche, Edmundo de Souza e Silva, Guilherme Domingues, Rosa M. M. Leao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-01-14T19:05:52Z","title":"Flexible Content Placement in Cache Networks using Reinforced Counters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.03446","kind":"arxiv","version":2},"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:f51018d2c9a85c6de1d0420f751947e1aae9b97a597d843f06e5398ce337bf72","target":"record","created_at":"2026-05-18T02:21:51Z","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":"8b6d32dc534a6c7cedc62bdeca5fbf35b73b102a4f791be3dedbbbf7026f2199","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-01-14T19:05:52Z","title_canon_sha256":"c4968aa68756ceb15721c00fbf99ce341ec8a11603878b5a39c91236b6c6ca3e"},"schema_version":"1.0","source":{"id":"1501.03446","kind":"arxiv","version":2}},"canonical_sha256":"d5bea45d1edcd9035d43b931265d2e82afd4b001f734129f82c36736ffb388d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5bea45d1edcd9035d43b931265d2e82afd4b001f734129f82c36736ffb388d6","first_computed_at":"2026-05-18T02:21:51.365693Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:51.365693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fTy6jwmWPbAgTo93LvZCTteUyBiJfkKqjuOWNT05RD+XbXUWMg1wV0TfTV69N7tftpg8GjSC4xAsz+/39YhJAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:51.366381Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.03446","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f51018d2c9a85c6de1d0420f751947e1aae9b97a597d843f06e5398ce337bf72","sha256:3bbfd73bc62ef9e2099f2f8017df38ab9ab790bb275ac8bd2c9abedb70d91fbb"],"state_sha256":"2ceb545fed7187fa84aff11accf54db3adea995d132265ea688c6c70860fa925"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rn1JYmXE/+4q5GiY4+Ihah+RR4K/n83O2M90MB/bTvs0x9arEL+CesbAzwLzkefY8ByBkcf/gbUDafki14LlDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:57:00.360521Z","bundle_sha256":"d48dac2c407e01922ec589c5143ee1662b80da145ab58473d97d09421cf9fa07"}}