{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:F3YR6UM33MJJ44RPLNEJTW7KI2","short_pith_number":"pith:F3YR6UM3","schema_version":"1.0","canonical_sha256":"2ef11f519bdb129e722f5b4899dbea46b98c57370a5d32c2c950f3c7abb66c78","source":{"kind":"arxiv","id":"1404.3577","version":1},"attestation_state":"computed","paper":{"title":"Cache-Oblivious VAT-Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kurt Mehlhorn, Patrick Nicholson, Tomasz Jurkiewicz","submitted_at":"2014-04-14T13:46:43Z","abstract_excerpt":"The VAT-model (virtual address translation model) extends the EM-model (external memory model) and takes the cost of address translation in virtual memories into account. In this model, the cost of a single memory access may be logarithmic in the largest address used. We show that the VAT-cost of cache-oblivious algorithms is only by a constant factor larger than their EM-cost; this requires a somewhat more stringent tall cache assumption as for the EM-model."},"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":"1404.3577","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-14T13:46:43Z","cross_cats_sorted":[],"title_canon_sha256":"17c5cd616f5a40f6eb72efaba2d61fb5bb40654adaa99a231080196f9e9d4b45","abstract_canon_sha256":"8798839b3fcaa9f7b82e6822fee47841a37ee624caa602e941514560c34f476f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:14.960892Z","signature_b64":"4u2LDdEuu5TU4zLDsVg9xiGhZZxUt+GfWkyUMuYR4Wr54G8govEaVUyQ9t0Fc2yjIEFLBi+K7/zZqO6cT+JICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ef11f519bdb129e722f5b4899dbea46b98c57370a5d32c2c950f3c7abb66c78","last_reissued_at":"2026-05-18T02:54:14.960460Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:14.960460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cache-Oblivious VAT-Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kurt Mehlhorn, Patrick Nicholson, Tomasz Jurkiewicz","submitted_at":"2014-04-14T13:46:43Z","abstract_excerpt":"The VAT-model (virtual address translation model) extends the EM-model (external memory model) and takes the cost of address translation in virtual memories into account. In this model, the cost of a single memory access may be logarithmic in the largest address used. We show that the VAT-cost of cache-oblivious algorithms is only by a constant factor larger than their EM-cost; this requires a somewhat more stringent tall cache assumption as for the EM-model."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3577","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":"1404.3577","created_at":"2026-05-18T02:54:14.960517+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.3577v1","created_at":"2026-05-18T02:54:14.960517+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3577","created_at":"2026-05-18T02:54:14.960517+00:00"},{"alias_kind":"pith_short_12","alias_value":"F3YR6UM33MJJ","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"F3YR6UM33MJJ44RP","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"F3YR6UM3","created_at":"2026-05-18T12:28:28.263976+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/F3YR6UM33MJJ44RPLNEJTW7KI2","json":"https://pith.science/pith/F3YR6UM33MJJ44RPLNEJTW7KI2.json","graph_json":"https://pith.science/api/pith-number/F3YR6UM33MJJ44RPLNEJTW7KI2/graph.json","events_json":"https://pith.science/api/pith-number/F3YR6UM33MJJ44RPLNEJTW7KI2/events.json","paper":"https://pith.science/paper/F3YR6UM3"},"agent_actions":{"view_html":"https://pith.science/pith/F3YR6UM33MJJ44RPLNEJTW7KI2","download_json":"https://pith.science/pith/F3YR6UM33MJJ44RPLNEJTW7KI2.json","view_paper":"https://pith.science/paper/F3YR6UM3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.3577&json=true","fetch_graph":"https://pith.science/api/pith-number/F3YR6UM33MJJ44RPLNEJTW7KI2/graph.json","fetch_events":"https://pith.science/api/pith-number/F3YR6UM33MJJ44RPLNEJTW7KI2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F3YR6UM33MJJ44RPLNEJTW7KI2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F3YR6UM33MJJ44RPLNEJTW7KI2/action/storage_attestation","attest_author":"https://pith.science/pith/F3YR6UM33MJJ44RPLNEJTW7KI2/action/author_attestation","sign_citation":"https://pith.science/pith/F3YR6UM33MJJ44RPLNEJTW7KI2/action/citation_signature","submit_replication":"https://pith.science/pith/F3YR6UM33MJJ44RPLNEJTW7KI2/action/replication_record"}},"created_at":"2026-05-18T02:54:14.960517+00:00","updated_at":"2026-05-18T02:54:14.960517+00:00"}