{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FVJ5SDVKHRLRAZHNG3O7BGZRMC","short_pith_number":"pith:FVJ5SDVK","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"},"canonical_sha256":"2d53d90eaa3c571064ed36ddf09b3160b04ef64b70278b1f24ef5530acc5ee37","source":{"kind":"arxiv","id":"1806.07944","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.07944","created_at":"2026-05-18T00:12:42Z"},{"alias_kind":"arxiv_version","alias_value":"1806.07944v1","created_at":"2026-05-18T00:12:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07944","created_at":"2026-05-18T00:12:42Z"},{"alias_kind":"pith_short_12","alias_value":"FVJ5SDVKHRLR","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FVJ5SDVKHRLRAZHN","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FVJ5SDVK","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FVJ5SDVKHRLRAZHNG3O7BGZRMC","target":"record","payload":{"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"},"canonical_sha256":"2d53d90eaa3c571064ed36ddf09b3160b04ef64b70278b1f24ef5530acc5ee37","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"},"source_kind":"arxiv","source_id":"1806.07944","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-05-18T00:12:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HABMlSP/9nMPY3pzVM/2H6wn/BkyrDI1OLvkhzq3OI4J60fzaGppTjJUbXlI2ZzrR3lLSrz8JWktz/0mSfMPBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:18:08.477886Z"},"content_sha256":"b1ea2cac3df930b10a6d93576c1bc81a43bd68e34a336fc48324c8371684dfed","schema_version":"1.0","event_id":"sha256:b1ea2cac3df930b10a6d93576c1bc81a43bd68e34a336fc48324c8371684dfed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FVJ5SDVKHRLRAZHNG3O7BGZRMC","target":"graph","payload":{"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"},"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-05-18T00:12:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mT26i8WYwPnYk0luebzU7gS5tJPq1C2RyxvphhoLUqkYS2x96kPbMeV2RgG9chz8wP6EJ+CmKuzjDjRUsdieAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:18:08.478228Z"},"content_sha256":"f1621a1bc80a449345b70238dbe9e83f86f494de2cc197d8dc4942e196526f7a","schema_version":"1.0","event_id":"sha256:f1621a1bc80a449345b70238dbe9e83f86f494de2cc197d8dc4942e196526f7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FVJ5SDVKHRLRAZHNG3O7BGZRMC/bundle.json","state_url":"https://pith.science/pith/FVJ5SDVKHRLRAZHNG3O7BGZRMC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FVJ5SDVKHRLRAZHNG3O7BGZRMC/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-06-10T19:18:08Z","links":{"resolver":"https://pith.science/pith/FVJ5SDVKHRLRAZHNG3O7BGZRMC","bundle":"https://pith.science/pith/FVJ5SDVKHRLRAZHNG3O7BGZRMC/bundle.json","state":"https://pith.science/pith/FVJ5SDVKHRLRAZHNG3O7BGZRMC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FVJ5SDVKHRLRAZHNG3O7BGZRMC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FVJ5SDVKHRLRAZHNG3O7BGZRMC","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":"b2cfe221640daa00b8f0404613c3577d7b1409391902b4e31bee947d32bd0eaf","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-05-24T04:55:14Z","title_canon_sha256":"65d5964e18b9f37aa9d49410a549b06a98aadb1284651dd78351dfdb7cd625ed"},"schema_version":"1.0","source":{"id":"1806.07944","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.07944","created_at":"2026-05-18T00:12:42Z"},{"alias_kind":"arxiv_version","alias_value":"1806.07944v1","created_at":"2026-05-18T00:12:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07944","created_at":"2026-05-18T00:12:42Z"},{"alias_kind":"pith_short_12","alias_value":"FVJ5SDVKHRLR","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FVJ5SDVKHRLRAZHN","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FVJ5SDVK","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:f1621a1bc80a449345b70238dbe9e83f86f494de2cc197d8dc4942e196526f7a","target":"graph","created_at":"2026-05-18T00:12:42Z","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"},"paper":{"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","authors_text":"Avik Ray, Sanjay Shakkottai, Sujay Sanghavi","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-05-24T04:55:14Z","title":"Searching for a Single Community in a Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07944","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:b1ea2cac3df930b10a6d93576c1bc81a43bd68e34a336fc48324c8371684dfed","target":"record","created_at":"2026-05-18T00:12:42Z","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":"b2cfe221640daa00b8f0404613c3577d7b1409391902b4e31bee947d32bd0eaf","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-05-24T04:55:14Z","title_canon_sha256":"65d5964e18b9f37aa9d49410a549b06a98aadb1284651dd78351dfdb7cd625ed"},"schema_version":"1.0","source":{"id":"1806.07944","kind":"arxiv","version":1}},"canonical_sha256":"2d53d90eaa3c571064ed36ddf09b3160b04ef64b70278b1f24ef5530acc5ee37","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d53d90eaa3c571064ed36ddf09b3160b04ef64b70278b1f24ef5530acc5ee37","first_computed_at":"2026-05-18T00:12:42.556460Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:42.556460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jslhdnBRy+xjuV255n9+j1LiFfEgfIuI0ct+SheCk8Hdgcxr6DBmmvEjo4nlF1cLbzh6eo3A+o+4A3e9mYAKCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:42.557001Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.07944","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b1ea2cac3df930b10a6d93576c1bc81a43bd68e34a336fc48324c8371684dfed","sha256:f1621a1bc80a449345b70238dbe9e83f86f494de2cc197d8dc4942e196526f7a"],"state_sha256":"1fe27e344d9815d8138366367fb30db4e54d295c60965d7f00c0c66607aa05e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8VjYhvwyrl8sx2TD+YQ0LoBVSUCItkUUgITKWKlRa1sDgT4z5DnKgCU4OFeAutycCU9DObUA4NOFx5JVCq05BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T19:18:08.480277Z","bundle_sha256":"dc28ce29737ff76c50a9ab95a477003289415d3f966847daf799a51251fc3813"}}