{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:KMCYRVIJKRXZKSAOOMIZV34PAJ","short_pith_number":"pith:KMCYRVIJ","schema_version":"1.0","canonical_sha256":"530588d509546f95480e73119aef8f025f18c828618d4c73e4fd4e894a13316e","source":{"kind":"arxiv","id":"2607.23798","version":1},"attestation_state":"computed","paper":{"title":"Interpolation via Generalized Splitting","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Lutz Stra{\\ss}burger","submitted_at":"2026-07-26T18:50:09Z","abstract_excerpt":"We propose a new proof theoretical method for proving Lyndon interpolation. Our proof does not use the sequent calculus but is based on a generalization of the splitting lemma in deep inference. We then formulate the interpolation theorem as a decomposition of a derivation into an up-fragment and a down-fragment. This can be seen as (i) a strengthening of the standard formulation of the interpolation theorem, and (ii) a generalization of the cut elimination theorem. We demonstrate the flexibility of our approach by applying it to linear logic, classical logic, and modal logics. For this, we al"},"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":"2607.23798","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-07-26T18:50:09Z","cross_cats_sorted":[],"title_canon_sha256":"673a46d2f888d23f41bc3d2355891fcefc506c09363660530d9cd4157b67ce90","abstract_canon_sha256":"e3d8fe622b6760f88cbd1be8968ecbc42be5b3c4ca4367d66c5fa2e2f055e370"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-28T01:23:11.693113Z","signature_b64":"MXQQZnIeBINl+SR5nlAoEsGb4mO5NlQPSMcPBqZOvjObAFNKOvCEgcs2kHysXHtIMPPa5U+yMeBEOZPJ4GhFAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"530588d509546f95480e73119aef8f025f18c828618d4c73e4fd4e894a13316e","last_reissued_at":"2026-07-28T01:23:11.692305Z","signature_status":"signed_v1","first_computed_at":"2026-07-28T01:23:11.692305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Interpolation via Generalized Splitting","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Lutz Stra{\\ss}burger","submitted_at":"2026-07-26T18:50:09Z","abstract_excerpt":"We propose a new proof theoretical method for proving Lyndon interpolation. Our proof does not use the sequent calculus but is based on a generalization of the splitting lemma in deep inference. We then formulate the interpolation theorem as a decomposition of a derivation into an up-fragment and a down-fragment. This can be seen as (i) a strengthening of the standard formulation of the interpolation theorem, and (ii) a generalization of the cut elimination theorem. We demonstrate the flexibility of our approach by applying it to linear logic, classical logic, and modal logics. For this, we al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.23798","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.23798/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":"2607.23798","created_at":"2026-07-28T01:23:11.692732+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.23798v1","created_at":"2026-07-28T01:23:11.692732+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.23798","created_at":"2026-07-28T01:23:11.692732+00:00"},{"alias_kind":"pith_short_12","alias_value":"KMCYRVIJKRXZ","created_at":"2026-07-28T01:23:11.692732+00:00"},{"alias_kind":"pith_short_16","alias_value":"KMCYRVIJKRXZKSAO","created_at":"2026-07-28T01:23:11.692732+00:00"},{"alias_kind":"pith_short_8","alias_value":"KMCYRVIJ","created_at":"2026-07-28T01:23:11.692732+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/KMCYRVIJKRXZKSAOOMIZV34PAJ","json":"https://pith.science/pith/KMCYRVIJKRXZKSAOOMIZV34PAJ.json","graph_json":"https://pith.science/api/pith-number/KMCYRVIJKRXZKSAOOMIZV34PAJ/graph.json","events_json":"https://pith.science/api/pith-number/KMCYRVIJKRXZKSAOOMIZV34PAJ/events.json","paper":"https://pith.science/paper/KMCYRVIJ"},"agent_actions":{"view_html":"https://pith.science/pith/KMCYRVIJKRXZKSAOOMIZV34PAJ","download_json":"https://pith.science/pith/KMCYRVIJKRXZKSAOOMIZV34PAJ.json","view_paper":"https://pith.science/paper/KMCYRVIJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.23798&json=true","fetch_graph":"https://pith.science/api/pith-number/KMCYRVIJKRXZKSAOOMIZV34PAJ/graph.json","fetch_events":"https://pith.science/api/pith-number/KMCYRVIJKRXZKSAOOMIZV34PAJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KMCYRVIJKRXZKSAOOMIZV34PAJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KMCYRVIJKRXZKSAOOMIZV34PAJ/action/storage_attestation","attest_author":"https://pith.science/pith/KMCYRVIJKRXZKSAOOMIZV34PAJ/action/author_attestation","sign_citation":"https://pith.science/pith/KMCYRVIJKRXZKSAOOMIZV34PAJ/action/citation_signature","submit_replication":"https://pith.science/pith/KMCYRVIJKRXZKSAOOMIZV34PAJ/action/replication_record"}},"created_at":"2026-07-28T01:23:11.692732+00:00","updated_at":"2026-07-28T01:23:11.692732+00:00"}