{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2W2C5CLNHORJYS2EPWDTOOQSM4","short_pith_number":"pith:2W2C5CLN","canonical_record":{"source":{"id":"1710.00264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-30T21:58:34Z","cross_cats_sorted":["cs.CC","cs.LG","math.PR","stat.ML"],"title_canon_sha256":"1041c0f1004312dfae84f83e34211b3ab1cf70b8831ce354080b3cba0e124421","abstract_canon_sha256":"86b30cafccc1049215e760e01f9ae3ff4fab94aa58f790d1811f0b3f8cd866f6"},"schema_version":"1.0"},"canonical_sha256":"d5b42e896d3ba29c4b447d87373a126736b2a8d9beec87c442d6d6f30953363e","source":{"kind":"arxiv","id":"1710.00264","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00264","created_at":"2026-05-18T00:33:47Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00264v1","created_at":"2026-05-18T00:33:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00264","created_at":"2026-05-18T00:33:47Z"},{"alias_kind":"pith_short_12","alias_value":"2W2C5CLNHORJ","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2W2C5CLNHORJYS2E","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2W2C5CLN","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2W2C5CLNHORJYS2EPWDTOOQSM4","target":"record","payload":{"canonical_record":{"source":{"id":"1710.00264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-30T21:58:34Z","cross_cats_sorted":["cs.CC","cs.LG","math.PR","stat.ML"],"title_canon_sha256":"1041c0f1004312dfae84f83e34211b3ab1cf70b8831ce354080b3cba0e124421","abstract_canon_sha256":"86b30cafccc1049215e760e01f9ae3ff4fab94aa58f790d1811f0b3f8cd866f6"},"schema_version":"1.0"},"canonical_sha256":"d5b42e896d3ba29c4b447d87373a126736b2a8d9beec87c442d6d6f30953363e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:47.829792Z","signature_b64":"P8QyJryNQAvwuEQiF2MVWf9SWpudFu8ol+obhOm2NPQ7hGmMFu6Hn4EmCZWfsK9QMWd630hRcivWczHSObppAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5b42e896d3ba29c4b447d87373a126736b2a8d9beec87c442d6d6f30953363e","last_reissued_at":"2026-05-18T00:33:47.829266Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:47.829266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.00264","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:33:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sqxTDEtLLAC3qoVqtnTaMGfJRBoX217EtR2uygDm1gvAOL9xy0/Vob0LHb9Xo6RYf5DL5NXtSTiYXegu0npeDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:52:13.007439Z"},"content_sha256":"a84f7d9e6cba3a1d040965c11f085ce1a58de9a4b27f4a06f61872a7d7cd81de","schema_version":"1.0","event_id":"sha256:a84f7d9e6cba3a1d040965c11f085ce1a58de9a4b27f4a06f61872a7d7cd81de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2W2C5CLNHORJYS2EPWDTOOQSM4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bayesian estimation from few samples: community detection and related problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LG","math.PR","stat.ML"],"primary_cat":"cs.DS","authors_text":"David Steurer, Samuel B. Hopkins","submitted_at":"2017-09-30T21:58:34Z","abstract_excerpt":"We propose an efficient meta-algorithm for Bayesian estimation problems that is based on low-degree polynomials, semidefinite programming, and tensor decomposition. The algorithm is inspired by recent lower bound constructions for sum-of-squares and related to the method of moments. Our focus is on sample complexity bounds that are as tight as possible (up to additive lower-order terms) and often achieve statistical thresholds or conjectured computational thresholds.\n  Our algorithm recovers the best known bounds for community detection in the sparse stochastic block model, a widely-studied cl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00264","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:33:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B3XYQvY75iwR7XbF19Nlb02jRhEeTZECYg0TwSrUSO3WN619DHzfgosOIuLnvXcgNhWecCdqj/pRQLxEe+EHBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:52:13.007799Z"},"content_sha256":"9338fd1c03b4e5e1d1ed2e324b87fad1bff7da73bf2f9b46b2eb925055c7b408","schema_version":"1.0","event_id":"sha256:9338fd1c03b4e5e1d1ed2e324b87fad1bff7da73bf2f9b46b2eb925055c7b408"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2W2C5CLNHORJYS2EPWDTOOQSM4/bundle.json","state_url":"https://pith.science/pith/2W2C5CLNHORJYS2EPWDTOOQSM4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2W2C5CLNHORJYS2EPWDTOOQSM4/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-09T14:52:13Z","links":{"resolver":"https://pith.science/pith/2W2C5CLNHORJYS2EPWDTOOQSM4","bundle":"https://pith.science/pith/2W2C5CLNHORJYS2EPWDTOOQSM4/bundle.json","state":"https://pith.science/pith/2W2C5CLNHORJYS2EPWDTOOQSM4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2W2C5CLNHORJYS2EPWDTOOQSM4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2W2C5CLNHORJYS2EPWDTOOQSM4","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":"86b30cafccc1049215e760e01f9ae3ff4fab94aa58f790d1811f0b3f8cd866f6","cross_cats_sorted":["cs.CC","cs.LG","math.PR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-30T21:58:34Z","title_canon_sha256":"1041c0f1004312dfae84f83e34211b3ab1cf70b8831ce354080b3cba0e124421"},"schema_version":"1.0","source":{"id":"1710.00264","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00264","created_at":"2026-05-18T00:33:47Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00264v1","created_at":"2026-05-18T00:33:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00264","created_at":"2026-05-18T00:33:47Z"},{"alias_kind":"pith_short_12","alias_value":"2W2C5CLNHORJ","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2W2C5CLNHORJYS2E","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2W2C5CLN","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:9338fd1c03b4e5e1d1ed2e324b87fad1bff7da73bf2f9b46b2eb925055c7b408","target":"graph","created_at":"2026-05-18T00:33:47Z","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 propose an efficient meta-algorithm for Bayesian estimation problems that is based on low-degree polynomials, semidefinite programming, and tensor decomposition. The algorithm is inspired by recent lower bound constructions for sum-of-squares and related to the method of moments. Our focus is on sample complexity bounds that are as tight as possible (up to additive lower-order terms) and often achieve statistical thresholds or conjectured computational thresholds.\n  Our algorithm recovers the best known bounds for community detection in the sparse stochastic block model, a widely-studied cl","authors_text":"David Steurer, Samuel B. Hopkins","cross_cats":["cs.CC","cs.LG","math.PR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-30T21:58:34Z","title":"Bayesian estimation from few samples: community detection and related problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00264","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:a84f7d9e6cba3a1d040965c11f085ce1a58de9a4b27f4a06f61872a7d7cd81de","target":"record","created_at":"2026-05-18T00:33:47Z","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":"86b30cafccc1049215e760e01f9ae3ff4fab94aa58f790d1811f0b3f8cd866f6","cross_cats_sorted":["cs.CC","cs.LG","math.PR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-09-30T21:58:34Z","title_canon_sha256":"1041c0f1004312dfae84f83e34211b3ab1cf70b8831ce354080b3cba0e124421"},"schema_version":"1.0","source":{"id":"1710.00264","kind":"arxiv","version":1}},"canonical_sha256":"d5b42e896d3ba29c4b447d87373a126736b2a8d9beec87c442d6d6f30953363e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5b42e896d3ba29c4b447d87373a126736b2a8d9beec87c442d6d6f30953363e","first_computed_at":"2026-05-18T00:33:47.829266Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:47.829266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P8QyJryNQAvwuEQiF2MVWf9SWpudFu8ol+obhOm2NPQ7hGmMFu6Hn4EmCZWfsK9QMWd630hRcivWczHSObppAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:47.829792Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.00264","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a84f7d9e6cba3a1d040965c11f085ce1a58de9a4b27f4a06f61872a7d7cd81de","sha256:9338fd1c03b4e5e1d1ed2e324b87fad1bff7da73bf2f9b46b2eb925055c7b408"],"state_sha256":"332fe46321e5892e4674ef245788f6cf66fd70191dcbc3dd884a6b2314f80d76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e9PxBommmaBqf2KaBjqSosNyEa0mRLsGg9QH+h5Kb5IYkK6SSmxNh/aA7tbJNxEmsPcJKUPE4cF3cbjS5UM3AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T14:52:13.009720Z","bundle_sha256":"633299a0fec9d9525196dfec67218b5ae4348ad0f6ffd724b35c3977d48c2665"}}