{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ATHC2QYJS4TDD4WH7Q2ETUUBH2","short_pith_number":"pith:ATHC2QYJ","schema_version":"1.0","canonical_sha256":"04ce2d4309972631f2c7fc3449d2813e8c42f29aa74e521f36e6bcdb9709680b","source":{"kind":"arxiv","id":"1810.09355","version":1},"attestation_state":"computed","paper":{"title":"Fast Dual Simulation Processing of Graph Database Queries (Supplement)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Denis Nagel, Hermann Kroll, Jan-Christoph Kalo, Stephan Mennicke, Wolf-Tilo Balke","submitted_at":"2018-10-22T15:18:54Z","abstract_excerpt":"Graph database query languages feature expressive, yet computationally expensive pattern matching capabilities. Answering optional query clauses in SPARQL for instance renders the query evaluation problem immediately Pspace-complete. Therefore, light-weight graph pattern matching relations, such as simulation, have recently been investigated as promising alternatives to more expensive query mechanisms like, e.g., computing subgraph isomorphism. Still, graph pattern matching alone lacks expressive query capabilities: all patterns are combined by usual join constructs, where more sophisticated c"},"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":"1810.09355","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DB","submitted_at":"2018-10-22T15:18:54Z","cross_cats_sorted":[],"title_canon_sha256":"8d52be35d89e86c5e15ed88688dad20630a8344b31c66d7f55fac761b3d52fa7","abstract_canon_sha256":"8918ee1b886d4b91a20ac594ed87d3aa6c3ba69350b7bda114041b633201cb2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:40.379254Z","signature_b64":"o2yTsr8T2C84M54JFlu5YU8RFDxaTNWIpxnXHuppUsgAKmA9xwhoCUR1BVEhZmp04FIIukFzMcwDqNVLDjYzDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04ce2d4309972631f2c7fc3449d2813e8c42f29aa74e521f36e6bcdb9709680b","last_reissued_at":"2026-05-18T00:02:40.378664Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:40.378664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Dual Simulation Processing of Graph Database Queries (Supplement)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Denis Nagel, Hermann Kroll, Jan-Christoph Kalo, Stephan Mennicke, Wolf-Tilo Balke","submitted_at":"2018-10-22T15:18:54Z","abstract_excerpt":"Graph database query languages feature expressive, yet computationally expensive pattern matching capabilities. Answering optional query clauses in SPARQL for instance renders the query evaluation problem immediately Pspace-complete. Therefore, light-weight graph pattern matching relations, such as simulation, have recently been investigated as promising alternatives to more expensive query mechanisms like, e.g., computing subgraph isomorphism. Still, graph pattern matching alone lacks expressive query capabilities: all patterns are combined by usual join constructs, where more sophisticated c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.09355","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":"1810.09355","created_at":"2026-05-18T00:02:40.378761+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.09355v1","created_at":"2026-05-18T00:02:40.378761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.09355","created_at":"2026-05-18T00:02:40.378761+00:00"},{"alias_kind":"pith_short_12","alias_value":"ATHC2QYJS4TD","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"ATHC2QYJS4TDD4WH","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"ATHC2QYJ","created_at":"2026-05-18T12:32:13.499390+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/ATHC2QYJS4TDD4WH7Q2ETUUBH2","json":"https://pith.science/pith/ATHC2QYJS4TDD4WH7Q2ETUUBH2.json","graph_json":"https://pith.science/api/pith-number/ATHC2QYJS4TDD4WH7Q2ETUUBH2/graph.json","events_json":"https://pith.science/api/pith-number/ATHC2QYJS4TDD4WH7Q2ETUUBH2/events.json","paper":"https://pith.science/paper/ATHC2QYJ"},"agent_actions":{"view_html":"https://pith.science/pith/ATHC2QYJS4TDD4WH7Q2ETUUBH2","download_json":"https://pith.science/pith/ATHC2QYJS4TDD4WH7Q2ETUUBH2.json","view_paper":"https://pith.science/paper/ATHC2QYJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.09355&json=true","fetch_graph":"https://pith.science/api/pith-number/ATHC2QYJS4TDD4WH7Q2ETUUBH2/graph.json","fetch_events":"https://pith.science/api/pith-number/ATHC2QYJS4TDD4WH7Q2ETUUBH2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ATHC2QYJS4TDD4WH7Q2ETUUBH2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ATHC2QYJS4TDD4WH7Q2ETUUBH2/action/storage_attestation","attest_author":"https://pith.science/pith/ATHC2QYJS4TDD4WH7Q2ETUUBH2/action/author_attestation","sign_citation":"https://pith.science/pith/ATHC2QYJS4TDD4WH7Q2ETUUBH2/action/citation_signature","submit_replication":"https://pith.science/pith/ATHC2QYJS4TDD4WH7Q2ETUUBH2/action/replication_record"}},"created_at":"2026-05-18T00:02:40.378761+00:00","updated_at":"2026-05-18T00:02:40.378761+00:00"}