{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FF5CKIIFGLOUSORWHURCIBQKCJ","short_pith_number":"pith:FF5CKIIF","canonical_record":{"source":{"id":"1608.01013","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-08-02T21:43:09Z","cross_cats_sorted":[],"title_canon_sha256":"47cca37f01a652df351d0191ce32271bcf26ef16c85228a4e936c1f47e88361b","abstract_canon_sha256":"b2629293e404b108f04e2d902da34a4714502818912c8c4a5d8f97f0743359fc"},"schema_version":"1.0"},"canonical_sha256":"297a25210532dd493a363d2224060a12548bce13d76f4bbdd82d934eaeec2e5d","source":{"kind":"arxiv","id":"1608.01013","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01013","created_at":"2026-05-18T01:09:56Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01013v1","created_at":"2026-05-18T01:09:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01013","created_at":"2026-05-18T01:09:56Z"},{"alias_kind":"pith_short_12","alias_value":"FF5CKIIFGLOU","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FF5CKIIFGLOUSORW","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FF5CKIIF","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FF5CKIIFGLOUSORWHURCIBQKCJ","target":"record","payload":{"canonical_record":{"source":{"id":"1608.01013","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-08-02T21:43:09Z","cross_cats_sorted":[],"title_canon_sha256":"47cca37f01a652df351d0191ce32271bcf26ef16c85228a4e936c1f47e88361b","abstract_canon_sha256":"b2629293e404b108f04e2d902da34a4714502818912c8c4a5d8f97f0743359fc"},"schema_version":"1.0"},"canonical_sha256":"297a25210532dd493a363d2224060a12548bce13d76f4bbdd82d934eaeec2e5d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:56.968788Z","signature_b64":"vm87Dm9CXYXRohO92mx+oIsMgcy3fztMk3dkGLa44C39F8lhXbPE8FA/5MfvzKePT4KpfXpLLW5pJF09tkjUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"297a25210532dd493a363d2224060a12548bce13d76f4bbdd82d934eaeec2e5d","last_reissued_at":"2026-05-18T01:09:56.968274Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:56.968274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.01013","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:09:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V8l5zDez2FlH1Srd3zplptm/L2mTopniaEsxvyYKrZKy9hlLmj2tuXuSW9DkaWu/dx5O1fzABHITovRb1yySBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T09:48:39.522285Z"},"content_sha256":"b8d84a2c8d4b141c7a95e184905c28500e9df6697467eb5023e137b586bb3751","schema_version":"1.0","event_id":"sha256:b8d84a2c8d4b141c7a95e184905c28500e9df6697467eb5023e137b586bb3751"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FF5CKIIFGLOUSORWHURCIBQKCJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Summarizing Large Query Logs in Ettu","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Duc Luong, Gokhan Kul, Oliver Kennedy, Patrick Coonan, Shambhu Upadhyaya, Ting Xie, Varun Chandola","submitted_at":"2016-08-02T21:43:09Z","abstract_excerpt":"Database access logs are large, unwieldy, and hard for humans to inspect and summarize. In spite of this, they remain the canonical go-to resource for tasks ranging from performance tuning to security auditing. In this paper, we address the challenge of compactly encoding large sequences of SQL queries for presentation to a human user. Our approach is based on the Weisfeiler-Lehman (WL) approximate graph isomorphism algorithm, which identifies salient features of a graph or in our case of an abstract syntax tree. Our generalization of WL allows us to define a distance metric for SQL queries, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01013","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:09:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9LYtn59mxIX+tlGW04wlSo2UkJGt2zKlZgx0EqQ/NOkY9Lz35qK91S0kbZABBXrsj00TvwJfDdn1sUr3pKdvBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T09:48:39.522655Z"},"content_sha256":"e36921366e729911e7b77e31c30c8c71153e07ff7031badac027263300c89037","schema_version":"1.0","event_id":"sha256:e36921366e729911e7b77e31c30c8c71153e07ff7031badac027263300c89037"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FF5CKIIFGLOUSORWHURCIBQKCJ/bundle.json","state_url":"https://pith.science/pith/FF5CKIIFGLOUSORWHURCIBQKCJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FF5CKIIFGLOUSORWHURCIBQKCJ/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-22T09:48:39Z","links":{"resolver":"https://pith.science/pith/FF5CKIIFGLOUSORWHURCIBQKCJ","bundle":"https://pith.science/pith/FF5CKIIFGLOUSORWHURCIBQKCJ/bundle.json","state":"https://pith.science/pith/FF5CKIIFGLOUSORWHURCIBQKCJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FF5CKIIFGLOUSORWHURCIBQKCJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FF5CKIIFGLOUSORWHURCIBQKCJ","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":"b2629293e404b108f04e2d902da34a4714502818912c8c4a5d8f97f0743359fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-08-02T21:43:09Z","title_canon_sha256":"47cca37f01a652df351d0191ce32271bcf26ef16c85228a4e936c1f47e88361b"},"schema_version":"1.0","source":{"id":"1608.01013","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01013","created_at":"2026-05-18T01:09:56Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01013v1","created_at":"2026-05-18T01:09:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01013","created_at":"2026-05-18T01:09:56Z"},{"alias_kind":"pith_short_12","alias_value":"FF5CKIIFGLOU","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FF5CKIIFGLOUSORW","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FF5CKIIF","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:e36921366e729911e7b77e31c30c8c71153e07ff7031badac027263300c89037","target":"graph","created_at":"2026-05-18T01:09:56Z","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":"Database access logs are large, unwieldy, and hard for humans to inspect and summarize. In spite of this, they remain the canonical go-to resource for tasks ranging from performance tuning to security auditing. In this paper, we address the challenge of compactly encoding large sequences of SQL queries for presentation to a human user. Our approach is based on the Weisfeiler-Lehman (WL) approximate graph isomorphism algorithm, which identifies salient features of a graph or in our case of an abstract syntax tree. Our generalization of WL allows us to define a distance metric for SQL queries, w","authors_text":"Duc Luong, Gokhan Kul, Oliver Kennedy, Patrick Coonan, Shambhu Upadhyaya, Ting Xie, Varun Chandola","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-08-02T21:43:09Z","title":"Summarizing Large Query Logs in Ettu"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01013","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:b8d84a2c8d4b141c7a95e184905c28500e9df6697467eb5023e137b586bb3751","target":"record","created_at":"2026-05-18T01:09:56Z","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":"b2629293e404b108f04e2d902da34a4714502818912c8c4a5d8f97f0743359fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-08-02T21:43:09Z","title_canon_sha256":"47cca37f01a652df351d0191ce32271bcf26ef16c85228a4e936c1f47e88361b"},"schema_version":"1.0","source":{"id":"1608.01013","kind":"arxiv","version":1}},"canonical_sha256":"297a25210532dd493a363d2224060a12548bce13d76f4bbdd82d934eaeec2e5d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"297a25210532dd493a363d2224060a12548bce13d76f4bbdd82d934eaeec2e5d","first_computed_at":"2026-05-18T01:09:56.968274Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:56.968274Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vm87Dm9CXYXRohO92mx+oIsMgcy3fztMk3dkGLa44C39F8lhXbPE8FA/5MfvzKePT4KpfXpLLW5pJF09tkjUDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:56.968788Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.01013","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8d84a2c8d4b141c7a95e184905c28500e9df6697467eb5023e137b586bb3751","sha256:e36921366e729911e7b77e31c30c8c71153e07ff7031badac027263300c89037"],"state_sha256":"be08c6ffe97d87887d968ed261896bb947805d323bc23db0beef5ee9e45c5f95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KaINaaV5sauVhPuu9CKfHilKOmxiZTUQgIVbChM5F/GAA7ALnpxy62LDwpgRN82H6UCeVeG6N75ym932iJanAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T09:48:39.524706Z","bundle_sha256":"3b53e07ff7880c4a4d9772c9a59dcab0405b1e563af90feca79ddc9e466b13dc"}}