{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:S3VSC2NZJD5YD6723GU55OWMDZ","short_pith_number":"pith:S3VSC2NZ","schema_version":"1.0","canonical_sha256":"96eb2169b948fb81fbfad9a9debacc1e6940f7a2b96e6d9beda00236bf5bc751","source":{"kind":"arxiv","id":"1806.10370","version":1},"attestation_state":"computed","paper":{"title":"Algorithmic Building Blocks for Asymmetric Memories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guy E. Blelloch, Yan Gu, Yihan Sun","submitted_at":"2018-06-27T09:40:04Z","abstract_excerpt":"The future of main memory appears to lie in the direction of new non-volatile memory technologies that provide strong capacity-to-performance ratios, but have write operations that are much more expensive than reads in terms of energy, bandwidth, and latency. This asymmetry can have a significant effect on algorithm design, and in many cases it is possible to reduce writes at the cost of reads. In this paper, we study which algorithmic techniques are useful in designing practical write-efficient algorithms. We focus on several fundamental algorithmic building blocks including unordered set/map"},"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":"1806.10370","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-27T09:40:04Z","cross_cats_sorted":[],"title_canon_sha256":"fa86b9e144818372d85c4be0c3ca99d768fd071fbcd25d9dcce3563634ee4974","abstract_canon_sha256":"e734320510daf07190b69cee2805309e47a235863835f2e26cb269c26401dd9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:12.643711Z","signature_b64":"oKbL6FSMtmIvuc0Ibi2KsqzQtX6elA6JvUVU1Jjhjsc7XhEx7vrd+BlA9jV9T1oEWQbl/fb1H6xqZ9+iCR2JDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96eb2169b948fb81fbfad9a9debacc1e6940f7a2b96e6d9beda00236bf5bc751","last_reissued_at":"2026-05-18T00:12:12.643015Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:12.643015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithmic Building Blocks for Asymmetric Memories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guy E. Blelloch, Yan Gu, Yihan Sun","submitted_at":"2018-06-27T09:40:04Z","abstract_excerpt":"The future of main memory appears to lie in the direction of new non-volatile memory technologies that provide strong capacity-to-performance ratios, but have write operations that are much more expensive than reads in terms of energy, bandwidth, and latency. This asymmetry can have a significant effect on algorithm design, and in many cases it is possible to reduce writes at the cost of reads. In this paper, we study which algorithmic techniques are useful in designing practical write-efficient algorithms. We focus on several fundamental algorithmic building blocks including unordered set/map"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10370","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":"1806.10370","created_at":"2026-05-18T00:12:12.643115+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.10370v1","created_at":"2026-05-18T00:12:12.643115+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10370","created_at":"2026-05-18T00:12:12.643115+00:00"},{"alias_kind":"pith_short_12","alias_value":"S3VSC2NZJD5Y","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"S3VSC2NZJD5YD672","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"S3VSC2NZ","created_at":"2026-05-18T12:32:50.500415+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/S3VSC2NZJD5YD6723GU55OWMDZ","json":"https://pith.science/pith/S3VSC2NZJD5YD6723GU55OWMDZ.json","graph_json":"https://pith.science/api/pith-number/S3VSC2NZJD5YD6723GU55OWMDZ/graph.json","events_json":"https://pith.science/api/pith-number/S3VSC2NZJD5YD6723GU55OWMDZ/events.json","paper":"https://pith.science/paper/S3VSC2NZ"},"agent_actions":{"view_html":"https://pith.science/pith/S3VSC2NZJD5YD6723GU55OWMDZ","download_json":"https://pith.science/pith/S3VSC2NZJD5YD6723GU55OWMDZ.json","view_paper":"https://pith.science/paper/S3VSC2NZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.10370&json=true","fetch_graph":"https://pith.science/api/pith-number/S3VSC2NZJD5YD6723GU55OWMDZ/graph.json","fetch_events":"https://pith.science/api/pith-number/S3VSC2NZJD5YD6723GU55OWMDZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S3VSC2NZJD5YD6723GU55OWMDZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S3VSC2NZJD5YD6723GU55OWMDZ/action/storage_attestation","attest_author":"https://pith.science/pith/S3VSC2NZJD5YD6723GU55OWMDZ/action/author_attestation","sign_citation":"https://pith.science/pith/S3VSC2NZJD5YD6723GU55OWMDZ/action/citation_signature","submit_replication":"https://pith.science/pith/S3VSC2NZJD5YD6723GU55OWMDZ/action/replication_record"}},"created_at":"2026-05-18T00:12:12.643115+00:00","updated_at":"2026-05-18T00:12:12.643115+00:00"}