{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:EJK4SPQISOJDT5U5UFRJ7VUL5O","short_pith_number":"pith:EJK4SPQI","canonical_record":{"source":{"id":"1204.2413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-04-11T11:11:43Z","cross_cats_sorted":[],"title_canon_sha256":"84b7a79bb41426ab2415b63b1312722bb10dea6c037ea03ac6901141a888ab03","abstract_canon_sha256":"8f74acaa20ed1a80765bbdc1dbae7d4fa0729d69ab174521d7ff2aa9fb85da6f"},"schema_version":"1.0"},"canonical_sha256":"2255c93e08939239f69da1629fd68beb917dd874d2b034a97dc1d5ec50117142","source":{"kind":"arxiv","id":"1204.2413","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.2413","created_at":"2026-05-18T03:58:05Z"},{"alias_kind":"arxiv_version","alias_value":"1204.2413v1","created_at":"2026-05-18T03:58:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2413","created_at":"2026-05-18T03:58:05Z"},{"alias_kind":"pith_short_12","alias_value":"EJK4SPQISOJD","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EJK4SPQISOJDT5U5","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EJK4SPQI","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:EJK4SPQISOJDT5U5UFRJ7VUL5O","target":"record","payload":{"canonical_record":{"source":{"id":"1204.2413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-04-11T11:11:43Z","cross_cats_sorted":[],"title_canon_sha256":"84b7a79bb41426ab2415b63b1312722bb10dea6c037ea03ac6901141a888ab03","abstract_canon_sha256":"8f74acaa20ed1a80765bbdc1dbae7d4fa0729d69ab174521d7ff2aa9fb85da6f"},"schema_version":"1.0"},"canonical_sha256":"2255c93e08939239f69da1629fd68beb917dd874d2b034a97dc1d5ec50117142","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:05.369766Z","signature_b64":"pmek/86Z0WZxSJmzbg0rn35yjLC1NgTORlrIBArzTVMS6cfbglPd0Ht6itOPF49C7R/aHh0VKViUF3xS/RwmDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2255c93e08939239f69da1629fd68beb917dd874d2b034a97dc1d5ec50117142","last_reissued_at":"2026-05-18T03:58:05.369064Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:05.369064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.2413","source_version":1,"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-18T03:58:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XOtMM6HPI7jFLMYFTygL20VpElo0lDinyLE8cuPpVBKmSPcW+5rCK3LBMkk2m8H1Sy4Ha1AMZ+gwZlqLIVQPCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:04:47.775649Z"},"content_sha256":"a67e53264fa7e09a235f86bc9d35ba24e3156320df44cbab50e30d537b8be571","schema_version":"1.0","event_id":"sha256:a67e53264fa7e09a235f86bc9d35ba24e3156320df44cbab50e30d537b8be571"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:EJK4SPQISOJDT5U5UFRJ7VUL5O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Grammar Logics in Nested Sequent Calculus: Proof Theory and Decision Procedures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alwen Tiu, Egor Ianovski, Rajeev Gore","submitted_at":"2012-04-11T11:11:43Z","abstract_excerpt":"A grammar logic refers to an extension to the multi-modal logic K in which the modal axioms are generated from a formal grammar. We consider a proof theory, in nested sequent calculus, of grammar logics with converse, i.e., every modal operator [a] comes with a converse. Extending previous works on nested sequent systems for tense logics, we show all grammar logics (with or without converse) can be formalised in nested sequent calculi, where the axioms are internalised in the calculi as structural rules. Syntactic cut-elimination for these calculi is proved using a procedure similar to that fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2413","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":""},"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-18T03:58:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0pZdQb/z920hbF/J/sQxu1PbzWWHnQ099tBjs6R62PboxpdE6+TIIx49A419D1o+PmbrRolKOXB9TOZpq7sLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:04:47.776055Z"},"content_sha256":"fcae4971e0bb49ad62c813bb79657bc40b85c7d51ffe4f8104c1db366099e525","schema_version":"1.0","event_id":"sha256:fcae4971e0bb49ad62c813bb79657bc40b85c7d51ffe4f8104c1db366099e525"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EJK4SPQISOJDT5U5UFRJ7VUL5O/bundle.json","state_url":"https://pith.science/pith/EJK4SPQISOJDT5U5UFRJ7VUL5O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EJK4SPQISOJDT5U5UFRJ7VUL5O/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-05-26T15:04:47Z","links":{"resolver":"https://pith.science/pith/EJK4SPQISOJDT5U5UFRJ7VUL5O","bundle":"https://pith.science/pith/EJK4SPQISOJDT5U5UFRJ7VUL5O/bundle.json","state":"https://pith.science/pith/EJK4SPQISOJDT5U5UFRJ7VUL5O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EJK4SPQISOJDT5U5UFRJ7VUL5O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:EJK4SPQISOJDT5U5UFRJ7VUL5O","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":"8f74acaa20ed1a80765bbdc1dbae7d4fa0729d69ab174521d7ff2aa9fb85da6f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-04-11T11:11:43Z","title_canon_sha256":"84b7a79bb41426ab2415b63b1312722bb10dea6c037ea03ac6901141a888ab03"},"schema_version":"1.0","source":{"id":"1204.2413","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.2413","created_at":"2026-05-18T03:58:05Z"},{"alias_kind":"arxiv_version","alias_value":"1204.2413v1","created_at":"2026-05-18T03:58:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2413","created_at":"2026-05-18T03:58:05Z"},{"alias_kind":"pith_short_12","alias_value":"EJK4SPQISOJD","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EJK4SPQISOJDT5U5","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EJK4SPQI","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:fcae4971e0bb49ad62c813bb79657bc40b85c7d51ffe4f8104c1db366099e525","target":"graph","created_at":"2026-05-18T03:58:05Z","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":"A grammar logic refers to an extension to the multi-modal logic K in which the modal axioms are generated from a formal grammar. We consider a proof theory, in nested sequent calculus, of grammar logics with converse, i.e., every modal operator [a] comes with a converse. Extending previous works on nested sequent systems for tense logics, we show all grammar logics (with or without converse) can be formalised in nested sequent calculi, where the axioms are internalised in the calculi as structural rules. Syntactic cut-elimination for these calculi is proved using a procedure similar to that fo","authors_text":"Alwen Tiu, Egor Ianovski, Rajeev Gore","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-04-11T11:11:43Z","title":"Grammar Logics in Nested Sequent Calculus: Proof Theory and Decision Procedures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2413","kind":"arxiv","version":1},"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:a67e53264fa7e09a235f86bc9d35ba24e3156320df44cbab50e30d537b8be571","target":"record","created_at":"2026-05-18T03:58:05Z","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":"8f74acaa20ed1a80765bbdc1dbae7d4fa0729d69ab174521d7ff2aa9fb85da6f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2012-04-11T11:11:43Z","title_canon_sha256":"84b7a79bb41426ab2415b63b1312722bb10dea6c037ea03ac6901141a888ab03"},"schema_version":"1.0","source":{"id":"1204.2413","kind":"arxiv","version":1}},"canonical_sha256":"2255c93e08939239f69da1629fd68beb917dd874d2b034a97dc1d5ec50117142","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2255c93e08939239f69da1629fd68beb917dd874d2b034a97dc1d5ec50117142","first_computed_at":"2026-05-18T03:58:05.369064Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:05.369064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pmek/86Z0WZxSJmzbg0rn35yjLC1NgTORlrIBArzTVMS6cfbglPd0Ht6itOPF49C7R/aHh0VKViUF3xS/RwmDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:05.369766Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.2413","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a67e53264fa7e09a235f86bc9d35ba24e3156320df44cbab50e30d537b8be571","sha256:fcae4971e0bb49ad62c813bb79657bc40b85c7d51ffe4f8104c1db366099e525"],"state_sha256":"d41923039850ee45a4fe3711689bd4460bfa7eb0826b20b35052d669c8b120e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ifQva9Wun/WY92YFWnVxBni/IOVPC2t6VE3kFjDNRBDShND/R12lx2jwxny57L/Wci9TJYB9bo0rrIKsaW/oBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:04:47.778493Z","bundle_sha256":"f73b287615f5417b2ce9ee5d253c8f3290eaadbf51efbdab935fe396c04990b0"}}