{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:Y4LZ47HFY32GKNEGDX3FBKUYNL","short_pith_number":"pith:Y4LZ47HF","schema_version":"1.0","canonical_sha256":"c7179e7ce5c6f46534861df650aa986aff99c32d3edc589db73c4c852e804c9c","source":{"kind":"arxiv","id":"1207.2017","version":1},"attestation_state":"computed","paper":{"title":"dup -- Explicit un-sharing in Haskell","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Joachim Breitner","submitted_at":"2012-07-09T12:05:25Z","abstract_excerpt":"We propose two operations to prevent sharing in Haskell that do not require modifying the data generating code, demonstrate their use and usefulness, and compare them to other approaches to preventing sharing. Our claims are supported by a formal semantics and a prototype implementation."},"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":"1207.2017","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2012-07-09T12:05:25Z","cross_cats_sorted":[],"title_canon_sha256":"8bbcf361a3a6ee9c9e52a11ac6a5281933cbc64a8007fac52eca3981421f6e5d","abstract_canon_sha256":"d1fc160694f7e3100795e748f911adad1d11bf9da63147d47204892458b0d01a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:26.275625Z","signature_b64":"UL0iIhy/wMlvN/fvbMXjj9ckrJJrOXipoEqMkI+k+i0dGeaJTJpDCAJIDFDS6JGYNNIc+DPyi3MOR32kRWoABQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7179e7ce5c6f46534861df650aa986aff99c32d3edc589db73c4c852e804c9c","last_reissued_at":"2026-05-18T03:51:26.275114Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:26.275114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"dup -- Explicit un-sharing in Haskell","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Joachim Breitner","submitted_at":"2012-07-09T12:05:25Z","abstract_excerpt":"We propose two operations to prevent sharing in Haskell that do not require modifying the data generating code, demonstrate their use and usefulness, and compare them to other approaches to preventing sharing. Our claims are supported by a formal semantics and a prototype implementation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2017","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":"1207.2017","created_at":"2026-05-18T03:51:26.275186+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.2017v1","created_at":"2026-05-18T03:51:26.275186+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2017","created_at":"2026-05-18T03:51:26.275186+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y4LZ47HFY32G","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y4LZ47HFY32GKNEG","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y4LZ47HF","created_at":"2026-05-18T12:27:27.928770+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/Y4LZ47HFY32GKNEGDX3FBKUYNL","json":"https://pith.science/pith/Y4LZ47HFY32GKNEGDX3FBKUYNL.json","graph_json":"https://pith.science/api/pith-number/Y4LZ47HFY32GKNEGDX3FBKUYNL/graph.json","events_json":"https://pith.science/api/pith-number/Y4LZ47HFY32GKNEGDX3FBKUYNL/events.json","paper":"https://pith.science/paper/Y4LZ47HF"},"agent_actions":{"view_html":"https://pith.science/pith/Y4LZ47HFY32GKNEGDX3FBKUYNL","download_json":"https://pith.science/pith/Y4LZ47HFY32GKNEGDX3FBKUYNL.json","view_paper":"https://pith.science/paper/Y4LZ47HF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.2017&json=true","fetch_graph":"https://pith.science/api/pith-number/Y4LZ47HFY32GKNEGDX3FBKUYNL/graph.json","fetch_events":"https://pith.science/api/pith-number/Y4LZ47HFY32GKNEGDX3FBKUYNL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y4LZ47HFY32GKNEGDX3FBKUYNL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y4LZ47HFY32GKNEGDX3FBKUYNL/action/storage_attestation","attest_author":"https://pith.science/pith/Y4LZ47HFY32GKNEGDX3FBKUYNL/action/author_attestation","sign_citation":"https://pith.science/pith/Y4LZ47HFY32GKNEGDX3FBKUYNL/action/citation_signature","submit_replication":"https://pith.science/pith/Y4LZ47HFY32GKNEGDX3FBKUYNL/action/replication_record"}},"created_at":"2026-05-18T03:51:26.275186+00:00","updated_at":"2026-05-18T03:51:26.275186+00:00"}