{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:6W43ZXEQNS3AAYEEC2J2ZON3HG","short_pith_number":"pith:6W43ZXEQ","canonical_record":{"source":{"id":"2412.08583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-12-11T17:59:58Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"d9c6bdce1e34dd10291f01ab40c933f9b08fe039d77537c0dc07754128870332","abstract_canon_sha256":"8378d79b9571d8d17dbe9bbaa41551e2ade80aaa6b61ad64331f7c1b417dac8c"},"schema_version":"1.0"},"canonical_sha256":"f5b9bcdc906cb60060841693acb9bb3986667bde3bcdcc5a17d0a30f52d53fac","source":{"kind":"arxiv","id":"2412.08583","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.08583","created_at":"2026-07-05T09:47:52Z"},{"alias_kind":"arxiv_version","alias_value":"2412.08583v1","created_at":"2026-07-05T09:47:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.08583","created_at":"2026-07-05T09:47:52Z"},{"alias_kind":"pith_short_12","alias_value":"6W43ZXEQNS3A","created_at":"2026-07-05T09:47:52Z"},{"alias_kind":"pith_short_16","alias_value":"6W43ZXEQNS3AAYEE","created_at":"2026-07-05T09:47:52Z"},{"alias_kind":"pith_short_8","alias_value":"6W43ZXEQ","created_at":"2026-07-05T09:47:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:6W43ZXEQNS3AAYEEC2J2ZON3HG","target":"record","payload":{"canonical_record":{"source":{"id":"2412.08583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-12-11T17:59:58Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"d9c6bdce1e34dd10291f01ab40c933f9b08fe039d77537c0dc07754128870332","abstract_canon_sha256":"8378d79b9571d8d17dbe9bbaa41551e2ade80aaa6b61ad64331f7c1b417dac8c"},"schema_version":"1.0"},"canonical_sha256":"f5b9bcdc906cb60060841693acb9bb3986667bde3bcdcc5a17d0a30f52d53fac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:47:52.243263Z","signature_b64":"misL6+7Yrr88/O41B+KXpCwI7gRIfTMTnWwl/q88gRfLjzO/DzgoQP/n53kPjLquFUpmGQGA3AT9pSAqT+xcBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5b9bcdc906cb60060841693acb9bb3986667bde3bcdcc5a17d0a30f52d53fac","last_reissued_at":"2026-07-05T09:47:52.242618Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:47:52.242618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.08583","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-07-05T09:47:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9l9MegyTyWtSDawkAgzWAXYCLH6FO5JGqtm+5jF86I+VnYTYeIVuHFK3fKYcwClOT2vHpQ0AP5IOTKAWxBG+AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T14:12:39.977938Z"},"content_sha256":"8c4953b678143ef060749e2e60577f4a48bd77f3f73fc118fafddf68c2372fb9","schema_version":"1.0","event_id":"sha256:8c4953b678143ef060749e2e60577f4a48bd77f3f73fc118fafddf68c2372fb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:6W43ZXEQNS3AAYEEC2J2ZON3HG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Principled Solution to the Disjunction Problem of Diagrammatic Query Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.DB","authors_text":"Wolfgang Gatterbauer","submitted_at":"2024-12-11T17:59:58Z","abstract_excerpt":"Finding unambiguous diagrammatic representations for first-order logical formulas and relational queries with arbitrarily nested disjunctions has been a surprisingly long-standing unsolved problem. We refer to this problem as the disjunction problem (of diagrammatic query representations).\n  This work solves the disjunction problem. Our solution unifies, generalizes, and overcomes the shortcomings of prior approaches for disjunctions. It extends the recently proposed Relational Diagrams and is identical for disjunction-free queries. However, it can preserve the relational patterns and the safe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.08583","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.08583/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"},"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-07-05T09:47:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hLth3b7pWzeTwluHgh3PWP47yKyotT21dHUmashjsY5yCk6QMj3MNQyGISOoS6A9A4DvA1LOZLWBxfRIueZ7Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T14:12:39.978242Z"},"content_sha256":"8ad9862454a3b20cd3b7eae370f1c9655088a0281c8ad72e615bb85e3f12a088","schema_version":"1.0","event_id":"sha256:8ad9862454a3b20cd3b7eae370f1c9655088a0281c8ad72e615bb85e3f12a088"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6W43ZXEQNS3AAYEEC2J2ZON3HG/bundle.json","state_url":"https://pith.science/pith/6W43ZXEQNS3AAYEEC2J2ZON3HG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6W43ZXEQNS3AAYEEC2J2ZON3HG/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-08-05T14:12:39Z","links":{"resolver":"https://pith.science/pith/6W43ZXEQNS3AAYEEC2J2ZON3HG","bundle":"https://pith.science/pith/6W43ZXEQNS3AAYEEC2J2ZON3HG/bundle.json","state":"https://pith.science/pith/6W43ZXEQNS3AAYEEC2J2ZON3HG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6W43ZXEQNS3AAYEEC2J2ZON3HG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:6W43ZXEQNS3AAYEEC2J2ZON3HG","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":"8378d79b9571d8d17dbe9bbaa41551e2ade80aaa6b61ad64331f7c1b417dac8c","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-12-11T17:59:58Z","title_canon_sha256":"d9c6bdce1e34dd10291f01ab40c933f9b08fe039d77537c0dc07754128870332"},"schema_version":"1.0","source":{"id":"2412.08583","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.08583","created_at":"2026-07-05T09:47:52Z"},{"alias_kind":"arxiv_version","alias_value":"2412.08583v1","created_at":"2026-07-05T09:47:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.08583","created_at":"2026-07-05T09:47:52Z"},{"alias_kind":"pith_short_12","alias_value":"6W43ZXEQNS3A","created_at":"2026-07-05T09:47:52Z"},{"alias_kind":"pith_short_16","alias_value":"6W43ZXEQNS3AAYEE","created_at":"2026-07-05T09:47:52Z"},{"alias_kind":"pith_short_8","alias_value":"6W43ZXEQ","created_at":"2026-07-05T09:47:52Z"}],"graph_snapshots":[{"event_id":"sha256:8ad9862454a3b20cd3b7eae370f1c9655088a0281c8ad72e615bb85e3f12a088","target":"graph","created_at":"2026-07-05T09:47:52Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.08583/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Finding unambiguous diagrammatic representations for first-order logical formulas and relational queries with arbitrarily nested disjunctions has been a surprisingly long-standing unsolved problem. We refer to this problem as the disjunction problem (of diagrammatic query representations).\n  This work solves the disjunction problem. Our solution unifies, generalizes, and overcomes the shortcomings of prior approaches for disjunctions. It extends the recently proposed Relational Diagrams and is identical for disjunction-free queries. However, it can preserve the relational patterns and the safe","authors_text":"Wolfgang Gatterbauer","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-12-11T17:59:58Z","title":"A Principled Solution to the Disjunction Problem of Diagrammatic Query Representations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.08583","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:8c4953b678143ef060749e2e60577f4a48bd77f3f73fc118fafddf68c2372fb9","target":"record","created_at":"2026-07-05T09:47:52Z","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":"8378d79b9571d8d17dbe9bbaa41551e2ade80aaa6b61ad64331f7c1b417dac8c","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2024-12-11T17:59:58Z","title_canon_sha256":"d9c6bdce1e34dd10291f01ab40c933f9b08fe039d77537c0dc07754128870332"},"schema_version":"1.0","source":{"id":"2412.08583","kind":"arxiv","version":1}},"canonical_sha256":"f5b9bcdc906cb60060841693acb9bb3986667bde3bcdcc5a17d0a30f52d53fac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5b9bcdc906cb60060841693acb9bb3986667bde3bcdcc5a17d0a30f52d53fac","first_computed_at":"2026-07-05T09:47:52.242618Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:47:52.242618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"misL6+7Yrr88/O41B+KXpCwI7gRIfTMTnWwl/q88gRfLjzO/DzgoQP/n53kPjLquFUpmGQGA3AT9pSAqT+xcBg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:47:52.243263Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.08583","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c4953b678143ef060749e2e60577f4a48bd77f3f73fc118fafddf68c2372fb9","sha256:8ad9862454a3b20cd3b7eae370f1c9655088a0281c8ad72e615bb85e3f12a088"],"state_sha256":"9d4ed6f0bd42a129708e19ca2af4b6d719f813902654d93c0df7cb66b3ac783f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PQlHTbozH7MdxOhSODm35nbwpV1r6KKkdKhiveC6kBwhKfuNepkQO8A5RvFVUOzBFKIyqOYefL75w5mQHek2AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T14:12:39.982162Z","bundle_sha256":"12d2025941ed8dbaaad7fb961322475487a26460a60499d05b09a5ac6a4975a1"}}