{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:FBSLJFXRR4DIKCPNRTUX5E4HCJ","short_pith_number":"pith:FBSLJFXR","schema_version":"1.0","canonical_sha256":"2864b496f18f068509ed8ce97e9387126d6148e0dd3d8ab8728371bafe289c44","source":{"kind":"arxiv","id":"2312.05929","version":3},"attestation_state":"computed","paper":{"title":"A non-uniform view of Craig interpolation in modal logics with linear frames","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.LO","authors_text":"Agi Kurucz, Frank Wolter, Michael Zakharyaschev","submitted_at":"2023-12-10T16:30:20Z","abstract_excerpt":"Normal modal logics extending the logic K4.3 of linear transitive frames are known to lack the Craig interpolation property, except some logics of bounded depth such as S5. We turn this `negative' fact into a research question and pursue a non-uniform approach to Craig interpolation by investigating the following interpolant existence problem: decide whether there exists a Craig interpolant between two given formulas in any fixed logic above K4.3. Using a bisimulation-based characterisation of interpolant existence for descriptive frames, we show that this problem is decidable and coNP-complet"},"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":"2312.05929","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2023-12-10T16:30:20Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"f06ec59259dc437d635d75f97de0297a8ae38af87c05cae8dfe192c018cc000e","abstract_canon_sha256":"b168ecff173ce2c682d38e251f34adcdee469af4b2f0580bd0a388d7202e2a30"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:12:02.978462Z","signature_b64":"Y8E5Oyj1qgXvOleLxAIW0yTXTVdWAgm2rxwAUa3sbJcg1jQiXTPj84v0zjopK1YyEwn1Mc9Enl2QTri5uDThBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2864b496f18f068509ed8ce97e9387126d6148e0dd3d8ab8728371bafe289c44","last_reissued_at":"2026-06-19T16:12:02.978066Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:12:02.978066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A non-uniform view of Craig interpolation in modal logics with linear frames","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.LO","authors_text":"Agi Kurucz, Frank Wolter, Michael Zakharyaschev","submitted_at":"2023-12-10T16:30:20Z","abstract_excerpt":"Normal modal logics extending the logic K4.3 of linear transitive frames are known to lack the Craig interpolation property, except some logics of bounded depth such as S5. We turn this `negative' fact into a research question and pursue a non-uniform approach to Craig interpolation by investigating the following interpolant existence problem: decide whether there exists a Craig interpolant between two given formulas in any fixed logic above K4.3. Using a bisimulation-based characterisation of interpolant existence for descriptive frames, we show that this problem is decidable and coNP-complet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.05929","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2312.05929/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2312.05929","created_at":"2026-06-19T16:12:02.978125+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.05929v3","created_at":"2026-06-19T16:12:02.978125+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.05929","created_at":"2026-06-19T16:12:02.978125+00:00"},{"alias_kind":"pith_short_12","alias_value":"FBSLJFXRR4DI","created_at":"2026-06-19T16:12:02.978125+00:00"},{"alias_kind":"pith_short_16","alias_value":"FBSLJFXRR4DIKCPN","created_at":"2026-06-19T16:12:02.978125+00:00"},{"alias_kind":"pith_short_8","alias_value":"FBSLJFXR","created_at":"2026-06-19T16:12:02.978125+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2511.04577","citing_title":"The Size of Interpolants in Modal Logics","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FBSLJFXRR4DIKCPNRTUX5E4HCJ","json":"https://pith.science/pith/FBSLJFXRR4DIKCPNRTUX5E4HCJ.json","graph_json":"https://pith.science/api/pith-number/FBSLJFXRR4DIKCPNRTUX5E4HCJ/graph.json","events_json":"https://pith.science/api/pith-number/FBSLJFXRR4DIKCPNRTUX5E4HCJ/events.json","paper":"https://pith.science/paper/FBSLJFXR"},"agent_actions":{"view_html":"https://pith.science/pith/FBSLJFXRR4DIKCPNRTUX5E4HCJ","download_json":"https://pith.science/pith/FBSLJFXRR4DIKCPNRTUX5E4HCJ.json","view_paper":"https://pith.science/paper/FBSLJFXR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.05929&json=true","fetch_graph":"https://pith.science/api/pith-number/FBSLJFXRR4DIKCPNRTUX5E4HCJ/graph.json","fetch_events":"https://pith.science/api/pith-number/FBSLJFXRR4DIKCPNRTUX5E4HCJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FBSLJFXRR4DIKCPNRTUX5E4HCJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FBSLJFXRR4DIKCPNRTUX5E4HCJ/action/storage_attestation","attest_author":"https://pith.science/pith/FBSLJFXRR4DIKCPNRTUX5E4HCJ/action/author_attestation","sign_citation":"https://pith.science/pith/FBSLJFXRR4DIKCPNRTUX5E4HCJ/action/citation_signature","submit_replication":"https://pith.science/pith/FBSLJFXRR4DIKCPNRTUX5E4HCJ/action/replication_record"}},"created_at":"2026-06-19T16:12:02.978125+00:00","updated_at":"2026-06-19T16:12:02.978125+00:00"}