{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AIX2UU4SR6WTUGANTPJRCKPBIC","short_pith_number":"pith:AIX2UU4S","schema_version":"1.0","canonical_sha256":"022faa53928fad3a180d9bd31129e140b5580c3d79bf0f8a1f59efabb2c4b792","source":{"kind":"arxiv","id":"1902.03560","version":1},"attestation_state":"computed","paper":{"title":"On the Complexity of Exact Pattern Matching in Graphs: Determinism and Zig-Zag Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Alexandru I. Tomescu, Massimo Equi, Roberto Grossi, Veli M\\\"akinen","submitted_at":"2019-02-10T09:43:38Z","abstract_excerpt":"Exact pattern matching in labeled graphs is the problem of searching paths of a graph $G=(V,E)$ that spell the same string as the given pattern $P[1..m]$. This basic problem can be found at the heart of more complex operations on variation graphs in computational biology, query operations in graph databases, and analysis of heterogeneous networks, where the nodes of some paths must match a sequence of labels or types. In our recent work we described a conditional lower bound stating that the exact pattern matching problem in labeled graphs cannot be solved in less than quadratic time, namely, "},"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":"1902.03560","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-10T09:43:38Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1b5f02c6bdcd7c54a7e4535e65fb76c5194ca578b4079b03c62cc2a57654c5ae","abstract_canon_sha256":"55e2d9976dfb4dd4d9a9804fdb7bdd2e5fd3faddd12538d722b48f1c8ce545fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:20.439724Z","signature_b64":"o/tvQRto6wP+mZi+XeM1DggKSQu8e9eEEAuDD+oPIlagbnKIt9EQih0pww6RGM7tOtHnJuTPTYnRE1DzlX3UCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"022faa53928fad3a180d9bd31129e140b5580c3d79bf0f8a1f59efabb2c4b792","last_reissued_at":"2026-05-17T23:54:20.439013Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:20.439013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of Exact Pattern Matching in Graphs: Determinism and Zig-Zag Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Alexandru I. Tomescu, Massimo Equi, Roberto Grossi, Veli M\\\"akinen","submitted_at":"2019-02-10T09:43:38Z","abstract_excerpt":"Exact pattern matching in labeled graphs is the problem of searching paths of a graph $G=(V,E)$ that spell the same string as the given pattern $P[1..m]$. This basic problem can be found at the heart of more complex operations on variation graphs in computational biology, query operations in graph databases, and analysis of heterogeneous networks, where the nodes of some paths must match a sequence of labels or types. In our recent work we described a conditional lower bound stating that the exact pattern matching problem in labeled graphs cannot be solved in less than quadratic time, namely, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03560","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":"1902.03560","created_at":"2026-05-17T23:54:20.439135+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.03560v1","created_at":"2026-05-17T23:54:20.439135+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03560","created_at":"2026-05-17T23:54:20.439135+00:00"},{"alias_kind":"pith_short_12","alias_value":"AIX2UU4SR6WT","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"AIX2UU4SR6WTUGAN","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"AIX2UU4S","created_at":"2026-05-18T12:33:12.712433+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/AIX2UU4SR6WTUGANTPJRCKPBIC","json":"https://pith.science/pith/AIX2UU4SR6WTUGANTPJRCKPBIC.json","graph_json":"https://pith.science/api/pith-number/AIX2UU4SR6WTUGANTPJRCKPBIC/graph.json","events_json":"https://pith.science/api/pith-number/AIX2UU4SR6WTUGANTPJRCKPBIC/events.json","paper":"https://pith.science/paper/AIX2UU4S"},"agent_actions":{"view_html":"https://pith.science/pith/AIX2UU4SR6WTUGANTPJRCKPBIC","download_json":"https://pith.science/pith/AIX2UU4SR6WTUGANTPJRCKPBIC.json","view_paper":"https://pith.science/paper/AIX2UU4S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.03560&json=true","fetch_graph":"https://pith.science/api/pith-number/AIX2UU4SR6WTUGANTPJRCKPBIC/graph.json","fetch_events":"https://pith.science/api/pith-number/AIX2UU4SR6WTUGANTPJRCKPBIC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AIX2UU4SR6WTUGANTPJRCKPBIC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AIX2UU4SR6WTUGANTPJRCKPBIC/action/storage_attestation","attest_author":"https://pith.science/pith/AIX2UU4SR6WTUGANTPJRCKPBIC/action/author_attestation","sign_citation":"https://pith.science/pith/AIX2UU4SR6WTUGANTPJRCKPBIC/action/citation_signature","submit_replication":"https://pith.science/pith/AIX2UU4SR6WTUGANTPJRCKPBIC/action/replication_record"}},"created_at":"2026-05-17T23:54:20.439135+00:00","updated_at":"2026-05-17T23:54:20.439135+00:00"}