{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EHYNMGX6C6WZKVISEHKOYZ57LI","short_pith_number":"pith:EHYNMGX6","canonical_record":{"source":{"id":"1404.7078","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-04-28T18:13:49Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"0ed02a1414bfb0c4b023f74f692d17b3eb450be51f24985a7e7675f009b82e14","abstract_canon_sha256":"64147fb92727f10fd82dcde474bbe20dbad423bf15764a029ca0441f72f760e6"},"schema_version":"1.0"},"canonical_sha256":"21f0d61afe17ad95551221d4ec67bf5a13ce73adfbe0a8a6bb3da9c4bc0860c3","source":{"kind":"arxiv","id":"1404.7078","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.7078","created_at":"2026-05-18T02:52:48Z"},{"alias_kind":"arxiv_version","alias_value":"1404.7078v2","created_at":"2026-05-18T02:52:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.7078","created_at":"2026-05-18T02:52:48Z"},{"alias_kind":"pith_short_12","alias_value":"EHYNMGX6C6WZ","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EHYNMGX6C6WZKVIS","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EHYNMGX6","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EHYNMGX6C6WZKVISEHKOYZ57LI","target":"record","payload":{"canonical_record":{"source":{"id":"1404.7078","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-04-28T18:13:49Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"0ed02a1414bfb0c4b023f74f692d17b3eb450be51f24985a7e7675f009b82e14","abstract_canon_sha256":"64147fb92727f10fd82dcde474bbe20dbad423bf15764a029ca0441f72f760e6"},"schema_version":"1.0"},"canonical_sha256":"21f0d61afe17ad95551221d4ec67bf5a13ce73adfbe0a8a6bb3da9c4bc0860c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:48.317231Z","signature_b64":"S+/47u5BCPj1EKE0cCZYDMksOaTB13yhNKlfPIuEg91v2fsx/GWQ1ETWO/NFRK/SxCHcXbcqmFWTgQN5SG4UAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21f0d61afe17ad95551221d4ec67bf5a13ce73adfbe0a8a6bb3da9c4bc0860c3","last_reissued_at":"2026-05-18T02:52:48.316691Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:48.316691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.7078","source_version":2,"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:52:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t5b8GGN3WuWlcluJ8oN11ljdQq4NIWKmI6V27mu+JrPbhJaSpxqKzremWb3IzSu4qGHWBGauSEQzGgI9fGXFDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:37:05.345422Z"},"content_sha256":"587e47a824016f61bf10e291395da644b3f62e8bf32612f7f255d0c28e181a35","schema_version":"1.0","event_id":"sha256:587e47a824016f61bf10e291395da644b3f62e8bf32612f7f255d0c28e181a35"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EHYNMGX6C6WZKVISEHKOYZ57LI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Query shredding: Efficient relational evaluation of queries over nested multisets (extended version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"cs.DB","authors_text":"James Cheney, Philip Wadler, Sam Lindley","submitted_at":"2014-04-28T18:13:49Z","abstract_excerpt":"Nested relational query languages have been explored extensively, and underlie industrial language-integrated query systems such as Microsoft's LINQ. However, relational databases do not natively support nested collections in query results. This can lead to major performance problems: if programmers write queries that yield nested results, then such systems typically either fail or generate a large number of queries. We present a new approach to query shredding, which converts a query returning nested data to a fixed number of SQL queries. Our approach, in contrast to prior work, handles multi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.7078","kind":"arxiv","version":2},"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:52:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8QOZu22Lvszg9F/oqWSu1lQObUriwAu7LT94J6qaR9/5ggbA2Gb7sBo0ZCk3wm1Bu0G+iBMx+6WTKFHPgncZAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:37:05.345774Z"},"content_sha256":"db6b4ee3bcfe47167384c1da4a4fe04656f546277d0b8ad9f3d812c4c48d5384","schema_version":"1.0","event_id":"sha256:db6b4ee3bcfe47167384c1da4a4fe04656f546277d0b8ad9f3d812c4c48d5384"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EHYNMGX6C6WZKVISEHKOYZ57LI/bundle.json","state_url":"https://pith.science/pith/EHYNMGX6C6WZKVISEHKOYZ57LI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EHYNMGX6C6WZKVISEHKOYZ57LI/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-01T11:37:05Z","links":{"resolver":"https://pith.science/pith/EHYNMGX6C6WZKVISEHKOYZ57LI","bundle":"https://pith.science/pith/EHYNMGX6C6WZKVISEHKOYZ57LI/bundle.json","state":"https://pith.science/pith/EHYNMGX6C6WZKVISEHKOYZ57LI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EHYNMGX6C6WZKVISEHKOYZ57LI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EHYNMGX6C6WZKVISEHKOYZ57LI","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":"64147fb92727f10fd82dcde474bbe20dbad423bf15764a029ca0441f72f760e6","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-04-28T18:13:49Z","title_canon_sha256":"0ed02a1414bfb0c4b023f74f692d17b3eb450be51f24985a7e7675f009b82e14"},"schema_version":"1.0","source":{"id":"1404.7078","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.7078","created_at":"2026-05-18T02:52:48Z"},{"alias_kind":"arxiv_version","alias_value":"1404.7078v2","created_at":"2026-05-18T02:52:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.7078","created_at":"2026-05-18T02:52:48Z"},{"alias_kind":"pith_short_12","alias_value":"EHYNMGX6C6WZ","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EHYNMGX6C6WZKVIS","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EHYNMGX6","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:db6b4ee3bcfe47167384c1da4a4fe04656f546277d0b8ad9f3d812c4c48d5384","target":"graph","created_at":"2026-05-18T02:52:48Z","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":"Nested relational query languages have been explored extensively, and underlie industrial language-integrated query systems such as Microsoft's LINQ. However, relational databases do not natively support nested collections in query results. This can lead to major performance problems: if programmers write queries that yield nested results, then such systems typically either fail or generate a large number of queries. We present a new approach to query shredding, which converts a query returning nested data to a fixed number of SQL queries. Our approach, in contrast to prior work, handles multi","authors_text":"James Cheney, Philip Wadler, Sam Lindley","cross_cats":["cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-04-28T18:13:49Z","title":"Query shredding: Efficient relational evaluation of queries over nested multisets (extended version)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.7078","kind":"arxiv","version":2},"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:587e47a824016f61bf10e291395da644b3f62e8bf32612f7f255d0c28e181a35","target":"record","created_at":"2026-05-18T02:52:48Z","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":"64147fb92727f10fd82dcde474bbe20dbad423bf15764a029ca0441f72f760e6","cross_cats_sorted":["cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-04-28T18:13:49Z","title_canon_sha256":"0ed02a1414bfb0c4b023f74f692d17b3eb450be51f24985a7e7675f009b82e14"},"schema_version":"1.0","source":{"id":"1404.7078","kind":"arxiv","version":2}},"canonical_sha256":"21f0d61afe17ad95551221d4ec67bf5a13ce73adfbe0a8a6bb3da9c4bc0860c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21f0d61afe17ad95551221d4ec67bf5a13ce73adfbe0a8a6bb3da9c4bc0860c3","first_computed_at":"2026-05-18T02:52:48.316691Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:48.316691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S+/47u5BCPj1EKE0cCZYDMksOaTB13yhNKlfPIuEg91v2fsx/GWQ1ETWO/NFRK/SxCHcXbcqmFWTgQN5SG4UAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:48.317231Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.7078","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:587e47a824016f61bf10e291395da644b3f62e8bf32612f7f255d0c28e181a35","sha256:db6b4ee3bcfe47167384c1da4a4fe04656f546277d0b8ad9f3d812c4c48d5384"],"state_sha256":"75a1050ac1d7659fffa390e5713ef9ed8d40b2660adcfb3f41f1a33dc3263153"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tZzeculNXYGRuzzHxKAD6WFao7U9gTLuMLEpP9ZINrg3SqMkyCgkWkyOtz7xNLGX7rXcOLLJ0PEg/gVttVb0AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T11:37:05.347736Z","bundle_sha256":"ed2a766085391d4d20339d5ec34d8b1ea49dac2970e382b07d17119eef2a414b"}}