{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:XWV55KYPCE22DHAJK6SWXVPIHO","short_pith_number":"pith:XWV55KYP","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"},"canonical_sha256":"bdabdeab0f1135a19c0957a56bd5e83bb3c44b3b882567f21bd32414e4e6c7a0","source":{"kind":"arxiv","id":"1904.00850","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.00850","created_at":"2026-05-17T23:49:45Z"},{"alias_kind":"arxiv_version","alias_value":"1904.00850v1","created_at":"2026-05-17T23:49:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.00850","created_at":"2026-05-17T23:49:45Z"},{"alias_kind":"pith_short_12","alias_value":"XWV55KYPCE22","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XWV55KYPCE22DHAJ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XWV55KYP","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:XWV55KYPCE22DHAJK6SWXVPIHO","target":"record","payload":{"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"},"canonical_sha256":"bdabdeab0f1135a19c0957a56bd5e83bb3c44b3b882567f21bd32414e4e6c7a0","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"},"source_kind":"arxiv","source_id":"1904.00850","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:49:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lxcwuQhy7WtZZSs4e2Nf+ZKk4egVrbJJs/0vN9ULq6iqeirepCpk/8nSiM3Cm9MKSSx7T36c2a57I7Ku88LXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:52:03.190375Z"},"content_sha256":"f6f4d77ff23e3bbe1c065fea8f1353570b20ee88140ddded83e5d7212d60afb6","schema_version":"1.0","event_id":"sha256:f6f4d77ff23e3bbe1c065fea8f1353570b20ee88140ddded83e5d7212d60afb6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:XWV55KYPCE22DHAJK6SWXVPIHO","target":"graph","payload":{"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"},"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:49:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bQvmCXyN6ZU1Dimrm/6bv0IHP8mTfthwI3t54Tap2MG6azEscJtjFfdo2PZ7mFRgKBPAQQnOM80UveMxbzvvCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:52:03.191061Z"},"content_sha256":"28dfa16ca2d248e77afa426f02fe78150d7d5e185eb3345b408374111beb54a7","schema_version":"1.0","event_id":"sha256:28dfa16ca2d248e77afa426f02fe78150d7d5e185eb3345b408374111beb54a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XWV55KYPCE22DHAJK6SWXVPIHO/bundle.json","state_url":"https://pith.science/pith/XWV55KYPCE22DHAJK6SWXVPIHO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XWV55KYPCE22DHAJK6SWXVPIHO/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-05-25T19:52:03Z","links":{"resolver":"https://pith.science/pith/XWV55KYPCE22DHAJK6SWXVPIHO","bundle":"https://pith.science/pith/XWV55KYPCE22DHAJK6SWXVPIHO/bundle.json","state":"https://pith.science/pith/XWV55KYPCE22DHAJK6SWXVPIHO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XWV55KYPCE22DHAJK6SWXVPIHO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XWV55KYPCE22DHAJK6SWXVPIHO","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":"f8f3bedd52b9ae89991cab4f64844d8eb658fee017ca10856a01c56b3e1579bc","cross_cats_sorted":["cs.DM","cs.FL","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-04-01T13:47:58Z","title_canon_sha256":"506768c2f0cc5581648c3b59c6c5d591a16c70fa02a9e61d705e64e5b6e6b317"},"schema_version":"1.0","source":{"id":"1904.00850","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.00850","created_at":"2026-05-17T23:49:45Z"},{"alias_kind":"arxiv_version","alias_value":"1904.00850v1","created_at":"2026-05-17T23:49:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.00850","created_at":"2026-05-17T23:49:45Z"},{"alias_kind":"pith_short_12","alias_value":"XWV55KYPCE22","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XWV55KYPCE22DHAJ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XWV55KYP","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:28dfa16ca2d248e77afa426f02fe78150d7d5e185eb3345b408374111beb54a7","target":"graph","created_at":"2026-05-17T23:49:45Z","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":"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","authors_text":"Diego Figueira, Miguel Romero, Pablo Barcel\\'o","cross_cats":["cs.DM","cs.FL","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-04-01T13:47:58Z","title":"Boundedness of Conjunctive Regular Path Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.00850","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:f6f4d77ff23e3bbe1c065fea8f1353570b20ee88140ddded83e5d7212d60afb6","target":"record","created_at":"2026-05-17T23:49:45Z","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":"f8f3bedd52b9ae89991cab4f64844d8eb658fee017ca10856a01c56b3e1579bc","cross_cats_sorted":["cs.DM","cs.FL","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-04-01T13:47:58Z","title_canon_sha256":"506768c2f0cc5581648c3b59c6c5d591a16c70fa02a9e61d705e64e5b6e6b317"},"schema_version":"1.0","source":{"id":"1904.00850","kind":"arxiv","version":1}},"canonical_sha256":"bdabdeab0f1135a19c0957a56bd5e83bb3c44b3b882567f21bd32414e4e6c7a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bdabdeab0f1135a19c0957a56bd5e83bb3c44b3b882567f21bd32414e4e6c7a0","first_computed_at":"2026-05-17T23:49:45.319432Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:45.319432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kQwCAcX3CrRabmTF0+xzbccjH2m8eRZFRPI4y8o0MQO30l+3YoJ8Mw2IHiQgtCuBf4uSxFuaqE7In6LuCQG1BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:45.319921Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.00850","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6f4d77ff23e3bbe1c065fea8f1353570b20ee88140ddded83e5d7212d60afb6","sha256:28dfa16ca2d248e77afa426f02fe78150d7d5e185eb3345b408374111beb54a7"],"state_sha256":"64431f8d10415b82ba17639c6ba66f73c968e642d25a77fef54ebb835ea07d35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PpDcTW+W8WHAeF62t7gLFjFzdw7dDop/Xl2EVpruGUVkztWnAUndG0bkLgCT24+O1dsHta2XRxFRZuiFOTI8DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:52:03.194989Z","bundle_sha256":"c5e483d083bfd4443fbbd9707edcc7c437332836225d3ab2078a1be45b5c5873"}}