{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:U4TS5L4H37PGSFTGVLB57SDPPI","short_pith_number":"pith:U4TS5L4H","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"},"canonical_sha256":"a7272eaf87dfde691666aac3dfc86f7a1687f70e4b8df8aecab2454f7f38abb2","source":{"kind":"arxiv","id":"1404.4749","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4749","created_at":"2026-05-18T02:38:37Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4749v2","created_at":"2026-05-18T02:38:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4749","created_at":"2026-05-18T02:38:37Z"},{"alias_kind":"pith_short_12","alias_value":"U4TS5L4H37PG","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"U4TS5L4H37PGSFTG","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"U4TS5L4H","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:U4TS5L4H37PGSFTGVLB57SDPPI","target":"record","payload":{"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"},"canonical_sha256":"a7272eaf87dfde691666aac3dfc86f7a1687f70e4b8df8aecab2454f7f38abb2","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"},"source_kind":"arxiv","source_id":"1404.4749","source_version":2,"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:38:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hv8KHYhobwv05NP8Cwslh6Rx3jnzAG9aKKTFo7d5m+NMG8Oe1TKnlItzl8VzEJrtGcm28jbTTEll5xcPEciRBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:05:15.178059Z"},"content_sha256":"c4a5c7ad486fe487d2b6fd9f28460658d293b8242f3da0ea77d65cc7c753c1d1","schema_version":"1.0","event_id":"sha256:c4a5c7ad486fe487d2b6fd9f28460658d293b8242f3da0ea77d65cc7c753c1d1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:U4TS5L4H37PGSFTGVLB57SDPPI","target":"graph","payload":{"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"},"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:38:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O5bTVQd974C6vdPpa9/Hr27onLZV1z/jsKwovxybS8fbQ4yi+S2NF7nrZHjUF9ms4FLBHsDfRH48hFgdX+18AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:05:15.178761Z"},"content_sha256":"261e6b9c5ba430b990e14dacfe3a9f10c847a1e94cd239cbd25fccd43e238b3f","schema_version":"1.0","event_id":"sha256:261e6b9c5ba430b990e14dacfe3a9f10c847a1e94cd239cbd25fccd43e238b3f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U4TS5L4H37PGSFTGVLB57SDPPI/bundle.json","state_url":"https://pith.science/pith/U4TS5L4H37PGSFTGVLB57SDPPI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U4TS5L4H37PGSFTGVLB57SDPPI/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-28T16:05:15Z","links":{"resolver":"https://pith.science/pith/U4TS5L4H37PGSFTGVLB57SDPPI","bundle":"https://pith.science/pith/U4TS5L4H37PGSFTGVLB57SDPPI/bundle.json","state":"https://pith.science/pith/U4TS5L4H37PGSFTGVLB57SDPPI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U4TS5L4H37PGSFTGVLB57SDPPI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:U4TS5L4H37PGSFTGVLB57SDPPI","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":"8fdf9fbc91a30464643177553f469de7e3d4e0790b8f191b8fd2875ce7136aac","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-18T11:18:56Z","title_canon_sha256":"10847848d0feb547bc42d627f0feab871064c2cdce82e0fc8957f0e351084f2a"},"schema_version":"1.0","source":{"id":"1404.4749","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4749","created_at":"2026-05-18T02:38:37Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4749v2","created_at":"2026-05-18T02:38:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4749","created_at":"2026-05-18T02:38:37Z"},{"alias_kind":"pith_short_12","alias_value":"U4TS5L4H37PG","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"U4TS5L4H37PGSFTG","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"U4TS5L4H","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:261e6b9c5ba430b990e14dacfe3a9f10c847a1e94cd239cbd25fccd43e238b3f","target":"graph","created_at":"2026-05-18T02:38:37Z","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 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","authors_text":"Afonso S. Bandeira, Amit Singer, Annina Bracher, Emmanuel Abbe","cross_cats":["cs.DS","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-18T11:18:56Z","title":"Decoding binary node labels from censored edge measurements: Phase transition and efficient recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4749","kind":"arxiv","version":2},"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:c4a5c7ad486fe487d2b6fd9f28460658d293b8242f3da0ea77d65cc7c753c1d1","target":"record","created_at":"2026-05-18T02:38:37Z","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":"8fdf9fbc91a30464643177553f469de7e3d4e0790b8f191b8fd2875ce7136aac","cross_cats_sorted":["cs.DS","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-18T11:18:56Z","title_canon_sha256":"10847848d0feb547bc42d627f0feab871064c2cdce82e0fc8957f0e351084f2a"},"schema_version":"1.0","source":{"id":"1404.4749","kind":"arxiv","version":2}},"canonical_sha256":"a7272eaf87dfde691666aac3dfc86f7a1687f70e4b8df8aecab2454f7f38abb2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7272eaf87dfde691666aac3dfc86f7a1687f70e4b8df8aecab2454f7f38abb2","first_computed_at":"2026-05-18T02:38:37.037674Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:37.037674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0NOKLi4GXkhmLRi13oobiJaE/Vi5oyBItSyXAQh7AGIzWTW823aqPlrfq3+MOiTJoT1nEAXG82LzhoChLeysCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:37.038473Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.4749","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4a5c7ad486fe487d2b6fd9f28460658d293b8242f3da0ea77d65cc7c753c1d1","sha256:261e6b9c5ba430b990e14dacfe3a9f10c847a1e94cd239cbd25fccd43e238b3f"],"state_sha256":"b778547902862198ebf65c09f3bf34e20c05c7c878642358d154b980d4bb2f4e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cd9m8l+TUgjrYHpAggwXKkLG54oQAz1ak90TOwUvQdMK2VUNAAWEjDvwQJB5qE1fiNC4X668OfOYQKEpL776Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:05:15.182187Z","bundle_sha256":"c1abc800d140be09e825f54e7d8402dc4297930fef3a2293cafeae559c1449b5"}}