{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:T4VNRMSCT2RDEMXCF6HUGNO6XK","short_pith_number":"pith:T4VNRMSC","schema_version":"1.0","canonical_sha256":"9f2ad8b2429ea23232e22f8f4335debaba29300a73bcb3b6bd946a1279336d92","source":{"kind":"arxiv","id":"1701.03255","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.03255","created_at":"2026-05-18T00:52:58.106995+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.03255v1","created_at":"2026-05-18T00:52:58.106995+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03255","created_at":"2026-05-18T00:52:58.106995+00:00"},{"alias_kind":"pith_short_12","alias_value":"T4VNRMSCT2RD","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"T4VNRMSCT2RDEMXC","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"T4VNRMSC","created_at":"2026-05-18T12:31:43.269735+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/T4VNRMSCT2RDEMXCF6HUGNO6XK","json":"https://pith.science/pith/T4VNRMSCT2RDEMXCF6HUGNO6XK.json","graph_json":"https://pith.science/api/pith-number/T4VNRMSCT2RDEMXCF6HUGNO6XK/graph.json","events_json":"https://pith.science/api/pith-number/T4VNRMSCT2RDEMXCF6HUGNO6XK/events.json","paper":"https://pith.science/paper/T4VNRMSC"},"agent_actions":{"view_html":"https://pith.science/pith/T4VNRMSCT2RDEMXCF6HUGNO6XK","download_json":"https://pith.science/pith/T4VNRMSCT2RDEMXCF6HUGNO6XK.json","view_paper":"https://pith.science/paper/T4VNRMSC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.03255&json=true","fetch_graph":"https://pith.science/api/pith-number/T4VNRMSCT2RDEMXCF6HUGNO6XK/graph.json","fetch_events":"https://pith.science/api/pith-number/T4VNRMSCT2RDEMXCF6HUGNO6XK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T4VNRMSCT2RDEMXCF6HUGNO6XK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T4VNRMSCT2RDEMXCF6HUGNO6XK/action/storage_attestation","attest_author":"https://pith.science/pith/T4VNRMSCT2RDEMXCF6HUGNO6XK/action/author_attestation","sign_citation":"https://pith.science/pith/T4VNRMSCT2RDEMXCF6HUGNO6XK/action/citation_signature","submit_replication":"https://pith.science/pith/T4VNRMSCT2RDEMXCF6HUGNO6XK/action/replication_record"}},"created_at":"2026-05-18T00:52:58.106995+00:00","updated_at":"2026-05-18T00:52:58.106995+00:00"}