{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:J2YW6Z7DBK2TJFGVJZZWQOVIY6","short_pith_number":"pith:J2YW6Z7D","schema_version":"1.0","canonical_sha256":"4eb16f67e30ab53494d54e73683aa8c7b160bcd908ed30269869908134622240","source":{"kind":"arxiv","id":"1402.7122","version":2},"attestation_state":"computed","paper":{"title":"Nested Regular Path Queries in Description Logics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DB"],"primary_cat":"cs.LO","authors_text":"Diego Calvanese, Magdalena Ortiz, Mantas Simkus, Meghyn Bienvenu","submitted_at":"2014-02-28T02:52:57Z","abstract_excerpt":"Two-way regular path queries (2RPQs) have received increased attention recently due to their ability to relate pairs of objects by flexibly navigating graph-structured data. They are present in property paths in SPARQL 1.1, the new standard RDF query language, and in the XML query language XPath. In line with XPath, we consider the extension of 2RPQs with nesting, which allows one to require that objects along a path satisfy complex conditions, in turn expressed through (nested) 2RPQs. We study the computational complexity of answering nested 2RPQs and conjunctions thereof (CN2RPQs) in the pre"},"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":"1402.7122","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-02-28T02:52:57Z","cross_cats_sorted":["cs.AI","cs.DB"],"title_canon_sha256":"cf43c2cc3d7ffdfba6a6e7105754a771b2613eef97a4ea201fd4387b2ed92ab7","abstract_canon_sha256":"3dce7be27ff636d42af7b61e3d3e61d2ab7b4fb2bcf9f43ed1817020482ed5ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:16.309227Z","signature_b64":"Vcsb0yHilxM96gSUCbkrD5HHJ6OBqlTsHGBoC9h1jT//5AeM4dZvKYoo1VmjhV1F5Ygwl4zA+rc5BQcACjq3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4eb16f67e30ab53494d54e73683aa8c7b160bcd908ed30269869908134622240","last_reissued_at":"2026-05-18T02:57:16.308586Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:16.308586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nested Regular Path Queries in Description Logics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DB"],"primary_cat":"cs.LO","authors_text":"Diego Calvanese, Magdalena Ortiz, Mantas Simkus, Meghyn Bienvenu","submitted_at":"2014-02-28T02:52:57Z","abstract_excerpt":"Two-way regular path queries (2RPQs) have received increased attention recently due to their ability to relate pairs of objects by flexibly navigating graph-structured data. They are present in property paths in SPARQL 1.1, the new standard RDF query language, and in the XML query language XPath. In line with XPath, we consider the extension of 2RPQs with nesting, which allows one to require that objects along a path satisfy complex conditions, in turn expressed through (nested) 2RPQs. We study the computational complexity of answering nested 2RPQs and conjunctions thereof (CN2RPQs) in the pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.7122","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":"1402.7122","created_at":"2026-05-18T02:57:16.308702+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.7122v2","created_at":"2026-05-18T02:57:16.308702+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.7122","created_at":"2026-05-18T02:57:16.308702+00:00"},{"alias_kind":"pith_short_12","alias_value":"J2YW6Z7DBK2T","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"J2YW6Z7DBK2TJFGV","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"J2YW6Z7D","created_at":"2026-05-18T12:28:33.132498+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/J2YW6Z7DBK2TJFGVJZZWQOVIY6","json":"https://pith.science/pith/J2YW6Z7DBK2TJFGVJZZWQOVIY6.json","graph_json":"https://pith.science/api/pith-number/J2YW6Z7DBK2TJFGVJZZWQOVIY6/graph.json","events_json":"https://pith.science/api/pith-number/J2YW6Z7DBK2TJFGVJZZWQOVIY6/events.json","paper":"https://pith.science/paper/J2YW6Z7D"},"agent_actions":{"view_html":"https://pith.science/pith/J2YW6Z7DBK2TJFGVJZZWQOVIY6","download_json":"https://pith.science/pith/J2YW6Z7DBK2TJFGVJZZWQOVIY6.json","view_paper":"https://pith.science/paper/J2YW6Z7D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.7122&json=true","fetch_graph":"https://pith.science/api/pith-number/J2YW6Z7DBK2TJFGVJZZWQOVIY6/graph.json","fetch_events":"https://pith.science/api/pith-number/J2YW6Z7DBK2TJFGVJZZWQOVIY6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J2YW6Z7DBK2TJFGVJZZWQOVIY6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J2YW6Z7DBK2TJFGVJZZWQOVIY6/action/storage_attestation","attest_author":"https://pith.science/pith/J2YW6Z7DBK2TJFGVJZZWQOVIY6/action/author_attestation","sign_citation":"https://pith.science/pith/J2YW6Z7DBK2TJFGVJZZWQOVIY6/action/citation_signature","submit_replication":"https://pith.science/pith/J2YW6Z7DBK2TJFGVJZZWQOVIY6/action/replication_record"}},"created_at":"2026-05-18T02:57:16.308702+00:00","updated_at":"2026-05-18T02:57:16.308702+00:00"}