{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FOD3XVKS33KGXNJI5JEO44ZCJP","short_pith_number":"pith:FOD3XVKS","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"},"canonical_sha256":"2b87bbd552ded46bb528ea48ee73224bda67530fc813b58a679c067f3c870779","source":{"kind":"arxiv","id":"1908.11788","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.11788","created_at":"2026-07-05T00:00:45Z"},{"alias_kind":"arxiv_version","alias_value":"1908.11788v1","created_at":"2026-07-05T00:00:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.11788","created_at":"2026-07-05T00:00:45Z"},{"alias_kind":"pith_short_12","alias_value":"FOD3XVKS33KG","created_at":"2026-07-05T00:00:45Z"},{"alias_kind":"pith_short_16","alias_value":"FOD3XVKS33KGXNJI","created_at":"2026-07-05T00:00:45Z"},{"alias_kind":"pith_short_8","alias_value":"FOD3XVKS","created_at":"2026-07-05T00:00:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FOD3XVKS33KGXNJI5JEO44ZCJP","target":"record","payload":{"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"},"canonical_sha256":"2b87bbd552ded46bb528ea48ee73224bda67530fc813b58a679c067f3c870779","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"},"source_kind":"arxiv","source_id":"1908.11788","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:00:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UGDztRDEQQ4USpwmzbBmLM+Iu2yyQXFOoZSGBXFMY51jYKOve0DvnrnFjQS6w0ZiPD3hZaG5ynXJ4qGXe7UABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T17:06:25.288802Z"},"content_sha256":"6c0c4b855542871032f8d0759548aa051bac9cf7a0ec63e63cbbd3165b97a842","schema_version":"1.0","event_id":"sha256:6c0c4b855542871032f8d0759548aa051bac9cf7a0ec63e63cbbd3165b97a842"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FOD3XVKS33KGXNJI5JEO44ZCJP","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:00:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CV6KJjvJLdaLwdacmIYTETkJIcpg9L9SZYtbjoPpD8wxj+NUYLFAW4XCC7bQdbR0mefhy35LPWFFyKX2RPdXBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T17:06:25.289326Z"},"content_sha256":"dce7cb2d71afd6ca487efeaec94c78af30dacd4c2df4c53ea6b5748de18ee9fb","schema_version":"1.0","event_id":"sha256:dce7cb2d71afd6ca487efeaec94c78af30dacd4c2df4c53ea6b5748de18ee9fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FOD3XVKS33KGXNJI5JEO44ZCJP/bundle.json","state_url":"https://pith.science/pith/FOD3XVKS33KGXNJI5JEO44ZCJP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FOD3XVKS33KGXNJI5JEO44ZCJP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-18T17:06:25Z","links":{"resolver":"https://pith.science/pith/FOD3XVKS33KGXNJI5JEO44ZCJP","bundle":"https://pith.science/pith/FOD3XVKS33KGXNJI5JEO44ZCJP/bundle.json","state":"https://pith.science/pith/FOD3XVKS33KGXNJI5JEO44ZCJP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FOD3XVKS33KGXNJI5JEO44ZCJP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FOD3XVKS33KGXNJI5JEO44ZCJP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"51aaacc06e1fa37a2eced9de75ecea8a97b4f3c4c269e5ae963b96a35b26a137","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-08-30T15:28:54Z","title_canon_sha256":"341091fb6c3ab613ae99fc8aeb7fff09b38814a92eca96eec653dc4a036a30ba"},"schema_version":"1.0","source":{"id":"1908.11788","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.11788","created_at":"2026-07-05T00:00:45Z"},{"alias_kind":"arxiv_version","alias_value":"1908.11788v1","created_at":"2026-07-05T00:00:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.11788","created_at":"2026-07-05T00:00:45Z"},{"alias_kind":"pith_short_12","alias_value":"FOD3XVKS33KG","created_at":"2026-07-05T00:00:45Z"},{"alias_kind":"pith_short_16","alias_value":"FOD3XVKS33KGXNJI","created_at":"2026-07-05T00:00:45Z"},{"alias_kind":"pith_short_8","alias_value":"FOD3XVKS","created_at":"2026-07-05T00:00:45Z"}],"graph_snapshots":[{"event_id":"sha256:dce7cb2d71afd6ca487efeaec94c78af30dacd4c2df4c53ea6b5748de18ee9fb","target":"graph","created_at":"2026-07-05T00:00:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.11788/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jianliang Xu, Longxu Sun, Rong-Hua Li, Xin Huang","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.11788","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6c0c4b855542871032f8d0759548aa051bac9cf7a0ec63e63cbbd3165b97a842","target":"record","created_at":"2026-07-05T00:00:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"51aaacc06e1fa37a2eced9de75ecea8a97b4f3c4c269e5ae963b96a35b26a137","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-08-30T15:28:54Z","title_canon_sha256":"341091fb6c3ab613ae99fc8aeb7fff09b38814a92eca96eec653dc4a036a30ba"},"schema_version":"1.0","source":{"id":"1908.11788","kind":"arxiv","version":1}},"canonical_sha256":"2b87bbd552ded46bb528ea48ee73224bda67530fc813b58a679c067f3c870779","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b87bbd552ded46bb528ea48ee73224bda67530fc813b58a679c067f3c870779","first_computed_at":"2026-07-05T00:00:45.698106Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:00:45.698106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hq+Y+nzixlptp/uwLxeY4x1Y4mLA+9lTyM667u0guu7R4JzF9ZeD0wFWytI9RNW7PxYWBfOlKFeJRAzH7HP2CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:00:45.698465Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.11788","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c0c4b855542871032f8d0759548aa051bac9cf7a0ec63e63cbbd3165b97a842","sha256:dce7cb2d71afd6ca487efeaec94c78af30dacd4c2df4c53ea6b5748de18ee9fb"],"state_sha256":"3e4a1c4f7dfe412504749223607262b9ea0b4979d253d119018b7bdf5fefd68b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BJDGJMdQ89a79aY8ZZ6lULIeEVfTDaEAF+g58JOPtOk93M22QzJhCHtREalhTv28ChhDsKEH748StHjaqVUaBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T17:06:25.295038Z","bundle_sha256":"30209597000e1f3813b25313ac387a5c61a4bebec688f3a9f4d527c24012b9e9"}}