{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GIGG4PXZ34TVFY3QVB5JUJKTOX","short_pith_number":"pith:GIGG4PXZ","canonical_record":{"source":{"id":"1802.02229","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2018-02-06T21:40:50Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"92aced30ec4282c5b618da009c15ac484cb6fa7b1def5c0101a3dc1ee48d473f","abstract_canon_sha256":"e210f321a09eb84cb4bc4024458f37263bfe975f1b3edf5f694f45367105e6fe"},"schema_version":"1.0"},"canonical_sha256":"320c6e3ef9df2752e370a87a9a255375efc831d9640bbb76fa829ff1e5c31ee7","source":{"kind":"arxiv","id":"1802.02229","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.02229","created_at":"2026-05-18T00:15:04Z"},{"alias_kind":"arxiv_version","alias_value":"1802.02229v3","created_at":"2026-05-18T00:15:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02229","created_at":"2026-05-18T00:15:04Z"},{"alias_kind":"pith_short_12","alias_value":"GIGG4PXZ34TV","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GIGG4PXZ34TVFY3Q","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GIGG4PXZ","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GIGG4PXZ34TVFY3QVB5JUJKTOX","target":"record","payload":{"canonical_record":{"source":{"id":"1802.02229","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2018-02-06T21:40:50Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"92aced30ec4282c5b618da009c15ac484cb6fa7b1def5c0101a3dc1ee48d473f","abstract_canon_sha256":"e210f321a09eb84cb4bc4024458f37263bfe975f1b3edf5f694f45367105e6fe"},"schema_version":"1.0"},"canonical_sha256":"320c6e3ef9df2752e370a87a9a255375efc831d9640bbb76fa829ff1e5c31ee7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:04.996251Z","signature_b64":"Khh2z7J+zDPjOqLF092YvBqfSVX6MZg3Bf21x2i0gSiMmPAL92G0Y3hFE6k+lyGdzcNIXKYX0uuptEoW4W80Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"320c6e3ef9df2752e370a87a9a255375efc831d9640bbb76fa829ff1e5c31ee7","last_reissued_at":"2026-05-18T00:15:04.995774Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:04.995774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.02229","source_version":3,"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-18T00:15:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WM/d2lII/Zph5LgfG652Iif9vSJBjbOwOZL6iT5tnu+3giIH8NDNAyM0I8krqYaz6mTNWgDy0ywwYD6SafdoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:13:17.737974Z"},"content_sha256":"12c8791062a7c6b94f055880246ffe64b6820bca342dba5af564c2fbd4527a35","schema_version":"1.0","event_id":"sha256:12c8791062a7c6b94f055880246ffe64b6820bca342dba5af564c2fbd4527a35"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GIGG4PXZ34TVFY3QVB5JUJKTOX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Axiomatic Foundations and Algorithms for Deciding Semantic Equivalences of SQL Queries","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.DB","authors_text":"Alvin Cheung, Brendan Murphy, Dan Suciu, Jared Roesch, Shumo Chu","submitted_at":"2018-02-06T21:40:50Z","abstract_excerpt":"Deciding the equivalence of SQL queries is a fundamental problem in data management. As prior work has mainly focused on studying the theoretical limitations of the problem, very few implementations for checking such equivalences exist. In this paper, we present a new formalism and implementation for reasoning about the equivalences of SQL queries. Our formalism, U-semiring, extends SQL's semiring semantics with unbounded summation and duplicate elimination. U-semiring is defined using only very few axioms and can thus be easily implemented using proof assistants such as Coq for automated quer"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02229","kind":"arxiv","version":3},"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-18T00:15:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mbP0kN+24gCoBFKN6p8i2Gp/1e/TCf/ul7mQYc9IaqW1Fj11BsaxgvCHzYcMXuW8y8I08NtfSHPmYqk/i55mCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:13:17.738652Z"},"content_sha256":"52e642f159f3d91a98c0522f75707ecc120294bbc4288a82804d462d43cb9114","schema_version":"1.0","event_id":"sha256:52e642f159f3d91a98c0522f75707ecc120294bbc4288a82804d462d43cb9114"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GIGG4PXZ34TVFY3QVB5JUJKTOX/bundle.json","state_url":"https://pith.science/pith/GIGG4PXZ34TVFY3QVB5JUJKTOX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GIGG4PXZ34TVFY3QVB5JUJKTOX/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-26T05:13:17Z","links":{"resolver":"https://pith.science/pith/GIGG4PXZ34TVFY3QVB5JUJKTOX","bundle":"https://pith.science/pith/GIGG4PXZ34TVFY3QVB5JUJKTOX/bundle.json","state":"https://pith.science/pith/GIGG4PXZ34TVFY3QVB5JUJKTOX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GIGG4PXZ34TVFY3QVB5JUJKTOX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GIGG4PXZ34TVFY3QVB5JUJKTOX","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":"e210f321a09eb84cb4bc4024458f37263bfe975f1b3edf5f694f45367105e6fe","cross_cats_sorted":["cs.PL"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2018-02-06T21:40:50Z","title_canon_sha256":"92aced30ec4282c5b618da009c15ac484cb6fa7b1def5c0101a3dc1ee48d473f"},"schema_version":"1.0","source":{"id":"1802.02229","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.02229","created_at":"2026-05-18T00:15:04Z"},{"alias_kind":"arxiv_version","alias_value":"1802.02229v3","created_at":"2026-05-18T00:15:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02229","created_at":"2026-05-18T00:15:04Z"},{"alias_kind":"pith_short_12","alias_value":"GIGG4PXZ34TV","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GIGG4PXZ34TVFY3Q","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GIGG4PXZ","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:52e642f159f3d91a98c0522f75707ecc120294bbc4288a82804d462d43cb9114","target":"graph","created_at":"2026-05-18T00:15:04Z","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":"Deciding the equivalence of SQL queries is a fundamental problem in data management. As prior work has mainly focused on studying the theoretical limitations of the problem, very few implementations for checking such equivalences exist. In this paper, we present a new formalism and implementation for reasoning about the equivalences of SQL queries. Our formalism, U-semiring, extends SQL's semiring semantics with unbounded summation and duplicate elimination. U-semiring is defined using only very few axioms and can thus be easily implemented using proof assistants such as Coq for automated quer","authors_text":"Alvin Cheung, Brendan Murphy, Dan Suciu, Jared Roesch, Shumo Chu","cross_cats":["cs.PL"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2018-02-06T21:40:50Z","title":"Axiomatic Foundations and Algorithms for Deciding Semantic Equivalences of SQL Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02229","kind":"arxiv","version":3},"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:12c8791062a7c6b94f055880246ffe64b6820bca342dba5af564c2fbd4527a35","target":"record","created_at":"2026-05-18T00:15:04Z","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":"e210f321a09eb84cb4bc4024458f37263bfe975f1b3edf5f694f45367105e6fe","cross_cats_sorted":["cs.PL"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2018-02-06T21:40:50Z","title_canon_sha256":"92aced30ec4282c5b618da009c15ac484cb6fa7b1def5c0101a3dc1ee48d473f"},"schema_version":"1.0","source":{"id":"1802.02229","kind":"arxiv","version":3}},"canonical_sha256":"320c6e3ef9df2752e370a87a9a255375efc831d9640bbb76fa829ff1e5c31ee7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"320c6e3ef9df2752e370a87a9a255375efc831d9640bbb76fa829ff1e5c31ee7","first_computed_at":"2026-05-18T00:15:04.995774Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:04.995774Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Khh2z7J+zDPjOqLF092YvBqfSVX6MZg3Bf21x2i0gSiMmPAL92G0Y3hFE6k+lyGdzcNIXKYX0uuptEoW4W80Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:04.996251Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.02229","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12c8791062a7c6b94f055880246ffe64b6820bca342dba5af564c2fbd4527a35","sha256:52e642f159f3d91a98c0522f75707ecc120294bbc4288a82804d462d43cb9114"],"state_sha256":"e3c1e8f34e9678ff32486d762bd1593106473978a03f43bd72d75a055129fc10"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qn4fdcXT2+L3z8HksOriUDV1DZV0D3Bn2ZzhAZgySTVDv/3MWJqoljqGosokMp8etolyC8GFfLTyFDyJPDtDAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T05:13:17.742237Z","bundle_sha256":"b02b5f53e66bf98fc3226505565128f1f37158c5d58f632ca977226918a7b9da"}}