{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:JUBFVLEEERIWXFOPUULCSFNRT5","short_pith_number":"pith:JUBFVLEE","schema_version":"1.0","canonical_sha256":"4d025aac8424516b95cfa5162915b19f6c07f9a47b5b531ce71b23439d37dddd","source":{"kind":"arxiv","id":"2001.01653","version":1},"attestation_state":"computed","paper":{"title":"A Fast Analytical Model of Fully Associative Caches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Laurin Brandner, Tobias Grosser, Tobias Gysi, Torsten Hoefler","submitted_at":"2020-01-06T16:35:46Z","abstract_excerpt":"While the cost of computation is an easy to understand local property, the cost of data movement on cached architectures depends on global state, does not compose, and is hard to predict. As a result, programmers often fail to consider the cost of data movement. Existing cache models and simulators provide the missing information but are computationally expensive. We present a lightweight cache model for fully associative caches with least recently used (LRU) replacement policy that gives fast and accurate results. We count the cache misses without explicit enumeration of all memory accesses b"},"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":"2001.01653","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2020-01-06T16:35:46Z","cross_cats_sorted":[],"title_canon_sha256":"ab47d3ee00b5a61032bd1d96fcfb77cca249f507b3fd61694c0c06f3e3207bb2","abstract_canon_sha256":"32c9323d1cdf7176daf77ad717d9c6e49388b96408ca3b7b9d23ce7d73cff8fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:29:48.750129Z","signature_b64":"yZypnp3Qy1Tu+Z9h103jXsbFbslIHOVesp7m4/JsBCwDLzwFS+Dw+8RIB534jocrqYPBVTLqBO1WxtQrmQ2rCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d025aac8424516b95cfa5162915b19f6c07f9a47b5b531ce71b23439d37dddd","last_reissued_at":"2026-07-05T00:29:48.749757Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:29:48.749757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast Analytical Model of Fully Associative Caches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Laurin Brandner, Tobias Grosser, Tobias Gysi, Torsten Hoefler","submitted_at":"2020-01-06T16:35:46Z","abstract_excerpt":"While the cost of computation is an easy to understand local property, the cost of data movement on cached architectures depends on global state, does not compose, and is hard to predict. As a result, programmers often fail to consider the cost of data movement. Existing cache models and simulators provide the missing information but are computationally expensive. We present a lightweight cache model for fully associative caches with least recently used (LRU) replacement policy that gives fast and accurate results. We count the cache misses without explicit enumeration of all memory accesses b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.01653","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2001.01653/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2001.01653","created_at":"2026-07-05T00:29:48.749816+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.01653v1","created_at":"2026-07-05T00:29:48.749816+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.01653","created_at":"2026-07-05T00:29:48.749816+00:00"},{"alias_kind":"pith_short_12","alias_value":"JUBFVLEEERIW","created_at":"2026-07-05T00:29:48.749816+00:00"},{"alias_kind":"pith_short_16","alias_value":"JUBFVLEEERIWXFOP","created_at":"2026-07-05T00:29:48.749816+00:00"},{"alias_kind":"pith_short_8","alias_value":"JUBFVLEE","created_at":"2026-07-05T00:29:48.749816+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/JUBFVLEEERIWXFOPUULCSFNRT5","json":"https://pith.science/pith/JUBFVLEEERIWXFOPUULCSFNRT5.json","graph_json":"https://pith.science/api/pith-number/JUBFVLEEERIWXFOPUULCSFNRT5/graph.json","events_json":"https://pith.science/api/pith-number/JUBFVLEEERIWXFOPUULCSFNRT5/events.json","paper":"https://pith.science/paper/JUBFVLEE"},"agent_actions":{"view_html":"https://pith.science/pith/JUBFVLEEERIWXFOPUULCSFNRT5","download_json":"https://pith.science/pith/JUBFVLEEERIWXFOPUULCSFNRT5.json","view_paper":"https://pith.science/paper/JUBFVLEE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.01653&json=true","fetch_graph":"https://pith.science/api/pith-number/JUBFVLEEERIWXFOPUULCSFNRT5/graph.json","fetch_events":"https://pith.science/api/pith-number/JUBFVLEEERIWXFOPUULCSFNRT5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JUBFVLEEERIWXFOPUULCSFNRT5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JUBFVLEEERIWXFOPUULCSFNRT5/action/storage_attestation","attest_author":"https://pith.science/pith/JUBFVLEEERIWXFOPUULCSFNRT5/action/author_attestation","sign_citation":"https://pith.science/pith/JUBFVLEEERIWXFOPUULCSFNRT5/action/citation_signature","submit_replication":"https://pith.science/pith/JUBFVLEEERIWXFOPUULCSFNRT5/action/replication_record"}},"created_at":"2026-07-05T00:29:48.749816+00:00","updated_at":"2026-07-05T00:29:48.749816+00:00"}