{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FGTKTVB3DYO3HR2MY7U4NLQHR7","short_pith_number":"pith:FGTKTVB3","schema_version":"1.0","canonical_sha256":"29a6a9d43b1e1db3c74cc7e9c6ae078fd0280ad8d57a1cb7189ab60c3f7d02fa","source":{"kind":"arxiv","id":"1508.03838","version":1},"attestation_state":"computed","paper":{"title":"Encoding TLA+ set theory into many-sorted first-order logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Hern\\'an Vanzetto, Stephan Merz","submitted_at":"2015-08-16T15:47:07Z","abstract_excerpt":"We present an encoding of Zermelo-Fraenkel set theory into many-sorted first-order logic, the input language of state-of-the-art SMT solvers. This translation is the main component of a back-end prover based on SMT solvers in the TLA+ Proof System."},"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":"1508.03838","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-08-16T15:47:07Z","cross_cats_sorted":[],"title_canon_sha256":"7dda04cf33e29d393e7235e250b3b845ae6605619c061bdc0bfdb961b7dae3cc","abstract_canon_sha256":"bd5c2fdd58bf22dd58a8bd177c8b11fe10eb3036563cfe1d34dd938ba2cdadb9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:15.113464Z","signature_b64":"JFvvvVW0Q/iaOsBPw8T9DLnADUjA4PxLNd88IuGbMETnagYVVHUF46txzoGSMeQTKtlzfqYketfx0d3dxWCLBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29a6a9d43b1e1db3c74cc7e9c6ae078fd0280ad8d57a1cb7189ab60c3f7d02fa","last_reissued_at":"2026-05-18T01:35:15.112917Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:15.112917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Encoding TLA+ set theory into many-sorted first-order logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Hern\\'an Vanzetto, Stephan Merz","submitted_at":"2015-08-16T15:47:07Z","abstract_excerpt":"We present an encoding of Zermelo-Fraenkel set theory into many-sorted first-order logic, the input language of state-of-the-art SMT solvers. This translation is the main component of a back-end prover based on SMT solvers in the TLA+ Proof System."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.03838","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":"1508.03838","created_at":"2026-05-18T01:35:15.113001+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.03838v1","created_at":"2026-05-18T01:35:15.113001+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.03838","created_at":"2026-05-18T01:35:15.113001+00:00"},{"alias_kind":"pith_short_12","alias_value":"FGTKTVB3DYO3","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"FGTKTVB3DYO3HR2M","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"FGTKTVB3","created_at":"2026-05-18T12:29:19.899920+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/FGTKTVB3DYO3HR2MY7U4NLQHR7","json":"https://pith.science/pith/FGTKTVB3DYO3HR2MY7U4NLQHR7.json","graph_json":"https://pith.science/api/pith-number/FGTKTVB3DYO3HR2MY7U4NLQHR7/graph.json","events_json":"https://pith.science/api/pith-number/FGTKTVB3DYO3HR2MY7U4NLQHR7/events.json","paper":"https://pith.science/paper/FGTKTVB3"},"agent_actions":{"view_html":"https://pith.science/pith/FGTKTVB3DYO3HR2MY7U4NLQHR7","download_json":"https://pith.science/pith/FGTKTVB3DYO3HR2MY7U4NLQHR7.json","view_paper":"https://pith.science/paper/FGTKTVB3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.03838&json=true","fetch_graph":"https://pith.science/api/pith-number/FGTKTVB3DYO3HR2MY7U4NLQHR7/graph.json","fetch_events":"https://pith.science/api/pith-number/FGTKTVB3DYO3HR2MY7U4NLQHR7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FGTKTVB3DYO3HR2MY7U4NLQHR7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FGTKTVB3DYO3HR2MY7U4NLQHR7/action/storage_attestation","attest_author":"https://pith.science/pith/FGTKTVB3DYO3HR2MY7U4NLQHR7/action/author_attestation","sign_citation":"https://pith.science/pith/FGTKTVB3DYO3HR2MY7U4NLQHR7/action/citation_signature","submit_replication":"https://pith.science/pith/FGTKTVB3DYO3HR2MY7U4NLQHR7/action/replication_record"}},"created_at":"2026-05-18T01:35:15.113001+00:00","updated_at":"2026-05-18T01:35:15.113001+00:00"}