{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UC6VW6XHUZY3TBEZJOLMUJSZVN","short_pith_number":"pith:UC6VW6XH","canonical_record":{"source":{"id":"1804.02312","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-03-12T09:07:52Z","cross_cats_sorted":[],"title_canon_sha256":"c66d320bc16d58fe85b54a3185ab20508e8c6ab67dbeef382c78c0cf3f5b3178","abstract_canon_sha256":"e848d355a405a74fb8128036118f5ed34a9d9250f9ca91fc82385a742c26b326"},"schema_version":"1.0"},"canonical_sha256":"a0bd5b7ae7a671b984994b96ca2659ab68bb227337dc8a65cf111eb9551ea6fd","source":{"kind":"arxiv","id":"1804.02312","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.02312","created_at":"2026-05-17T23:45:46Z"},{"alias_kind":"arxiv_version","alias_value":"1804.02312v2","created_at":"2026-05-17T23:45:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02312","created_at":"2026-05-17T23:45:46Z"},{"alias_kind":"pith_short_12","alias_value":"UC6VW6XHUZY3","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UC6VW6XHUZY3TBEZ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UC6VW6XH","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UC6VW6XHUZY3TBEZJOLMUJSZVN","target":"record","payload":{"canonical_record":{"source":{"id":"1804.02312","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-03-12T09:07:52Z","cross_cats_sorted":[],"title_canon_sha256":"c66d320bc16d58fe85b54a3185ab20508e8c6ab67dbeef382c78c0cf3f5b3178","abstract_canon_sha256":"e848d355a405a74fb8128036118f5ed34a9d9250f9ca91fc82385a742c26b326"},"schema_version":"1.0"},"canonical_sha256":"a0bd5b7ae7a671b984994b96ca2659ab68bb227337dc8a65cf111eb9551ea6fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:46.885838Z","signature_b64":"qSBGQP0N+UcQR5rN7MoT/92fBbT7pP1h8gmKAC+ARJZmGSIa+w/EoxEFs9wUYa/psczcSgPdVUQlGl0DrMdOAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0bd5b7ae7a671b984994b96ca2659ab68bb227337dc8a65cf111eb9551ea6fd","last_reissued_at":"2026-05-17T23:45:46.885156Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:46.885156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.02312","source_version":2,"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-17T23:45:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YeI8bUSmQPB1pwiqvGkl/vaHoWgOXDsMWS3X4hsus5HnHRbH0Xq0ypV27qtiTBTH0hMgmFggeMU2dcD0QaRNAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T18:58:11.188106Z"},"content_sha256":"480bcc2452ffc97c33b245230ef850a7b3d745c1098c80be772ced583caad6f0","schema_version":"1.0","event_id":"sha256:480bcc2452ffc97c33b245230ef850a7b3d745c1098c80be772ced583caad6f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UC6VW6XHUZY3TBEZJOLMUJSZVN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Derivation languages, descriptional complexity measures and decision problems of a class of flat splicing systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Kumar Sankar Ray, Prithwineel Paul","submitted_at":"2018-03-12T09:07:52Z","abstract_excerpt":"In this paper, we associate the idea of derivation languages with flat splicing systems and compare the families of derivation languages (Szilard and control languages) of these systems with the family of languages in Chomsky hierarchy. We show that the family of Szilard languages of labeled flat finite splicing systems of type $( m, n)$ (i.e., $SZLS_{n, FIN}^{m}$ ) and $REG$, $CF$ and $CS$ are incomparable. Also, it is decidable whether or not $SZ_{n, FIN}^{m}(\\mathscr{LS}) \\subseteq R$ and $R \\subseteq SZ_{n, FIN}^{m}(\\mathscr{LS})$ for any regular language $R$ and labeled flat finite splici"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02312","kind":"arxiv","version":2},"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-17T23:45:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/6NQrgCio6bVhfwgskpNkhkBjd04THQr9BfkPIbb2rpmXzT2hC8xUgrkziwOjOpuOLlMOedJgYt1WY95hIPSCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T18:58:11.188464Z"},"content_sha256":"1e79a1e022f5da92c1dd31883b1d8b840294b9545968df80650d4ed7b2ec42b7","schema_version":"1.0","event_id":"sha256:1e79a1e022f5da92c1dd31883b1d8b840294b9545968df80650d4ed7b2ec42b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UC6VW6XHUZY3TBEZJOLMUJSZVN/bundle.json","state_url":"https://pith.science/pith/UC6VW6XHUZY3TBEZJOLMUJSZVN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UC6VW6XHUZY3TBEZJOLMUJSZVN/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-07-01T18:58:11Z","links":{"resolver":"https://pith.science/pith/UC6VW6XHUZY3TBEZJOLMUJSZVN","bundle":"https://pith.science/pith/UC6VW6XHUZY3TBEZJOLMUJSZVN/bundle.json","state":"https://pith.science/pith/UC6VW6XHUZY3TBEZJOLMUJSZVN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UC6VW6XHUZY3TBEZJOLMUJSZVN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UC6VW6XHUZY3TBEZJOLMUJSZVN","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":"e848d355a405a74fb8128036118f5ed34a9d9250f9ca91fc82385a742c26b326","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-03-12T09:07:52Z","title_canon_sha256":"c66d320bc16d58fe85b54a3185ab20508e8c6ab67dbeef382c78c0cf3f5b3178"},"schema_version":"1.0","source":{"id":"1804.02312","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.02312","created_at":"2026-05-17T23:45:46Z"},{"alias_kind":"arxiv_version","alias_value":"1804.02312v2","created_at":"2026-05-17T23:45:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02312","created_at":"2026-05-17T23:45:46Z"},{"alias_kind":"pith_short_12","alias_value":"UC6VW6XHUZY3","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UC6VW6XHUZY3TBEZ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UC6VW6XH","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:1e79a1e022f5da92c1dd31883b1d8b840294b9545968df80650d4ed7b2ec42b7","target":"graph","created_at":"2026-05-17T23:45:46Z","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":"In this paper, we associate the idea of derivation languages with flat splicing systems and compare the families of derivation languages (Szilard and control languages) of these systems with the family of languages in Chomsky hierarchy. We show that the family of Szilard languages of labeled flat finite splicing systems of type $( m, n)$ (i.e., $SZLS_{n, FIN}^{m}$ ) and $REG$, $CF$ and $CS$ are incomparable. Also, it is decidable whether or not $SZ_{n, FIN}^{m}(\\mathscr{LS}) \\subseteq R$ and $R \\subseteq SZ_{n, FIN}^{m}(\\mathscr{LS})$ for any regular language $R$ and labeled flat finite splici","authors_text":"Kumar Sankar Ray, Prithwineel Paul","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-03-12T09:07:52Z","title":"Derivation languages, descriptional complexity measures and decision problems of a class of flat splicing systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02312","kind":"arxiv","version":2},"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:480bcc2452ffc97c33b245230ef850a7b3d745c1098c80be772ced583caad6f0","target":"record","created_at":"2026-05-17T23:45:46Z","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":"e848d355a405a74fb8128036118f5ed34a9d9250f9ca91fc82385a742c26b326","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-03-12T09:07:52Z","title_canon_sha256":"c66d320bc16d58fe85b54a3185ab20508e8c6ab67dbeef382c78c0cf3f5b3178"},"schema_version":"1.0","source":{"id":"1804.02312","kind":"arxiv","version":2}},"canonical_sha256":"a0bd5b7ae7a671b984994b96ca2659ab68bb227337dc8a65cf111eb9551ea6fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0bd5b7ae7a671b984994b96ca2659ab68bb227337dc8a65cf111eb9551ea6fd","first_computed_at":"2026-05-17T23:45:46.885156Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:46.885156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qSBGQP0N+UcQR5rN7MoT/92fBbT7pP1h8gmKAC+ARJZmGSIa+w/EoxEFs9wUYa/psczcSgPdVUQlGl0DrMdOAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:46.885838Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.02312","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:480bcc2452ffc97c33b245230ef850a7b3d745c1098c80be772ced583caad6f0","sha256:1e79a1e022f5da92c1dd31883b1d8b840294b9545968df80650d4ed7b2ec42b7"],"state_sha256":"3845681017c20047106cf19eee478557e4dae63646fa78073d3e7cc444bbb805"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d5StegnFUYa/t7Xhsp8lIrqUxTwDMLjGPKsLBsZncjo9EDCOu3o40AR+WzgAuc0Q+e1PLmRk4Cs4wdt0iH2QCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T18:58:11.190323Z","bundle_sha256":"3ac5ffdafa63ef09aea6b1887e8c25804a8624fa6ecb323bf80c3b9db6900ff4"}}