{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:T4VNRMSCT2RDEMXCF6HUGNO6XK","short_pith_number":"pith:T4VNRMSC","canonical_record":{"source":{"id":"1701.03255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-01-12T06:47:46Z","cross_cats_sorted":[],"title_canon_sha256":"a56a79f12e18e8db87e612d23762c8848d55779ef5cb5d0878a6ced4b443f8f2","abstract_canon_sha256":"14fbfcd8a86762c29a4a81484def1bbe3f84fbc48c5b2f296830c4817c217faa"},"schema_version":"1.0"},"canonical_sha256":"9f2ad8b2429ea23232e22f8f4335debaba29300a73bcb3b6bd946a1279336d92","source":{"kind":"arxiv","id":"1701.03255","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03255","created_at":"2026-05-18T00:52:58Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03255v1","created_at":"2026-05-18T00:52:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03255","created_at":"2026-05-18T00:52:58Z"},{"alias_kind":"pith_short_12","alias_value":"T4VNRMSCT2RD","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"T4VNRMSCT2RDEMXC","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"T4VNRMSC","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:T4VNRMSCT2RDEMXCF6HUGNO6XK","target":"record","payload":{"canonical_record":{"source":{"id":"1701.03255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-01-12T06:47:46Z","cross_cats_sorted":[],"title_canon_sha256":"a56a79f12e18e8db87e612d23762c8848d55779ef5cb5d0878a6ced4b443f8f2","abstract_canon_sha256":"14fbfcd8a86762c29a4a81484def1bbe3f84fbc48c5b2f296830c4817c217faa"},"schema_version":"1.0"},"canonical_sha256":"9f2ad8b2429ea23232e22f8f4335debaba29300a73bcb3b6bd946a1279336d92","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:58.107487Z","signature_b64":"8I2+EldAU8US2U/drqmCd+ChEP2/p7vzmtEraBapYOuFVU9A/QBC7tEoIIPP9RYWtznRnfolJ13Sd4RaAW44AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f2ad8b2429ea23232e22f8f4335debaba29300a73bcb3b6bd946a1279336d92","last_reissued_at":"2026-05-18T00:52:58.106902Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:58.106902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.03255","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-18T00:52:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mrelrmurGTv0aSPhbhKJmOcF7pE6BpCHlsbp1tKKIU4iNRKfIBxI6g1b0UH5qusFMJyNaQiAi551VbzjG60dAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T14:08:30.359411Z"},"content_sha256":"c14c4340511837af24efe36aff639da1329d5f86b33eabde3d99c67e44511b24","schema_version":"1.0","event_id":"sha256:c14c4340511837af24efe36aff639da1329d5f86b33eabde3d99c67e44511b24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:T4VNRMSCT2RDEMXCF6HUGNO6XK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of L-reachability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Balagopal Komarath, Jayalal Sarma, K. S. Sunil","submitted_at":"2017-01-12T06:47:46Z","abstract_excerpt":"We initiate a complexity theoretic study of the language based graph reachability problem (L-REACH) : Fix a language L. Given a graph whose edges are labeled with alphabet symbols of the language L and two special vertices s and t, test if there is path P from s to t in the graph such that the concatenation of the symbols seen from s to t in the path P forms a string in the language L. We study variants of this problem with different graph classes and different language classes and obtain complexity theoretic characterizations for all of them. Our main results are the following: 1.Restricting "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03255","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-18T00:52:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cVazGf5KawtjRnp15LyfHW44z5elvxMwxeoJSZjCQk0ELvaeUF7XHsbBUkfzNYBX8MyLfkRN9Rhu43CphNQcAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T14:08:30.360118Z"},"content_sha256":"815e187de2162aef1a5a72f2c963017ed6125c8f241e64b4eca802c777f433c3","schema_version":"1.0","event_id":"sha256:815e187de2162aef1a5a72f2c963017ed6125c8f241e64b4eca802c777f433c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T4VNRMSCT2RDEMXCF6HUGNO6XK/bundle.json","state_url":"https://pith.science/pith/T4VNRMSCT2RDEMXCF6HUGNO6XK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T4VNRMSCT2RDEMXCF6HUGNO6XK/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-23T14:08:30Z","links":{"resolver":"https://pith.science/pith/T4VNRMSCT2RDEMXCF6HUGNO6XK","bundle":"https://pith.science/pith/T4VNRMSCT2RDEMXCF6HUGNO6XK/bundle.json","state":"https://pith.science/pith/T4VNRMSCT2RDEMXCF6HUGNO6XK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T4VNRMSCT2RDEMXCF6HUGNO6XK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:T4VNRMSCT2RDEMXCF6HUGNO6XK","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":"14fbfcd8a86762c29a4a81484def1bbe3f84fbc48c5b2f296830c4817c217faa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-01-12T06:47:46Z","title_canon_sha256":"a56a79f12e18e8db87e612d23762c8848d55779ef5cb5d0878a6ced4b443f8f2"},"schema_version":"1.0","source":{"id":"1701.03255","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03255","created_at":"2026-05-18T00:52:58Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03255v1","created_at":"2026-05-18T00:52:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03255","created_at":"2026-05-18T00:52:58Z"},{"alias_kind":"pith_short_12","alias_value":"T4VNRMSCT2RD","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"T4VNRMSCT2RDEMXC","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"T4VNRMSC","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:815e187de2162aef1a5a72f2c963017ed6125c8f241e64b4eca802c777f433c3","target":"graph","created_at":"2026-05-18T00:52:58Z","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":"We initiate a complexity theoretic study of the language based graph reachability problem (L-REACH) : Fix a language L. Given a graph whose edges are labeled with alphabet symbols of the language L and two special vertices s and t, test if there is path P from s to t in the graph such that the concatenation of the symbols seen from s to t in the path P forms a string in the language L. We study variants of this problem with different graph classes and different language classes and obtain complexity theoretic characterizations for all of them. Our main results are the following: 1.Restricting ","authors_text":"Balagopal Komarath, Jayalal Sarma, K. S. Sunil","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-01-12T06:47:46Z","title":"On the Complexity of L-reachability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03255","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:c14c4340511837af24efe36aff639da1329d5f86b33eabde3d99c67e44511b24","target":"record","created_at":"2026-05-18T00:52:58Z","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":"14fbfcd8a86762c29a4a81484def1bbe3f84fbc48c5b2f296830c4817c217faa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-01-12T06:47:46Z","title_canon_sha256":"a56a79f12e18e8db87e612d23762c8848d55779ef5cb5d0878a6ced4b443f8f2"},"schema_version":"1.0","source":{"id":"1701.03255","kind":"arxiv","version":1}},"canonical_sha256":"9f2ad8b2429ea23232e22f8f4335debaba29300a73bcb3b6bd946a1279336d92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f2ad8b2429ea23232e22f8f4335debaba29300a73bcb3b6bd946a1279336d92","first_computed_at":"2026-05-18T00:52:58.106902Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:58.106902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8I2+EldAU8US2U/drqmCd+ChEP2/p7vzmtEraBapYOuFVU9A/QBC7tEoIIPP9RYWtznRnfolJ13Sd4RaAW44AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:58.107487Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.03255","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c14c4340511837af24efe36aff639da1329d5f86b33eabde3d99c67e44511b24","sha256:815e187de2162aef1a5a72f2c963017ed6125c8f241e64b4eca802c777f433c3"],"state_sha256":"fff0569849e70a8a87a225ecc2a4f311d6fec04aa16a7756fd24f3f297df8248"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8vvV05Etd5AdjC1zx1vZruBZ55xOPjH56CZNIjBi1Oaf7Vxnt/AjjpYPhRh2fSSWAf4OhpaBQxwyVvht7sLaBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T14:08:30.364116Z","bundle_sha256":"87f84d27873e230587c41c7d0947ba6c5981f942799697952ebf143aee7ee310"}}