{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BZ5ALFOQNRVIPCFDHIWRMKNGBC","short_pith_number":"pith:BZ5ALFOQ","canonical_record":{"source":{"id":"1611.04847","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-10T10:13:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e4222fcaf56ea15c352fd1b2184d0a8630697d077e709fea0da8355f2ebeb38b","abstract_canon_sha256":"485f65620918def72a7ea48748b13e301fa944fd573c65f94b4cdf84d58d05b2"},"schema_version":"1.0"},"canonical_sha256":"0e7a0595d06c6a8788a33a2d1629a608a4296ee638e7c0a789c068d9d3d20c4a","source":{"kind":"arxiv","id":"1611.04847","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.04847","created_at":"2026-05-18T00:49:31Z"},{"alias_kind":"arxiv_version","alias_value":"1611.04847v3","created_at":"2026-05-18T00:49:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04847","created_at":"2026-05-18T00:49:31Z"},{"alias_kind":"pith_short_12","alias_value":"BZ5ALFOQNRVI","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BZ5ALFOQNRVIPCFD","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BZ5ALFOQ","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BZ5ALFOQNRVIPCFDHIWRMKNGBC","target":"record","payload":{"canonical_record":{"source":{"id":"1611.04847","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-10T10:13:10Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e4222fcaf56ea15c352fd1b2184d0a8630697d077e709fea0da8355f2ebeb38b","abstract_canon_sha256":"485f65620918def72a7ea48748b13e301fa944fd573c65f94b4cdf84d58d05b2"},"schema_version":"1.0"},"canonical_sha256":"0e7a0595d06c6a8788a33a2d1629a608a4296ee638e7c0a789c068d9d3d20c4a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:31.744833Z","signature_b64":"s84i0cTiXpzhI+XSXi3qCgbuq9JSZU6ROErJyEqjo9hM+mS3zQlQFbTcw5g0Bp5eSaU/6Enu/hXTlZXTe8VsDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e7a0595d06c6a8788a33a2d1629a608a4296ee638e7c0a789c068d9d3d20c4a","last_reissued_at":"2026-05-18T00:49:31.744195Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:31.744195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.04847","source_version":3,"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:49:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tePc4PHNlbgZ/t4uML3bMgyd4xw5+K3ZNRIt7ec6RgWDQosaEbq6PbnzsUBapHRxRUOylfaGubK0t/0t64kqAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T11:45:45.750687Z"},"content_sha256":"9c01d8ad9ecc2769628e52c91344b772b83d7aa598ffbc142c9e658138ee72ad","schema_version":"1.0","event_id":"sha256:9c01d8ad9ecc2769628e52c91344b772b83d7aa598ffbc142c9e658138ee72ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BZ5ALFOQNRVIPCFDHIWRMKNGBC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Power of Side-information in Subgraph Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Arun Kadavankandy (MAESTRO), Konstantin Avrachenkov (MAESTRO), Laura Cottatellucci, Rajesh Sundaresan (ECE)","submitted_at":"2016-11-10T10:13:10Z","abstract_excerpt":"In this work, we tackle the problem of hidden community detection. We consider Belief Propagation (BP) applied to the problem of detecting a hidden Erd\\H{o}s-R\\'enyi (ER) graph embedded in a larger and sparser ER graph, in the presence of side-information. We derive two related algorithms based on BP to perform subgraph detection in the presence of two kinds of side-information. The first variant of side-information consists of a set of nodes, called cues, known to be from the subgraph. The second variant of side-information consists of a set of nodes that are cues with a given probability. It"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04847","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":""},"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:49:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7GzXP4uVYHeHSISHDlHWqkUMGbTKW0AuOm2fw+U4gcEWd94KUvIWgL1HIMoJoQakdpVj84fw+eDC1rFSSNevBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T11:45:45.751029Z"},"content_sha256":"30e1b7bb6cafbba5c33e9eba2eed085ef760bf63c7a614e7d4c9a2cdc9ca782c","schema_version":"1.0","event_id":"sha256:30e1b7bb6cafbba5c33e9eba2eed085ef760bf63c7a614e7d4c9a2cdc9ca782c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BZ5ALFOQNRVIPCFDHIWRMKNGBC/bundle.json","state_url":"https://pith.science/pith/BZ5ALFOQNRVIPCFDHIWRMKNGBC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BZ5ALFOQNRVIPCFDHIWRMKNGBC/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-29T11:45:45Z","links":{"resolver":"https://pith.science/pith/BZ5ALFOQNRVIPCFDHIWRMKNGBC","bundle":"https://pith.science/pith/BZ5ALFOQNRVIPCFDHIWRMKNGBC/bundle.json","state":"https://pith.science/pith/BZ5ALFOQNRVIPCFDHIWRMKNGBC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BZ5ALFOQNRVIPCFDHIWRMKNGBC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BZ5ALFOQNRVIPCFDHIWRMKNGBC","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":"485f65620918def72a7ea48748b13e301fa944fd573c65f94b4cdf84d58d05b2","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-10T10:13:10Z","title_canon_sha256":"e4222fcaf56ea15c352fd1b2184d0a8630697d077e709fea0da8355f2ebeb38b"},"schema_version":"1.0","source":{"id":"1611.04847","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.04847","created_at":"2026-05-18T00:49:31Z"},{"alias_kind":"arxiv_version","alias_value":"1611.04847v3","created_at":"2026-05-18T00:49:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.04847","created_at":"2026-05-18T00:49:31Z"},{"alias_kind":"pith_short_12","alias_value":"BZ5ALFOQNRVI","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BZ5ALFOQNRVIPCFD","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BZ5ALFOQ","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:30e1b7bb6cafbba5c33e9eba2eed085ef760bf63c7a614e7d4c9a2cdc9ca782c","target":"graph","created_at":"2026-05-18T00:49:31Z","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 this work, we tackle the problem of hidden community detection. We consider Belief Propagation (BP) applied to the problem of detecting a hidden Erd\\H{o}s-R\\'enyi (ER) graph embedded in a larger and sparser ER graph, in the presence of side-information. We derive two related algorithms based on BP to perform subgraph detection in the presence of two kinds of side-information. The first variant of side-information consists of a set of nodes, called cues, known to be from the subgraph. The second variant of side-information consists of a set of nodes that are cues with a given probability. It","authors_text":"Arun Kadavankandy (MAESTRO), Konstantin Avrachenkov (MAESTRO), Laura Cottatellucci, Rajesh Sundaresan (ECE)","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-10T10:13:10Z","title":"The Power of Side-information in Subgraph Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.04847","kind":"arxiv","version":3},"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:9c01d8ad9ecc2769628e52c91344b772b83d7aa598ffbc142c9e658138ee72ad","target":"record","created_at":"2026-05-18T00:49:31Z","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":"485f65620918def72a7ea48748b13e301fa944fd573c65f94b4cdf84d58d05b2","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-11-10T10:13:10Z","title_canon_sha256":"e4222fcaf56ea15c352fd1b2184d0a8630697d077e709fea0da8355f2ebeb38b"},"schema_version":"1.0","source":{"id":"1611.04847","kind":"arxiv","version":3}},"canonical_sha256":"0e7a0595d06c6a8788a33a2d1629a608a4296ee638e7c0a789c068d9d3d20c4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e7a0595d06c6a8788a33a2d1629a608a4296ee638e7c0a789c068d9d3d20c4a","first_computed_at":"2026-05-18T00:49:31.744195Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:31.744195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s84i0cTiXpzhI+XSXi3qCgbuq9JSZU6ROErJyEqjo9hM+mS3zQlQFbTcw5g0Bp5eSaU/6Enu/hXTlZXTe8VsDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:31.744833Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.04847","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c01d8ad9ecc2769628e52c91344b772b83d7aa598ffbc142c9e658138ee72ad","sha256:30e1b7bb6cafbba5c33e9eba2eed085ef760bf63c7a614e7d4c9a2cdc9ca782c"],"state_sha256":"6c18af4dbbd7b02212600809e2a8cea09b96b87875e4db368149ee2b8def7e60"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ImKO0y6lRaAUbz3HdmgBdMZlVGiYMIE7jgWrF3bLE/Myhp0UjNM1MI5E09IKzL5JnNJKvMBvZ6cX0pbernuDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T11:45:45.752926Z","bundle_sha256":"c11fd13357885e0a871123ae1baf9f1a183f78bce3d22ef0ff7e21e70b1f1139"}}