{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:YE5VXZBZBTU3EPWKVE7MXWQSCQ","short_pith_number":"pith:YE5VXZBZ","schema_version":"1.0","canonical_sha256":"c13b5be4390ce9b23ecaa93ecbda12143299e66d9e48c058ecdb2e3ddcb7832a","source":{"kind":"arxiv","id":"2104.03583","version":2},"attestation_state":"computed","paper":{"title":"Query Driven-Graph Neural Networks for Community Search: From Non-Attributed, Attributed, to Interactive Attributed","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SI"],"primary_cat":"cs.DB","authors_text":"Hong Cheng, Junzhou Huang, Kangfei Zhao, Xin Huang, Yuli Jiang, Yu Rong","submitted_at":"2021-04-08T07:52:48Z","abstract_excerpt":"Given one or more query vertices, Community Search (CS) aims to find densely intra-connected and loosely inter-connected structures containing query vertices. Attributed Community Search (ACS), a related problem, is more challenging since it finds communities with both cohesive structures and homogeneous vertex attributes. However, most methods for the CS task rely on inflexible pre-defined structures and studies for ACS treat each attribute independently. Moreover, the most popular ACS strategies decompose ACS into two separate sub-problems, i.e., the CS task and subsequent attribute filterin"},"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":"2104.03583","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2021-04-08T07:52:48Z","cross_cats_sorted":["cs.LG","cs.SI"],"title_canon_sha256":"723fdca1ea1d62725433e311d8efb07b05b969f958e71d266024878cf9e3689d","abstract_canon_sha256":"3c655dffaaf284947960190fc5600f399e2261f2d2e605bced079d8c454364b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:07:38.553568Z","signature_b64":"Nq6CuV5z44kaVygdnHlSq9pHK9w/umCTHBWrkuwfSm6tFD/SzKQOkom2l7dAVWNw9RPd92LSka+WOdxSRv8sBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c13b5be4390ce9b23ecaa93ecbda12143299e66d9e48c058ecdb2e3ddcb7832a","last_reissued_at":"2026-07-05T04:07:38.553156Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:07:38.553156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Query Driven-Graph Neural Networks for Community Search: From Non-Attributed, Attributed, to Interactive Attributed","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SI"],"primary_cat":"cs.DB","authors_text":"Hong Cheng, Junzhou Huang, Kangfei Zhao, Xin Huang, Yuli Jiang, Yu Rong","submitted_at":"2021-04-08T07:52:48Z","abstract_excerpt":"Given one or more query vertices, Community Search (CS) aims to find densely intra-connected and loosely inter-connected structures containing query vertices. Attributed Community Search (ACS), a related problem, is more challenging since it finds communities with both cohesive structures and homogeneous vertex attributes. However, most methods for the CS task rely on inflexible pre-defined structures and studies for ACS treat each attribute independently. Moreover, the most popular ACS strategies decompose ACS into two separate sub-problems, i.e., the CS task and subsequent attribute filterin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.03583","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/2104.03583/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":"2104.03583","created_at":"2026-07-05T04:07:38.553210+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.03583v2","created_at":"2026-07-05T04:07:38.553210+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.03583","created_at":"2026-07-05T04:07:38.553210+00:00"},{"alias_kind":"pith_short_12","alias_value":"YE5VXZBZBTU3","created_at":"2026-07-05T04:07:38.553210+00:00"},{"alias_kind":"pith_short_16","alias_value":"YE5VXZBZBTU3EPWK","created_at":"2026-07-05T04:07:38.553210+00:00"},{"alias_kind":"pith_short_8","alias_value":"YE5VXZBZ","created_at":"2026-07-05T04:07:38.553210+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.02784","citing_title":"UTCS: Effective Unsupervised Temporal Community Search with Pre-training of Temporal Dynamics and Subgraph Knowledge","ref_index":2022,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YE5VXZBZBTU3EPWKVE7MXWQSCQ","json":"https://pith.science/pith/YE5VXZBZBTU3EPWKVE7MXWQSCQ.json","graph_json":"https://pith.science/api/pith-number/YE5VXZBZBTU3EPWKVE7MXWQSCQ/graph.json","events_json":"https://pith.science/api/pith-number/YE5VXZBZBTU3EPWKVE7MXWQSCQ/events.json","paper":"https://pith.science/paper/YE5VXZBZ"},"agent_actions":{"view_html":"https://pith.science/pith/YE5VXZBZBTU3EPWKVE7MXWQSCQ","download_json":"https://pith.science/pith/YE5VXZBZBTU3EPWKVE7MXWQSCQ.json","view_paper":"https://pith.science/paper/YE5VXZBZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.03583&json=true","fetch_graph":"https://pith.science/api/pith-number/YE5VXZBZBTU3EPWKVE7MXWQSCQ/graph.json","fetch_events":"https://pith.science/api/pith-number/YE5VXZBZBTU3EPWKVE7MXWQSCQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YE5VXZBZBTU3EPWKVE7MXWQSCQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YE5VXZBZBTU3EPWKVE7MXWQSCQ/action/storage_attestation","attest_author":"https://pith.science/pith/YE5VXZBZBTU3EPWKVE7MXWQSCQ/action/author_attestation","sign_citation":"https://pith.science/pith/YE5VXZBZBTU3EPWKVE7MXWQSCQ/action/citation_signature","submit_replication":"https://pith.science/pith/YE5VXZBZBTU3EPWKVE7MXWQSCQ/action/replication_record"}},"created_at":"2026-07-05T04:07:38.553210+00:00","updated_at":"2026-07-05T04:07:38.553210+00:00"}