{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UE2GDD7EFZBJVEZJRGCCWVCC7P","short_pith_number":"pith:UE2GDD7E","schema_version":"1.0","canonical_sha256":"a134618fe42e429a932989842b5442fbe21e1043ee48c32fe3dad185645cf454","source":{"kind":"arxiv","id":"1709.08083","version":2},"attestation_state":"computed","paper":{"title":"Finding Theme Communities from Database Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DB","authors_text":"Enhong Chen, Jian Pei, Lingyang Chu, Yanyan Zhang, Yu Yang, Zhefeng Wang","submitted_at":"2017-09-23T17:35:25Z","abstract_excerpt":"Given a database network where each vertex is associated with a transaction database, we are interested in finding theme communities. Here, a theme community is a cohesive subgraph such that a common pattern is frequent in all transaction databases associated with the vertices in the subgraph. Finding all theme communities from a database network enjoys many novel applications. However, it is challenging since even counting the number of all theme communities in a database network is #P-hard. Inspired by the observation that a theme community shrinks when the length of the pattern increases, 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":"1709.08083","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-09-23T17:35:25Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"1bfc14a3e6e5d2eeea5d1f1caa69c84e3f613877dd77c207ecd3ec95ca9dedce","abstract_canon_sha256":"d8d90d258cb181b44d8b107778d5f8a40121738ab34ebd9b6aedc38f4136b80c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:04:05.001097Z","signature_b64":"sbsMDS272fiddoWBTPqHUPSq8+hrbb9V1uaIh/u/CwEtEec1zy3H5WM8VgfMqtUGz44PN7TsIOH7i5yQulMAAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a134618fe42e429a932989842b5442fbe21e1043ee48c32fe3dad185645cf454","last_reissued_at":"2026-07-05T00:04:05.000592Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:04:05.000592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Theme Communities from Database Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DB","authors_text":"Enhong Chen, Jian Pei, Lingyang Chu, Yanyan Zhang, Yu Yang, Zhefeng Wang","submitted_at":"2017-09-23T17:35:25Z","abstract_excerpt":"Given a database network where each vertex is associated with a transaction database, we are interested in finding theme communities. Here, a theme community is a cohesive subgraph such that a common pattern is frequent in all transaction databases associated with the vertices in the subgraph. Finding all theme communities from a database network enjoys many novel applications. However, it is challenging since even counting the number of all theme communities in a database network is #P-hard. Inspired by the observation that a theme community shrinks when the length of the pattern increases, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08083","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1709.08083/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1709.08083","created_at":"2026-07-05T00:04:05.000648+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.08083v2","created_at":"2026-07-05T00:04:05.000648+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08083","created_at":"2026-07-05T00:04:05.000648+00:00"},{"alias_kind":"pith_short_12","alias_value":"UE2GDD7EFZBJ","created_at":"2026-07-05T00:04:05.000648+00:00"},{"alias_kind":"pith_short_16","alias_value":"UE2GDD7EFZBJVEZJ","created_at":"2026-07-05T00:04:05.000648+00:00"},{"alias_kind":"pith_short_8","alias_value":"UE2GDD7E","created_at":"2026-07-05T00:04:05.000648+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/UE2GDD7EFZBJVEZJRGCCWVCC7P","json":"https://pith.science/pith/UE2GDD7EFZBJVEZJRGCCWVCC7P.json","graph_json":"https://pith.science/api/pith-number/UE2GDD7EFZBJVEZJRGCCWVCC7P/graph.json","events_json":"https://pith.science/api/pith-number/UE2GDD7EFZBJVEZJRGCCWVCC7P/events.json","paper":"https://pith.science/paper/UE2GDD7E"},"agent_actions":{"view_html":"https://pith.science/pith/UE2GDD7EFZBJVEZJRGCCWVCC7P","download_json":"https://pith.science/pith/UE2GDD7EFZBJVEZJRGCCWVCC7P.json","view_paper":"https://pith.science/paper/UE2GDD7E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.08083&json=true","fetch_graph":"https://pith.science/api/pith-number/UE2GDD7EFZBJVEZJRGCCWVCC7P/graph.json","fetch_events":"https://pith.science/api/pith-number/UE2GDD7EFZBJVEZJRGCCWVCC7P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UE2GDD7EFZBJVEZJRGCCWVCC7P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UE2GDD7EFZBJVEZJRGCCWVCC7P/action/storage_attestation","attest_author":"https://pith.science/pith/UE2GDD7EFZBJVEZJRGCCWVCC7P/action/author_attestation","sign_citation":"https://pith.science/pith/UE2GDD7EFZBJVEZJRGCCWVCC7P/action/citation_signature","submit_replication":"https://pith.science/pith/UE2GDD7EFZBJVEZJRGCCWVCC7P/action/replication_record"}},"created_at":"2026-07-05T00:04:05.000648+00:00","updated_at":"2026-07-05T00:04:05.000648+00:00"}