{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:RL3DDTJ7LZ62VOFLTFVM57TSP2","short_pith_number":"pith:RL3DDTJ7","schema_version":"1.0","canonical_sha256":"8af631cd3f5e7daab8ab996acefe727ea97772d4c3377b12707030d8a809edf6","source":{"kind":"arxiv","id":"2201.00288","version":3},"attestation_state":"computed","paper":{"title":"Community Search: A Meta-Learning Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Guanghua Li, Jeffery Xu Yu, Kangfei Zhao, Shuheng Fang","submitted_at":"2022-01-02T04:29:02Z","abstract_excerpt":"Community Search (CS) is one of the fundamental graph analysis tasks, which is a building block of various real applications. Given any query nodes, CS aims to find cohesive subgraphs that query nodes belong to. Recently, a large number of CS algorithms are designed. These algorithms adopt predefined subgraph patterns to model the communities, which cannot find ground-truth communities that do not have such pre-defined patterns in real-world graphs. Thereby, machine learning (ML) and deep learning (DL) based approaches are proposed to capture flexible community structures by learning from grou"},"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":"2201.00288","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2022-01-02T04:29:02Z","cross_cats_sorted":[],"title_canon_sha256":"9216b1fdbd3401332910f3bd510964c4a493cfa76e82047fb61b2f2c2e0cddd5","abstract_canon_sha256":"67184d54d044c456fced2e37ac7c3bd9ea88acef5846edd800d49915b089f721"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:58:04.265797Z","signature_b64":"QEKS/4KjuZcg91TSJh2AOd1ja/WzNbb9gINpdQow0XDtDdR4x+mr1a4cRBh1aQrZxA5876EIGTn5+S0n6/L0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8af631cd3f5e7daab8ab996acefe727ea97772d4c3377b12707030d8a809edf6","last_reissued_at":"2026-07-05T06:58:04.265249Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:58:04.265249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Community Search: A Meta-Learning Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Guanghua Li, Jeffery Xu Yu, Kangfei Zhao, Shuheng Fang","submitted_at":"2022-01-02T04:29:02Z","abstract_excerpt":"Community Search (CS) is one of the fundamental graph analysis tasks, which is a building block of various real applications. Given any query nodes, CS aims to find cohesive subgraphs that query nodes belong to. Recently, a large number of CS algorithms are designed. These algorithms adopt predefined subgraph patterns to model the communities, which cannot find ground-truth communities that do not have such pre-defined patterns in real-world graphs. Thereby, machine learning (ML) and deep learning (DL) based approaches are proposed to capture flexible community structures by learning from grou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.00288","kind":"arxiv","version":3},"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/2201.00288/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":"2201.00288","created_at":"2026-07-05T06:58:04.265308+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.00288v3","created_at":"2026-07-05T06:58:04.265308+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.00288","created_at":"2026-07-05T06:58:04.265308+00:00"},{"alias_kind":"pith_short_12","alias_value":"RL3DDTJ7LZ62","created_at":"2026-07-05T06:58:04.265308+00:00"},{"alias_kind":"pith_short_16","alias_value":"RL3DDTJ7LZ62VOFL","created_at":"2026-07-05T06:58:04.265308+00:00"},{"alias_kind":"pith_short_8","alias_value":"RL3DDTJ7","created_at":"2026-07-05T06:58:04.265308+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/RL3DDTJ7LZ62VOFLTFVM57TSP2","json":"https://pith.science/pith/RL3DDTJ7LZ62VOFLTFVM57TSP2.json","graph_json":"https://pith.science/api/pith-number/RL3DDTJ7LZ62VOFLTFVM57TSP2/graph.json","events_json":"https://pith.science/api/pith-number/RL3DDTJ7LZ62VOFLTFVM57TSP2/events.json","paper":"https://pith.science/paper/RL3DDTJ7"},"agent_actions":{"view_html":"https://pith.science/pith/RL3DDTJ7LZ62VOFLTFVM57TSP2","download_json":"https://pith.science/pith/RL3DDTJ7LZ62VOFLTFVM57TSP2.json","view_paper":"https://pith.science/paper/RL3DDTJ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.00288&json=true","fetch_graph":"https://pith.science/api/pith-number/RL3DDTJ7LZ62VOFLTFVM57TSP2/graph.json","fetch_events":"https://pith.science/api/pith-number/RL3DDTJ7LZ62VOFLTFVM57TSP2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RL3DDTJ7LZ62VOFLTFVM57TSP2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RL3DDTJ7LZ62VOFLTFVM57TSP2/action/storage_attestation","attest_author":"https://pith.science/pith/RL3DDTJ7LZ62VOFLTFVM57TSP2/action/author_attestation","sign_citation":"https://pith.science/pith/RL3DDTJ7LZ62VOFLTFVM57TSP2/action/citation_signature","submit_replication":"https://pith.science/pith/RL3DDTJ7LZ62VOFLTFVM57TSP2/action/replication_record"}},"created_at":"2026-07-05T06:58:04.265308+00:00","updated_at":"2026-07-05T06:58:04.265308+00:00"}