{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TRQMIV4LXKWOFHAORHQ77WUWCH","short_pith_number":"pith:TRQMIV4L","schema_version":"1.0","canonical_sha256":"9c60c4578bbaace29c0e89e1ffda9611e854605cba64ebf2efb05282792ce6e9","source":{"kind":"arxiv","id":"1603.00658","version":2},"attestation_state":"computed","paper":{"title":"Nesting Depth of Operators in Graph Database Queries: Expressiveness Vs. Evaluation Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.FL"],"primary_cat":"cs.LO","authors_text":"B. Srivathsan, M. Praveen","submitted_at":"2016-03-02T11:16:37Z","abstract_excerpt":"Designing query languages for graph structured data is an active field of research, where expressiveness and efficient algorithms for query evaluation are conflicting goals. To better handle dynamically changing data, recent work has been done on designing query languages that can compare values stored in the graph database, without hard coding the values in the query. The main idea is to allow variables in the query and bind the variables to values when evaluating the query. For query languages that bind variables only once, query evaluation is usually NP-complete. There are query languages t"},"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":"1603.00658","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-03-02T11:16:37Z","cross_cats_sorted":["cs.DB","cs.FL"],"title_canon_sha256":"e72954143c0141a7ed86a79af1c8da862ce1a183717879155c0915ac1241beec","abstract_canon_sha256":"bb0dc9bce9c31fbe7a27f83afa8bffd8268ee3d1d43b09b1c7af9b3c39f10153"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:34.048938Z","signature_b64":"6Ywq+xIB9RK6P8myxrmQPIJCQwmQhaGDPU6/eDBjA0tqKF3T/tgjE3y67gHV8PmfB5yU1c+PCSsxnc5PiG3mCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c60c4578bbaace29c0e89e1ffda9611e854605cba64ebf2efb05282792ce6e9","last_reissued_at":"2026-05-18T01:15:34.048335Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:34.048335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nesting Depth of Operators in Graph Database Queries: Expressiveness Vs. Evaluation Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.FL"],"primary_cat":"cs.LO","authors_text":"B. Srivathsan, M. Praveen","submitted_at":"2016-03-02T11:16:37Z","abstract_excerpt":"Designing query languages for graph structured data is an active field of research, where expressiveness and efficient algorithms for query evaluation are conflicting goals. To better handle dynamically changing data, recent work has been done on designing query languages that can compare values stored in the graph database, without hard coding the values in the query. The main idea is to allow variables in the query and bind the variables to values when evaluating the query. For query languages that bind variables only once, query evaluation is usually NP-complete. There are query languages t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.00658","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":""},"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":"1603.00658","created_at":"2026-05-18T01:15:34.048408+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.00658v2","created_at":"2026-05-18T01:15:34.048408+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.00658","created_at":"2026-05-18T01:15:34.048408+00:00"},{"alias_kind":"pith_short_12","alias_value":"TRQMIV4LXKWO","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"TRQMIV4LXKWOFHAO","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"TRQMIV4L","created_at":"2026-05-18T12:30:46.583412+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/TRQMIV4LXKWOFHAORHQ77WUWCH","json":"https://pith.science/pith/TRQMIV4LXKWOFHAORHQ77WUWCH.json","graph_json":"https://pith.science/api/pith-number/TRQMIV4LXKWOFHAORHQ77WUWCH/graph.json","events_json":"https://pith.science/api/pith-number/TRQMIV4LXKWOFHAORHQ77WUWCH/events.json","paper":"https://pith.science/paper/TRQMIV4L"},"agent_actions":{"view_html":"https://pith.science/pith/TRQMIV4LXKWOFHAORHQ77WUWCH","download_json":"https://pith.science/pith/TRQMIV4LXKWOFHAORHQ77WUWCH.json","view_paper":"https://pith.science/paper/TRQMIV4L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.00658&json=true","fetch_graph":"https://pith.science/api/pith-number/TRQMIV4LXKWOFHAORHQ77WUWCH/graph.json","fetch_events":"https://pith.science/api/pith-number/TRQMIV4LXKWOFHAORHQ77WUWCH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TRQMIV4LXKWOFHAORHQ77WUWCH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TRQMIV4LXKWOFHAORHQ77WUWCH/action/storage_attestation","attest_author":"https://pith.science/pith/TRQMIV4LXKWOFHAORHQ77WUWCH/action/author_attestation","sign_citation":"https://pith.science/pith/TRQMIV4LXKWOFHAORHQ77WUWCH/action/citation_signature","submit_replication":"https://pith.science/pith/TRQMIV4LXKWOFHAORHQ77WUWCH/action/replication_record"}},"created_at":"2026-05-18T01:15:34.048408+00:00","updated_at":"2026-05-18T01:15:34.048408+00:00"}