{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PJQ5VNBCBEGUZ5BIIXR3CNVEI4","short_pith_number":"pith:PJQ5VNBC","canonical_record":{"source":{"id":"1512.01681","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2015-12-05T15:54:19Z","cross_cats_sorted":[],"title_canon_sha256":"4e6cc282eefacbaf3ad30aa91a967cb0203d4638221771f7e12f1c8cfa7caf0a","abstract_canon_sha256":"ccc784b60be4ef0f6b37bac1596613b82e563850c080264e1edd84b442daff39"},"schema_version":"1.0"},"canonical_sha256":"7a61dab422090d4cf42845e3b136a447018362f803e5c088358ef7cdfde4399f","source":{"kind":"arxiv","id":"1512.01681","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.01681","created_at":"2026-05-18T01:25:10Z"},{"alias_kind":"arxiv_version","alias_value":"1512.01681v1","created_at":"2026-05-18T01:25:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01681","created_at":"2026-05-18T01:25:10Z"},{"alias_kind":"pith_short_12","alias_value":"PJQ5VNBCBEGU","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PJQ5VNBCBEGUZ5BI","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PJQ5VNBC","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PJQ5VNBCBEGUZ5BIIXR3CNVEI4","target":"record","payload":{"canonical_record":{"source":{"id":"1512.01681","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2015-12-05T15:54:19Z","cross_cats_sorted":[],"title_canon_sha256":"4e6cc282eefacbaf3ad30aa91a967cb0203d4638221771f7e12f1c8cfa7caf0a","abstract_canon_sha256":"ccc784b60be4ef0f6b37bac1596613b82e563850c080264e1edd84b442daff39"},"schema_version":"1.0"},"canonical_sha256":"7a61dab422090d4cf42845e3b136a447018362f803e5c088358ef7cdfde4399f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:10.672456Z","signature_b64":"RJldXRsIu/V0xsV2bLb4ZF7ba3vC2sC7Ij8XzAqxGfs0/eTn8zWh3mb5f2hNrnLP2tn/m63m4mRe/9ExggjzAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a61dab422090d4cf42845e3b136a447018362f803e5c088358ef7cdfde4399f","last_reissued_at":"2026-05-18T01:25:10.671788Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:10.671788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.01681","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-18T01:25:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8zBF1AobSGSSWc/nXWjNQfBb+j+xje7dHr0Bcx5CmI9nYEzEGYoHBU6dvywRr/eJkmWKrguyNkNGTbxM6ZQ+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:43:07.476421Z"},"content_sha256":"4a6c10e026ded0a64dee61afb502dcba8988442c011a0a2a342ddb54526b2e6c","schema_version":"1.0","event_id":"sha256:4a6c10e026ded0a64dee61afb502dcba8988442c011a0a2a342ddb54526b2e6c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PJQ5VNBCBEGUZ5BIIXR3CNVEI4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Red Spider Meets a Rainworm: Conjunctive Query Finite Determinacy Is Undecidable","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Jerzy Marcinkowski, Tomasz Gogacz","submitted_at":"2015-12-05T15:54:19Z","abstract_excerpt":"We solve a well known and long-standing open problem in database theory, proving that Conjunctive Query Finite Determinacy Problem is undecidable. The technique we use builds on the top of our Red Spider method which we developed in our paper [GM15] to show undecidability of the same problem in the \"unrestricted case\" -- when database instances are allowed to be infinite. We also show a specific instance $Q_0$, ${\\cal Q}= \\{Q_1, Q_2, \\ldots Q_k\\}$ such that the set $\\cal Q$ of CQs does not determine CQ $Q_0$ but finitely determines it. Finally, we claim that while $Q_0$ is finitely determined "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01681","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-18T01:25:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IiLtzoACBxid3QIh7HcZJHMBEAKhUM04kA5FhPGXdYt30rqyEI3bWE3m9R7zM55sp3AoWSBxoPahzf7TrC0HCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:43:07.476775Z"},"content_sha256":"07c2deb6d54849d317b1ea7f69b05bbea580989ffd774f5fc34a1f0e5b7e39f8","schema_version":"1.0","event_id":"sha256:07c2deb6d54849d317b1ea7f69b05bbea580989ffd774f5fc34a1f0e5b7e39f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PJQ5VNBCBEGUZ5BIIXR3CNVEI4/bundle.json","state_url":"https://pith.science/pith/PJQ5VNBCBEGUZ5BIIXR3CNVEI4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PJQ5VNBCBEGUZ5BIIXR3CNVEI4/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-28T03:43:07Z","links":{"resolver":"https://pith.science/pith/PJQ5VNBCBEGUZ5BIIXR3CNVEI4","bundle":"https://pith.science/pith/PJQ5VNBCBEGUZ5BIIXR3CNVEI4/bundle.json","state":"https://pith.science/pith/PJQ5VNBCBEGUZ5BIIXR3CNVEI4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PJQ5VNBCBEGUZ5BIIXR3CNVEI4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PJQ5VNBCBEGUZ5BIIXR3CNVEI4","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":"ccc784b60be4ef0f6b37bac1596613b82e563850c080264e1edd84b442daff39","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2015-12-05T15:54:19Z","title_canon_sha256":"4e6cc282eefacbaf3ad30aa91a967cb0203d4638221771f7e12f1c8cfa7caf0a"},"schema_version":"1.0","source":{"id":"1512.01681","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.01681","created_at":"2026-05-18T01:25:10Z"},{"alias_kind":"arxiv_version","alias_value":"1512.01681v1","created_at":"2026-05-18T01:25:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01681","created_at":"2026-05-18T01:25:10Z"},{"alias_kind":"pith_short_12","alias_value":"PJQ5VNBCBEGU","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PJQ5VNBCBEGUZ5BI","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PJQ5VNBC","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:07c2deb6d54849d317b1ea7f69b05bbea580989ffd774f5fc34a1f0e5b7e39f8","target":"graph","created_at":"2026-05-18T01:25:10Z","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 solve a well known and long-standing open problem in database theory, proving that Conjunctive Query Finite Determinacy Problem is undecidable. The technique we use builds on the top of our Red Spider method which we developed in our paper [GM15] to show undecidability of the same problem in the \"unrestricted case\" -- when database instances are allowed to be infinite. We also show a specific instance $Q_0$, ${\\cal Q}= \\{Q_1, Q_2, \\ldots Q_k\\}$ such that the set $\\cal Q$ of CQs does not determine CQ $Q_0$ but finitely determines it. Finally, we claim that while $Q_0$ is finitely determined ","authors_text":"Jerzy Marcinkowski, Tomasz Gogacz","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2015-12-05T15:54:19Z","title":"Red Spider Meets a Rainworm: Conjunctive Query Finite Determinacy Is Undecidable"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01681","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:4a6c10e026ded0a64dee61afb502dcba8988442c011a0a2a342ddb54526b2e6c","target":"record","created_at":"2026-05-18T01:25:10Z","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":"ccc784b60be4ef0f6b37bac1596613b82e563850c080264e1edd84b442daff39","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2015-12-05T15:54:19Z","title_canon_sha256":"4e6cc282eefacbaf3ad30aa91a967cb0203d4638221771f7e12f1c8cfa7caf0a"},"schema_version":"1.0","source":{"id":"1512.01681","kind":"arxiv","version":1}},"canonical_sha256":"7a61dab422090d4cf42845e3b136a447018362f803e5c088358ef7cdfde4399f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a61dab422090d4cf42845e3b136a447018362f803e5c088358ef7cdfde4399f","first_computed_at":"2026-05-18T01:25:10.671788Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:10.671788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RJldXRsIu/V0xsV2bLb4ZF7ba3vC2sC7Ij8XzAqxGfs0/eTn8zWh3mb5f2hNrnLP2tn/m63m4mRe/9ExggjzAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:10.672456Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.01681","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a6c10e026ded0a64dee61afb502dcba8988442c011a0a2a342ddb54526b2e6c","sha256:07c2deb6d54849d317b1ea7f69b05bbea580989ffd774f5fc34a1f0e5b7e39f8"],"state_sha256":"80515c8bc724ff8290f78707261d66e2ff292ed85351752731c4ed6d6184e6cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JWf89bscxjUOQlOM7I0bb2s68xkXERdcqrddbarerJ2EFCyz8vCBpXKbBJEWhzD3Ef085molkB9zH89eFqhbDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:43:07.478722Z","bundle_sha256":"839203672455c49e0527d5bcb4d060fc28c16ecc3656e555f2a8b2c8a8d3c51d"}}