{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VWUB44BJRDJYSDLHO42FIX3OYH","short_pith_number":"pith:VWUB44BJ","canonical_record":{"source":{"id":"1709.05603","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-09-17T03:23:43Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"fbc3ed1a6c2c9bbd21cdc5775108c279aa089e829cae7b7e0274a485473317f5","abstract_canon_sha256":"21ed270b70e13c3b0d1255ab0ece9c2e9da06bcbcc6bda1551a20cf2f2841c67"},"schema_version":"1.0"},"canonical_sha256":"ada81e702988d3890d677734545f6ec1e45d523a83b6847341fac5ec43f0413a","source":{"kind":"arxiv","id":"1709.05603","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05603","created_at":"2026-05-18T00:35:00Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05603v1","created_at":"2026-05-18T00:35:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05603","created_at":"2026-05-18T00:35:00Z"},{"alias_kind":"pith_short_12","alias_value":"VWUB44BJRDJY","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VWUB44BJRDJYSDLH","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VWUB44BJ","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VWUB44BJRDJYSDLHO42FIX3OYH","target":"record","payload":{"canonical_record":{"source":{"id":"1709.05603","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-09-17T03:23:43Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"fbc3ed1a6c2c9bbd21cdc5775108c279aa089e829cae7b7e0274a485473317f5","abstract_canon_sha256":"21ed270b70e13c3b0d1255ab0ece9c2e9da06bcbcc6bda1551a20cf2f2841c67"},"schema_version":"1.0"},"canonical_sha256":"ada81e702988d3890d677734545f6ec1e45d523a83b6847341fac5ec43f0413a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:00.160277Z","signature_b64":"34gB6QVG/QL6E3GXe9mRVzxcpFFydfEZbvwjPiKhXmtfu72tQnHAoZ9QkPJwUm7W6Y/83o+/yIwKgdXYTwsCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ada81e702988d3890d677734545f6ec1e45d523a83b6847341fac5ec43f0413a","last_reissued_at":"2026-05-18T00:35:00.159638Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:00.159638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.05603","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:35:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H0Wvl9cL9+LFuDJWsslSX9bpzo1R72kmwzJVSUMqGwmTCh1nCZ/OTLNcX5MWFLUZIdt/EpTCJy74PDSmBKJhBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:45:36.775496Z"},"content_sha256":"3004354666bc2068c6c1c09a92cad24578b272d0dc281e6fdfe8073e1b674eb0","schema_version":"1.0","event_id":"sha256:3004354666bc2068c6c1c09a92cad24578b272d0dc281e6fdfe8073e1b674eb0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VWUB44BJRDJYSDLHO42FIX3OYH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Sharp Lower Bound for Mixed-membership Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Jiashun Jin, Zheng Tracy Ke","submitted_at":"2017-09-17T03:23:43Z","abstract_excerpt":"Consider an undirected network with $n$ nodes and $K$ perceivable communities, where some nodes may have mixed memberships. We assume that for each node $1 \\leq i \\leq n$, there is a probability mass function $\\pi_i$ defined over $\\{1, 2, \\ldots, K\\}$ such that \\[ \\pi_i(k) = \\mbox{the weight of node $i$ on community $k$}, \\qquad 1 \\leq k \\leq K. \\] The goal is to estimate $\\{\\pi_i, 1 \\leq i \\leq n\\}$ (i.e., membership estimation).\n  We model the network with the {\\it degree-corrected mixed membership (DCMM)} model \\cite{Mixed-SCORE}. Since for many natural networks, the degrees have an approxi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05603","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:35:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JN3smurcmrijUWlb4ToX1nRL3TLfdIbfvWcJ34B7sF1F+jBBv8izNMlOQ6gquuafb/cNc1Im1+OQqn6qtFEfCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:45:36.776194Z"},"content_sha256":"43d60e19172976144df63a49f85a61441a7a78cd34504496b42d6c1605b797ff","schema_version":"1.0","event_id":"sha256:43d60e19172976144df63a49f85a61441a7a78cd34504496b42d6c1605b797ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VWUB44BJRDJYSDLHO42FIX3OYH/bundle.json","state_url":"https://pith.science/pith/VWUB44BJRDJYSDLHO42FIX3OYH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VWUB44BJRDJYSDLHO42FIX3OYH/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-25T09:45:36Z","links":{"resolver":"https://pith.science/pith/VWUB44BJRDJYSDLHO42FIX3OYH","bundle":"https://pith.science/pith/VWUB44BJRDJYSDLHO42FIX3OYH/bundle.json","state":"https://pith.science/pith/VWUB44BJRDJYSDLHO42FIX3OYH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VWUB44BJRDJYSDLHO42FIX3OYH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VWUB44BJRDJYSDLHO42FIX3OYH","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":"21ed270b70e13c3b0d1255ab0ece9c2e9da06bcbcc6bda1551a20cf2f2841c67","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-09-17T03:23:43Z","title_canon_sha256":"fbc3ed1a6c2c9bbd21cdc5775108c279aa089e829cae7b7e0274a485473317f5"},"schema_version":"1.0","source":{"id":"1709.05603","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05603","created_at":"2026-05-18T00:35:00Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05603v1","created_at":"2026-05-18T00:35:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05603","created_at":"2026-05-18T00:35:00Z"},{"alias_kind":"pith_short_12","alias_value":"VWUB44BJRDJY","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VWUB44BJRDJYSDLH","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VWUB44BJ","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:43d60e19172976144df63a49f85a61441a7a78cd34504496b42d6c1605b797ff","target":"graph","created_at":"2026-05-18T00:35:00Z","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":"Consider an undirected network with $n$ nodes and $K$ perceivable communities, where some nodes may have mixed memberships. We assume that for each node $1 \\leq i \\leq n$, there is a probability mass function $\\pi_i$ defined over $\\{1, 2, \\ldots, K\\}$ such that \\[ \\pi_i(k) = \\mbox{the weight of node $i$ on community $k$}, \\qquad 1 \\leq k \\leq K. \\] The goal is to estimate $\\{\\pi_i, 1 \\leq i \\leq n\\}$ (i.e., membership estimation).\n  We model the network with the {\\it degree-corrected mixed membership (DCMM)} model \\cite{Mixed-SCORE}. Since for many natural networks, the degrees have an approxi","authors_text":"Jiashun Jin, Zheng Tracy Ke","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-09-17T03:23:43Z","title":"A Sharp Lower Bound for Mixed-membership Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05603","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:3004354666bc2068c6c1c09a92cad24578b272d0dc281e6fdfe8073e1b674eb0","target":"record","created_at":"2026-05-18T00:35:00Z","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":"21ed270b70e13c3b0d1255ab0ece9c2e9da06bcbcc6bda1551a20cf2f2841c67","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-09-17T03:23:43Z","title_canon_sha256":"fbc3ed1a6c2c9bbd21cdc5775108c279aa089e829cae7b7e0274a485473317f5"},"schema_version":"1.0","source":{"id":"1709.05603","kind":"arxiv","version":1}},"canonical_sha256":"ada81e702988d3890d677734545f6ec1e45d523a83b6847341fac5ec43f0413a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ada81e702988d3890d677734545f6ec1e45d523a83b6847341fac5ec43f0413a","first_computed_at":"2026-05-18T00:35:00.159638Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:00.159638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"34gB6QVG/QL6E3GXe9mRVzxcpFFydfEZbvwjPiKhXmtfu72tQnHAoZ9QkPJwUm7W6Y/83o+/yIwKgdXYTwsCAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:00.160277Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.05603","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3004354666bc2068c6c1c09a92cad24578b272d0dc281e6fdfe8073e1b674eb0","sha256:43d60e19172976144df63a49f85a61441a7a78cd34504496b42d6c1605b797ff"],"state_sha256":"71279d26260371b2680a60ab3e95293eab3a4fcbddaa7b42afbb96757f41bb47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"duMOfUX4HqLwbuvkpEnYDZaleOinJZluV2pCt3sGo3fruSCop6J5GmTGmfKIUro3dmbANQp3l7YxfumYe/gnBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T09:45:36.780009Z","bundle_sha256":"38d30c998839cac63fb10856e568e441917468c76ac595a4cb68eebe5bf693f6"}}