{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DE7CIHJPAW6DN5HU2T4KJLG4CP","short_pith_number":"pith:DE7CIHJP","schema_version":"1.0","canonical_sha256":"193e241d2f05bc36f4f4d4f8a4acdc13f0b2968d26c1ac17319f44daa7ec5a9f","source":{"kind":"arxiv","id":"1610.06264","version":3},"attestation_state":"computed","paper":{"title":"Foundations of Modern Query Languages for Graph Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Aidan Hogan, Domagoj Vrgoc, Juan Reutter, Marcelo Arenas, Pablo Barcelo, Renzo Angles","submitted_at":"2016-10-20T01:59:48Z","abstract_excerpt":"We survey foundational features underlying modern graph query languages. We first discuss two popular graph data models: edge-labelled graphs, where nodes are connected by directed, labelled edges; and property graphs, where nodes and edges can further have attributes. Next we discuss the two most fundamental graph querying functionalities: graph patterns and navigational expressions. We start with graph patterns, in which a graph-structured query is matched against the data. Thereafter we discuss navigational expressions, in which patterns can be matched recursively against the graph to navig"},"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":"1610.06264","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-10-20T01:59:48Z","cross_cats_sorted":[],"title_canon_sha256":"20a016a6c0c234107f5ace4d55c9a6ffccf3eed8c5a5820acd152ca11daaf741","abstract_canon_sha256":"dd27743571689f3f3b06d8665cd7cec715a7748ca53165f6352201f46d48d1b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:17.659226Z","signature_b64":"86osfeX5SU5cwjHGeCeaGgzkoOB6eCIgGayVvLpUpIP3/1WPp2chpzGF9zH4uK++i2+pgmYrCN3GS2+4mmaiCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"193e241d2f05bc36f4f4d4f8a4acdc13f0b2968d26c1ac17319f44daa7ec5a9f","last_reissued_at":"2026-05-18T00:42:17.658749Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:17.658749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Foundations of Modern Query Languages for Graph Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Aidan Hogan, Domagoj Vrgoc, Juan Reutter, Marcelo Arenas, Pablo Barcelo, Renzo Angles","submitted_at":"2016-10-20T01:59:48Z","abstract_excerpt":"We survey foundational features underlying modern graph query languages. We first discuss two popular graph data models: edge-labelled graphs, where nodes are connected by directed, labelled edges; and property graphs, where nodes and edges can further have attributes. Next we discuss the two most fundamental graph querying functionalities: graph patterns and navigational expressions. We start with graph patterns, in which a graph-structured query is matched against the data. Thereafter we discuss navigational expressions, in which patterns can be matched recursively against the graph to navig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.06264","kind":"arxiv","version":3},"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":"1610.06264","created_at":"2026-05-18T00:42:17.658825+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.06264v3","created_at":"2026-05-18T00:42:17.658825+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.06264","created_at":"2026-05-18T00:42:17.658825+00:00"},{"alias_kind":"pith_short_12","alias_value":"DE7CIHJPAW6D","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DE7CIHJPAW6DN5HU","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DE7CIHJP","created_at":"2026-05-18T12:30:12.583610+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/DE7CIHJPAW6DN5HU2T4KJLG4CP","json":"https://pith.science/pith/DE7CIHJPAW6DN5HU2T4KJLG4CP.json","graph_json":"https://pith.science/api/pith-number/DE7CIHJPAW6DN5HU2T4KJLG4CP/graph.json","events_json":"https://pith.science/api/pith-number/DE7CIHJPAW6DN5HU2T4KJLG4CP/events.json","paper":"https://pith.science/paper/DE7CIHJP"},"agent_actions":{"view_html":"https://pith.science/pith/DE7CIHJPAW6DN5HU2T4KJLG4CP","download_json":"https://pith.science/pith/DE7CIHJPAW6DN5HU2T4KJLG4CP.json","view_paper":"https://pith.science/paper/DE7CIHJP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.06264&json=true","fetch_graph":"https://pith.science/api/pith-number/DE7CIHJPAW6DN5HU2T4KJLG4CP/graph.json","fetch_events":"https://pith.science/api/pith-number/DE7CIHJPAW6DN5HU2T4KJLG4CP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DE7CIHJPAW6DN5HU2T4KJLG4CP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DE7CIHJPAW6DN5HU2T4KJLG4CP/action/storage_attestation","attest_author":"https://pith.science/pith/DE7CIHJPAW6DN5HU2T4KJLG4CP/action/author_attestation","sign_citation":"https://pith.science/pith/DE7CIHJPAW6DN5HU2T4KJLG4CP/action/citation_signature","submit_replication":"https://pith.science/pith/DE7CIHJPAW6DN5HU2T4KJLG4CP/action/replication_record"}},"created_at":"2026-05-18T00:42:17.658825+00:00","updated_at":"2026-05-18T00:42:17.658825+00:00"}