{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WPBRAOY7LWZVMPYL5L3MWI6RLF","short_pith_number":"pith:WPBRAOY7","schema_version":"1.0","canonical_sha256":"b3c3103b1f5db3563f0beaf6cb23d15940db7b3d9ca7d0465741f5d01dc310ff","source":{"kind":"arxiv","id":"1603.05422","version":1},"attestation_state":"computed","paper":{"title":"Set Containment Join Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Manolis Terrovitis, Nikos Mamoulis, Panagiotis Bouros, Shen Ge","submitted_at":"2016-03-17T10:47:48Z","abstract_excerpt":"Given two collections of set objects $R$ and $S$, the $R \\bowtie_{\\subseteq} S$ set containment join returns all object pairs $(r, s) \\in R \\times S$ such that $r \\subseteq s$. Besides being a basic operator in all modern data management systems with a wide range of applications, the join can be used to evaluate complex SQL queries based on relational division and as a module of data mining algorithms. The state-of-the-art algorithm for set containment joins (PRETTI) builds an inverted index on the right-hand collection $S$ and a prefix tree on the left-hand collection $R$ that groups set obje"},"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":"1603.05422","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-03-17T10:47:48Z","cross_cats_sorted":[],"title_canon_sha256":"a8aaee63c9691758a7cba430e55516a439e630a517093a48dda5e99048fa1968","abstract_canon_sha256":"621b35ee257ee1c99ebb1bbb91b2d514ecf88d515d27960d77f58ba85d658a10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:56.393690Z","signature_b64":"oC0tIo/s/uIllRqhC/Q1GoENd1rxGbQYs2H83FJ25HGOfCrNLlBLsKS802v5UL4qCG8f6AGgQ0j7DQVKWQcDAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3c3103b1f5db3563f0beaf6cb23d15940db7b3d9ca7d0465741f5d01dc310ff","last_reissued_at":"2026-05-18T01:18:56.393238Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:56.393238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Set Containment Join Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Manolis Terrovitis, Nikos Mamoulis, Panagiotis Bouros, Shen Ge","submitted_at":"2016-03-17T10:47:48Z","abstract_excerpt":"Given two collections of set objects $R$ and $S$, the $R \\bowtie_{\\subseteq} S$ set containment join returns all object pairs $(r, s) \\in R \\times S$ such that $r \\subseteq s$. Besides being a basic operator in all modern data management systems with a wide range of applications, the join can be used to evaluate complex SQL queries based on relational division and as a module of data mining algorithms. The state-of-the-art algorithm for set containment joins (PRETTI) builds an inverted index on the right-hand collection $S$ and a prefix tree on the left-hand collection $R$ that groups set obje"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05422","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":"1603.05422","created_at":"2026-05-18T01:18:56.393305+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.05422v1","created_at":"2026-05-18T01:18:56.393305+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05422","created_at":"2026-05-18T01:18:56.393305+00:00"},{"alias_kind":"pith_short_12","alias_value":"WPBRAOY7LWZV","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"WPBRAOY7LWZVMPYL","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"WPBRAOY7","created_at":"2026-05-18T12:30:51.357362+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/WPBRAOY7LWZVMPYL5L3MWI6RLF","json":"https://pith.science/pith/WPBRAOY7LWZVMPYL5L3MWI6RLF.json","graph_json":"https://pith.science/api/pith-number/WPBRAOY7LWZVMPYL5L3MWI6RLF/graph.json","events_json":"https://pith.science/api/pith-number/WPBRAOY7LWZVMPYL5L3MWI6RLF/events.json","paper":"https://pith.science/paper/WPBRAOY7"},"agent_actions":{"view_html":"https://pith.science/pith/WPBRAOY7LWZVMPYL5L3MWI6RLF","download_json":"https://pith.science/pith/WPBRAOY7LWZVMPYL5L3MWI6RLF.json","view_paper":"https://pith.science/paper/WPBRAOY7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.05422&json=true","fetch_graph":"https://pith.science/api/pith-number/WPBRAOY7LWZVMPYL5L3MWI6RLF/graph.json","fetch_events":"https://pith.science/api/pith-number/WPBRAOY7LWZVMPYL5L3MWI6RLF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WPBRAOY7LWZVMPYL5L3MWI6RLF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WPBRAOY7LWZVMPYL5L3MWI6RLF/action/storage_attestation","attest_author":"https://pith.science/pith/WPBRAOY7LWZVMPYL5L3MWI6RLF/action/author_attestation","sign_citation":"https://pith.science/pith/WPBRAOY7LWZVMPYL5L3MWI6RLF/action/citation_signature","submit_replication":"https://pith.science/pith/WPBRAOY7LWZVMPYL5L3MWI6RLF/action/replication_record"}},"created_at":"2026-05-18T01:18:56.393305+00:00","updated_at":"2026-05-18T01:18:56.393305+00:00"}