{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FMGCGJ5M766TDTQS4J6XQ2WTW3","short_pith_number":"pith:FMGCGJ5M","schema_version":"1.0","canonical_sha256":"2b0c2327acffbd31ce12e27d786ad3b6eac38d220ae26b12e60702f5b6e17b69","source":{"kind":"arxiv","id":"1801.02367","version":1},"attestation_state":"computed","paper":{"title":"Deciding and Interpolating Algebraic Data Types by Reduction (Technical Report)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"cs.LO","authors_text":"Hossein Hojjat (Rochester Institute of Technology), Philipp R\\\"ummer (Uppsala University)","submitted_at":"2018-01-08T10:16:18Z","abstract_excerpt":"Recursive algebraic data types (term algebras, ADTs) are one of the most well-studied theories in logic, and find application in contexts including functional programming, modelling languages, proof assistants, and verification. At this point, several state-of-the-art theorem provers and SMT solvers include tailor-made decision procedures for ADTs, and version 2.6 of the SMT-LIB standard includes support for ADTs. We study an extremely simple approach to decide satisfiability of ADT constraints, the reduction of ADT constraints to equisatisfiable constraints over uninterpreted functions (EUF) "},"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.02367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-01-08T10:16:18Z","cross_cats_sorted":["cs.SC"],"title_canon_sha256":"51354e569c0503a5199444733e0324ea92a8529f7e98a732099ef00ff4bb3dfc","abstract_canon_sha256":"7febaa44e443dcc0e8ff5e86bd91598d0465227b1a3dd677d17baacbd3cd0722"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:31.867040Z","signature_b64":"7f87b1haRryh38/nk4IagbGQ+j+lh15Ys9byLsr4cVvBGXJgs4I6jlTJbfakWEIwF+LBbwThElufSRQf7y1WCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b0c2327acffbd31ce12e27d786ad3b6eac38d220ae26b12e60702f5b6e17b69","last_reissued_at":"2026-05-18T00:26:31.866362Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:31.866362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deciding and Interpolating Algebraic Data Types by Reduction (Technical Report)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"cs.LO","authors_text":"Hossein Hojjat (Rochester Institute of Technology), Philipp R\\\"ummer (Uppsala University)","submitted_at":"2018-01-08T10:16:18Z","abstract_excerpt":"Recursive algebraic data types (term algebras, ADTs) are one of the most well-studied theories in logic, and find application in contexts including functional programming, modelling languages, proof assistants, and verification. At this point, several state-of-the-art theorem provers and SMT solvers include tailor-made decision procedures for ADTs, and version 2.6 of the SMT-LIB standard includes support for ADTs. We study an extremely simple approach to decide satisfiability of ADT constraints, the reduction of ADT constraints to equisatisfiable constraints over uninterpreted functions (EUF) "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02367","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":"1801.02367","created_at":"2026-05-18T00:26:31.866478+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.02367v1","created_at":"2026-05-18T00:26:31.866478+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02367","created_at":"2026-05-18T00:26:31.866478+00:00"},{"alias_kind":"pith_short_12","alias_value":"FMGCGJ5M766T","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"FMGCGJ5M766TDTQS","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"FMGCGJ5M","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/FMGCGJ5M766TDTQS4J6XQ2WTW3","json":"https://pith.science/pith/FMGCGJ5M766TDTQS4J6XQ2WTW3.json","graph_json":"https://pith.science/api/pith-number/FMGCGJ5M766TDTQS4J6XQ2WTW3/graph.json","events_json":"https://pith.science/api/pith-number/FMGCGJ5M766TDTQS4J6XQ2WTW3/events.json","paper":"https://pith.science/paper/FMGCGJ5M"},"agent_actions":{"view_html":"https://pith.science/pith/FMGCGJ5M766TDTQS4J6XQ2WTW3","download_json":"https://pith.science/pith/FMGCGJ5M766TDTQS4J6XQ2WTW3.json","view_paper":"https://pith.science/paper/FMGCGJ5M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.02367&json=true","fetch_graph":"https://pith.science/api/pith-number/FMGCGJ5M766TDTQS4J6XQ2WTW3/graph.json","fetch_events":"https://pith.science/api/pith-number/FMGCGJ5M766TDTQS4J6XQ2WTW3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FMGCGJ5M766TDTQS4J6XQ2WTW3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FMGCGJ5M766TDTQS4J6XQ2WTW3/action/storage_attestation","attest_author":"https://pith.science/pith/FMGCGJ5M766TDTQS4J6XQ2WTW3/action/author_attestation","sign_citation":"https://pith.science/pith/FMGCGJ5M766TDTQS4J6XQ2WTW3/action/citation_signature","submit_replication":"https://pith.science/pith/FMGCGJ5M766TDTQS4J6XQ2WTW3/action/replication_record"}},"created_at":"2026-05-18T00:26:31.866478+00:00","updated_at":"2026-05-18T00:26:31.866478+00:00"}