{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HZGHDJMLRKUTWST4XIN5V5ZRKS","short_pith_number":"pith:HZGHDJML","schema_version":"1.0","canonical_sha256":"3e4c71a58b8aa93b4a7cba1bdaf73154a79fa157a872a733d9aec6ea64aad9ed","source":{"kind":"arxiv","id":"1710.05599","version":4},"attestation_state":"computed","paper":{"title":"Complexity of the interpretability logic IL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Fedor Pakhomov, Luka Mikec, Mladen Vukovi\\'c","submitted_at":"2017-10-16T10:00:26Z","abstract_excerpt":"We show that the decision problem for the basic system of interpretability logic IL is PSPACE-complete. For this purpose we present an algorithm which uses polynomial space with respect to the complexity of a given formula. The existence of such algorithm, together with the previously known PSPACE hardness of the closed fragment of IL, implies PSPACE-completeness."},"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":"1710.05599","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2017-10-16T10:00:26Z","cross_cats_sorted":[],"title_canon_sha256":"9edae1a752eab503169eb5337c5396db12c94f0ba001e10182d63d2712c5e0f9","abstract_canon_sha256":"ee9250e9bd60eb7192d9b2a0921e51ce353f458f75e798f9826dec7c5153265e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:08.667408Z","signature_b64":"/VA9TrzBakY/BHbj2bo+t5iMpvpaUNVAeQ9i2fzJ7qt7Zts1jLneRZAS61Kn383tEKAeeVAu3uebYvALK1osBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e4c71a58b8aa93b4a7cba1bdaf73154a79fa157a872a733d9aec6ea64aad9ed","last_reissued_at":"2026-05-18T00:19:08.666702Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:08.666702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity of the interpretability logic IL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Fedor Pakhomov, Luka Mikec, Mladen Vukovi\\'c","submitted_at":"2017-10-16T10:00:26Z","abstract_excerpt":"We show that the decision problem for the basic system of interpretability logic IL is PSPACE-complete. For this purpose we present an algorithm which uses polynomial space with respect to the complexity of a given formula. The existence of such algorithm, together with the previously known PSPACE hardness of the closed fragment of IL, implies PSPACE-completeness."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05599","kind":"arxiv","version":4},"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":"1710.05599","created_at":"2026-05-18T00:19:08.666808+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.05599v4","created_at":"2026-05-18T00:19:08.666808+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05599","created_at":"2026-05-18T00:19:08.666808+00:00"},{"alias_kind":"pith_short_12","alias_value":"HZGHDJMLRKUT","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"HZGHDJMLRKUTWST4","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"HZGHDJML","created_at":"2026-05-18T12:31:21.493067+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/HZGHDJMLRKUTWST4XIN5V5ZRKS","json":"https://pith.science/pith/HZGHDJMLRKUTWST4XIN5V5ZRKS.json","graph_json":"https://pith.science/api/pith-number/HZGHDJMLRKUTWST4XIN5V5ZRKS/graph.json","events_json":"https://pith.science/api/pith-number/HZGHDJMLRKUTWST4XIN5V5ZRKS/events.json","paper":"https://pith.science/paper/HZGHDJML"},"agent_actions":{"view_html":"https://pith.science/pith/HZGHDJMLRKUTWST4XIN5V5ZRKS","download_json":"https://pith.science/pith/HZGHDJMLRKUTWST4XIN5V5ZRKS.json","view_paper":"https://pith.science/paper/HZGHDJML","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.05599&json=true","fetch_graph":"https://pith.science/api/pith-number/HZGHDJMLRKUTWST4XIN5V5ZRKS/graph.json","fetch_events":"https://pith.science/api/pith-number/HZGHDJMLRKUTWST4XIN5V5ZRKS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HZGHDJMLRKUTWST4XIN5V5ZRKS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HZGHDJMLRKUTWST4XIN5V5ZRKS/action/storage_attestation","attest_author":"https://pith.science/pith/HZGHDJMLRKUTWST4XIN5V5ZRKS/action/author_attestation","sign_citation":"https://pith.science/pith/HZGHDJMLRKUTWST4XIN5V5ZRKS/action/citation_signature","submit_replication":"https://pith.science/pith/HZGHDJMLRKUTWST4XIN5V5ZRKS/action/replication_record"}},"created_at":"2026-05-18T00:19:08.666808+00:00","updated_at":"2026-05-18T00:19:08.666808+00:00"}