{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:BQMY7HCI4U4ZO2J3KIZANSDRLY","short_pith_number":"pith:BQMY7HCI","schema_version":"1.0","canonical_sha256":"0c198f9c48e53997693b523206c8715e370584a6ff7772d5ed0a288ca7b1f1ce","source":{"kind":"arxiv","id":"1511.01038","version":3},"attestation_state":"computed","paper":{"title":"Efficient Algorithms with Asymmetric Read and Write Costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guy E. Blelloch, Jeremy T. Fineman, Julian Shun, Phillip B. Gibbons, Yan Gu","submitted_at":"2015-11-03T19:18:55Z","abstract_excerpt":"In several emerging technologies for computer memory (main memory), the cost of reading is significantly cheaper than the cost of writing. Such asymmetry in memory costs poses a fundamentally different model from the RAM for algorithm design. In this paper we study lower and upper bounds for various problems under such asymmetric read and write costs. We consider both the case in which all but $O(1)$ memory has asymmetric cost, and the case of a small cache of symmetric memory. We model both cases using the $(M,\\omega)$-ARAM, in which there is a small (symmetric) memory of size $M$ and a large"},"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":"1511.01038","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-03T19:18:55Z","cross_cats_sorted":[],"title_canon_sha256":"7b4805c04150cb60dd8bb101f6348433ded569910f69b675245c94bfef16eee6","abstract_canon_sha256":"820d84ff98018f1d4668dcd8d0b7b609fbee38fb6e08c41be46278b148c4d974"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:51.080409Z","signature_b64":"PY4A5o5LLwfYuJY3UxRbgxPkv+S7RiDF4K48pGxLYQYYVs//3fAdo/yreCFA/jltTURJaZwxDJkjYlUHgN4rAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c198f9c48e53997693b523206c8715e370584a6ff7772d5ed0a288ca7b1f1ce","last_reissued_at":"2026-05-18T01:07:51.079856Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:51.079856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Algorithms with Asymmetric Read and Write Costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guy E. Blelloch, Jeremy T. Fineman, Julian Shun, Phillip B. Gibbons, Yan Gu","submitted_at":"2015-11-03T19:18:55Z","abstract_excerpt":"In several emerging technologies for computer memory (main memory), the cost of reading is significantly cheaper than the cost of writing. Such asymmetry in memory costs poses a fundamentally different model from the RAM for algorithm design. In this paper we study lower and upper bounds for various problems under such asymmetric read and write costs. We consider both the case in which all but $O(1)$ memory has asymmetric cost, and the case of a small cache of symmetric memory. We model both cases using the $(M,\\omega)$-ARAM, in which there is a small (symmetric) memory of size $M$ and a large"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01038","kind":"arxiv","version":3},"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":"1511.01038","created_at":"2026-05-18T01:07:51.079953+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.01038v3","created_at":"2026-05-18T01:07:51.079953+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01038","created_at":"2026-05-18T01:07:51.079953+00:00"},{"alias_kind":"pith_short_12","alias_value":"BQMY7HCI4U4Z","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BQMY7HCI4U4ZO2J3","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BQMY7HCI","created_at":"2026-05-18T12:29:14.074870+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/BQMY7HCI4U4ZO2J3KIZANSDRLY","json":"https://pith.science/pith/BQMY7HCI4U4ZO2J3KIZANSDRLY.json","graph_json":"https://pith.science/api/pith-number/BQMY7HCI4U4ZO2J3KIZANSDRLY/graph.json","events_json":"https://pith.science/api/pith-number/BQMY7HCI4U4ZO2J3KIZANSDRLY/events.json","paper":"https://pith.science/paper/BQMY7HCI"},"agent_actions":{"view_html":"https://pith.science/pith/BQMY7HCI4U4ZO2J3KIZANSDRLY","download_json":"https://pith.science/pith/BQMY7HCI4U4ZO2J3KIZANSDRLY.json","view_paper":"https://pith.science/paper/BQMY7HCI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.01038&json=true","fetch_graph":"https://pith.science/api/pith-number/BQMY7HCI4U4ZO2J3KIZANSDRLY/graph.json","fetch_events":"https://pith.science/api/pith-number/BQMY7HCI4U4ZO2J3KIZANSDRLY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BQMY7HCI4U4ZO2J3KIZANSDRLY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BQMY7HCI4U4ZO2J3KIZANSDRLY/action/storage_attestation","attest_author":"https://pith.science/pith/BQMY7HCI4U4ZO2J3KIZANSDRLY/action/author_attestation","sign_citation":"https://pith.science/pith/BQMY7HCI4U4ZO2J3KIZANSDRLY/action/citation_signature","submit_replication":"https://pith.science/pith/BQMY7HCI4U4ZO2J3KIZANSDRLY/action/replication_record"}},"created_at":"2026-05-18T01:07:51.079953+00:00","updated_at":"2026-05-18T01:07:51.079953+00:00"}