{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:N3HWRICOB4ZZYDE42GZA65ODVW","short_pith_number":"pith:N3HWRICO","canonical_record":{"source":{"id":"1508.02344","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-08-10T18:23:27Z","cross_cats_sorted":["cs.CC","cs.DC","math.PR"],"title_canon_sha256":"10dba13fc06e8a6388a278553331ca562d54ec1aa7ee0ee1e3a8bc8430ac0e94","abstract_canon_sha256":"5e544829764ccfae5599e64e32acc6ff2d2eb88049426eb76f3c5508c0a2a77e"},"schema_version":"1.0"},"canonical_sha256":"6ecf68a04e0f339c0c9cd1b20f75c3ada553fa049e68aa474fcc04431b5919d1","source":{"kind":"arxiv","id":"1508.02344","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02344","created_at":"2026-05-18T01:35:33Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02344v1","created_at":"2026-05-18T01:35:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02344","created_at":"2026-05-18T01:35:33Z"},{"alias_kind":"pith_short_12","alias_value":"N3HWRICOB4ZZ","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"N3HWRICOB4ZZYDE4","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"N3HWRICO","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:N3HWRICOB4ZZYDE42GZA65ODVW","target":"record","payload":{"canonical_record":{"source":{"id":"1508.02344","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-08-10T18:23:27Z","cross_cats_sorted":["cs.CC","cs.DC","math.PR"],"title_canon_sha256":"10dba13fc06e8a6388a278553331ca562d54ec1aa7ee0ee1e3a8bc8430ac0e94","abstract_canon_sha256":"5e544829764ccfae5599e64e32acc6ff2d2eb88049426eb76f3c5508c0a2a77e"},"schema_version":"1.0"},"canonical_sha256":"6ecf68a04e0f339c0c9cd1b20f75c3ada553fa049e68aa474fcc04431b5919d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:33.485308Z","signature_b64":"QhY6fmDnVhwq6b3Wclb6F0DsPC8s/t6hfFRvyS9aaWNvcDeH0WeboxyWLAhRDuYxktLe4R7xWjotUY7zwU4/Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ecf68a04e0f339c0c9cd1b20f75c3ada553fa049e68aa474fcc04431b5919d1","last_reissued_at":"2026-05-18T01:35:33.484276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:33.484276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.02344","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-18T01:35:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IDOdcy61ZpIX6ZJ3Xx4Ffj4nnzfiCwgevYWW8Qr7xW9eyObWnxh4CerSsCDfqJ5CVGhQpg+43ExtW5bYmSfeBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:13:42.380695Z"},"content_sha256":"433c2facd4bae4b1fbfeb56607af8b7b88c94c9143066de81749060435f0be46","schema_version":"1.0","event_id":"sha256:433c2facd4bae4b1fbfeb56607af8b7b88c94c9143066de81749060435f0be46"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:N3HWRICOB4ZZYDE42GZA65ODVW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local Algorithms for Block Models with Side Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DC","math.PR"],"primary_cat":"stat.ML","authors_text":"Elchanan Mossel, Jiaming Xu","submitted_at":"2015-08-10T18:23:27Z","abstract_excerpt":"There has been a recent interest in understanding the power of local algorithms for optimization and inference problems on sparse graphs. Gamarnik and Sudan (2014) showed that local algorithms are weaker than global algorithms for finding large independent sets in sparse random regular graphs. Montanari (2015) showed that local algorithms are suboptimal for finding a community with high connectivity in the sparse Erd\\H{o}s-R\\'enyi random graphs. For the symmetric planted partition problem (also named community detection for the block models) on sparse graphs, a simple observation is that local"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02344","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-18T01:35:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cAUGP34cxUAF/QI0itSeD8Uv/u4+7hVqbWCFwTsGzUS8zYPNgUl8FqhjQv3zcFWERUbOjQJX7m+CAqnrGv3yBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:13:42.381305Z"},"content_sha256":"c2c6c4c1d7c930b002d14511f049e859d89ab48dcccead64867b36b9c350f51c","schema_version":"1.0","event_id":"sha256:c2c6c4c1d7c930b002d14511f049e859d89ab48dcccead64867b36b9c350f51c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N3HWRICOB4ZZYDE42GZA65ODVW/bundle.json","state_url":"https://pith.science/pith/N3HWRICOB4ZZYDE42GZA65ODVW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N3HWRICOB4ZZYDE42GZA65ODVW/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-31T04:13:42Z","links":{"resolver":"https://pith.science/pith/N3HWRICOB4ZZYDE42GZA65ODVW","bundle":"https://pith.science/pith/N3HWRICOB4ZZYDE42GZA65ODVW/bundle.json","state":"https://pith.science/pith/N3HWRICOB4ZZYDE42GZA65ODVW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N3HWRICOB4ZZYDE42GZA65ODVW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:N3HWRICOB4ZZYDE42GZA65ODVW","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":"5e544829764ccfae5599e64e32acc6ff2d2eb88049426eb76f3c5508c0a2a77e","cross_cats_sorted":["cs.CC","cs.DC","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-08-10T18:23:27Z","title_canon_sha256":"10dba13fc06e8a6388a278553331ca562d54ec1aa7ee0ee1e3a8bc8430ac0e94"},"schema_version":"1.0","source":{"id":"1508.02344","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02344","created_at":"2026-05-18T01:35:33Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02344v1","created_at":"2026-05-18T01:35:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02344","created_at":"2026-05-18T01:35:33Z"},{"alias_kind":"pith_short_12","alias_value":"N3HWRICOB4ZZ","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"N3HWRICOB4ZZYDE4","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"N3HWRICO","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:c2c6c4c1d7c930b002d14511f049e859d89ab48dcccead64867b36b9c350f51c","target":"graph","created_at":"2026-05-18T01:35: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":"There has been a recent interest in understanding the power of local algorithms for optimization and inference problems on sparse graphs. Gamarnik and Sudan (2014) showed that local algorithms are weaker than global algorithms for finding large independent sets in sparse random regular graphs. Montanari (2015) showed that local algorithms are suboptimal for finding a community with high connectivity in the sparse Erd\\H{o}s-R\\'enyi random graphs. For the symmetric planted partition problem (also named community detection for the block models) on sparse graphs, a simple observation is that local","authors_text":"Elchanan Mossel, Jiaming Xu","cross_cats":["cs.CC","cs.DC","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-08-10T18:23:27Z","title":"Local Algorithms for Block Models with Side Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02344","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:433c2facd4bae4b1fbfeb56607af8b7b88c94c9143066de81749060435f0be46","target":"record","created_at":"2026-05-18T01:35: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":"5e544829764ccfae5599e64e32acc6ff2d2eb88049426eb76f3c5508c0a2a77e","cross_cats_sorted":["cs.CC","cs.DC","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-08-10T18:23:27Z","title_canon_sha256":"10dba13fc06e8a6388a278553331ca562d54ec1aa7ee0ee1e3a8bc8430ac0e94"},"schema_version":"1.0","source":{"id":"1508.02344","kind":"arxiv","version":1}},"canonical_sha256":"6ecf68a04e0f339c0c9cd1b20f75c3ada553fa049e68aa474fcc04431b5919d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ecf68a04e0f339c0c9cd1b20f75c3ada553fa049e68aa474fcc04431b5919d1","first_computed_at":"2026-05-18T01:35:33.484276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:33.484276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QhY6fmDnVhwq6b3Wclb6F0DsPC8s/t6hfFRvyS9aaWNvcDeH0WeboxyWLAhRDuYxktLe4R7xWjotUY7zwU4/Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:33.485308Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.02344","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:433c2facd4bae4b1fbfeb56607af8b7b88c94c9143066de81749060435f0be46","sha256:c2c6c4c1d7c930b002d14511f049e859d89ab48dcccead64867b36b9c350f51c"],"state_sha256":"b5e5239840dc46192efe441d7cd5f6f02217f75388fd886c0642f5a02a6c9422"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MAlpBxZZJWPVUrQgFUMEzJlsv5xiUxgQkeZoDWbeJdjQ0oMfT9aGKbTabKO4LIVP8zcyTNrfCM2+3qv1GryQCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:13:42.385416Z","bundle_sha256":"27beed3ad74037885d9f4a34e3444c594f1f1b67410df309c44dc4a354eb5369"}}