{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:LMRZN35GY5FUVGJ7HJGIZ4SO2Y","short_pith_number":"pith:LMRZN35G","schema_version":"1.0","canonical_sha256":"5b2396efa6c74b4a993f3a4c8cf24ed6126a2a8d9dae7a189bfe0a69bf0c628e","source":{"kind":"arxiv","id":"cs/0602024","version":4},"attestation_state":"computed","paper":{"title":"Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Dimiter Vakarelov, Valentin Goranko, Willem Conradie","submitted_at":"2006-02-07T10:10:12Z","abstract_excerpt":"Modal formulae express monadic second-order properties on Kripke frames, but in many important cases these have first-order equivalents. Computing such equivalents is important for both logical and computational reasons. On the other hand, canonicity of modal formulae is important, too, because it implies frame-completeness of logics axiomatized with canonical formulae.\n  Computing a first-order equivalent of a modal formula amounts to elimination of second-order quantifiers. Two algorithms have been developed for second-order quantifier elimination: SCAN, based on constraint resolution, and D"},"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":"cs/0602024","kind":"arxiv","version":4},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2006-02-07T10:10:12Z","cross_cats_sorted":[],"title_canon_sha256":"0d047a3cdf2b088df9c59721ecbb31f59863ffb6a09d8cd497f2f7067b596388","abstract_canon_sha256":"a16738b90438f1242478c59d31b73450ddce797e370ee53db38b5a2c0fc6e8dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:03.404305Z","signature_b64":"ZAelJ50xE64qvXZ1miZeFcfU1rZoxqPfV06tzsDpo/f9R0TMhBxW5OdLrNLk4EOAK8z0Nfiex3lde9UnDxsCCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b2396efa6c74b4a993f3a4c8cf24ed6126a2a8d9dae7a189bfe0a69bf0c628e","last_reissued_at":"2026-05-18T00:53:03.403874Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:03.403874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Dimiter Vakarelov, Valentin Goranko, Willem Conradie","submitted_at":"2006-02-07T10:10:12Z","abstract_excerpt":"Modal formulae express monadic second-order properties on Kripke frames, but in many important cases these have first-order equivalents. Computing such equivalents is important for both logical and computational reasons. On the other hand, canonicity of modal formulae is important, too, because it implies frame-completeness of logics axiomatized with canonical formulae.\n  Computing a first-order equivalent of a modal formula amounts to elimination of second-order quantifiers. Two algorithms have been developed for second-order quantifier elimination: SCAN, based on constraint resolution, and D"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0602024","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":"cs/0602024","created_at":"2026-05-18T00:53:03.403945+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0602024v4","created_at":"2026-05-18T00:53:03.403945+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0602024","created_at":"2026-05-18T00:53:03.403945+00:00"},{"alias_kind":"pith_short_12","alias_value":"LMRZN35GY5FU","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"LMRZN35GY5FUVGJ7","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"LMRZN35G","created_at":"2026-05-18T12:25:54.717736+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/LMRZN35GY5FUVGJ7HJGIZ4SO2Y","json":"https://pith.science/pith/LMRZN35GY5FUVGJ7HJGIZ4SO2Y.json","graph_json":"https://pith.science/api/pith-number/LMRZN35GY5FUVGJ7HJGIZ4SO2Y/graph.json","events_json":"https://pith.science/api/pith-number/LMRZN35GY5FUVGJ7HJGIZ4SO2Y/events.json","paper":"https://pith.science/paper/LMRZN35G"},"agent_actions":{"view_html":"https://pith.science/pith/LMRZN35GY5FUVGJ7HJGIZ4SO2Y","download_json":"https://pith.science/pith/LMRZN35GY5FUVGJ7HJGIZ4SO2Y.json","view_paper":"https://pith.science/paper/LMRZN35G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0602024&json=true","fetch_graph":"https://pith.science/api/pith-number/LMRZN35GY5FUVGJ7HJGIZ4SO2Y/graph.json","fetch_events":"https://pith.science/api/pith-number/LMRZN35GY5FUVGJ7HJGIZ4SO2Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LMRZN35GY5FUVGJ7HJGIZ4SO2Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LMRZN35GY5FUVGJ7HJGIZ4SO2Y/action/storage_attestation","attest_author":"https://pith.science/pith/LMRZN35GY5FUVGJ7HJGIZ4SO2Y/action/author_attestation","sign_citation":"https://pith.science/pith/LMRZN35GY5FUVGJ7HJGIZ4SO2Y/action/citation_signature","submit_replication":"https://pith.science/pith/LMRZN35GY5FUVGJ7HJGIZ4SO2Y/action/replication_record"}},"created_at":"2026-05-18T00:53:03.403945+00:00","updated_at":"2026-05-18T00:53:03.403945+00:00"}