{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:AIXOKJEZKGA2JMK2PEKI7OBW76","short_pith_number":"pith:AIXOKJEZ","schema_version":"1.0","canonical_sha256":"022ee524995181a4b15a79148fb836ffbdd940bf18e33509034b182980dfd2b5","source":{"kind":"arxiv","id":"2110.00446","version":2},"attestation_state":"computed","paper":{"title":"CHAD for Expressive Total Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","math.CT"],"primary_cat":"cs.PL","authors_text":"Fernando Lucatelli Nunes, Matthijs V\\'ak\\'ar","submitted_at":"2021-10-01T14:30:30Z","abstract_excerpt":"We show how to apply forward and reverse mode Combinatory Homomorphic Automatic Differentiation (CHAD) to total functional programming languages with expressive type systems featuring the combination of - tuple types; - sum types; - inductive types; - coinductive types; - function types. We achieve this by analysing the categorical semantics of such types in $\\Sigma$-types (Grothendieck constructions) of suitable categories. Using a novel categorical logical relations technique for such expressive type systems, we give a correctness proof of CHAD in this setting by showing that it computes the"},"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":"2110.00446","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2021-10-01T14:30:30Z","cross_cats_sorted":["cs.LO","math.CT"],"title_canon_sha256":"486728acdc2c9be0565a3cf51a654987e114186993380228049c086a6c3ecd4f","abstract_canon_sha256":"8094cc97c885b180a658ffaee330f875a99301f507c4527d0abda3f01ea02aec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:11:11.548106Z","signature_b64":"YKDUDZahbC33YA2qCJFGHQyCzodWdueS4mqKiNfbWt2VW1u9KksoTYjPT1d4RXcA3Lwy31qyPFszgRhr/gaKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"022ee524995181a4b15a79148fb836ffbdd940bf18e33509034b182980dfd2b5","last_reissued_at":"2026-07-05T07:11:11.547086Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:11:11.547086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CHAD for Expressive Total Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","math.CT"],"primary_cat":"cs.PL","authors_text":"Fernando Lucatelli Nunes, Matthijs V\\'ak\\'ar","submitted_at":"2021-10-01T14:30:30Z","abstract_excerpt":"We show how to apply forward and reverse mode Combinatory Homomorphic Automatic Differentiation (CHAD) to total functional programming languages with expressive type systems featuring the combination of - tuple types; - sum types; - inductive types; - coinductive types; - function types. We achieve this by analysing the categorical semantics of such types in $\\Sigma$-types (Grothendieck constructions) of suitable categories. Using a novel categorical logical relations technique for such expressive type systems, we give a correctness proof of CHAD in this setting by showing that it computes the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.00446","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/2110.00446/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":"2110.00446","created_at":"2026-07-05T07:11:11.547478+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.00446v2","created_at":"2026-07-05T07:11:11.547478+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.00446","created_at":"2026-07-05T07:11:11.547478+00:00"},{"alias_kind":"pith_short_12","alias_value":"AIXOKJEZKGA2","created_at":"2026-07-05T07:11:11.547478+00:00"},{"alias_kind":"pith_short_16","alias_value":"AIXOKJEZKGA2JMK2","created_at":"2026-07-05T07:11:11.547478+00:00"},{"alias_kind":"pith_short_8","alias_value":"AIXOKJEZ","created_at":"2026-07-05T07:11:11.547478+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2103.15776","citing_title":"CHAD: Combinatory Homomorphic Automatic Differentiation","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AIXOKJEZKGA2JMK2PEKI7OBW76","json":"https://pith.science/pith/AIXOKJEZKGA2JMK2PEKI7OBW76.json","graph_json":"https://pith.science/api/pith-number/AIXOKJEZKGA2JMK2PEKI7OBW76/graph.json","events_json":"https://pith.science/api/pith-number/AIXOKJEZKGA2JMK2PEKI7OBW76/events.json","paper":"https://pith.science/paper/AIXOKJEZ"},"agent_actions":{"view_html":"https://pith.science/pith/AIXOKJEZKGA2JMK2PEKI7OBW76","download_json":"https://pith.science/pith/AIXOKJEZKGA2JMK2PEKI7OBW76.json","view_paper":"https://pith.science/paper/AIXOKJEZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.00446&json=true","fetch_graph":"https://pith.science/api/pith-number/AIXOKJEZKGA2JMK2PEKI7OBW76/graph.json","fetch_events":"https://pith.science/api/pith-number/AIXOKJEZKGA2JMK2PEKI7OBW76/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AIXOKJEZKGA2JMK2PEKI7OBW76/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AIXOKJEZKGA2JMK2PEKI7OBW76/action/storage_attestation","attest_author":"https://pith.science/pith/AIXOKJEZKGA2JMK2PEKI7OBW76/action/author_attestation","sign_citation":"https://pith.science/pith/AIXOKJEZKGA2JMK2PEKI7OBW76/action/citation_signature","submit_replication":"https://pith.science/pith/AIXOKJEZKGA2JMK2PEKI7OBW76/action/replication_record"}},"created_at":"2026-07-05T07:11:11.547478+00:00","updated_at":"2026-07-05T07:11:11.547478+00:00"}