{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:EN3354YONBH7NERTPPCQAUT7PR","short_pith_number":"pith:EN3354YO","schema_version":"1.0","canonical_sha256":"2377bef30e684ff692337bc500527f7c4a890e763ef24d3bdcaf8710661692af","source":{"kind":"arxiv","id":"2002.00629","version":2},"attestation_state":"computed","paper":{"title":"Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alexandru I. Tomescu, Massimo Equi, Veli M\\\"akinen","submitted_at":"2020-02-03T10:01:34Z","abstract_excerpt":"We consider the following string matching problem on a node-labeled graph $G=(V,E)$: given a pattern string $P$, decide whether there exists a path in $G$ whose concatenation of node labels equals $P$. This is a basic primitive in various problems in bioinformatics, graph databases, or networks. The hardness results of Backurs and Indyk (FOCS 2016) imply that this problem cannot be solved in better than $O(|E||P|)$ time, under the Orthogonal Vectors Hypothesis (OVH), and this holds even under various restrictions on the graph (Equi et al., ICALP 2019).\n  In this paper we consider its offline v"},"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":"2002.00629","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-02-03T10:01:34Z","cross_cats_sorted":[],"title_canon_sha256":"2cd3047e88fba37ce278787f4bb81a7c95f988e6d31fb672bda81f85f22e8f90","abstract_canon_sha256":"2a25f6127b5339a9f51677b16e2458808387de1cb09d110debc8a82e53f20ed4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:45:44.527246Z","signature_b64":"/u7TcX0Dd9nq7jGr8fNJEkzejGxS/QLRQOMeWVyqaZFFr2UmKnYZwdMfXKxZIYlEhM8DwmG45xiSLxEgeuoLDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2377bef30e684ff692337bc500527f7c4a890e763ef24d3bdcaf8710661692af","last_reissued_at":"2026-07-05T00:45:44.526673Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:45:44.526673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alexandru I. Tomescu, Massimo Equi, Veli M\\\"akinen","submitted_at":"2020-02-03T10:01:34Z","abstract_excerpt":"We consider the following string matching problem on a node-labeled graph $G=(V,E)$: given a pattern string $P$, decide whether there exists a path in $G$ whose concatenation of node labels equals $P$. This is a basic primitive in various problems in bioinformatics, graph databases, or networks. The hardness results of Backurs and Indyk (FOCS 2016) imply that this problem cannot be solved in better than $O(|E||P|)$ time, under the Orthogonal Vectors Hypothesis (OVH), and this holds even under various restrictions on the graph (Equi et al., ICALP 2019).\n  In this paper we consider its offline v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.00629","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2002.00629/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2002.00629","created_at":"2026-07-05T00:45:44.526739+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.00629v2","created_at":"2026-07-05T00:45:44.526739+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.00629","created_at":"2026-07-05T00:45:44.526739+00:00"},{"alias_kind":"pith_short_12","alias_value":"EN3354YONBH7","created_at":"2026-07-05T00:45:44.526739+00:00"},{"alias_kind":"pith_short_16","alias_value":"EN3354YONBH7NERT","created_at":"2026-07-05T00:45:44.526739+00:00"},{"alias_kind":"pith_short_8","alias_value":"EN3354YO","created_at":"2026-07-05T00:45:44.526739+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08566","citing_title":"Algorithms and Indexing Lower Bounds for Variable String Matching","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EN3354YONBH7NERTPPCQAUT7PR","json":"https://pith.science/pith/EN3354YONBH7NERTPPCQAUT7PR.json","graph_json":"https://pith.science/api/pith-number/EN3354YONBH7NERTPPCQAUT7PR/graph.json","events_json":"https://pith.science/api/pith-number/EN3354YONBH7NERTPPCQAUT7PR/events.json","paper":"https://pith.science/paper/EN3354YO"},"agent_actions":{"view_html":"https://pith.science/pith/EN3354YONBH7NERTPPCQAUT7PR","download_json":"https://pith.science/pith/EN3354YONBH7NERTPPCQAUT7PR.json","view_paper":"https://pith.science/paper/EN3354YO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.00629&json=true","fetch_graph":"https://pith.science/api/pith-number/EN3354YONBH7NERTPPCQAUT7PR/graph.json","fetch_events":"https://pith.science/api/pith-number/EN3354YONBH7NERTPPCQAUT7PR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EN3354YONBH7NERTPPCQAUT7PR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EN3354YONBH7NERTPPCQAUT7PR/action/storage_attestation","attest_author":"https://pith.science/pith/EN3354YONBH7NERTPPCQAUT7PR/action/author_attestation","sign_citation":"https://pith.science/pith/EN3354YONBH7NERTPPCQAUT7PR/action/citation_signature","submit_replication":"https://pith.science/pith/EN3354YONBH7NERTPPCQAUT7PR/action/replication_record"}},"created_at":"2026-07-05T00:45:44.526739+00:00","updated_at":"2026-07-05T00:45:44.526739+00:00"}