{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:SSFXCXXLY4DBC4RT4RFNTDMOXZ","short_pith_number":"pith:SSFXCXXL","canonical_record":{"source":{"id":"1110.2318","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.FL","submitted_at":"2011-10-11T10:10:28Z","cross_cats_sorted":[],"title_canon_sha256":"349d1f5a7825b88283203b5c37bb7dab80b65b7df13397cb85828be6ac1e1d6d","abstract_canon_sha256":"beb81716cb575d48a38c0b3c9a23f06530b12432c96d5e9c7861ab25a2ee175f"},"schema_version":"1.0"},"canonical_sha256":"948b715eebc706117233e44ad98d8ebe669b5f538c84da8c1e6d3ecac4a85389","source":{"kind":"arxiv","id":"1110.2318","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.2318","created_at":"2026-05-18T03:08:59Z"},{"alias_kind":"arxiv_version","alias_value":"1110.2318v1","created_at":"2026-05-18T03:08:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2318","created_at":"2026-05-18T03:08:59Z"},{"alias_kind":"pith_short_12","alias_value":"SSFXCXXLY4DB","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SSFXCXXLY4DBC4RT","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SSFXCXXL","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:SSFXCXXLY4DBC4RT4RFNTDMOXZ","target":"record","payload":{"canonical_record":{"source":{"id":"1110.2318","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.FL","submitted_at":"2011-10-11T10:10:28Z","cross_cats_sorted":[],"title_canon_sha256":"349d1f5a7825b88283203b5c37bb7dab80b65b7df13397cb85828be6ac1e1d6d","abstract_canon_sha256":"beb81716cb575d48a38c0b3c9a23f06530b12432c96d5e9c7861ab25a2ee175f"},"schema_version":"1.0"},"canonical_sha256":"948b715eebc706117233e44ad98d8ebe669b5f538c84da8c1e6d3ecac4a85389","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:59.868120Z","signature_b64":"qivP8n8BA1W4pg8e2RXByCd2r6F4flMgLxlXNk/YO6Lhou7b2KHcvYRb/z7kiwpGGETGR9VSmz6E0O38o3l4AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"948b715eebc706117233e44ad98d8ebe669b5f538c84da8c1e6d3ecac4a85389","last_reissued_at":"2026-05-18T03:08:59.867521Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:59.867521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.2318","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:08:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jmYD6J98UkIQFbQtcYHbre+GW3hMQwEYx5bp/So07pGQezfvDzBGnOM+oBVCrI31tIZPWg8ZFGkygq56f1tkAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:50:20.750162Z"},"content_sha256":"50db01d0477f2d63d7ce01b6e25ae11f2074db1af6249711f7dc771a752f2536","schema_version":"1.0","event_id":"sha256:50db01d0477f2d63d7ce01b6e25ae11f2074db1af6249711f7dc771a752f2536"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:SSFXCXXLY4DBC4RT4RFNTDMOXZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compressed Membership for NFA (DFA) with Compressed Labels is in NP (P)","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Artur Je\\.z","submitted_at":"2011-10-11T10:10:28Z","abstract_excerpt":"In this paper, a compressed membership problem for finite automata, both deterministic and non-deterministic, with compressed transition labels is studied. The compression is represented by straight-line programs (SLPs), i.e. context-free grammars generating exactly one string. A novel technique of dealing with SLPs is introduced: the SLPs are recompressed, so that substrings of the input text are encoded in SLPs labelling the transitions of the NFA (DFA) in the same way, as in the SLP representing the input text. To this end, the SLPs are locally decompressed and then recompressed in a unifor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2318","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:08:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HM/EUxgC/BdyGGB2WTgwOtW520mVfIiQxKCeOFiQw2oCQsghlf2ztoblNz6SGD9z7g7nqluxhg+yoTNncKHMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:50:20.750522Z"},"content_sha256":"aadd1f205d5f8272b8ae39c32ce558bde0bb06064a43f70a7b19aea8f01dbc1e","schema_version":"1.0","event_id":"sha256:aadd1f205d5f8272b8ae39c32ce558bde0bb06064a43f70a7b19aea8f01dbc1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SSFXCXXLY4DBC4RT4RFNTDMOXZ/bundle.json","state_url":"https://pith.science/pith/SSFXCXXLY4DBC4RT4RFNTDMOXZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SSFXCXXLY4DBC4RT4RFNTDMOXZ/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-06-02T07:50:20Z","links":{"resolver":"https://pith.science/pith/SSFXCXXLY4DBC4RT4RFNTDMOXZ","bundle":"https://pith.science/pith/SSFXCXXLY4DBC4RT4RFNTDMOXZ/bundle.json","state":"https://pith.science/pith/SSFXCXXLY4DBC4RT4RFNTDMOXZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SSFXCXXLY4DBC4RT4RFNTDMOXZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:SSFXCXXLY4DBC4RT4RFNTDMOXZ","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":"beb81716cb575d48a38c0b3c9a23f06530b12432c96d5e9c7861ab25a2ee175f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.FL","submitted_at":"2011-10-11T10:10:28Z","title_canon_sha256":"349d1f5a7825b88283203b5c37bb7dab80b65b7df13397cb85828be6ac1e1d6d"},"schema_version":"1.0","source":{"id":"1110.2318","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.2318","created_at":"2026-05-18T03:08:59Z"},{"alias_kind":"arxiv_version","alias_value":"1110.2318v1","created_at":"2026-05-18T03:08:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2318","created_at":"2026-05-18T03:08:59Z"},{"alias_kind":"pith_short_12","alias_value":"SSFXCXXLY4DB","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SSFXCXXLY4DBC4RT","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SSFXCXXL","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:aadd1f205d5f8272b8ae39c32ce558bde0bb06064a43f70a7b19aea8f01dbc1e","target":"graph","created_at":"2026-05-18T03:08:59Z","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, a compressed membership problem for finite automata, both deterministic and non-deterministic, with compressed transition labels is studied. The compression is represented by straight-line programs (SLPs), i.e. context-free grammars generating exactly one string. A novel technique of dealing with SLPs is introduced: the SLPs are recompressed, so that substrings of the input text are encoded in SLPs labelling the transitions of the NFA (DFA) in the same way, as in the SLP representing the input text. To this end, the SLPs are locally decompressed and then recompressed in a unifor","authors_text":"Artur Je\\.z","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.FL","submitted_at":"2011-10-11T10:10:28Z","title":"Compressed Membership for NFA (DFA) with Compressed Labels is in NP (P)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2318","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:50db01d0477f2d63d7ce01b6e25ae11f2074db1af6249711f7dc771a752f2536","target":"record","created_at":"2026-05-18T03:08:59Z","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":"beb81716cb575d48a38c0b3c9a23f06530b12432c96d5e9c7861ab25a2ee175f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.FL","submitted_at":"2011-10-11T10:10:28Z","title_canon_sha256":"349d1f5a7825b88283203b5c37bb7dab80b65b7df13397cb85828be6ac1e1d6d"},"schema_version":"1.0","source":{"id":"1110.2318","kind":"arxiv","version":1}},"canonical_sha256":"948b715eebc706117233e44ad98d8ebe669b5f538c84da8c1e6d3ecac4a85389","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"948b715eebc706117233e44ad98d8ebe669b5f538c84da8c1e6d3ecac4a85389","first_computed_at":"2026-05-18T03:08:59.867521Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:59.867521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qivP8n8BA1W4pg8e2RXByCd2r6F4flMgLxlXNk/YO6Lhou7b2KHcvYRb/z7kiwpGGETGR9VSmz6E0O38o3l4AA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:59.868120Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.2318","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50db01d0477f2d63d7ce01b6e25ae11f2074db1af6249711f7dc771a752f2536","sha256:aadd1f205d5f8272b8ae39c32ce558bde0bb06064a43f70a7b19aea8f01dbc1e"],"state_sha256":"beee31e88fbec499adf4dc96b6d72274bbadd0ca08bdfb7ec80baf78413218ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AlxInZdxVSORd67NpUoK0mIN8jbniHjYeVS8U3AzHypGe70vPqWuf5vIfG2wqOKiaU74nd+NTUmWCKMiQFtYAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:50:20.752439Z","bundle_sha256":"4789ecb24d9a3dc7bebd1268d78877d09e6e0e169e17bb0c73ccbe448aba0328"}}