{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SWF5H5PQUS7DZ5CUSJKECGVLI4","short_pith_number":"pith:SWF5H5PQ","canonical_record":{"source":{"id":"1605.02372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-08T22:07:00Z","cross_cats_sorted":["cs.SI","math.PR"],"title_canon_sha256":"23d6e972e8690bb8994aeada99e5f21abcf9319d23ecb5e47c3b514664a50002","abstract_canon_sha256":"84f6c5b6680f7aafbc3b9c4bbb20e5b60c886bc3cdcffd482ce5462f3f34776c"},"schema_version":"1.0"},"canonical_sha256":"958bd3f5f0a4be3cf4549254411aab473fd0d47dded5ebfdb92434fa88054765","source":{"kind":"arxiv","id":"1605.02372","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02372","created_at":"2026-05-18T00:58:33Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02372v1","created_at":"2026-05-18T00:58:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02372","created_at":"2026-05-18T00:58:33Z"},{"alias_kind":"pith_short_12","alias_value":"SWF5H5PQUS7D","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SWF5H5PQUS7DZ5CU","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SWF5H5PQ","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SWF5H5PQUS7DZ5CUSJKECGVLI4","target":"record","payload":{"canonical_record":{"source":{"id":"1605.02372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-08T22:07:00Z","cross_cats_sorted":["cs.SI","math.PR"],"title_canon_sha256":"23d6e972e8690bb8994aeada99e5f21abcf9319d23ecb5e47c3b514664a50002","abstract_canon_sha256":"84f6c5b6680f7aafbc3b9c4bbb20e5b60c886bc3cdcffd482ce5462f3f34776c"},"schema_version":"1.0"},"canonical_sha256":"958bd3f5f0a4be3cf4549254411aab473fd0d47dded5ebfdb92434fa88054765","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:33.539617Z","signature_b64":"NfkjsgxTDB4xlxxZpGe/VtU6lU1Mp0nTnRqkAQhe+OJxBZu95m8pi6KhVz31IFW4aL6eqTUKbMm94gGkq3vnDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"958bd3f5f0a4be3cf4549254411aab473fd0d47dded5ebfdb92434fa88054765","last_reissued_at":"2026-05-18T00:58:33.538957Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:33.538957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.02372","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:58:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fVtJtNFfeAA/D3rk0m3reN4s5DR8Chl+G52TGLb6Es6kKrtStgLbMqfdm0t/ae4aDMaGM63yQC+mRRy58o8tAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:44:03.587597Z"},"content_sha256":"566e51f3ccd6f2b65b65e61758f0ae36c1f4bbb57fd391e4087e14534880045e","schema_version":"1.0","event_id":"sha256:566e51f3ccd6f2b65b65e61758f0ae36c1f4bbb57fd391e4087e14534880045e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SWF5H5PQUS7DZ5CUSJKECGVLI4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Active Learning for Community Detection in Stochastic Block Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.PR"],"primary_cat":"cs.LG","authors_text":"Akshay Gadde, Antonio Ortega, Eyal En Gad, Salman Avestimehr","submitted_at":"2016-05-08T22:07:00Z","abstract_excerpt":"The stochastic block model (SBM) is an important generative model for random graphs in network science and machine learning, useful for benchmarking community detection (or clustering) algorithms. The symmetric SBM generates a graph with $2n$ nodes which cluster into two equally sized communities. Nodes connect with probability $p$ within a community and $q$ across different communities. We consider the case of $p=a\\ln (n)/n$ and $q=b\\ln (n)/n$. In this case, it was recently shown that recovering the community membership (or label) of every node with high probability (w.h.p.) using only the gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02372","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:58:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TKnoJKseS6yLnrKCCH6uwbHJGfg6dbKdBqIDUGoY+sL88wBfsMGShvRz2UhKkpMq+rhdIrhze27ffzHgmqMAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:44:03.588202Z"},"content_sha256":"0f1f75a9a7553ac9fce77143720aaa314df1a7e14a03ce6a9b491691b49533f0","schema_version":"1.0","event_id":"sha256:0f1f75a9a7553ac9fce77143720aaa314df1a7e14a03ce6a9b491691b49533f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SWF5H5PQUS7DZ5CUSJKECGVLI4/bundle.json","state_url":"https://pith.science/pith/SWF5H5PQUS7DZ5CUSJKECGVLI4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SWF5H5PQUS7DZ5CUSJKECGVLI4/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-05-27T01:44:03Z","links":{"resolver":"https://pith.science/pith/SWF5H5PQUS7DZ5CUSJKECGVLI4","bundle":"https://pith.science/pith/SWF5H5PQUS7DZ5CUSJKECGVLI4/bundle.json","state":"https://pith.science/pith/SWF5H5PQUS7DZ5CUSJKECGVLI4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SWF5H5PQUS7DZ5CUSJKECGVLI4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SWF5H5PQUS7DZ5CUSJKECGVLI4","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":"84f6c5b6680f7aafbc3b9c4bbb20e5b60c886bc3cdcffd482ce5462f3f34776c","cross_cats_sorted":["cs.SI","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-08T22:07:00Z","title_canon_sha256":"23d6e972e8690bb8994aeada99e5f21abcf9319d23ecb5e47c3b514664a50002"},"schema_version":"1.0","source":{"id":"1605.02372","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02372","created_at":"2026-05-18T00:58:33Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02372v1","created_at":"2026-05-18T00:58:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02372","created_at":"2026-05-18T00:58:33Z"},{"alias_kind":"pith_short_12","alias_value":"SWF5H5PQUS7D","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SWF5H5PQUS7DZ5CU","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SWF5H5PQ","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:0f1f75a9a7553ac9fce77143720aaa314df1a7e14a03ce6a9b491691b49533f0","target":"graph","created_at":"2026-05-18T00:58:33Z","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":"The stochastic block model (SBM) is an important generative model for random graphs in network science and machine learning, useful for benchmarking community detection (or clustering) algorithms. The symmetric SBM generates a graph with $2n$ nodes which cluster into two equally sized communities. Nodes connect with probability $p$ within a community and $q$ across different communities. We consider the case of $p=a\\ln (n)/n$ and $q=b\\ln (n)/n$. In this case, it was recently shown that recovering the community membership (or label) of every node with high probability (w.h.p.) using only the gr","authors_text":"Akshay Gadde, Antonio Ortega, Eyal En Gad, Salman Avestimehr","cross_cats":["cs.SI","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-08T22:07:00Z","title":"Active Learning for Community Detection in Stochastic Block Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02372","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:566e51f3ccd6f2b65b65e61758f0ae36c1f4bbb57fd391e4087e14534880045e","target":"record","created_at":"2026-05-18T00:58:33Z","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":"84f6c5b6680f7aafbc3b9c4bbb20e5b60c886bc3cdcffd482ce5462f3f34776c","cross_cats_sorted":["cs.SI","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-08T22:07:00Z","title_canon_sha256":"23d6e972e8690bb8994aeada99e5f21abcf9319d23ecb5e47c3b514664a50002"},"schema_version":"1.0","source":{"id":"1605.02372","kind":"arxiv","version":1}},"canonical_sha256":"958bd3f5f0a4be3cf4549254411aab473fd0d47dded5ebfdb92434fa88054765","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"958bd3f5f0a4be3cf4549254411aab473fd0d47dded5ebfdb92434fa88054765","first_computed_at":"2026-05-18T00:58:33.538957Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:33.538957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NfkjsgxTDB4xlxxZpGe/VtU6lU1Mp0nTnRqkAQhe+OJxBZu95m8pi6KhVz31IFW4aL6eqTUKbMm94gGkq3vnDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:33.539617Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.02372","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:566e51f3ccd6f2b65b65e61758f0ae36c1f4bbb57fd391e4087e14534880045e","sha256:0f1f75a9a7553ac9fce77143720aaa314df1a7e14a03ce6a9b491691b49533f0"],"state_sha256":"b4763cca3e3f3393af6f9dbdfb028b7d9010cbd70b790631fcdce4d3e42bfb35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VsvISQ/LSH+8FRitFhdRm+r2dkyF8kD0JTCPRbIW44j3n8xBtdoo7kTpf00QRput/WENNOQ/f7Cu8twdkMELDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:44:03.591923Z","bundle_sha256":"cd055339f27907d952a78eb1fdb0c1c909293c29a6bb5f027d5c2e2a2472be05"}}