{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:N5UKRGYY2V7NJ47J56AA3QSDTA","short_pith_number":"pith:N5UKRGYY","schema_version":"1.0","canonical_sha256":"6f68a89b18d57ed4f3e9ef800dc243981cfcdd684c2e06eb1727df3e3f38f555","source":{"kind":"arxiv","id":"1811.11561","version":1},"attestation_state":"computed","paper":{"title":"Approximate Evaluation of Label-Constrained Reachability Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Amaia Nazabal Ruiz Diaz, Angela Bonifati, Romain Vuillemot, Stefania Dumbrava","submitted_at":"2018-11-28T13:51:39Z","abstract_excerpt":"The current surge of interest in graph-based data models mirrors the usage of increasingly complex reachability queries, as witnessed by recent analytical studies on real-world graph query logs. Despite the maturity of graph DBMS capabilities, complex label-constrained reachability queries, along with their corresponding aggregate versions, remain difficult to evaluate. In this paper, we focus on the approximate evaluation of counting label-constrained reachability queries. We offer a human-explainable solution to graph Approximate Query Processing (AQP). This consists of a summarization algor"},"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":"1811.11561","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-11-28T13:51:39Z","cross_cats_sorted":[],"title_canon_sha256":"ba1c662d8c3c0eb4e8aca704b87a5aefa752fff92cfed6324e10ff09f3268117","abstract_canon_sha256":"06f11672e8c4b24fb4b816b6a85b24c26abfb8ad826c531d6a10d1170909d316"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:40.735922Z","signature_b64":"pkp5oDei7DYyUXX4JnZ/KsZZomC5HHFTIP59P/2kVMHxwynLATFp/kSU6XBcOk2F7DYPs0HAbDBUJgyVuJSNCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f68a89b18d57ed4f3e9ef800dc243981cfcdd684c2e06eb1727df3e3f38f555","last_reissued_at":"2026-05-17T23:59:40.735299Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:40.735299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Evaluation of Label-Constrained Reachability Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Amaia Nazabal Ruiz Diaz, Angela Bonifati, Romain Vuillemot, Stefania Dumbrava","submitted_at":"2018-11-28T13:51:39Z","abstract_excerpt":"The current surge of interest in graph-based data models mirrors the usage of increasingly complex reachability queries, as witnessed by recent analytical studies on real-world graph query logs. Despite the maturity of graph DBMS capabilities, complex label-constrained reachability queries, along with their corresponding aggregate versions, remain difficult to evaluate. In this paper, we focus on the approximate evaluation of counting label-constrained reachability queries. We offer a human-explainable solution to graph Approximate Query Processing (AQP). This consists of a summarization algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11561","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":"1811.11561","created_at":"2026-05-17T23:59:40.735413+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.11561v1","created_at":"2026-05-17T23:59:40.735413+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11561","created_at":"2026-05-17T23:59:40.735413+00:00"},{"alias_kind":"pith_short_12","alias_value":"N5UKRGYY2V7N","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"N5UKRGYY2V7NJ47J","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"N5UKRGYY","created_at":"2026-05-18T12:32:40.477152+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/N5UKRGYY2V7NJ47J56AA3QSDTA","json":"https://pith.science/pith/N5UKRGYY2V7NJ47J56AA3QSDTA.json","graph_json":"https://pith.science/api/pith-number/N5UKRGYY2V7NJ47J56AA3QSDTA/graph.json","events_json":"https://pith.science/api/pith-number/N5UKRGYY2V7NJ47J56AA3QSDTA/events.json","paper":"https://pith.science/paper/N5UKRGYY"},"agent_actions":{"view_html":"https://pith.science/pith/N5UKRGYY2V7NJ47J56AA3QSDTA","download_json":"https://pith.science/pith/N5UKRGYY2V7NJ47J56AA3QSDTA.json","view_paper":"https://pith.science/paper/N5UKRGYY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.11561&json=true","fetch_graph":"https://pith.science/api/pith-number/N5UKRGYY2V7NJ47J56AA3QSDTA/graph.json","fetch_events":"https://pith.science/api/pith-number/N5UKRGYY2V7NJ47J56AA3QSDTA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N5UKRGYY2V7NJ47J56AA3QSDTA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N5UKRGYY2V7NJ47J56AA3QSDTA/action/storage_attestation","attest_author":"https://pith.science/pith/N5UKRGYY2V7NJ47J56AA3QSDTA/action/author_attestation","sign_citation":"https://pith.science/pith/N5UKRGYY2V7NJ47J56AA3QSDTA/action/citation_signature","submit_replication":"https://pith.science/pith/N5UKRGYY2V7NJ47J56AA3QSDTA/action/replication_record"}},"created_at":"2026-05-17T23:59:40.735413+00:00","updated_at":"2026-05-17T23:59:40.735413+00:00"}