{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:LMRZN35GY5FUVGJ7HJGIZ4SO2Y","short_pith_number":"pith:LMRZN35G","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"},"canonical_sha256":"5b2396efa6c74b4a993f3a4c8cf24ed6126a2a8d9dae7a189bfe0a69bf0c628e","source":{"kind":"arxiv","id":"cs/0602024","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0602024","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0602024v4","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0602024","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"pith_short_12","alias_value":"LMRZN35GY5FU","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"LMRZN35GY5FUVGJ7","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"LMRZN35G","created_at":"2026-05-18T12:25:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:LMRZN35GY5FUVGJ7HJGIZ4SO2Y","target":"record","payload":{"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"},"canonical_sha256":"5b2396efa6c74b4a993f3a4c8cf24ed6126a2a8d9dae7a189bfe0a69bf0c628e","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"},"source_kind":"arxiv","source_id":"cs/0602024","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:53:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MHj6WMYv5khg8xaJZWLC6DS5a22l9dENzjl0TbcRs4375gdgwIWm2bewnFfioL6c7cfs63+3MSw4yNNBvtK5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T23:33:27.801559Z"},"content_sha256":"165735f1e9a5363bd4cbfe5cedcbf3eeb31b844d1a49ddf405e28d089739a131","schema_version":"1.0","event_id":"sha256:165735f1e9a5363bd4cbfe5cedcbf3eeb31b844d1a49ddf405e28d089739a131"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:LMRZN35GY5FUVGJ7HJGIZ4SO2Y","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:53:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CGl4JVwcLcIQjZ+v9hxfCHUHyK9FXG6pPW1v2LwUkHw3rnwZm27c4SlFLebIU5g3FWhBSBLchmiWxYXvKwR3AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T23:33:27.802367Z"},"content_sha256":"146c8f2491c1601713199684334e80843e7a922fd7f2dc118c429f465576e792","schema_version":"1.0","event_id":"sha256:146c8f2491c1601713199684334e80843e7a922fd7f2dc118c429f465576e792"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LMRZN35GY5FUVGJ7HJGIZ4SO2Y/bundle.json","state_url":"https://pith.science/pith/LMRZN35GY5FUVGJ7HJGIZ4SO2Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LMRZN35GY5FUVGJ7HJGIZ4SO2Y/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T23:33:27Z","links":{"resolver":"https://pith.science/pith/LMRZN35GY5FUVGJ7HJGIZ4SO2Y","bundle":"https://pith.science/pith/LMRZN35GY5FUVGJ7HJGIZ4SO2Y/bundle.json","state":"https://pith.science/pith/LMRZN35GY5FUVGJ7HJGIZ4SO2Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LMRZN35GY5FUVGJ7HJGIZ4SO2Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:LMRZN35GY5FUVGJ7HJGIZ4SO2Y","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a16738b90438f1242478c59d31b73450ddce797e370ee53db38b5a2c0fc6e8dc","cross_cats_sorted":[],"license":"","primary_cat":"cs.LO","submitted_at":"2006-02-07T10:10:12Z","title_canon_sha256":"0d047a3cdf2b088df9c59721ecbb31f59863ffb6a09d8cd497f2f7067b596388"},"schema_version":"1.0","source":{"id":"cs/0602024","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0602024","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0602024v4","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0602024","created_at":"2026-05-18T00:53:03Z"},{"alias_kind":"pith_short_12","alias_value":"LMRZN35GY5FU","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_16","alias_value":"LMRZN35GY5FUVGJ7","created_at":"2026-05-18T12:25:54Z"},{"alias_kind":"pith_short_8","alias_value":"LMRZN35G","created_at":"2026-05-18T12:25:54Z"}],"graph_snapshots":[{"event_id":"sha256:146c8f2491c1601713199684334e80843e7a922fd7f2dc118c429f465576e792","target":"graph","created_at":"2026-05-18T00:53:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Dimiter Vakarelov, Valentin Goranko, Willem Conradie","cross_cats":[],"headline":"","license":"","primary_cat":"cs.LO","submitted_at":"2006-02-07T10:10:12Z","title":"Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0602024","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:165735f1e9a5363bd4cbfe5cedcbf3eeb31b844d1a49ddf405e28d089739a131","target":"record","created_at":"2026-05-18T00:53:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a16738b90438f1242478c59d31b73450ddce797e370ee53db38b5a2c0fc6e8dc","cross_cats_sorted":[],"license":"","primary_cat":"cs.LO","submitted_at":"2006-02-07T10:10:12Z","title_canon_sha256":"0d047a3cdf2b088df9c59721ecbb31f59863ffb6a09d8cd497f2f7067b596388"},"schema_version":"1.0","source":{"id":"cs/0602024","kind":"arxiv","version":4}},"canonical_sha256":"5b2396efa6c74b4a993f3a4c8cf24ed6126a2a8d9dae7a189bfe0a69bf0c628e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b2396efa6c74b4a993f3a4c8cf24ed6126a2a8d9dae7a189bfe0a69bf0c628e","first_computed_at":"2026-05-18T00:53:03.403874Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:03.403874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZAelJ50xE64qvXZ1miZeFcfU1rZoxqPfV06tzsDpo/f9R0TMhBxW5OdLrNLk4EOAK8z0Nfiex3lde9UnDxsCCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:03.404305Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0602024","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:165735f1e9a5363bd4cbfe5cedcbf3eeb31b844d1a49ddf405e28d089739a131","sha256:146c8f2491c1601713199684334e80843e7a922fd7f2dc118c429f465576e792"],"state_sha256":"39f6c58303408fd81f19a99aa6f2260c07b31f59798be5eedbf66d645707e5c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gsd28am6/AC2nC7jYTsqQ3tJMRnMgBAzOCNlzXWP/FgRon94vy9Ml2QENSOpUeYMGUo35UEk0Go5Vez6ZnfkCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T23:33:27.806173Z","bundle_sha256":"9278e93df14016ef3f34ac9a5ef76b914d7e49470343434a91341604cca0bdc1"}}