{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7JBKVZNRBMH5KAHUHUPRZUN2ZJ","short_pith_number":"pith:7JBKVZNR","schema_version":"1.0","canonical_sha256":"fa42aae5b10b0fd500f43d1f1cd1baca6944e4cb87b25961f06b2463f558cc79","source":{"kind":"arxiv","id":"1402.5987","version":1},"attestation_state":"computed","paper":{"title":"Exact Analysis of TTL Cache Networks: The Case of Caching Policies driven by Stopping Times","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.PF","authors_text":"Daniel S. Berger, Florin Ciucu, Philipp Gland, Sahil Singla","submitted_at":"2014-02-24T21:19:39Z","abstract_excerpt":"TTL caching models have recently regained significant research interest, largely due to their ability to fit popular caching policies such as LRU. This paper advances the state-of-the-art analysis of TTL-based cache networks by developing two exact methods with orthogonal generality and computational complexity. The first method generalizes existing results for line networks under renewal requests to the broad class of caching policies whereby evictions are driven by stopping times. The obtained results are further generalized, using the second method, to feedforward networks with Markov arriv"},"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":"1402.5987","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2014-02-24T21:19:39Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"8d2ba2d82b3f13c6d8aa306a56edda73add24e5ad8dcbaf09f2a1abdd193e300","abstract_canon_sha256":"33ab7b120502ce00bb757476b7d39e44ae2cf98f9f12ff290bd15000b699f887"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:51.913311Z","signature_b64":"Hea/7OJmll9fFmwP6sxTWWVETGMLN7Jxx2F5TkTLb2UVKAx9Q7AQDcNBVE7Wa4O4PVQJIXGqh6wUA7IhzMuUAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa42aae5b10b0fd500f43d1f1cd1baca6944e4cb87b25961f06b2463f558cc79","last_reissued_at":"2026-05-18T02:57:51.912801Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:51.912801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact Analysis of TTL Cache Networks: The Case of Caching Policies driven by Stopping Times","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.PF","authors_text":"Daniel S. Berger, Florin Ciucu, Philipp Gland, Sahil Singla","submitted_at":"2014-02-24T21:19:39Z","abstract_excerpt":"TTL caching models have recently regained significant research interest, largely due to their ability to fit popular caching policies such as LRU. This paper advances the state-of-the-art analysis of TTL-based cache networks by developing two exact methods with orthogonal generality and computational complexity. The first method generalizes existing results for line networks under renewal requests to the broad class of caching policies whereby evictions are driven by stopping times. The obtained results are further generalized, using the second method, to feedforward networks with Markov arriv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5987","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":"1402.5987","created_at":"2026-05-18T02:57:51.912873+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.5987v1","created_at":"2026-05-18T02:57:51.912873+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5987","created_at":"2026-05-18T02:57:51.912873+00:00"},{"alias_kind":"pith_short_12","alias_value":"7JBKVZNRBMH5","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"7JBKVZNRBMH5KAHU","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"7JBKVZNR","created_at":"2026-05-18T12:28:19.803747+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/7JBKVZNRBMH5KAHUHUPRZUN2ZJ","json":"https://pith.science/pith/7JBKVZNRBMH5KAHUHUPRZUN2ZJ.json","graph_json":"https://pith.science/api/pith-number/7JBKVZNRBMH5KAHUHUPRZUN2ZJ/graph.json","events_json":"https://pith.science/api/pith-number/7JBKVZNRBMH5KAHUHUPRZUN2ZJ/events.json","paper":"https://pith.science/paper/7JBKVZNR"},"agent_actions":{"view_html":"https://pith.science/pith/7JBKVZNRBMH5KAHUHUPRZUN2ZJ","download_json":"https://pith.science/pith/7JBKVZNRBMH5KAHUHUPRZUN2ZJ.json","view_paper":"https://pith.science/paper/7JBKVZNR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.5987&json=true","fetch_graph":"https://pith.science/api/pith-number/7JBKVZNRBMH5KAHUHUPRZUN2ZJ/graph.json","fetch_events":"https://pith.science/api/pith-number/7JBKVZNRBMH5KAHUHUPRZUN2ZJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7JBKVZNRBMH5KAHUHUPRZUN2ZJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7JBKVZNRBMH5KAHUHUPRZUN2ZJ/action/storage_attestation","attest_author":"https://pith.science/pith/7JBKVZNRBMH5KAHUHUPRZUN2ZJ/action/author_attestation","sign_citation":"https://pith.science/pith/7JBKVZNRBMH5KAHUHUPRZUN2ZJ/action/citation_signature","submit_replication":"https://pith.science/pith/7JBKVZNRBMH5KAHUHUPRZUN2ZJ/action/replication_record"}},"created_at":"2026-05-18T02:57:51.912873+00:00","updated_at":"2026-05-18T02:57:51.912873+00:00"}