{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HS2X6N4VLFXDDQEHV2D4LZTFVX","short_pith_number":"pith:HS2X6N4V","schema_version":"1.0","canonical_sha256":"3cb57f3795596e31c087ae87c5e665adf4e8377e351b782797575d275bd8dac0","source":{"kind":"arxiv","id":"1803.09681","version":2},"attestation_state":"computed","paper":{"title":"I/O Logic in HOL --- First Steps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Christoph Benzm\\\"uller, Xavier Parent","submitted_at":"2018-03-26T15:53:31Z","abstract_excerpt":"A semantical embedding of input/output logic in classical higher-order logic is presented. This embedding enables the mechanisation and automation of reasoning tasks in input/output logic with off-the-shelf higher-order theorem provers and proof assistants. The key idea for the solution presented here results from the analysis of an inaccurate previous embedding attempt, which we will discuss as well."},"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":"1803.09681","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-03-26T15:53:31Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"fa520190371fb088c851632a528c4bedfb523ec88518bdd74d8ebab05f83eba8","abstract_canon_sha256":"9cc11d5269ed279429bf21a6f7f6290612acdcb2fb271200889593d680a80a36"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:03.698201Z","signature_b64":"0ufGIHjRVX+eAV/3vtcdP3oWNpMG3xg2RKdaX+XQnCqU/B8k/mOUCBqntWUW53luvDe3bhR7U4ypk4wBONiXCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cb57f3795596e31c087ae87c5e665adf4e8377e351b782797575d275bd8dac0","last_reissued_at":"2026-05-18T00:18:03.697644Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:03.697644Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"I/O Logic in HOL --- First Steps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Christoph Benzm\\\"uller, Xavier Parent","submitted_at":"2018-03-26T15:53:31Z","abstract_excerpt":"A semantical embedding of input/output logic in classical higher-order logic is presented. This embedding enables the mechanisation and automation of reasoning tasks in input/output logic with off-the-shelf higher-order theorem provers and proof assistants. The key idea for the solution presented here results from the analysis of an inaccurate previous embedding attempt, which we will discuss as well."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09681","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":""},"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":"1803.09681","created_at":"2026-05-18T00:18:03.697735+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.09681v2","created_at":"2026-05-18T00:18:03.697735+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09681","created_at":"2026-05-18T00:18:03.697735+00:00"},{"alias_kind":"pith_short_12","alias_value":"HS2X6N4VLFXD","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HS2X6N4VLFXDDQEH","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HS2X6N4V","created_at":"2026-05-18T12:32:28.185984+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/HS2X6N4VLFXDDQEHV2D4LZTFVX","json":"https://pith.science/pith/HS2X6N4VLFXDDQEHV2D4LZTFVX.json","graph_json":"https://pith.science/api/pith-number/HS2X6N4VLFXDDQEHV2D4LZTFVX/graph.json","events_json":"https://pith.science/api/pith-number/HS2X6N4VLFXDDQEHV2D4LZTFVX/events.json","paper":"https://pith.science/paper/HS2X6N4V"},"agent_actions":{"view_html":"https://pith.science/pith/HS2X6N4VLFXDDQEHV2D4LZTFVX","download_json":"https://pith.science/pith/HS2X6N4VLFXDDQEHV2D4LZTFVX.json","view_paper":"https://pith.science/paper/HS2X6N4V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.09681&json=true","fetch_graph":"https://pith.science/api/pith-number/HS2X6N4VLFXDDQEHV2D4LZTFVX/graph.json","fetch_events":"https://pith.science/api/pith-number/HS2X6N4VLFXDDQEHV2D4LZTFVX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HS2X6N4VLFXDDQEHV2D4LZTFVX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HS2X6N4VLFXDDQEHV2D4LZTFVX/action/storage_attestation","attest_author":"https://pith.science/pith/HS2X6N4VLFXDDQEHV2D4LZTFVX/action/author_attestation","sign_citation":"https://pith.science/pith/HS2X6N4VLFXDDQEHV2D4LZTFVX/action/citation_signature","submit_replication":"https://pith.science/pith/HS2X6N4VLFXDDQEHV2D4LZTFVX/action/replication_record"}},"created_at":"2026-05-18T00:18:03.697735+00:00","updated_at":"2026-05-18T00:18:03.697735+00:00"}