{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KJJ3MS2FMWCU3EWAF7QRT73NAL","short_pith_number":"pith:KJJ3MS2F","schema_version":"1.0","canonical_sha256":"5253b64b4565854d92c02fe119ff6d02d66bdb2c2432e36311bd988715f23e0a","source":{"kind":"arxiv","id":"2402.17242","version":3},"attestation_state":"computed","paper":{"title":"Scalable Community Search with Accuracy Guarantee on Attributed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.SI","authors_text":"Shuzhan Ye, Tianxing Wu, Xiangyu Ke, Xiaoliang Xu, Yuxia Geng, Yuxiang Wang, Zhenghe Zhao","submitted_at":"2024-02-27T06:24:15Z","abstract_excerpt":"Given an attributed graph $G$ and a query node $q$, \\underline{C}ommunity \\underline{S}earch over \\underline{A}ttributed \\underline{G}raphs (CS-AG) aims to find a structure- and attribute-cohesive subgraph from $G$ that contains $q$. Although CS-AG has been widely studied, they still face three challenges. (1) Exact methods based on graph traversal are time-consuming, especially for large graphs. Some tailored indices can improve efficiency, but introduce nonnegligible storage and maintenance overhead. (2) Approximate methods with a loose approximation ratio only provide a coarse-grained evalu"},"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":"2402.17242","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2024-02-27T06:24:15Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"9bb584175dedd69753a871020a96b691a1f3ab6c17226a567f36da11cdf48f3f","abstract_canon_sha256":"960494e2b0592a9c26ef4875b2d1cf634edffbf1ca0850cc65eca115adb4681d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:50:24.106854Z","signature_b64":"kxuy9hfembL1dRpXlS5oBpsXtp3oHue1ikZoCZa7txRY0LLHs2yGdgg+KHkD7e1Gos3j/E1/XXE+3QdUcfsgAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5253b64b4565854d92c02fe119ff6d02d66bdb2c2432e36311bd988715f23e0a","last_reissued_at":"2026-07-05T07:50:24.106341Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:50:24.106341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Community Search with Accuracy Guarantee on Attributed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.SI","authors_text":"Shuzhan Ye, Tianxing Wu, Xiangyu Ke, Xiaoliang Xu, Yuxia Geng, Yuxiang Wang, Zhenghe Zhao","submitted_at":"2024-02-27T06:24:15Z","abstract_excerpt":"Given an attributed graph $G$ and a query node $q$, \\underline{C}ommunity \\underline{S}earch over \\underline{A}ttributed \\underline{G}raphs (CS-AG) aims to find a structure- and attribute-cohesive subgraph from $G$ that contains $q$. Although CS-AG has been widely studied, they still face three challenges. (1) Exact methods based on graph traversal are time-consuming, especially for large graphs. Some tailored indices can improve efficiency, but introduce nonnegligible storage and maintenance overhead. (2) Approximate methods with a loose approximation ratio only provide a coarse-grained evalu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.17242","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/2402.17242/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":"2402.17242","created_at":"2026-07-05T07:50:24.106409+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.17242v3","created_at":"2026-07-05T07:50:24.106409+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.17242","created_at":"2026-07-05T07:50:24.106409+00:00"},{"alias_kind":"pith_short_12","alias_value":"KJJ3MS2FMWCU","created_at":"2026-07-05T07:50:24.106409+00:00"},{"alias_kind":"pith_short_16","alias_value":"KJJ3MS2FMWCU3EWA","created_at":"2026-07-05T07:50:24.106409+00:00"},{"alias_kind":"pith_short_8","alias_value":"KJJ3MS2F","created_at":"2026-07-05T07:50:24.106409+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/KJJ3MS2FMWCU3EWAF7QRT73NAL","json":"https://pith.science/pith/KJJ3MS2FMWCU3EWAF7QRT73NAL.json","graph_json":"https://pith.science/api/pith-number/KJJ3MS2FMWCU3EWAF7QRT73NAL/graph.json","events_json":"https://pith.science/api/pith-number/KJJ3MS2FMWCU3EWAF7QRT73NAL/events.json","paper":"https://pith.science/paper/KJJ3MS2F"},"agent_actions":{"view_html":"https://pith.science/pith/KJJ3MS2FMWCU3EWAF7QRT73NAL","download_json":"https://pith.science/pith/KJJ3MS2FMWCU3EWAF7QRT73NAL.json","view_paper":"https://pith.science/paper/KJJ3MS2F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.17242&json=true","fetch_graph":"https://pith.science/api/pith-number/KJJ3MS2FMWCU3EWAF7QRT73NAL/graph.json","fetch_events":"https://pith.science/api/pith-number/KJJ3MS2FMWCU3EWAF7QRT73NAL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KJJ3MS2FMWCU3EWAF7QRT73NAL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KJJ3MS2FMWCU3EWAF7QRT73NAL/action/storage_attestation","attest_author":"https://pith.science/pith/KJJ3MS2FMWCU3EWAF7QRT73NAL/action/author_attestation","sign_citation":"https://pith.science/pith/KJJ3MS2FMWCU3EWAF7QRT73NAL/action/citation_signature","submit_replication":"https://pith.science/pith/KJJ3MS2FMWCU3EWAF7QRT73NAL/action/replication_record"}},"created_at":"2026-07-05T07:50:24.106409+00:00","updated_at":"2026-07-05T07:50:24.106409+00:00"}