{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:U4TS5L4H37PGSFTGVLB57SDPPI","short_pith_number":"pith:U4TS5L4H","schema_version":"1.0","canonical_sha256":"a7272eaf87dfde691666aac3dfc86f7a1687f70e4b8df8aecab2454f7f38abb2","source":{"kind":"arxiv","id":"1404.4749","version":2},"attestation_state":"computed","paper":{"title":"Decoding binary node labels from censored edge measurements: Phase transition and efficient recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Afonso S. Bandeira, Amit Singer, Annina Bracher, Emmanuel Abbe","submitted_at":"2014-04-18T11:18:56Z","abstract_excerpt":"We consider the problem of clustering a graph $G$ into two communities by observing a subset of the vertex correlations. Specifically, we consider the inverse problem with observed variables $Y=B_G x \\oplus Z$, where $B_G$ is the incidence matrix of a graph $G$, $x$ is the vector of unknown vertex variables (with a uniform prior) and $Z$ is a noise vector with Bernoulli$(\\varepsilon)$ i.i.d. entries. All variables and operations are Boolean. This model is motivated by coding, synchronization, and community detection problems. In particular, it corresponds to a stochastic block model or a corre"},"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":"1404.4749","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-18T11:18:56Z","cross_cats_sorted":["cs.DS","math.IT"],"title_canon_sha256":"10847848d0feb547bc42d627f0feab871064c2cdce82e0fc8957f0e351084f2a","abstract_canon_sha256":"8fdf9fbc91a30464643177553f469de7e3d4e0790b8f191b8fd2875ce7136aac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:37.038473Z","signature_b64":"0NOKLi4GXkhmLRi13oobiJaE/Vi5oyBItSyXAQh7AGIzWTW823aqPlrfq3+MOiTJoT1nEAXG82LzhoChLeysCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7272eaf87dfde691666aac3dfc86f7a1687f70e4b8df8aecab2454f7f38abb2","last_reissued_at":"2026-05-18T02:38:37.037674Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:37.037674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decoding binary node labels from censored edge measurements: Phase transition and efficient recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Afonso S. Bandeira, Amit Singer, Annina Bracher, Emmanuel Abbe","submitted_at":"2014-04-18T11:18:56Z","abstract_excerpt":"We consider the problem of clustering a graph $G$ into two communities by observing a subset of the vertex correlations. Specifically, we consider the inverse problem with observed variables $Y=B_G x \\oplus Z$, where $B_G$ is the incidence matrix of a graph $G$, $x$ is the vector of unknown vertex variables (with a uniform prior) and $Z$ is a noise vector with Bernoulli$(\\varepsilon)$ i.i.d. entries. All variables and operations are Boolean. This model is motivated by coding, synchronization, and community detection problems. In particular, it corresponds to a stochastic block model or a corre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4749","kind":"arxiv","version":2},"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":"1404.4749","created_at":"2026-05-18T02:38:37.037807+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.4749v2","created_at":"2026-05-18T02:38:37.037807+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4749","created_at":"2026-05-18T02:38:37.037807+00:00"},{"alias_kind":"pith_short_12","alias_value":"U4TS5L4H37PG","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"U4TS5L4H37PGSFTG","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"U4TS5L4H","created_at":"2026-05-18T12:28:52.271510+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U4TS5L4H37PGSFTGVLB57SDPPI","json":"https://pith.science/pith/U4TS5L4H37PGSFTGVLB57SDPPI.json","graph_json":"https://pith.science/api/pith-number/U4TS5L4H37PGSFTGVLB57SDPPI/graph.json","events_json":"https://pith.science/api/pith-number/U4TS5L4H37PGSFTGVLB57SDPPI/events.json","paper":"https://pith.science/paper/U4TS5L4H"},"agent_actions":{"view_html":"https://pith.science/pith/U4TS5L4H37PGSFTGVLB57SDPPI","download_json":"https://pith.science/pith/U4TS5L4H37PGSFTGVLB57SDPPI.json","view_paper":"https://pith.science/paper/U4TS5L4H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.4749&json=true","fetch_graph":"https://pith.science/api/pith-number/U4TS5L4H37PGSFTGVLB57SDPPI/graph.json","fetch_events":"https://pith.science/api/pith-number/U4TS5L4H37PGSFTGVLB57SDPPI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U4TS5L4H37PGSFTGVLB57SDPPI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U4TS5L4H37PGSFTGVLB57SDPPI/action/storage_attestation","attest_author":"https://pith.science/pith/U4TS5L4H37PGSFTGVLB57SDPPI/action/author_attestation","sign_citation":"https://pith.science/pith/U4TS5L4H37PGSFTGVLB57SDPPI/action/citation_signature","submit_replication":"https://pith.science/pith/U4TS5L4H37PGSFTGVLB57SDPPI/action/replication_record"}},"created_at":"2026-05-18T02:38:37.037807+00:00","updated_at":"2026-05-18T02:38:37.037807+00:00"}