{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SGP4HJRGIZSIHTHNUT7FH5FB3M","short_pith_number":"pith:SGP4HJRG","schema_version":"1.0","canonical_sha256":"919fc3a626466483cceda4fe53f4a1db09938fe3810dfd4fd47561b8768a3ef8","source":{"kind":"arxiv","id":"1907.06101","version":1},"attestation_state":"computed","paper":{"title":"Sharing Equality is Linear","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andrea Condoluci, Beniamino Accattoli, Claudio Sacerdoti Coen","submitted_at":"2019-07-13T15:52:06Z","abstract_excerpt":"The $\\lambda$-calculus is a handy formalism to specify the evaluation of higher-order programs. It is not very handy, however, when one interprets the specification as an execution mechanism, because terms can grow exponentially with the number of $\\beta$-steps. This is why implementations of functional languages and proof assistants always rely on some form of sharing of subterms. These frameworks however do not only evaluate $\\lambda$-terms, they also have to compare them for equality. In presence of sharing, one is actually interested in the equality---or more precisely $\\alpha$-conversion-"},"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":"1907.06101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-07-13T15:52:06Z","cross_cats_sorted":[],"title_canon_sha256":"d4a51ef1796a589419a4be21b4189928920d2da8868c85823f48f2adbb6f5fa3","abstract_canon_sha256":"aed1f22ccb97d454de13169c5b525f9197bb8eaf27ee3ef6ccd637c648d24e9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:42.429296Z","signature_b64":"E4HQrZTP/e2OgCM7U5kU4jJ1EpdF3nEuuq83mXvDpHO5dlrjOVDJYGyNAzbkZOg6pBRw/n/wZyIFTXRi82OVDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"919fc3a626466483cceda4fe53f4a1db09938fe3810dfd4fd47561b8768a3ef8","last_reissued_at":"2026-05-17T23:40:42.428557Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:42.428557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sharing Equality is Linear","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Andrea Condoluci, Beniamino Accattoli, Claudio Sacerdoti Coen","submitted_at":"2019-07-13T15:52:06Z","abstract_excerpt":"The $\\lambda$-calculus is a handy formalism to specify the evaluation of higher-order programs. It is not very handy, however, when one interprets the specification as an execution mechanism, because terms can grow exponentially with the number of $\\beta$-steps. This is why implementations of functional languages and proof assistants always rely on some form of sharing of subterms. These frameworks however do not only evaluate $\\lambda$-terms, they also have to compare them for equality. In presence of sharing, one is actually interested in the equality---or more precisely $\\alpha$-conversion-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06101","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":"1907.06101","created_at":"2026-05-17T23:40:42.428684+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.06101v1","created_at":"2026-05-17T23:40:42.428684+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06101","created_at":"2026-05-17T23:40:42.428684+00:00"},{"alias_kind":"pith_short_12","alias_value":"SGP4HJRGIZSI","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"SGP4HJRGIZSIHTHN","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"SGP4HJRG","created_at":"2026-05-18T12:33:27.125529+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/SGP4HJRGIZSIHTHNUT7FH5FB3M","json":"https://pith.science/pith/SGP4HJRGIZSIHTHNUT7FH5FB3M.json","graph_json":"https://pith.science/api/pith-number/SGP4HJRGIZSIHTHNUT7FH5FB3M/graph.json","events_json":"https://pith.science/api/pith-number/SGP4HJRGIZSIHTHNUT7FH5FB3M/events.json","paper":"https://pith.science/paper/SGP4HJRG"},"agent_actions":{"view_html":"https://pith.science/pith/SGP4HJRGIZSIHTHNUT7FH5FB3M","download_json":"https://pith.science/pith/SGP4HJRGIZSIHTHNUT7FH5FB3M.json","view_paper":"https://pith.science/paper/SGP4HJRG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.06101&json=true","fetch_graph":"https://pith.science/api/pith-number/SGP4HJRGIZSIHTHNUT7FH5FB3M/graph.json","fetch_events":"https://pith.science/api/pith-number/SGP4HJRGIZSIHTHNUT7FH5FB3M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SGP4HJRGIZSIHTHNUT7FH5FB3M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SGP4HJRGIZSIHTHNUT7FH5FB3M/action/storage_attestation","attest_author":"https://pith.science/pith/SGP4HJRGIZSIHTHNUT7FH5FB3M/action/author_attestation","sign_citation":"https://pith.science/pith/SGP4HJRGIZSIHTHNUT7FH5FB3M/action/citation_signature","submit_replication":"https://pith.science/pith/SGP4HJRGIZSIHTHNUT7FH5FB3M/action/replication_record"}},"created_at":"2026-05-17T23:40:42.428684+00:00","updated_at":"2026-05-17T23:40:42.428684+00:00"}