{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:5IYUSVTT53NDP45ITEF4VFU7ED","short_pith_number":"pith:5IYUSVTT","schema_version":"1.0","canonical_sha256":"ea31495673eeda37f3a8990bca969f20c17e2c725d185ee94c30435be68c247a","source":{"kind":"arxiv","id":"2203.08606","version":5},"attestation_state":"computed","paper":{"title":"A Reachability Index for Recursive Label-Concatenated Graph Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Angela Bonifati, Chao Zhang, Hugo Kapp, Jean-Pierre Lozi, Vlad Ioan Haprian","submitted_at":"2022-03-16T13:25:20Z","abstract_excerpt":"Reachability queries checking the existence of a path from a source node to a target node are fundamental operators for querying and processing graph data. Current approaches for index-based evaluation of reachability queries either focus on plain reachability or constraint-based reachability with alternation only. In this paper, for the first time we study the problem of index-based processing for recursive label-concatenated reachability queries, referred to as RLC queries. These queries check the existence of a path that can satisfy the constraint defined by a concatenation of at most k edg"},"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":"2203.08606","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2022-03-16T13:25:20Z","cross_cats_sorted":[],"title_canon_sha256":"b32493ae47f95d7d545757b83ad39f81f42149bead5b97072ef06a49f3278441","abstract_canon_sha256":"ab7bdc111d4a0eb8147fe0dee85d7ef8b463659d6fdf922e483f0b27bfeddaa3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:41:54.884743Z","signature_b64":"b+xnXVHofEfVmnr5rq7w3SuTw90j9SvqNNMm9OhHLfbfRd4W+rarhGuRzCIhzziT1wVzpcOY7X4BaovTZZiBDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea31495673eeda37f3a8990bca969f20c17e2c725d185ee94c30435be68c247a","last_reissued_at":"2026-07-05T04:41:54.884232Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:41:54.884232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Reachability Index for Recursive Label-Concatenated Graph Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Angela Bonifati, Chao Zhang, Hugo Kapp, Jean-Pierre Lozi, Vlad Ioan Haprian","submitted_at":"2022-03-16T13:25:20Z","abstract_excerpt":"Reachability queries checking the existence of a path from a source node to a target node are fundamental operators for querying and processing graph data. Current approaches for index-based evaluation of reachability queries either focus on plain reachability or constraint-based reachability with alternation only. In this paper, for the first time we study the problem of index-based processing for recursive label-concatenated reachability queries, referred to as RLC queries. These queries check the existence of a path that can satisfy the constraint defined by a concatenation of at most k edg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.08606","kind":"arxiv","version":5},"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/2203.08606/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":"2203.08606","created_at":"2026-07-05T04:41:54.884294+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.08606v5","created_at":"2026-07-05T04:41:54.884294+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.08606","created_at":"2026-07-05T04:41:54.884294+00:00"},{"alias_kind":"pith_short_12","alias_value":"5IYUSVTT53ND","created_at":"2026-07-05T04:41:54.884294+00:00"},{"alias_kind":"pith_short_16","alias_value":"5IYUSVTT53NDP45I","created_at":"2026-07-05T04:41:54.884294+00:00"},{"alias_kind":"pith_short_8","alias_value":"5IYUSVTT","created_at":"2026-07-05T04:41:54.884294+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/5IYUSVTT53NDP45ITEF4VFU7ED","json":"https://pith.science/pith/5IYUSVTT53NDP45ITEF4VFU7ED.json","graph_json":"https://pith.science/api/pith-number/5IYUSVTT53NDP45ITEF4VFU7ED/graph.json","events_json":"https://pith.science/api/pith-number/5IYUSVTT53NDP45ITEF4VFU7ED/events.json","paper":"https://pith.science/paper/5IYUSVTT"},"agent_actions":{"view_html":"https://pith.science/pith/5IYUSVTT53NDP45ITEF4VFU7ED","download_json":"https://pith.science/pith/5IYUSVTT53NDP45ITEF4VFU7ED.json","view_paper":"https://pith.science/paper/5IYUSVTT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.08606&json=true","fetch_graph":"https://pith.science/api/pith-number/5IYUSVTT53NDP45ITEF4VFU7ED/graph.json","fetch_events":"https://pith.science/api/pith-number/5IYUSVTT53NDP45ITEF4VFU7ED/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5IYUSVTT53NDP45ITEF4VFU7ED/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5IYUSVTT53NDP45ITEF4VFU7ED/action/storage_attestation","attest_author":"https://pith.science/pith/5IYUSVTT53NDP45ITEF4VFU7ED/action/author_attestation","sign_citation":"https://pith.science/pith/5IYUSVTT53NDP45ITEF4VFU7ED/action/citation_signature","submit_replication":"https://pith.science/pith/5IYUSVTT53NDP45ITEF4VFU7ED/action/replication_record"}},"created_at":"2026-07-05T04:41:54.884294+00:00","updated_at":"2026-07-05T04:41:54.884294+00:00"}