{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NFTEDFVDJOB6CZNXOZYZVYWOLE","short_pith_number":"pith:NFTEDFVD","canonical_record":{"source":{"id":"1407.2774","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-10T13:12:38Z","cross_cats_sorted":["math.CO","math.PR"],"title_canon_sha256":"7eb99f6a44eaa744a604ad909ad7482f70d98149d6db2c4ef9ce25a14641f8c0","abstract_canon_sha256":"fd754816fb7d3e507f1dcca6b15408cc42c8e343677948eb6d9a251367d7603a"},"schema_version":"1.0"},"canonical_sha256":"69664196a34b83e165b776719ae2ce591bd9d122a3161a269387ddc73eb61734","source":{"kind":"arxiv","id":"1407.2774","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2774","created_at":"2026-05-18T02:17:33Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2774v3","created_at":"2026-05-18T02:17:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2774","created_at":"2026-05-18T02:17:33Z"},{"alias_kind":"pith_short_12","alias_value":"NFTEDFVDJOB6","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NFTEDFVDJOB6CZNX","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NFTEDFVD","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NFTEDFVDJOB6CZNXOZYZVYWOLE","target":"record","payload":{"canonical_record":{"source":{"id":"1407.2774","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-10T13:12:38Z","cross_cats_sorted":["math.CO","math.PR"],"title_canon_sha256":"7eb99f6a44eaa744a604ad909ad7482f70d98149d6db2c4ef9ce25a14641f8c0","abstract_canon_sha256":"fd754816fb7d3e507f1dcca6b15408cc42c8e343677948eb6d9a251367d7603a"},"schema_version":"1.0"},"canonical_sha256":"69664196a34b83e165b776719ae2ce591bd9d122a3161a269387ddc73eb61734","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:33.724938Z","signature_b64":"zfMhPdEcXzEtkalFun+YQMMlTNs4x8oqcngZ6GTHHIvmEYI/NRYvGO62HiI49AsVpE6Lwg4UdIAvvArGWfZnAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69664196a34b83e165b776719ae2ce591bd9d122a3161a269387ddc73eb61734","last_reissued_at":"2026-05-18T02:17:33.724195Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:33.724195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.2774","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-18T02:17:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PFPXKJIApkdaYzBaXonBEu3UB7qe74XVOuLz9o9lsfdq49SL6BkrwvdxoFef+mgwNRd53gDS6avrpUUV/ZvKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:15:11.472403Z"},"content_sha256":"676e5cc23b366b08a99235ce2149b6c291cac07ec3fc66b2975cc45d41a2d4b5","schema_version":"1.0","event_id":"sha256:676e5cc23b366b08a99235ce2149b6c291cac07ec3fc66b2975cc45d41a2d4b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NFTEDFVDJOB6CZNXOZYZVYWOLE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subsampled Power Iteration: a Unified Algorithm for Block Models and Planted CSP's","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.PR"],"primary_cat":"cs.DS","authors_text":"Santosh Vempala, Vitaly Feldman, Will Perkins","submitted_at":"2014-07-10T13:12:38Z","abstract_excerpt":"We present an algorithm for recovering planted solutions in two well-known models, the stochastic block model and planted constraint satisfaction problems, via a common generalization in terms of random bipartite graphs. Our algorithm matches up to a constant factor the best-known bounds for the number of edges (or constraints) needed for perfect recovery and its running time is linear in the number of edges used. The time complexity is significantly better than both spectral and SDP-based approaches.\n  The main contribution of the algorithm is in the case of unequal sizes in the bipartition ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2774","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-18T02:17:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Z+lzjQI5V+oVVR/JiBMrwalAAILcn1T9s0aN1Z0e4R8z1HUom+qdl9MMjNOBOk6NEQITwIT2zFCp+LDXAZgBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:15:11.473092Z"},"content_sha256":"22e80ec45db0d912f1a250ff0eb248f22fa46f34b48ed4fcb0d6609aaf0d4516","schema_version":"1.0","event_id":"sha256:22e80ec45db0d912f1a250ff0eb248f22fa46f34b48ed4fcb0d6609aaf0d4516"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NFTEDFVDJOB6CZNXOZYZVYWOLE/bundle.json","state_url":"https://pith.science/pith/NFTEDFVDJOB6CZNXOZYZVYWOLE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NFTEDFVDJOB6CZNXOZYZVYWOLE/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-27T13:15:11Z","links":{"resolver":"https://pith.science/pith/NFTEDFVDJOB6CZNXOZYZVYWOLE","bundle":"https://pith.science/pith/NFTEDFVDJOB6CZNXOZYZVYWOLE/bundle.json","state":"https://pith.science/pith/NFTEDFVDJOB6CZNXOZYZVYWOLE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NFTEDFVDJOB6CZNXOZYZVYWOLE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NFTEDFVDJOB6CZNXOZYZVYWOLE","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":"fd754816fb7d3e507f1dcca6b15408cc42c8e343677948eb6d9a251367d7603a","cross_cats_sorted":["math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-10T13:12:38Z","title_canon_sha256":"7eb99f6a44eaa744a604ad909ad7482f70d98149d6db2c4ef9ce25a14641f8c0"},"schema_version":"1.0","source":{"id":"1407.2774","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2774","created_at":"2026-05-18T02:17:33Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2774v3","created_at":"2026-05-18T02:17:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2774","created_at":"2026-05-18T02:17:33Z"},{"alias_kind":"pith_short_12","alias_value":"NFTEDFVDJOB6","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NFTEDFVDJOB6CZNX","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NFTEDFVD","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:22e80ec45db0d912f1a250ff0eb248f22fa46f34b48ed4fcb0d6609aaf0d4516","target":"graph","created_at":"2026-05-18T02:17: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":"We present an algorithm for recovering planted solutions in two well-known models, the stochastic block model and planted constraint satisfaction problems, via a common generalization in terms of random bipartite graphs. Our algorithm matches up to a constant factor the best-known bounds for the number of edges (or constraints) needed for perfect recovery and its running time is linear in the number of edges used. The time complexity is significantly better than both spectral and SDP-based approaches.\n  The main contribution of the algorithm is in the case of unequal sizes in the bipartition (","authors_text":"Santosh Vempala, Vitaly Feldman, Will Perkins","cross_cats":["math.CO","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-10T13:12:38Z","title":"Subsampled Power Iteration: a Unified Algorithm for Block Models and Planted CSP's"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2774","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:676e5cc23b366b08a99235ce2149b6c291cac07ec3fc66b2975cc45d41a2d4b5","target":"record","created_at":"2026-05-18T02:17: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":"fd754816fb7d3e507f1dcca6b15408cc42c8e343677948eb6d9a251367d7603a","cross_cats_sorted":["math.CO","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-10T13:12:38Z","title_canon_sha256":"7eb99f6a44eaa744a604ad909ad7482f70d98149d6db2c4ef9ce25a14641f8c0"},"schema_version":"1.0","source":{"id":"1407.2774","kind":"arxiv","version":3}},"canonical_sha256":"69664196a34b83e165b776719ae2ce591bd9d122a3161a269387ddc73eb61734","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69664196a34b83e165b776719ae2ce591bd9d122a3161a269387ddc73eb61734","first_computed_at":"2026-05-18T02:17:33.724195Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:33.724195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zfMhPdEcXzEtkalFun+YQMMlTNs4x8oqcngZ6GTHHIvmEYI/NRYvGO62HiI49AsVpE6Lwg4UdIAvvArGWfZnAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:33.724938Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.2774","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:676e5cc23b366b08a99235ce2149b6c291cac07ec3fc66b2975cc45d41a2d4b5","sha256:22e80ec45db0d912f1a250ff0eb248f22fa46f34b48ed4fcb0d6609aaf0d4516"],"state_sha256":"f218f5132e3299c7e87fb53301145e477bd92e8b72193bdbcfff2a6854c2f397"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YbgBtpIqyJQC4A9KrI6j0F180J3k7SMODuhQpQQ3ZMsnKHXGU1rpjdBESD0rSjcAUGQxtIn866ngu5lGU3zbAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:15:11.476646Z","bundle_sha256":"a2e5e6c6e063a16f24c3277ffafc2c8c0e96c003b220286fc45c5b03acde483b"}}