{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GYQIH5KVKMJOBNN2Y62YBPNHDK","short_pith_number":"pith:GYQIH5KV","canonical_record":{"source":{"id":"1509.07859","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-25T19:56:35Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"fe0f33396d8f922fc622d0e881734db896bc32b665834f630f1eec4f7b99f134","abstract_canon_sha256":"254f712c09481290dee14e7901c59035f7f4491ac329d36a5aa56a453a257405"},"schema_version":"1.0"},"canonical_sha256":"362083f5555312e0b5bac7b580bda71a8cded7ca4d683ef9fead6971eb8f354b","source":{"kind":"arxiv","id":"1509.07859","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07859","created_at":"2026-05-18T01:22:06Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07859v2","created_at":"2026-05-18T01:22:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07859","created_at":"2026-05-18T01:22:06Z"},{"alias_kind":"pith_short_12","alias_value":"GYQIH5KVKMJO","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GYQIH5KVKMJOBNN2","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GYQIH5KV","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GYQIH5KVKMJOBNN2Y62YBPNHDK","target":"record","payload":{"canonical_record":{"source":{"id":"1509.07859","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-25T19:56:35Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"fe0f33396d8f922fc622d0e881734db896bc32b665834f630f1eec4f7b99f134","abstract_canon_sha256":"254f712c09481290dee14e7901c59035f7f4491ac329d36a5aa56a453a257405"},"schema_version":"1.0"},"canonical_sha256":"362083f5555312e0b5bac7b580bda71a8cded7ca4d683ef9fead6971eb8f354b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:06.007929Z","signature_b64":"IG6rqGkaD02KKlTSC0LFSzwTkFQYDRk4k6l2oijlssN9NBQf5lIYDyN2uEK2y1AoMC/dzApZdk0CT+Q9/ImwCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"362083f5555312e0b5bac7b580bda71a8cded7ca4d683ef9fead6971eb8f354b","last_reissued_at":"2026-05-18T01:22:06.007253Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:06.007253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.07859","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-18T01:22:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/FA0LrkVLmyUph7hnXpJololDtdZqc1ajhOI68CnSpgmJXEiZ65BO9tDqwINe9lsRypnfhCrm+lUKPQBlPBNBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T14:37:02.024041Z"},"content_sha256":"9eb89ac33d7ffd5dfbcc076f417c74a26bbd9b63ae9a944f7b7efb63e3ad886a","schema_version":"1.0","event_id":"sha256:9eb89ac33d7ffd5dfbcc076f417c74a26bbd9b63ae9a944f7b7efb63e3ad886a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GYQIH5KVKMJOBNN2Y62YBPNHDK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Information Limits for Recovering a Hidden Community","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"stat.ML","authors_text":"Bruce Hajek, Jiaming Xu, Yihong Wu","submitted_at":"2015-09-25T19:56:35Z","abstract_excerpt":"We study the problem of recovering a hidden community of cardinality $K$ from an $n \\times n$ symmetric data matrix $A$, where for distinct indices $i,j$, $A_{ij} \\sim P$ if $i, j$ both belong to the community and $A_{ij} \\sim Q$ otherwise, for two known probability distributions $P$ and $Q$ depending on $n$. If $P={\\rm Bern}(p)$ and $Q={\\rm Bern}(q)$ with $p>q$, it reduces to the problem of finding a densely-connected $K$-subgraph planted in a large Erd\\\"os-R\\'enyi graph; if $P=\\mathcal{N}(\\mu,1)$ and $Q=\\mathcal{N}(0,1)$ with $\\mu>0$, it corresponds to the problem of locating a $K \\times K$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07859","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-18T01:22:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"svwPXtA1ozdHQO3ybBfkzmNTfDT2fcF04V9wrGxjySLIZ7wgt7HvB/aE/CwCAnLMttbFbYKEP+j0OvxMvzp4CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T14:37:02.024703Z"},"content_sha256":"5dcfe74d53eaa5d357ca39dbe4100a891beb4d906aa1655aeab4053313ba4462","schema_version":"1.0","event_id":"sha256:5dcfe74d53eaa5d357ca39dbe4100a891beb4d906aa1655aeab4053313ba4462"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GYQIH5KVKMJOBNN2Y62YBPNHDK/bundle.json","state_url":"https://pith.science/pith/GYQIH5KVKMJOBNN2Y62YBPNHDK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GYQIH5KVKMJOBNN2Y62YBPNHDK/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-11T14:37:02Z","links":{"resolver":"https://pith.science/pith/GYQIH5KVKMJOBNN2Y62YBPNHDK","bundle":"https://pith.science/pith/GYQIH5KVKMJOBNN2Y62YBPNHDK/bundle.json","state":"https://pith.science/pith/GYQIH5KVKMJOBNN2Y62YBPNHDK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GYQIH5KVKMJOBNN2Y62YBPNHDK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GYQIH5KVKMJOBNN2Y62YBPNHDK","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":"254f712c09481290dee14e7901c59035f7f4491ac329d36a5aa56a453a257405","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-25T19:56:35Z","title_canon_sha256":"fe0f33396d8f922fc622d0e881734db896bc32b665834f630f1eec4f7b99f134"},"schema_version":"1.0","source":{"id":"1509.07859","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07859","created_at":"2026-05-18T01:22:06Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07859v2","created_at":"2026-05-18T01:22:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07859","created_at":"2026-05-18T01:22:06Z"},{"alias_kind":"pith_short_12","alias_value":"GYQIH5KVKMJO","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GYQIH5KVKMJOBNN2","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GYQIH5KV","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:5dcfe74d53eaa5d357ca39dbe4100a891beb4d906aa1655aeab4053313ba4462","target":"graph","created_at":"2026-05-18T01:22:06Z","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 study the problem of recovering a hidden community of cardinality $K$ from an $n \\times n$ symmetric data matrix $A$, where for distinct indices $i,j$, $A_{ij} \\sim P$ if $i, j$ both belong to the community and $A_{ij} \\sim Q$ otherwise, for two known probability distributions $P$ and $Q$ depending on $n$. If $P={\\rm Bern}(p)$ and $Q={\\rm Bern}(q)$ with $p>q$, it reduces to the problem of finding a densely-connected $K$-subgraph planted in a large Erd\\\"os-R\\'enyi graph; if $P=\\mathcal{N}(\\mu,1)$ and $Q=\\mathcal{N}(0,1)$ with $\\mu>0$, it corresponds to the problem of locating a $K \\times K$ ","authors_text":"Bruce Hajek, Jiaming Xu, Yihong Wu","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-25T19:56:35Z","title":"Information Limits for Recovering a Hidden Community"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07859","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:9eb89ac33d7ffd5dfbcc076f417c74a26bbd9b63ae9a944f7b7efb63e3ad886a","target":"record","created_at":"2026-05-18T01:22:06Z","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":"254f712c09481290dee14e7901c59035f7f4491ac329d36a5aa56a453a257405","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-25T19:56:35Z","title_canon_sha256":"fe0f33396d8f922fc622d0e881734db896bc32b665834f630f1eec4f7b99f134"},"schema_version":"1.0","source":{"id":"1509.07859","kind":"arxiv","version":2}},"canonical_sha256":"362083f5555312e0b5bac7b580bda71a8cded7ca4d683ef9fead6971eb8f354b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"362083f5555312e0b5bac7b580bda71a8cded7ca4d683ef9fead6971eb8f354b","first_computed_at":"2026-05-18T01:22:06.007253Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:06.007253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IG6rqGkaD02KKlTSC0LFSzwTkFQYDRk4k6l2oijlssN9NBQf5lIYDyN2uEK2y1AoMC/dzApZdk0CT+Q9/ImwCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:06.007929Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.07859","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9eb89ac33d7ffd5dfbcc076f417c74a26bbd9b63ae9a944f7b7efb63e3ad886a","sha256:5dcfe74d53eaa5d357ca39dbe4100a891beb4d906aa1655aeab4053313ba4462"],"state_sha256":"922f61537ec67a5dbbd67eae312dd048d943dfa963eca901cb717fd225a202cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cDAOnf8kmoGJ1fkZn53g1Fus/DOjDIoQTLE9qyaQ/SUl9inhEJQyY5ke+Kj3hIgT6eBbeRtW8Qnqqf7QcPHrAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T14:37:02.026786Z","bundle_sha256":"d1ff789ef510dd43d19b80fad52572a3ed5f3f8dc2adff152f7ddf523a791893"}}