{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FVJ5SDVKHRLRAZHNG3O7BGZRMC","short_pith_number":"pith:FVJ5SDVK","schema_version":"1.0","canonical_sha256":"2d53d90eaa3c571064ed36ddf09b3160b04ef64b70278b1f24ef5530acc5ee37","source":{"kind":"arxiv","id":"1806.07944","version":1},"attestation_state":"computed","paper":{"title":"Searching for a Single Community in a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SI","authors_text":"Avik Ray, Sanjay Shakkottai, Sujay Sanghavi","submitted_at":"2018-05-24T04:55:14Z","abstract_excerpt":"In standard graph clustering/community detection, one is interested in partitioning the graph into more densely connected subsets of nodes. In contrast, the \"search\" problem of this paper aims to only find the nodes in a \"single\" such community, the target, out of the many communities that may exist. To do so , we are given suitable side information about the target; for example, a very small number of nodes from the target are labeled as such.\n  We consider a general yet simple notion of side information: all nodes are assumed to have random weights, with nodes in the target having higher wei"},"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":"1806.07944","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-05-24T04:55:14Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"65d5964e18b9f37aa9d49410a549b06a98aadb1284651dd78351dfdb7cd625ed","abstract_canon_sha256":"b2cfe221640daa00b8f0404613c3577d7b1409391902b4e31bee947d32bd0eaf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:42.557001Z","signature_b64":"jslhdnBRy+xjuV255n9+j1LiFfEgfIuI0ct+SheCk8Hdgcxr6DBmmvEjo4nlF1cLbzh6eo3A+o+4A3e9mYAKCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d53d90eaa3c571064ed36ddf09b3160b04ef64b70278b1f24ef5530acc5ee37","last_reissued_at":"2026-05-18T00:12:42.556460Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:42.556460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Searching for a Single Community in a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.SI","authors_text":"Avik Ray, Sanjay Shakkottai, Sujay Sanghavi","submitted_at":"2018-05-24T04:55:14Z","abstract_excerpt":"In standard graph clustering/community detection, one is interested in partitioning the graph into more densely connected subsets of nodes. In contrast, the \"search\" problem of this paper aims to only find the nodes in a \"single\" such community, the target, out of the many communities that may exist. To do so , we are given suitable side information about the target; for example, a very small number of nodes from the target are labeled as such.\n  We consider a general yet simple notion of side information: all nodes are assumed to have random weights, with nodes in the target having higher wei"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07944","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":""},"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":"1806.07944","created_at":"2026-05-18T00:12:42.556532+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.07944v1","created_at":"2026-05-18T00:12:42.556532+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07944","created_at":"2026-05-18T00:12:42.556532+00:00"},{"alias_kind":"pith_short_12","alias_value":"FVJ5SDVKHRLR","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"FVJ5SDVKHRLRAZHN","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"FVJ5SDVK","created_at":"2026-05-18T12:32:25.280505+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/FVJ5SDVKHRLRAZHNG3O7BGZRMC","json":"https://pith.science/pith/FVJ5SDVKHRLRAZHNG3O7BGZRMC.json","graph_json":"https://pith.science/api/pith-number/FVJ5SDVKHRLRAZHNG3O7BGZRMC/graph.json","events_json":"https://pith.science/api/pith-number/FVJ5SDVKHRLRAZHNG3O7BGZRMC/events.json","paper":"https://pith.science/paper/FVJ5SDVK"},"agent_actions":{"view_html":"https://pith.science/pith/FVJ5SDVKHRLRAZHNG3O7BGZRMC","download_json":"https://pith.science/pith/FVJ5SDVKHRLRAZHNG3O7BGZRMC.json","view_paper":"https://pith.science/paper/FVJ5SDVK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.07944&json=true","fetch_graph":"https://pith.science/api/pith-number/FVJ5SDVKHRLRAZHNG3O7BGZRMC/graph.json","fetch_events":"https://pith.science/api/pith-number/FVJ5SDVKHRLRAZHNG3O7BGZRMC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FVJ5SDVKHRLRAZHNG3O7BGZRMC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FVJ5SDVKHRLRAZHNG3O7BGZRMC/action/storage_attestation","attest_author":"https://pith.science/pith/FVJ5SDVKHRLRAZHNG3O7BGZRMC/action/author_attestation","sign_citation":"https://pith.science/pith/FVJ5SDVKHRLRAZHNG3O7BGZRMC/action/citation_signature","submit_replication":"https://pith.science/pith/FVJ5SDVKHRLRAZHNG3O7BGZRMC/action/replication_record"}},"created_at":"2026-05-18T00:12:42.556532+00:00","updated_at":"2026-05-18T00:12:42.556532+00:00"}