{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:JAIWMCTFEOXE7ON3MCOB5NMCWF","short_pith_number":"pith:JAIWMCTF","schema_version":"1.0","canonical_sha256":"4811660a6523ae4fb9bb609c1eb582b172ac60e184664baaaafd6e930d7bc6e4","source":{"kind":"arxiv","id":"2412.10287","version":2},"attestation_state":"computed","paper":{"title":"Single-Source Regular Path Querying in Terms of Linear Algebra","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Georgiy Belyanin, Rodion Suvorov, Semyon Grigoriev","submitted_at":"2024-12-13T17:10:28Z","abstract_excerpt":"Two-way regular path queries (2-RPQs) allow one to use regular languages over edges and inverted edges in edge-labelled graph to constrain paths of interest. 2-RPQs are (partially) adopted in different real-world graph analysis systems and have become a part of the GQL ISO standard. However the performance of 2-RPQs on real-world graphs remains a bottleneck for wider adoption. Utilisation of high-performance sparse linear algebra libraries for the algorithm implementation allows one to achieve significant speedup over competitors on real-world data and queries. We propose a new breadth-first-s"},"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":"2412.10287","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-12-13T17:10:28Z","cross_cats_sorted":[],"title_canon_sha256":"d757748719d0de737d6c5c998121bc7cad92ebd2a65265ba58d4ee159f27dc54","abstract_canon_sha256":"cdf490b53f727fa7e3f64fdcaad0c5555eb7afc22b876e382494e67e06301f81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:22:17.253032Z","signature_b64":"N3bWGZeWgtHt4ga68kdFn3i9CdeKNqKiUsMY6kU9hERCthfFilSAPrksi0rsninNBDsPXufsBfJlESyqzUuEAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4811660a6523ae4fb9bb609c1eb582b172ac60e184664baaaafd6e930d7bc6e4","last_reissued_at":"2026-07-05T11:22:17.252451Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:22:17.252451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Single-Source Regular Path Querying in Terms of Linear Algebra","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Georgiy Belyanin, Rodion Suvorov, Semyon Grigoriev","submitted_at":"2024-12-13T17:10:28Z","abstract_excerpt":"Two-way regular path queries (2-RPQs) allow one to use regular languages over edges and inverted edges in edge-labelled graph to constrain paths of interest. 2-RPQs are (partially) adopted in different real-world graph analysis systems and have become a part of the GQL ISO standard. However the performance of 2-RPQs on real-world graphs remains a bottleneck for wider adoption. Utilisation of high-performance sparse linear algebra libraries for the algorithm implementation allows one to achieve significant speedup over competitors on real-world data and queries. We propose a new breadth-first-s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.10287","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.10287/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":"2412.10287","created_at":"2026-07-05T11:22:17.252544+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.10287v2","created_at":"2026-07-05T11:22:17.252544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.10287","created_at":"2026-07-05T11:22:17.252544+00:00"},{"alias_kind":"pith_short_12","alias_value":"JAIWMCTFEOXE","created_at":"2026-07-05T11:22:17.252544+00:00"},{"alias_kind":"pith_short_16","alias_value":"JAIWMCTFEOXE7ON3","created_at":"2026-07-05T11:22:17.252544+00:00"},{"alias_kind":"pith_short_8","alias_value":"JAIWMCTF","created_at":"2026-07-05T11:22:17.252544+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.02553","citing_title":"Efficient Path Query Processing in Relational Database Systems","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JAIWMCTFEOXE7ON3MCOB5NMCWF","json":"https://pith.science/pith/JAIWMCTFEOXE7ON3MCOB5NMCWF.json","graph_json":"https://pith.science/api/pith-number/JAIWMCTFEOXE7ON3MCOB5NMCWF/graph.json","events_json":"https://pith.science/api/pith-number/JAIWMCTFEOXE7ON3MCOB5NMCWF/events.json","paper":"https://pith.science/paper/JAIWMCTF"},"agent_actions":{"view_html":"https://pith.science/pith/JAIWMCTFEOXE7ON3MCOB5NMCWF","download_json":"https://pith.science/pith/JAIWMCTFEOXE7ON3MCOB5NMCWF.json","view_paper":"https://pith.science/paper/JAIWMCTF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.10287&json=true","fetch_graph":"https://pith.science/api/pith-number/JAIWMCTFEOXE7ON3MCOB5NMCWF/graph.json","fetch_events":"https://pith.science/api/pith-number/JAIWMCTFEOXE7ON3MCOB5NMCWF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JAIWMCTFEOXE7ON3MCOB5NMCWF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JAIWMCTFEOXE7ON3MCOB5NMCWF/action/storage_attestation","attest_author":"https://pith.science/pith/JAIWMCTFEOXE7ON3MCOB5NMCWF/action/author_attestation","sign_citation":"https://pith.science/pith/JAIWMCTFEOXE7ON3MCOB5NMCWF/action/citation_signature","submit_replication":"https://pith.science/pith/JAIWMCTFEOXE7ON3MCOB5NMCWF/action/replication_record"}},"created_at":"2026-07-05T11:22:17.252544+00:00","updated_at":"2026-07-05T11:22:17.252544+00:00"}