{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FF5CKIIFGLOUSORWHURCIBQKCJ","short_pith_number":"pith:FF5CKIIF","schema_version":"1.0","canonical_sha256":"297a25210532dd493a363d2224060a12548bce13d76f4bbdd82d934eaeec2e5d","source":{"kind":"arxiv","id":"1608.01013","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1608.01013","created_at":"2026-05-18T01:09:56.968366+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.01013v1","created_at":"2026-05-18T01:09:56.968366+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01013","created_at":"2026-05-18T01:09:56.968366+00:00"},{"alias_kind":"pith_short_12","alias_value":"FF5CKIIFGLOU","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FF5CKIIFGLOUSORW","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FF5CKIIF","created_at":"2026-05-18T12:30:15.759754+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FF5CKIIFGLOUSORWHURCIBQKCJ","json":"https://pith.science/pith/FF5CKIIFGLOUSORWHURCIBQKCJ.json","graph_json":"https://pith.science/api/pith-number/FF5CKIIFGLOUSORWHURCIBQKCJ/graph.json","events_json":"https://pith.science/api/pith-number/FF5CKIIFGLOUSORWHURCIBQKCJ/events.json","paper":"https://pith.science/paper/FF5CKIIF"},"agent_actions":{"view_html":"https://pith.science/pith/FF5CKIIFGLOUSORWHURCIBQKCJ","download_json":"https://pith.science/pith/FF5CKIIFGLOUSORWHURCIBQKCJ.json","view_paper":"https://pith.science/paper/FF5CKIIF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.01013&json=true","fetch_graph":"https://pith.science/api/pith-number/FF5CKIIFGLOUSORWHURCIBQKCJ/graph.json","fetch_events":"https://pith.science/api/pith-number/FF5CKIIFGLOUSORWHURCIBQKCJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FF5CKIIFGLOUSORWHURCIBQKCJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FF5CKIIFGLOUSORWHURCIBQKCJ/action/storage_attestation","attest_author":"https://pith.science/pith/FF5CKIIFGLOUSORWHURCIBQKCJ/action/author_attestation","sign_citation":"https://pith.science/pith/FF5CKIIFGLOUSORWHURCIBQKCJ/action/citation_signature","submit_replication":"https://pith.science/pith/FF5CKIIFGLOUSORWHURCIBQKCJ/action/replication_record"}},"created_at":"2026-05-18T01:09:56.968366+00:00","updated_at":"2026-05-18T01:09:56.968366+00:00"}