{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VM3M2PE4SAITVLBMYHX4HUZXVN","short_pith_number":"pith:VM3M2PE4","schema_version":"1.0","canonical_sha256":"ab36cd3c9c90113aac2cc1efc3d337ab7122c3acedbf717fc47525da27c428e8","source":{"kind":"arxiv","id":"2606.03413","version":1},"attestation_state":"computed","paper":{"title":"Non-Wellfounded and Cyclic Proofs for LTL: A Syntactic Correspondence with Linear Nested Sequents","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"cs.LO","authors_text":"Lukas Zenger, Tim S. Lyon","submitted_at":"2026-06-02T09:57:08Z","abstract_excerpt":"We introduce and investigate non-wellfounded and cyclic linear nested sequent calculi, and, as a case study, develop such systems for linear temporal logic (LTL). The paper addresses two central problems, which we call 'cycle recognition' and 'unraveling.' Cycle recognition concerns identifying cycles in non-wellfounded proofs in order to extract corresponding cyclic proofs, while unraveling studies the converse transformation, from cyclic proofs to non-wellfounded ones. Although these processes are well understood for Gentzen sequents, they have received little attention for more expressive s"},"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":"2606.03413","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-06-02T09:57:08Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"35887d6440b46cd669dd8c847e2802b03e5e5de351d4dddc3094793cedc9c78d","abstract_canon_sha256":"fd76c149fd07680a9d31222e4ec00eb6f7bce0a67188a0ad870683391b34001a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:57.204627Z","signature_b64":"mP/N2450PZSS4rGc5lnMWXI6V/6mhrWheEgPlO6GAG/CUi31fjfCyBVtj9rxERfNauYzfTGxLdhgfmKglUQDAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab36cd3c9c90113aac2cc1efc3d337ab7122c3acedbf717fc47525da27c428e8","last_reissued_at":"2026-06-03T01:05:57.204075Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:57.204075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Wellfounded and Cyclic Proofs for LTL: A Syntactic Correspondence with Linear Nested Sequents","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"cs.LO","authors_text":"Lukas Zenger, Tim S. Lyon","submitted_at":"2026-06-02T09:57:08Z","abstract_excerpt":"We introduce and investigate non-wellfounded and cyclic linear nested sequent calculi, and, as a case study, develop such systems for linear temporal logic (LTL). The paper addresses two central problems, which we call 'cycle recognition' and 'unraveling.' Cycle recognition concerns identifying cycles in non-wellfounded proofs in order to extract corresponding cyclic proofs, while unraveling studies the converse transformation, from cyclic proofs to non-wellfounded ones. Although these processes are well understood for Gentzen sequents, they have received little attention for more expressive s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.03413","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/2606.03413/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":"2606.03413","created_at":"2026-06-03T01:05:57.204180+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.03413v1","created_at":"2026-06-03T01:05:57.204180+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.03413","created_at":"2026-06-03T01:05:57.204180+00:00"},{"alias_kind":"pith_short_12","alias_value":"VM3M2PE4SAIT","created_at":"2026-06-03T01:05:57.204180+00:00"},{"alias_kind":"pith_short_16","alias_value":"VM3M2PE4SAITVLBM","created_at":"2026-06-03T01:05:57.204180+00:00"},{"alias_kind":"pith_short_8","alias_value":"VM3M2PE4","created_at":"2026-06-03T01:05:57.204180+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/VM3M2PE4SAITVLBMYHX4HUZXVN","json":"https://pith.science/pith/VM3M2PE4SAITVLBMYHX4HUZXVN.json","graph_json":"https://pith.science/api/pith-number/VM3M2PE4SAITVLBMYHX4HUZXVN/graph.json","events_json":"https://pith.science/api/pith-number/VM3M2PE4SAITVLBMYHX4HUZXVN/events.json","paper":"https://pith.science/paper/VM3M2PE4"},"agent_actions":{"view_html":"https://pith.science/pith/VM3M2PE4SAITVLBMYHX4HUZXVN","download_json":"https://pith.science/pith/VM3M2PE4SAITVLBMYHX4HUZXVN.json","view_paper":"https://pith.science/paper/VM3M2PE4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.03413&json=true","fetch_graph":"https://pith.science/api/pith-number/VM3M2PE4SAITVLBMYHX4HUZXVN/graph.json","fetch_events":"https://pith.science/api/pith-number/VM3M2PE4SAITVLBMYHX4HUZXVN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VM3M2PE4SAITVLBMYHX4HUZXVN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VM3M2PE4SAITVLBMYHX4HUZXVN/action/storage_attestation","attest_author":"https://pith.science/pith/VM3M2PE4SAITVLBMYHX4HUZXVN/action/author_attestation","sign_citation":"https://pith.science/pith/VM3M2PE4SAITVLBMYHX4HUZXVN/action/citation_signature","submit_replication":"https://pith.science/pith/VM3M2PE4SAITVLBMYHX4HUZXVN/action/replication_record"}},"created_at":"2026-06-03T01:05:57.204180+00:00","updated_at":"2026-06-03T01:05:57.204180+00:00"}