{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FN7QOW3XFMBEPALYR66X7RHVRN","short_pith_number":"pith:FN7QOW3X","schema_version":"1.0","canonical_sha256":"2b7f075b772b024781788fbd7fc4f58b75dc68ee024c4b5107aa71a193ee8ae5","source":{"kind":"arxiv","id":"1801.04618","version":2},"attestation_state":"computed","paper":{"title":"Hierarchical Memory Management for Mutable State","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.PL","authors_text":"Adrien Guatto, Matthew Fluet, Ram Raghunathan, Sam Westrick, Umut Acar","submitted_at":"2018-01-14T22:25:44Z","abstract_excerpt":"It is well known that modern functional programming languages are naturally amenable to parallel programming. Achieving efficient parallelism using functional languages, however, remains difficult. Perhaps the most important reason for this is their lack of support for efficient in-place updates, i.e., mutation, which is important for the implementation of both parallel algorithms and the run-time system services (e.g., schedulers and synchronization primitives) used to execute them.\n  In this paper, we propose techniques for efficient mutation in parallel functional languages. To this end, we"},"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":"1801.04618","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-01-14T22:25:44Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"12d1c0734bb42f34a1cab78567728d174749b85b59e61bcc948e163e132f7d53","abstract_canon_sha256":"dc635ba04a6bfa42dd335a5844fccd580c9dbaee32fc9d75e55aa3c05e96d34a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:04.908008Z","signature_b64":"M2kwjGMgm2wnNNiaKJMraLkBsQsJfZMjNGHyl/Yhj6Y344XjILV3XI0w5qrGjSpttJ6oSkcrmMuVPzxGQj+VCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b7f075b772b024781788fbd7fc4f58b75dc68ee024c4b5107aa71a193ee8ae5","last_reissued_at":"2026-05-18T00:23:04.907179Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:04.907179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchical Memory Management for Mutable State","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.PL","authors_text":"Adrien Guatto, Matthew Fluet, Ram Raghunathan, Sam Westrick, Umut Acar","submitted_at":"2018-01-14T22:25:44Z","abstract_excerpt":"It is well known that modern functional programming languages are naturally amenable to parallel programming. Achieving efficient parallelism using functional languages, however, remains difficult. Perhaps the most important reason for this is their lack of support for efficient in-place updates, i.e., mutation, which is important for the implementation of both parallel algorithms and the run-time system services (e.g., schedulers and synchronization primitives) used to execute them.\n  In this paper, we propose techniques for efficient mutation in parallel functional languages. To this end, we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04618","kind":"arxiv","version":2},"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":"1801.04618","created_at":"2026-05-18T00:23:04.907339+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.04618v2","created_at":"2026-05-18T00:23:04.907339+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04618","created_at":"2026-05-18T00:23:04.907339+00:00"},{"alias_kind":"pith_short_12","alias_value":"FN7QOW3XFMBE","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"FN7QOW3XFMBEPALY","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"FN7QOW3X","created_at":"2026-05-18T12:32:22.470017+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/FN7QOW3XFMBEPALYR66X7RHVRN","json":"https://pith.science/pith/FN7QOW3XFMBEPALYR66X7RHVRN.json","graph_json":"https://pith.science/api/pith-number/FN7QOW3XFMBEPALYR66X7RHVRN/graph.json","events_json":"https://pith.science/api/pith-number/FN7QOW3XFMBEPALYR66X7RHVRN/events.json","paper":"https://pith.science/paper/FN7QOW3X"},"agent_actions":{"view_html":"https://pith.science/pith/FN7QOW3XFMBEPALYR66X7RHVRN","download_json":"https://pith.science/pith/FN7QOW3XFMBEPALYR66X7RHVRN.json","view_paper":"https://pith.science/paper/FN7QOW3X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.04618&json=true","fetch_graph":"https://pith.science/api/pith-number/FN7QOW3XFMBEPALYR66X7RHVRN/graph.json","fetch_events":"https://pith.science/api/pith-number/FN7QOW3XFMBEPALYR66X7RHVRN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FN7QOW3XFMBEPALYR66X7RHVRN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FN7QOW3XFMBEPALYR66X7RHVRN/action/storage_attestation","attest_author":"https://pith.science/pith/FN7QOW3XFMBEPALYR66X7RHVRN/action/author_attestation","sign_citation":"https://pith.science/pith/FN7QOW3XFMBEPALYR66X7RHVRN/action/citation_signature","submit_replication":"https://pith.science/pith/FN7QOW3XFMBEPALYR66X7RHVRN/action/replication_record"}},"created_at":"2026-05-18T00:23:04.907339+00:00","updated_at":"2026-05-18T00:23:04.907339+00:00"}