{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LMQ4E5MBGRAEFJ4BQA2D3GX2HD","short_pith_number":"pith:LMQ4E5MB","schema_version":"1.0","canonical_sha256":"5b21c27581344042a78180343d9afa38cf77446e57f15b32c20255fc2eaa76e1","source":{"kind":"arxiv","id":"1507.01708","version":1},"attestation_state":"computed","paper":{"title":"Typing Regular Path Query Languages for Data Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.DB","authors_text":"Carlo Sartiani, Dario Colazzo","submitted_at":"2015-07-07T08:43:59Z","abstract_excerpt":"Regular path query languages for data graphs are essentially \\emph{untyped}. The lack of type information greatly limits the optimization opportunities for query engines and makes application development more complex. In this paper we discuss a simple, yet expressive, schema language for edge-labelled data graphs. This schema language is, then, used to define a query type inference approach with good precision properties."},"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":"1507.01708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-07-07T08:43:59Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"7bf575d9d9453912a443b4f3fd5be5e9b70c9009def7b7333c9a84e74b1f192a","abstract_canon_sha256":"db41dad18204ba8fa0baaefd61a4b0978793b111d8ad74d5490584d776ae0d0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:12.594034Z","signature_b64":"dpaayJ9TYylEcJxK5Ty1TrLTX+QRIvEACFl3JG1HLi/Gc74J2dIPfuMnKRItY+9CL4YDjVwrXErhuaB1VjK4Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b21c27581344042a78180343d9afa38cf77446e57f15b32c20255fc2eaa76e1","last_reissued_at":"2026-05-18T01:37:12.593409Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:12.593409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Typing Regular Path Query Languages for Data Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.DB","authors_text":"Carlo Sartiani, Dario Colazzo","submitted_at":"2015-07-07T08:43:59Z","abstract_excerpt":"Regular path query languages for data graphs are essentially \\emph{untyped}. The lack of type information greatly limits the optimization opportunities for query engines and makes application development more complex. In this paper we discuss a simple, yet expressive, schema language for edge-labelled data graphs. This schema language is, then, used to define a query type inference approach with good precision properties."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01708","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":"1507.01708","created_at":"2026-05-18T01:37:12.593487+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.01708v1","created_at":"2026-05-18T01:37:12.593487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01708","created_at":"2026-05-18T01:37:12.593487+00:00"},{"alias_kind":"pith_short_12","alias_value":"LMQ4E5MBGRAE","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LMQ4E5MBGRAEFJ4B","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LMQ4E5MB","created_at":"2026-05-18T12:29:29.992203+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/LMQ4E5MBGRAEFJ4BQA2D3GX2HD","json":"https://pith.science/pith/LMQ4E5MBGRAEFJ4BQA2D3GX2HD.json","graph_json":"https://pith.science/api/pith-number/LMQ4E5MBGRAEFJ4BQA2D3GX2HD/graph.json","events_json":"https://pith.science/api/pith-number/LMQ4E5MBGRAEFJ4BQA2D3GX2HD/events.json","paper":"https://pith.science/paper/LMQ4E5MB"},"agent_actions":{"view_html":"https://pith.science/pith/LMQ4E5MBGRAEFJ4BQA2D3GX2HD","download_json":"https://pith.science/pith/LMQ4E5MBGRAEFJ4BQA2D3GX2HD.json","view_paper":"https://pith.science/paper/LMQ4E5MB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.01708&json=true","fetch_graph":"https://pith.science/api/pith-number/LMQ4E5MBGRAEFJ4BQA2D3GX2HD/graph.json","fetch_events":"https://pith.science/api/pith-number/LMQ4E5MBGRAEFJ4BQA2D3GX2HD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LMQ4E5MBGRAEFJ4BQA2D3GX2HD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LMQ4E5MBGRAEFJ4BQA2D3GX2HD/action/storage_attestation","attest_author":"https://pith.science/pith/LMQ4E5MBGRAEFJ4BQA2D3GX2HD/action/author_attestation","sign_citation":"https://pith.science/pith/LMQ4E5MBGRAEFJ4BQA2D3GX2HD/action/citation_signature","submit_replication":"https://pith.science/pith/LMQ4E5MBGRAEFJ4BQA2D3GX2HD/action/replication_record"}},"created_at":"2026-05-18T01:37:12.593487+00:00","updated_at":"2026-05-18T01:37:12.593487+00:00"}