{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FOD3XVKS33KGXNJI5JEO44ZCJP","short_pith_number":"pith:FOD3XVKS","schema_version":"1.0","canonical_sha256":"2b87bbd552ded46bb528ea48ee73224bda67530fc813b58a679c067f3c870779","source":{"kind":"arxiv","id":"1908.11788","version":1},"attestation_state":"computed","paper":{"title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.SI","authors_text":"Jianliang Xu, Longxu Sun, Rong-Hua Li, Xin Huang","submitted_at":"2019-08-30T15:28:54Z","abstract_excerpt":"Community search that finds query-dependent communities has been studied on various kinds of graphs. As one instance of community search, intimate-core group search over a weighted graph is to find a connected $k$-core containing all query nodes with the smallest group weight. However, existing state-of-the-art methods start from the maximal $k$-core to refine an answer, which is practically inefficient for large networks. In this paper, we develop an efficient framework, called local exploration k-core search (LEKS), to find intimate-core groups in graphs. We propose a small-weighted spanning"},"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":"1908.11788","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-08-30T15:28:54Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"341091fb6c3ab613ae99fc8aeb7fff09b38814a92eca96eec653dc4a036a30ba","abstract_canon_sha256":"51aaacc06e1fa37a2eced9de75ecea8a97b4f3c4c269e5ae963b96a35b26a137"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:00:45.698465Z","signature_b64":"hq+Y+nzixlptp/uwLxeY4x1Y4mLA+9lTyM667u0guu7R4JzF9ZeD0wFWytI9RNW7PxYWBfOlKFeJRAzH7HP2CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b87bbd552ded46bb528ea48ee73224bda67530fc813b58a679c067f3c870779","last_reissued_at":"2026-07-05T00:00:45.698106Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:00:45.698106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.SI","authors_text":"Jianliang Xu, Longxu Sun, Rong-Hua Li, Xin Huang","submitted_at":"2019-08-30T15:28:54Z","abstract_excerpt":"Community search that finds query-dependent communities has been studied on various kinds of graphs. As one instance of community search, intimate-core group search over a weighted graph is to find a connected $k$-core containing all query nodes with the smallest group weight. However, existing state-of-the-art methods start from the maximal $k$-core to refine an answer, which is practically inefficient for large networks. In this paper, we develop an efficient framework, called local exploration k-core search (LEKS), to find intimate-core groups in graphs. We propose a small-weighted spanning"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.11788","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.11788/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":"1908.11788","created_at":"2026-07-05T00:00:45.698167+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.11788v1","created_at":"2026-07-05T00:00:45.698167+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.11788","created_at":"2026-07-05T00:00:45.698167+00:00"},{"alias_kind":"pith_short_12","alias_value":"FOD3XVKS33KG","created_at":"2026-07-05T00:00:45.698167+00:00"},{"alias_kind":"pith_short_16","alias_value":"FOD3XVKS33KGXNJI","created_at":"2026-07-05T00:00:45.698167+00:00"},{"alias_kind":"pith_short_8","alias_value":"FOD3XVKS","created_at":"2026-07-05T00:00:45.698167+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/FOD3XVKS33KGXNJI5JEO44ZCJP","json":"https://pith.science/pith/FOD3XVKS33KGXNJI5JEO44ZCJP.json","graph_json":"https://pith.science/api/pith-number/FOD3XVKS33KGXNJI5JEO44ZCJP/graph.json","events_json":"https://pith.science/api/pith-number/FOD3XVKS33KGXNJI5JEO44ZCJP/events.json","paper":"https://pith.science/paper/FOD3XVKS"},"agent_actions":{"view_html":"https://pith.science/pith/FOD3XVKS33KGXNJI5JEO44ZCJP","download_json":"https://pith.science/pith/FOD3XVKS33KGXNJI5JEO44ZCJP.json","view_paper":"https://pith.science/paper/FOD3XVKS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.11788&json=true","fetch_graph":"https://pith.science/api/pith-number/FOD3XVKS33KGXNJI5JEO44ZCJP/graph.json","fetch_events":"https://pith.science/api/pith-number/FOD3XVKS33KGXNJI5JEO44ZCJP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FOD3XVKS33KGXNJI5JEO44ZCJP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FOD3XVKS33KGXNJI5JEO44ZCJP/action/storage_attestation","attest_author":"https://pith.science/pith/FOD3XVKS33KGXNJI5JEO44ZCJP/action/author_attestation","sign_citation":"https://pith.science/pith/FOD3XVKS33KGXNJI5JEO44ZCJP/action/citation_signature","submit_replication":"https://pith.science/pith/FOD3XVKS33KGXNJI5JEO44ZCJP/action/replication_record"}},"created_at":"2026-07-05T00:00:45.698167+00:00","updated_at":"2026-07-05T00:00:45.698167+00:00"}