{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IOCEM4L6J4SIMP7HC4UXCUBNIS","short_pith_number":"pith:IOCEM4L6","schema_version":"1.0","canonical_sha256":"438446717e4f24863fe7172971502d44be7869fff65274c77ee4e6b9146525fc","source":{"kind":"arxiv","id":"1908.02414","version":2},"attestation_state":"computed","paper":{"title":"Space-Efficient Gradual Typing in Coercion-Passing Style","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Atsushi Igarashi, Tomoya Tabuchi, Yuya Tsuda","submitted_at":"2019-08-07T01:40:24Z","abstract_excerpt":"Herman et al. pointed out that the insertion of run-time checks into a gradually typed program could hamper tail-call optimization and, as a result, worsen the space complexity of the program. To address the problem, they proposed a space-efficient coercion calculus, which was subsequently improved by Siek et al. The semantics of these calculi involves eager composition of run-time checks expressed by coercions to prevent the size of a term from growing. However, it relies also on a nonstandard reduction rule, which does not seem easy to implement. In fact, no compiler implementation of gradua"},"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":"1908.02414","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-08-07T01:40:24Z","cross_cats_sorted":[],"title_canon_sha256":"45826e91b91c9fcdfd01adaf0f536fa7c3d94fe464bf0bb0e88bbbf60400f7a6","abstract_canon_sha256":"6dd93a66bc0855fe9056649c100557ca3688ef4d3834520a88e215e066a08b3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:50:15.555234Z","signature_b64":"qs94Y4mdXxYgghxLrq3XiKl8CjfzmQL+PuAvTRWpXewFFNm+pqRQkqDG0IUaowHcSfmsP2bKdclu3HKT+rreCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"438446717e4f24863fe7172971502d44be7869fff65274c77ee4e6b9146525fc","last_reissued_at":"2026-07-05T01:50:15.554834Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:50:15.554834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Space-Efficient Gradual Typing in Coercion-Passing Style","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Atsushi Igarashi, Tomoya Tabuchi, Yuya Tsuda","submitted_at":"2019-08-07T01:40:24Z","abstract_excerpt":"Herman et al. pointed out that the insertion of run-time checks into a gradually typed program could hamper tail-call optimization and, as a result, worsen the space complexity of the program. To address the problem, they proposed a space-efficient coercion calculus, which was subsequently improved by Siek et al. The semantics of these calculi involves eager composition of run-time checks expressed by coercions to prevent the size of a term from growing. However, it relies also on a nonstandard reduction rule, which does not seem easy to implement. In fact, no compiler implementation of gradua"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02414","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.02414/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.02414","created_at":"2026-07-05T01:50:15.554886+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.02414v2","created_at":"2026-07-05T01:50:15.554886+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02414","created_at":"2026-07-05T01:50:15.554886+00:00"},{"alias_kind":"pith_short_12","alias_value":"IOCEM4L6J4SI","created_at":"2026-07-05T01:50:15.554886+00:00"},{"alias_kind":"pith_short_16","alias_value":"IOCEM4L6J4SIMP7H","created_at":"2026-07-05T01:50:15.554886+00:00"},{"alias_kind":"pith_short_8","alias_value":"IOCEM4L6","created_at":"2026-07-05T01:50:15.554886+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/IOCEM4L6J4SIMP7HC4UXCUBNIS","json":"https://pith.science/pith/IOCEM4L6J4SIMP7HC4UXCUBNIS.json","graph_json":"https://pith.science/api/pith-number/IOCEM4L6J4SIMP7HC4UXCUBNIS/graph.json","events_json":"https://pith.science/api/pith-number/IOCEM4L6J4SIMP7HC4UXCUBNIS/events.json","paper":"https://pith.science/paper/IOCEM4L6"},"agent_actions":{"view_html":"https://pith.science/pith/IOCEM4L6J4SIMP7HC4UXCUBNIS","download_json":"https://pith.science/pith/IOCEM4L6J4SIMP7HC4UXCUBNIS.json","view_paper":"https://pith.science/paper/IOCEM4L6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.02414&json=true","fetch_graph":"https://pith.science/api/pith-number/IOCEM4L6J4SIMP7HC4UXCUBNIS/graph.json","fetch_events":"https://pith.science/api/pith-number/IOCEM4L6J4SIMP7HC4UXCUBNIS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IOCEM4L6J4SIMP7HC4UXCUBNIS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IOCEM4L6J4SIMP7HC4UXCUBNIS/action/storage_attestation","attest_author":"https://pith.science/pith/IOCEM4L6J4SIMP7HC4UXCUBNIS/action/author_attestation","sign_citation":"https://pith.science/pith/IOCEM4L6J4SIMP7HC4UXCUBNIS/action/citation_signature","submit_replication":"https://pith.science/pith/IOCEM4L6J4SIMP7HC4UXCUBNIS/action/replication_record"}},"created_at":"2026-07-05T01:50:15.554886+00:00","updated_at":"2026-07-05T01:50:15.554886+00:00"}