{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:L7D65NLDAI7KCADSQL72OVQN3W","short_pith_number":"pith:L7D65NLD","schema_version":"1.0","canonical_sha256":"5fc7eeb563023ea1007282ffa7560ddda0467fe45d41f54c0d65a8da9cc3cc81","source":{"kind":"arxiv","id":"1509.06418","version":1},"attestation_state":"computed","paper":{"title":"Information-theoretic bounds for exact recovery in weighted stochastic block models using the Renyi divergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Po-Ling Loh, Varun Jog","submitted_at":"2015-09-21T22:26:14Z","abstract_excerpt":"We derive sharp thresholds for exact recovery of communities in a weighted stochastic block model, where observations are collected in the form of a weighted adjacency matrix, and the weight of each edge is generated independently from a distribution determined by the community membership of its endpoints. Our main result, characterizing the precise boundary between success and failure of maximum likelihood estimation when edge weights are drawn from discrete distributions, involves the Renyi divergence of order $\\frac{1}{2}$ between the distributions of within-community and between-community "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1509.06418","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-09-21T22:26:14Z","cross_cats_sorted":["cs.SI","math.IT","math.ST","stat.TH"],"title_canon_sha256":"ec763ec5c99d144482ea11430844f0de075cdd2687044ff1a3664b51bdd762e9","abstract_canon_sha256":"d07f514d47f901ebe67a7d8ca675069631d0ad0e2e80629ee601e7086c837b34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:20.388717Z","signature_b64":"98VF1xEkQkDojZ/xzVgsl4zlkI06eVbdJDc6q7poFog3hpg7+7QttDHXN36twJVgnQAS8RCpLwDHcfqAVi3LBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fc7eeb563023ea1007282ffa7560ddda0467fe45d41f54c0d65a8da9cc3cc81","last_reissued_at":"2026-05-18T01:32:20.388120Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:20.388120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Information-theoretic bounds for exact recovery in weighted stochastic block models using the Renyi divergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Po-Ling Loh, Varun Jog","submitted_at":"2015-09-21T22:26:14Z","abstract_excerpt":"We derive sharp thresholds for exact recovery of communities in a weighted stochastic block model, where observations are collected in the form of a weighted adjacency matrix, and the weight of each edge is generated independently from a distribution determined by the community membership of its endpoints. Our main result, characterizing the precise boundary between success and failure of maximum likelihood estimation when edge weights are drawn from discrete distributions, involves the Renyi divergence of order $\\frac{1}{2}$ between the distributions of within-community and between-community "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06418","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.06418","created_at":"2026-05-18T01:32:20.388201+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.06418v1","created_at":"2026-05-18T01:32:20.388201+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06418","created_at":"2026-05-18T01:32:20.388201+00:00"},{"alias_kind":"pith_short_12","alias_value":"L7D65NLDAI7K","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"L7D65NLDAI7KCADS","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"L7D65NLD","created_at":"2026-05-18T12:29:29.992203+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.17767","citing_title":"Feature Learning in Linear-Width Two-Layer Networks: Two vs. One Step of Gradient Descent","ref_index":178,"is_internal_anchor":true},{"citing_arxiv_id":"2605.17767","citing_title":"Feature Learning in Linear-Width Two-Layer Networks: Two vs. One Step of Gradient Descent","ref_index":178,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L7D65NLDAI7KCADSQL72OVQN3W","json":"https://pith.science/pith/L7D65NLDAI7KCADSQL72OVQN3W.json","graph_json":"https://pith.science/api/pith-number/L7D65NLDAI7KCADSQL72OVQN3W/graph.json","events_json":"https://pith.science/api/pith-number/L7D65NLDAI7KCADSQL72OVQN3W/events.json","paper":"https://pith.science/paper/L7D65NLD"},"agent_actions":{"view_html":"https://pith.science/pith/L7D65NLDAI7KCADSQL72OVQN3W","download_json":"https://pith.science/pith/L7D65NLDAI7KCADSQL72OVQN3W.json","view_paper":"https://pith.science/paper/L7D65NLD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.06418&json=true","fetch_graph":"https://pith.science/api/pith-number/L7D65NLDAI7KCADSQL72OVQN3W/graph.json","fetch_events":"https://pith.science/api/pith-number/L7D65NLDAI7KCADSQL72OVQN3W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L7D65NLDAI7KCADSQL72OVQN3W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L7D65NLDAI7KCADSQL72OVQN3W/action/storage_attestation","attest_author":"https://pith.science/pith/L7D65NLDAI7KCADSQL72OVQN3W/action/author_attestation","sign_citation":"https://pith.science/pith/L7D65NLDAI7KCADSQL72OVQN3W/action/citation_signature","submit_replication":"https://pith.science/pith/L7D65NLDAI7KCADSQL72OVQN3W/action/replication_record"}},"created_at":"2026-05-18T01:32:20.388201+00:00","updated_at":"2026-05-18T01:32:20.388201+00:00"}