{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5YAL7W42LNTT3GZ4BAASM4XMAM","short_pith_number":"pith:5YAL7W42","schema_version":"1.0","canonical_sha256":"ee00bfdb9a5b673d9b3c08012672ec03023788eac66b7bb5ee5cb8a863185802","source":{"kind":"arxiv","id":"2508.09549","version":2},"attestation_state":"computed","paper":{"title":"CS-Agent: LLM-based Community Search via Dual-agent Collaboration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Jiahao Hua, Long Yuan, Qiang Fan, Qingshuai Feng, Shan Huang","submitted_at":"2025-08-13T07:13:45Z","abstract_excerpt":"Large Language Models (LLMs) have demonstrated remarkable capabilities in natural language processing tasks, yet their application to graph structure analysis, particularly in community search, remains underexplored. Community search, a fundamental task in graph analysis, aims to identify groups of nodes with dense interconnections, which is crucial for understanding the macroscopic structure of graphs. In this paper, we propose GraphCS, a comprehensive benchmark designed to evaluate the performance of LLMs in community search tasks. Our experiments reveal that while LLMs exhibit preliminary p"},"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":"2508.09549","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2025-08-13T07:13:45Z","cross_cats_sorted":[],"title_canon_sha256":"19692e14faf93108f0d7889742d78208f7a19f22642f77cb2bccccb112c4efbf","abstract_canon_sha256":"84d582f2332b7f2a935ef635383f58e67665c2296489ce1747dc596a5c804344"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:53:51.164783Z","signature_b64":"O6pSeUL86elyLo6VFoPnqgweIsFkPw2+Qx6DO+ZoAx9wYcrUaS0Vvm0ygzEq8CHdTnLXosYukntGISyyNyr6Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee00bfdb9a5b673d9b3c08012672ec03023788eac66b7bb5ee5cb8a863185802","last_reissued_at":"2026-07-05T11:53:51.164291Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:53:51.164291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CS-Agent: LLM-based Community Search via Dual-agent Collaboration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Jiahao Hua, Long Yuan, Qiang Fan, Qingshuai Feng, Shan Huang","submitted_at":"2025-08-13T07:13:45Z","abstract_excerpt":"Large Language Models (LLMs) have demonstrated remarkable capabilities in natural language processing tasks, yet their application to graph structure analysis, particularly in community search, remains underexplored. Community search, a fundamental task in graph analysis, aims to identify groups of nodes with dense interconnections, which is crucial for understanding the macroscopic structure of graphs. In this paper, we propose GraphCS, a comprehensive benchmark designed to evaluate the performance of LLMs in community search tasks. Our experiments reveal that while LLMs exhibit preliminary p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.09549","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/2508.09549/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":"2508.09549","created_at":"2026-07-05T11:53:51.164365+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.09549v2","created_at":"2026-07-05T11:53:51.164365+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.09549","created_at":"2026-07-05T11:53:51.164365+00:00"},{"alias_kind":"pith_short_12","alias_value":"5YAL7W42LNTT","created_at":"2026-07-05T11:53:51.164365+00:00"},{"alias_kind":"pith_short_16","alias_value":"5YAL7W42LNTT3GZ4","created_at":"2026-07-05T11:53:51.164365+00:00"},{"alias_kind":"pith_short_8","alias_value":"5YAL7W42","created_at":"2026-07-05T11:53:51.164365+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/5YAL7W42LNTT3GZ4BAASM4XMAM","json":"https://pith.science/pith/5YAL7W42LNTT3GZ4BAASM4XMAM.json","graph_json":"https://pith.science/api/pith-number/5YAL7W42LNTT3GZ4BAASM4XMAM/graph.json","events_json":"https://pith.science/api/pith-number/5YAL7W42LNTT3GZ4BAASM4XMAM/events.json","paper":"https://pith.science/paper/5YAL7W42"},"agent_actions":{"view_html":"https://pith.science/pith/5YAL7W42LNTT3GZ4BAASM4XMAM","download_json":"https://pith.science/pith/5YAL7W42LNTT3GZ4BAASM4XMAM.json","view_paper":"https://pith.science/paper/5YAL7W42","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.09549&json=true","fetch_graph":"https://pith.science/api/pith-number/5YAL7W42LNTT3GZ4BAASM4XMAM/graph.json","fetch_events":"https://pith.science/api/pith-number/5YAL7W42LNTT3GZ4BAASM4XMAM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5YAL7W42LNTT3GZ4BAASM4XMAM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5YAL7W42LNTT3GZ4BAASM4XMAM/action/storage_attestation","attest_author":"https://pith.science/pith/5YAL7W42LNTT3GZ4BAASM4XMAM/action/author_attestation","sign_citation":"https://pith.science/pith/5YAL7W42LNTT3GZ4BAASM4XMAM/action/citation_signature","submit_replication":"https://pith.science/pith/5YAL7W42LNTT3GZ4BAASM4XMAM/action/replication_record"}},"created_at":"2026-07-05T11:53:51.164365+00:00","updated_at":"2026-07-05T11:53:51.164365+00:00"}