{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XWV55KYPCE22DHAJK6SWXVPIHO","short_pith_number":"pith:XWV55KYP","schema_version":"1.0","canonical_sha256":"bdabdeab0f1135a19c0957a56bd5e83bb3c44b3b882567f21bd32414e4e6c7a0","source":{"kind":"arxiv","id":"1904.00850","version":1},"attestation_state":"computed","paper":{"title":"Boundedness of Conjunctive Regular Path Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.FL","cs.LO"],"primary_cat":"cs.DB","authors_text":"Diego Figueira, Miguel Romero, Pablo Barcel\\'o","submitted_at":"2019-04-01T13:47:58Z","abstract_excerpt":"We study the boundedness problem for unions of conjunctive regular path queries with inverses (UC2RPQs). This is the problem of, given a UC2RPQ, checking whether it is equivalent to a union of conjunctive queries (UCQ). We show the problem to be ExpSpace-complete, thus coinciding with the complexity of containment for UC2RPQs. As a corollary, when a UC2RPQ is bounded, it is equivalent to a UCQ of at most triple-exponential size, and in fact we show that this bound is optimal. We also study better behaved classes of UC2RPQs, namely acyclic UC2RPQs of bounded thickness, and strongly connected UC"},"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":"1904.00850","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-04-01T13:47:58Z","cross_cats_sorted":["cs.DM","cs.FL","cs.LO"],"title_canon_sha256":"506768c2f0cc5581648c3b59c6c5d591a16c70fa02a9e61d705e64e5b6e6b317","abstract_canon_sha256":"f8f3bedd52b9ae89991cab4f64844d8eb658fee017ca10856a01c56b3e1579bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:45.319921Z","signature_b64":"kQwCAcX3CrRabmTF0+xzbccjH2m8eRZFRPI4y8o0MQO30l+3YoJ8Mw2IHiQgtCuBf4uSxFuaqE7In6LuCQG1BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdabdeab0f1135a19c0957a56bd5e83bb3c44b3b882567f21bd32414e4e6c7a0","last_reissued_at":"2026-05-17T23:49:45.319432Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:45.319432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Boundedness of Conjunctive Regular Path Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.FL","cs.LO"],"primary_cat":"cs.DB","authors_text":"Diego Figueira, Miguel Romero, Pablo Barcel\\'o","submitted_at":"2019-04-01T13:47:58Z","abstract_excerpt":"We study the boundedness problem for unions of conjunctive regular path queries with inverses (UC2RPQs). This is the problem of, given a UC2RPQ, checking whether it is equivalent to a union of conjunctive queries (UCQ). We show the problem to be ExpSpace-complete, thus coinciding with the complexity of containment for UC2RPQs. As a corollary, when a UC2RPQ is bounded, it is equivalent to a UCQ of at most triple-exponential size, and in fact we show that this bound is optimal. We also study better behaved classes of UC2RPQs, namely acyclic UC2RPQs of bounded thickness, and strongly connected UC"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.00850","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":"1904.00850","created_at":"2026-05-17T23:49:45.319512+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.00850v1","created_at":"2026-05-17T23:49:45.319512+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.00850","created_at":"2026-05-17T23:49:45.319512+00:00"},{"alias_kind":"pith_short_12","alias_value":"XWV55KYPCE22","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"XWV55KYPCE22DHAJ","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"XWV55KYP","created_at":"2026-05-18T12:33:33.725879+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/XWV55KYPCE22DHAJK6SWXVPIHO","json":"https://pith.science/pith/XWV55KYPCE22DHAJK6SWXVPIHO.json","graph_json":"https://pith.science/api/pith-number/XWV55KYPCE22DHAJK6SWXVPIHO/graph.json","events_json":"https://pith.science/api/pith-number/XWV55KYPCE22DHAJK6SWXVPIHO/events.json","paper":"https://pith.science/paper/XWV55KYP"},"agent_actions":{"view_html":"https://pith.science/pith/XWV55KYPCE22DHAJK6SWXVPIHO","download_json":"https://pith.science/pith/XWV55KYPCE22DHAJK6SWXVPIHO.json","view_paper":"https://pith.science/paper/XWV55KYP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.00850&json=true","fetch_graph":"https://pith.science/api/pith-number/XWV55KYPCE22DHAJK6SWXVPIHO/graph.json","fetch_events":"https://pith.science/api/pith-number/XWV55KYPCE22DHAJK6SWXVPIHO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XWV55KYPCE22DHAJK6SWXVPIHO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XWV55KYPCE22DHAJK6SWXVPIHO/action/storage_attestation","attest_author":"https://pith.science/pith/XWV55KYPCE22DHAJK6SWXVPIHO/action/author_attestation","sign_citation":"https://pith.science/pith/XWV55KYPCE22DHAJK6SWXVPIHO/action/citation_signature","submit_replication":"https://pith.science/pith/XWV55KYPCE22DHAJK6SWXVPIHO/action/replication_record"}},"created_at":"2026-05-17T23:49:45.319512+00:00","updated_at":"2026-05-17T23:49:45.319512+00:00"}