{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:RSILE63IFWVWCIFMZ6ZXYLH5NJ","short_pith_number":"pith:RSILE63I","schema_version":"1.0","canonical_sha256":"8c90b27b682dab6120accfb37c2cfd6a65c36a645dfb4fbea65ef6a2b075400c","source":{"kind":"arxiv","id":"2004.03477","version":1},"attestation_state":"computed","paper":{"title":"An Algorithm for Context-Free Path Queries over Graph Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.FL"],"primary_cat":"cs.DB","authors_text":"Ciro M. Medeiros, Martin A. Musicante, Umberto S. Costa","submitted_at":"2020-04-07T15:26:50Z","abstract_excerpt":"RDF (Resource Description Framework) is a standard language to represent graph databases. Query languages for RDF databases usually include primitives to support path queries, linking pairs of vertices of the graph that are connected by a path of labels belonging to a given language. Languages such as SPARQL include support for paths defined by regular languages (by means of Regular Expressions). A context-free path query is a path query whose language can be defined by a context-free grammar. Context-free path queries can be used to implement queries such as the \"same generation queries\", tha"},"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":"2004.03477","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2020-04-07T15:26:50Z","cross_cats_sorted":["cs.DS","cs.FL"],"title_canon_sha256":"68d0acbfda9709aa97250c0b4b0e0a83147c7a4a2ba27e46b27d2fded0187dd9","abstract_canon_sha256":"c5f8e358209f6c9927f64200bbba1eb3638ffe4b5d77bbeaef6d27b2cefcba16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:53:26.532284Z","signature_b64":"/ilVn/WCNoFb3eDkUpIC7LW2yCuU1JKwFNWfVGAtfDrcmcEaug70OcxI+//b7xVAPVEJ14iIuvnO/OSkmZ8kDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c90b27b682dab6120accfb37c2cfd6a65c36a645dfb4fbea65ef6a2b075400c","last_reissued_at":"2026-07-05T00:53:26.531839Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:53:26.531839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Algorithm for Context-Free Path Queries over Graph Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.FL"],"primary_cat":"cs.DB","authors_text":"Ciro M. Medeiros, Martin A. Musicante, Umberto S. Costa","submitted_at":"2020-04-07T15:26:50Z","abstract_excerpt":"RDF (Resource Description Framework) is a standard language to represent graph databases. Query languages for RDF databases usually include primitives to support path queries, linking pairs of vertices of the graph that are connected by a path of labels belonging to a given language. Languages such as SPARQL include support for paths defined by regular languages (by means of Regular Expressions). A context-free path query is a path query whose language can be defined by a context-free grammar. Context-free path queries can be used to implement queries such as the \"same generation queries\", tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.03477","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2004.03477/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":"2004.03477","created_at":"2026-07-05T00:53:26.531893+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.03477v1","created_at":"2026-07-05T00:53:26.531893+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.03477","created_at":"2026-07-05T00:53:26.531893+00:00"},{"alias_kind":"pith_short_12","alias_value":"RSILE63IFWVW","created_at":"2026-07-05T00:53:26.531893+00:00"},{"alias_kind":"pith_short_16","alias_value":"RSILE63IFWVWCIFM","created_at":"2026-07-05T00:53:26.531893+00:00"},{"alias_kind":"pith_short_8","alias_value":"RSILE63I","created_at":"2026-07-05T00:53:26.531893+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/RSILE63IFWVWCIFMZ6ZXYLH5NJ","json":"https://pith.science/pith/RSILE63IFWVWCIFMZ6ZXYLH5NJ.json","graph_json":"https://pith.science/api/pith-number/RSILE63IFWVWCIFMZ6ZXYLH5NJ/graph.json","events_json":"https://pith.science/api/pith-number/RSILE63IFWVWCIFMZ6ZXYLH5NJ/events.json","paper":"https://pith.science/paper/RSILE63I"},"agent_actions":{"view_html":"https://pith.science/pith/RSILE63IFWVWCIFMZ6ZXYLH5NJ","download_json":"https://pith.science/pith/RSILE63IFWVWCIFMZ6ZXYLH5NJ.json","view_paper":"https://pith.science/paper/RSILE63I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.03477&json=true","fetch_graph":"https://pith.science/api/pith-number/RSILE63IFWVWCIFMZ6ZXYLH5NJ/graph.json","fetch_events":"https://pith.science/api/pith-number/RSILE63IFWVWCIFMZ6ZXYLH5NJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RSILE63IFWVWCIFMZ6ZXYLH5NJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RSILE63IFWVWCIFMZ6ZXYLH5NJ/action/storage_attestation","attest_author":"https://pith.science/pith/RSILE63IFWVWCIFMZ6ZXYLH5NJ/action/author_attestation","sign_citation":"https://pith.science/pith/RSILE63IFWVWCIFMZ6ZXYLH5NJ/action/citation_signature","submit_replication":"https://pith.science/pith/RSILE63IFWVWCIFMZ6ZXYLH5NJ/action/replication_record"}},"created_at":"2026-07-05T00:53:26.531893+00:00","updated_at":"2026-07-05T00:53:26.531893+00:00"}