{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:K5PTXPLKSQ3HO7GGN3W2YFSUCP","short_pith_number":"pith:K5PTXPLK","schema_version":"1.0","canonical_sha256":"575f3bbd6a9436777cc66eedac165413e3a3ddf6f7e2d57cbbd008d560a488b4","source":{"kind":"arxiv","id":"1305.6065","version":1},"attestation_state":"computed","paper":{"title":"On the complexity of the closed fragment of Japaridze's provability logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Fedor Pakhomov","submitted_at":"2013-05-26T20:00:06Z","abstract_excerpt":"We consider well-known provability logic GLP. We prove that the GLP-provability problem for variable-free polymodal formulas is PSPACE-complete. For a number n, let L^n_0 denote the class of all polymodal variable-free formulas without modalities <n>, <n+1>,... . We show that, for every number n, the GLP-provability problem for formulas from L^n_0 is in PTIME."},"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":"1305.6065","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2013-05-26T20:00:06Z","cross_cats_sorted":[],"title_canon_sha256":"73f14fa53944cfdc198a71b243ee1fcb3665384216ef3f92efbfbc10a99ddef0","abstract_canon_sha256":"8556bbf938432ae0f62b2cce9d3dc7d267ffc591a0c2f5af797fd63a6a225b2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:24:53.042638Z","signature_b64":"jPSpGA/s9noyEAG2v/R/vXaJFg/B+VUsjGJCSl20JJ3DgCMwKLLamToFe/VotVegerWfGMpxZoiBO+0zp5PVBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"575f3bbd6a9436777cc66eedac165413e3a3ddf6f7e2d57cbbd008d560a488b4","last_reissued_at":"2026-05-18T03:24:53.042128Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:24:53.042128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the complexity of the closed fragment of Japaridze's provability logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Fedor Pakhomov","submitted_at":"2013-05-26T20:00:06Z","abstract_excerpt":"We consider well-known provability logic GLP. We prove that the GLP-provability problem for variable-free polymodal formulas is PSPACE-complete. For a number n, let L^n_0 denote the class of all polymodal variable-free formulas without modalities <n>, <n+1>,... . We show that, for every number n, the GLP-provability problem for formulas from L^n_0 is in PTIME."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6065","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":"1305.6065","created_at":"2026-05-18T03:24:53.042212+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.6065v1","created_at":"2026-05-18T03:24:53.042212+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6065","created_at":"2026-05-18T03:24:53.042212+00:00"},{"alias_kind":"pith_short_12","alias_value":"K5PTXPLKSQ3H","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"K5PTXPLKSQ3HO7GG","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"K5PTXPLK","created_at":"2026-05-18T12:27:49.015174+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/K5PTXPLKSQ3HO7GGN3W2YFSUCP","json":"https://pith.science/pith/K5PTXPLKSQ3HO7GGN3W2YFSUCP.json","graph_json":"https://pith.science/api/pith-number/K5PTXPLKSQ3HO7GGN3W2YFSUCP/graph.json","events_json":"https://pith.science/api/pith-number/K5PTXPLKSQ3HO7GGN3W2YFSUCP/events.json","paper":"https://pith.science/paper/K5PTXPLK"},"agent_actions":{"view_html":"https://pith.science/pith/K5PTXPLKSQ3HO7GGN3W2YFSUCP","download_json":"https://pith.science/pith/K5PTXPLKSQ3HO7GGN3W2YFSUCP.json","view_paper":"https://pith.science/paper/K5PTXPLK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.6065&json=true","fetch_graph":"https://pith.science/api/pith-number/K5PTXPLKSQ3HO7GGN3W2YFSUCP/graph.json","fetch_events":"https://pith.science/api/pith-number/K5PTXPLKSQ3HO7GGN3W2YFSUCP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K5PTXPLKSQ3HO7GGN3W2YFSUCP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K5PTXPLKSQ3HO7GGN3W2YFSUCP/action/storage_attestation","attest_author":"https://pith.science/pith/K5PTXPLKSQ3HO7GGN3W2YFSUCP/action/author_attestation","sign_citation":"https://pith.science/pith/K5PTXPLKSQ3HO7GGN3W2YFSUCP/action/citation_signature","submit_replication":"https://pith.science/pith/K5PTXPLKSQ3HO7GGN3W2YFSUCP/action/replication_record"}},"created_at":"2026-05-18T03:24:53.042212+00:00","updated_at":"2026-05-18T03:24:53.042212+00:00"}