{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:N5UKRGYY2V7NJ47J56AA3QSDTA","short_pith_number":"pith:N5UKRGYY","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"},"canonical_sha256":"6f68a89b18d57ed4f3e9ef800dc243981cfcdd684c2e06eb1727df3e3f38f555","source":{"kind":"arxiv","id":"1811.11561","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11561","created_at":"2026-05-17T23:59:40Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11561v1","created_at":"2026-05-17T23:59:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11561","created_at":"2026-05-17T23:59:40Z"},{"alias_kind":"pith_short_12","alias_value":"N5UKRGYY2V7N","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"N5UKRGYY2V7NJ47J","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"N5UKRGYY","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:N5UKRGYY2V7NJ47J56AA3QSDTA","target":"record","payload":{"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"},"canonical_sha256":"6f68a89b18d57ed4f3e9ef800dc243981cfcdd684c2e06eb1727df3e3f38f555","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"},"source_kind":"arxiv","source_id":"1811.11561","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:59:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qIxpbsE4h9TLBUigm2KeG+1G69YDfJhEsivjJL0cU0T6QW7Ni7DXcizjc2EEbMhsjZ1yFqZj4BrUzTpQbzHgDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:07:58.099470Z"},"content_sha256":"30e3bd4dec4d97eff20c61076b9cab2c6a116e9d9e0a4d855f9a8cd280db0465","schema_version":"1.0","event_id":"sha256:30e3bd4dec4d97eff20c61076b9cab2c6a116e9d9e0a4d855f9a8cd280db0465"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:N5UKRGYY2V7NJ47J56AA3QSDTA","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:59:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w8F+QMxlA6ROjrhxoDHt9GavWqu8cssohw+A9cUGAmbF/hyNYI0VW1o+1oho/d2kS6cRdmClgmbtYlV9N5hlDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:07:58.100117Z"},"content_sha256":"2f402f40df4a84b5e1081c3cbcb5ac0c0b1e6802db09484b64c70e63e3bd2e01","schema_version":"1.0","event_id":"sha256:2f402f40df4a84b5e1081c3cbcb5ac0c0b1e6802db09484b64c70e63e3bd2e01"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N5UKRGYY2V7NJ47J56AA3QSDTA/bundle.json","state_url":"https://pith.science/pith/N5UKRGYY2V7NJ47J56AA3QSDTA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N5UKRGYY2V7NJ47J56AA3QSDTA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T12:07:58Z","links":{"resolver":"https://pith.science/pith/N5UKRGYY2V7NJ47J56AA3QSDTA","bundle":"https://pith.science/pith/N5UKRGYY2V7NJ47J56AA3QSDTA/bundle.json","state":"https://pith.science/pith/N5UKRGYY2V7NJ47J56AA3QSDTA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N5UKRGYY2V7NJ47J56AA3QSDTA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:N5UKRGYY2V7NJ47J56AA3QSDTA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"06f11672e8c4b24fb4b816b6a85b24c26abfb8ad826c531d6a10d1170909d316","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-11-28T13:51:39Z","title_canon_sha256":"ba1c662d8c3c0eb4e8aca704b87a5aefa752fff92cfed6324e10ff09f3268117"},"schema_version":"1.0","source":{"id":"1811.11561","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11561","created_at":"2026-05-17T23:59:40Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11561v1","created_at":"2026-05-17T23:59:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11561","created_at":"2026-05-17T23:59:40Z"},{"alias_kind":"pith_short_12","alias_value":"N5UKRGYY2V7N","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"N5UKRGYY2V7NJ47J","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"N5UKRGYY","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:2f402f40df4a84b5e1081c3cbcb5ac0c0b1e6802db09484b64c70e63e3bd2e01","target":"graph","created_at":"2026-05-17T23:59:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Amaia Nazabal Ruiz Diaz, Angela Bonifati, Romain Vuillemot, Stefania Dumbrava","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-11-28T13:51:39Z","title":"Approximate Evaluation of Label-Constrained Reachability Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11561","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:30e3bd4dec4d97eff20c61076b9cab2c6a116e9d9e0a4d855f9a8cd280db0465","target":"record","created_at":"2026-05-17T23:59:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"06f11672e8c4b24fb4b816b6a85b24c26abfb8ad826c531d6a10d1170909d316","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-11-28T13:51:39Z","title_canon_sha256":"ba1c662d8c3c0eb4e8aca704b87a5aefa752fff92cfed6324e10ff09f3268117"},"schema_version":"1.0","source":{"id":"1811.11561","kind":"arxiv","version":1}},"canonical_sha256":"6f68a89b18d57ed4f3e9ef800dc243981cfcdd684c2e06eb1727df3e3f38f555","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f68a89b18d57ed4f3e9ef800dc243981cfcdd684c2e06eb1727df3e3f38f555","first_computed_at":"2026-05-17T23:59:40.735299Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:40.735299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pkp5oDei7DYyUXX4JnZ/KsZZomC5HHFTIP59P/2kVMHxwynLATFp/kSU6XBcOk2F7DYPs0HAbDBUJgyVuJSNCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:40.735922Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.11561","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30e3bd4dec4d97eff20c61076b9cab2c6a116e9d9e0a4d855f9a8cd280db0465","sha256:2f402f40df4a84b5e1081c3cbcb5ac0c0b1e6802db09484b64c70e63e3bd2e01"],"state_sha256":"d60a0710457b849569a0b7ec3335e60fdd9cd547979b6758e9e4323ecdc83e1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CBNJsy0eXlEbT/4G4jGiReDqetwpnFiOu/S+kl9bC3k2Jn7hbWK7aN0T+GAUSryOlK9DsTl1YyEYjLvnysRVDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T12:07:58.103223Z","bundle_sha256":"fb85a35d8f9763f3aa9b33c4d408d061e8033d1300eaaefaa998f21fd9887b57"}}