{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:T2ZUC46LPCQBC5LLWAXWEVJQAA","short_pith_number":"pith:T2ZUC46L","canonical_record":{"source":{"id":"1406.0349","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-06-02T13:02:39Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"2e60cb81a8bdd688b7a1436d522660fa26c3684e7d5034d431c7b960718bd668","abstract_canon_sha256":"7c0cf6bef48cbc90b09c9a7d9a4af321ebaad4eeacd657cc2984ed3ef7ddbe91"},"schema_version":"1.0"},"canonical_sha256":"9eb34173cb78a011756bb02f625530001b568ab781a14a63ae014cf3120d398f","source":{"kind":"arxiv","id":"1406.0349","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.0349","created_at":"2026-05-18T02:50:41Z"},{"alias_kind":"arxiv_version","alias_value":"1406.0349v1","created_at":"2026-05-18T02:50:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0349","created_at":"2026-05-18T02:50:41Z"},{"alias_kind":"pith_short_12","alias_value":"T2ZUC46LPCQB","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"T2ZUC46LPCQBC5LL","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"T2ZUC46L","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:T2ZUC46LPCQBC5LLWAXWEVJQAA","target":"record","payload":{"canonical_record":{"source":{"id":"1406.0349","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-06-02T13:02:39Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"2e60cb81a8bdd688b7a1436d522660fa26c3684e7d5034d431c7b960718bd668","abstract_canon_sha256":"7c0cf6bef48cbc90b09c9a7d9a4af321ebaad4eeacd657cc2984ed3ef7ddbe91"},"schema_version":"1.0"},"canonical_sha256":"9eb34173cb78a011756bb02f625530001b568ab781a14a63ae014cf3120d398f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:41.141865Z","signature_b64":"CnqJf4/aW2f4ya/MkqTF4EpTeoUoysM65/YDlhWSOzStBnXqfnLC/mTqa4HWQtZMRREqNGJC6wV/B8PGSIYWAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9eb34173cb78a011756bb02f625530001b568ab781a14a63ae014cf3120d398f","last_reissued_at":"2026-05-18T02:50:41.141275Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:41.141275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.0349","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-18T02:50:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CwSc7xqymcyIC0MT0lZKkr0p+4soP30Y5+FJDobvOH6jYJk787r5mclzfJwZ1zUoqvIVNk2LXdQpvhCNBaDrCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:54:04.044552Z"},"content_sha256":"9f53dbb500175cfb3537823c73875cc35feb4e5241c41e54f3605ee0a87b20b9","schema_version":"1.0","event_id":"sha256:9f53dbb500175cfb3537823c73875cc35feb4e5241c41e54f3605ee0a87b20b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:T2ZUC46LPCQBC5LLWAXWEVJQAA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Undecidability of satisfiability in the algebra of finite binary relations with union, composition, and difference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.LO","authors_text":"Jan Van den Bussche, Tony Tan, Xiaowang Zhang","submitted_at":"2014-06-02T13:02:39Z","abstract_excerpt":"We consider expressions built up from binary relation names using the operators union, composition, and set difference. We show that it is undecidable to test whether a given such expression $e$ is finitely satisfiable, i.e., whether there exist finite binary relations that can be substituted for the relation names so that $e$ evaluates to a nonempty result. This result already holds in restriction to expressions that mention just a single relation name, and where the difference operator can be nested at most once."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0349","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-18T02:50:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/dd00u7ZfvLaR+5w6xLqXXSmwHUh4ertowL4veiQ4ANdWF2qmqpUXtffYa2p5hnl6dSTB4GIvvwI3sX6e6ACAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:54:04.044905Z"},"content_sha256":"52357f12a4b4d7fe07d319a6f8bf8f2c963a409a049fef7d18a5f06d47691bbf","schema_version":"1.0","event_id":"sha256:52357f12a4b4d7fe07d319a6f8bf8f2c963a409a049fef7d18a5f06d47691bbf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T2ZUC46LPCQBC5LLWAXWEVJQAA/bundle.json","state_url":"https://pith.science/pith/T2ZUC46LPCQBC5LLWAXWEVJQAA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T2ZUC46LPCQBC5LLWAXWEVJQAA/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-06-03T08:54:04Z","links":{"resolver":"https://pith.science/pith/T2ZUC46LPCQBC5LLWAXWEVJQAA","bundle":"https://pith.science/pith/T2ZUC46LPCQBC5LLWAXWEVJQAA/bundle.json","state":"https://pith.science/pith/T2ZUC46LPCQBC5LLWAXWEVJQAA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T2ZUC46LPCQBC5LLWAXWEVJQAA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:T2ZUC46LPCQBC5LLWAXWEVJQAA","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":"7c0cf6bef48cbc90b09c9a7d9a4af321ebaad4eeacd657cc2984ed3ef7ddbe91","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-06-02T13:02:39Z","title_canon_sha256":"2e60cb81a8bdd688b7a1436d522660fa26c3684e7d5034d431c7b960718bd668"},"schema_version":"1.0","source":{"id":"1406.0349","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.0349","created_at":"2026-05-18T02:50:41Z"},{"alias_kind":"arxiv_version","alias_value":"1406.0349v1","created_at":"2026-05-18T02:50:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0349","created_at":"2026-05-18T02:50:41Z"},{"alias_kind":"pith_short_12","alias_value":"T2ZUC46LPCQB","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"T2ZUC46LPCQBC5LL","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"T2ZUC46L","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:52357f12a4b4d7fe07d319a6f8bf8f2c963a409a049fef7d18a5f06d47691bbf","target":"graph","created_at":"2026-05-18T02:50:41Z","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 consider expressions built up from binary relation names using the operators union, composition, and set difference. We show that it is undecidable to test whether a given such expression $e$ is finitely satisfiable, i.e., whether there exist finite binary relations that can be substituted for the relation names so that $e$ evaluates to a nonempty result. This result already holds in restriction to expressions that mention just a single relation name, and where the difference operator can be nested at most once.","authors_text":"Jan Van den Bussche, Tony Tan, Xiaowang Zhang","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-06-02T13:02:39Z","title":"Undecidability of satisfiability in the algebra of finite binary relations with union, composition, and difference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0349","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:9f53dbb500175cfb3537823c73875cc35feb4e5241c41e54f3605ee0a87b20b9","target":"record","created_at":"2026-05-18T02:50:41Z","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":"7c0cf6bef48cbc90b09c9a7d9a4af321ebaad4eeacd657cc2984ed3ef7ddbe91","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-06-02T13:02:39Z","title_canon_sha256":"2e60cb81a8bdd688b7a1436d522660fa26c3684e7d5034d431c7b960718bd668"},"schema_version":"1.0","source":{"id":"1406.0349","kind":"arxiv","version":1}},"canonical_sha256":"9eb34173cb78a011756bb02f625530001b568ab781a14a63ae014cf3120d398f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9eb34173cb78a011756bb02f625530001b568ab781a14a63ae014cf3120d398f","first_computed_at":"2026-05-18T02:50:41.141275Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:41.141275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CnqJf4/aW2f4ya/MkqTF4EpTeoUoysM65/YDlhWSOzStBnXqfnLC/mTqa4HWQtZMRREqNGJC6wV/B8PGSIYWAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:41.141865Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.0349","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f53dbb500175cfb3537823c73875cc35feb4e5241c41e54f3605ee0a87b20b9","sha256:52357f12a4b4d7fe07d319a6f8bf8f2c963a409a049fef7d18a5f06d47691bbf"],"state_sha256":"6017e0bb5552c1bdcc299b6b09ba99446f8e157d51cbc2a84a943d3421723ad9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vzqh/6O8qeojeE+eaUDe/50hPrwrWBZVihim+/H91kK7RSL5+B5Aaznl8LXifixEpc4SZ0QB08HIz1f8YhTgDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T08:54:04.046796Z","bundle_sha256":"f987e96eab9b1ceabfaadefd86201910c5e2893aaf8fe8dacd3cb70ff1bd5eba"}}