{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:HS7AUAP6A55FHCHCFXZKUGD3WX","short_pith_number":"pith:HS7AUAP6","schema_version":"1.0","canonical_sha256":"3cbe0a01fe077a5388e22df2aa187bb5f600c59d9b199262dac8a88505251354","source":{"kind":"arxiv","id":"1207.6685","version":1},"attestation_state":"computed","paper":{"title":"FMLtoHOL (version 1.0): Automating First-order Modal Logics with LEO-II and Friends","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Christoph Benzmueller, Thomas Raths","submitted_at":"2012-07-28T07:03:16Z","abstract_excerpt":"A converter from first-order modal logics to classical higher- order logic is presented. This tool enables the application of off-the-shelf higher-order theorem provers and model finders for reasoning within first- order modal logics. The tool supports logics K, K4, D, D4, T, S4, and S5 with respect to constant, varying and cumulative domain semantics."},"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":"1207.6685","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-07-28T07:03:16Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a4320975fcbe08af590e7367360e3d78312ac8279a4ec2cc9986abc38e8baec2","abstract_canon_sha256":"3507662a6098933aa850f951d12cfca57a90d4cec21c327a9bffffaaa025db51"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:57.510481Z","signature_b64":"ML2qqM595ScGyXlEXpV752BFUdZQKKn//48pQ0uLdnjHGW3uJJ61T95i0L8J22RLo9zlBmP0Pp38BQFUszkqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cbe0a01fe077a5388e22df2aa187bb5f600c59d9b199262dac8a88505251354","last_reissued_at":"2026-05-18T03:49:57.509836Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:57.509836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FMLtoHOL (version 1.0): Automating First-order Modal Logics with LEO-II and Friends","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Christoph Benzmueller, Thomas Raths","submitted_at":"2012-07-28T07:03:16Z","abstract_excerpt":"A converter from first-order modal logics to classical higher- order logic is presented. This tool enables the application of off-the-shelf higher-order theorem provers and model finders for reasoning within first- order modal logics. The tool supports logics K, K4, D, D4, T, S4, and S5 with respect to constant, varying and cumulative domain semantics."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6685","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":"1207.6685","created_at":"2026-05-18T03:49:57.509925+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.6685v1","created_at":"2026-05-18T03:49:57.509925+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6685","created_at":"2026-05-18T03:49:57.509925+00:00"},{"alias_kind":"pith_short_12","alias_value":"HS7AUAP6A55F","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"HS7AUAP6A55FHCHC","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"HS7AUAP6","created_at":"2026-05-18T12:27:09.501522+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/HS7AUAP6A55FHCHCFXZKUGD3WX","json":"https://pith.science/pith/HS7AUAP6A55FHCHCFXZKUGD3WX.json","graph_json":"https://pith.science/api/pith-number/HS7AUAP6A55FHCHCFXZKUGD3WX/graph.json","events_json":"https://pith.science/api/pith-number/HS7AUAP6A55FHCHCFXZKUGD3WX/events.json","paper":"https://pith.science/paper/HS7AUAP6"},"agent_actions":{"view_html":"https://pith.science/pith/HS7AUAP6A55FHCHCFXZKUGD3WX","download_json":"https://pith.science/pith/HS7AUAP6A55FHCHCFXZKUGD3WX.json","view_paper":"https://pith.science/paper/HS7AUAP6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.6685&json=true","fetch_graph":"https://pith.science/api/pith-number/HS7AUAP6A55FHCHCFXZKUGD3WX/graph.json","fetch_events":"https://pith.science/api/pith-number/HS7AUAP6A55FHCHCFXZKUGD3WX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HS7AUAP6A55FHCHCFXZKUGD3WX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HS7AUAP6A55FHCHCFXZKUGD3WX/action/storage_attestation","attest_author":"https://pith.science/pith/HS7AUAP6A55FHCHCFXZKUGD3WX/action/author_attestation","sign_citation":"https://pith.science/pith/HS7AUAP6A55FHCHCFXZKUGD3WX/action/citation_signature","submit_replication":"https://pith.science/pith/HS7AUAP6A55FHCHCFXZKUGD3WX/action/replication_record"}},"created_at":"2026-05-18T03:49:57.509925+00:00","updated_at":"2026-05-18T03:49:57.509925+00:00"}