{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:NRAPWWNHIPC3F62SLP2FHLSGGT","short_pith_number":"pith:NRAPWWNH","canonical_record":{"source":{"id":"1906.09479","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-22T17:57:27Z","cross_cats_sorted":["cs.LG","math.PR"],"title_canon_sha256":"0359433c995267fb64192d2419fa83d3d3bd179b851cf74b2d1c645dd29a63b0","abstract_canon_sha256":"84852faba021c4a9cbca1899546da1ca0cf45080b38aa07e4742b452c21bf6f7"},"schema_version":"1.0"},"canonical_sha256":"6c40fb59a743c5b2fb525bf453ae4634e2b1980d34f6df16dc143e5d3f51e01d","source":{"kind":"arxiv","id":"1906.09479","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.09479","created_at":"2026-05-17T23:42:37Z"},{"alias_kind":"arxiv_version","alias_value":"1906.09479v1","created_at":"2026-05-17T23:42:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09479","created_at":"2026-05-17T23:42:37Z"},{"alias_kind":"pith_short_12","alias_value":"NRAPWWNHIPC3","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NRAPWWNHIPC3F62S","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NRAPWWNH","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:NRAPWWNHIPC3F62SLP2FHLSGGT","target":"record","payload":{"canonical_record":{"source":{"id":"1906.09479","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-22T17:57:27Z","cross_cats_sorted":["cs.LG","math.PR"],"title_canon_sha256":"0359433c995267fb64192d2419fa83d3d3bd179b851cf74b2d1c645dd29a63b0","abstract_canon_sha256":"84852faba021c4a9cbca1899546da1ca0cf45080b38aa07e4742b452c21bf6f7"},"schema_version":"1.0"},"canonical_sha256":"6c40fb59a743c5b2fb525bf453ae4634e2b1980d34f6df16dc143e5d3f51e01d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:37.891149Z","signature_b64":"nbURvF2lkqRhq9Hyc2e27JZHO9qOyd32GyWndutlP78PRge9yg5Xn0zy1W/nSJ8irwpjHENr0WbLP9LZtU47AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c40fb59a743c5b2fb525bf453ae4634e2b1980d34f6df16dc143e5d3f51e01d","last_reissued_at":"2026-05-17T23:42:37.890426Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:37.890426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.09479","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-17T23:42:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N87+fGeyjfSxe+/fQL9qEOWhPtv5a/N52pc8zg2HlQsxjGzV+xk+AehBCMjHaFHuQptqnWURxQGqAXz9EhyuBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:19:02.268938Z"},"content_sha256":"c8ab6a98e7b7f3abb2ab13248b0dd859fc3e2a87b3184a0afe345493faa9c80e","schema_version":"1.0","event_id":"sha256:c8ab6a98e7b7f3abb2ab13248b0dd859fc3e2a87b3184a0afe345493faa9c80e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:NRAPWWNHIPC3F62SLP2FHLSGGT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The non-tightness of the reconstruction threshold of a 4 states symmetric model with different in-block and out-block mutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.PR"],"primary_cat":"stat.ML","authors_text":"Ning Ning, Wenjian Liu","submitted_at":"2019-06-22T17:57:27Z","abstract_excerpt":"The tree reconstruction problem is to collect and analyze massive data at the $n$th level of the tree, to identify whether there is non-vanishing information of the root, as $n$ goes to infinity. Its connection to the clustering problem in the setting of the stochastic block model, which has wide applications in machine learning and data mining, has been well established. For the stochastic block model, an \"information-theoretically-solvable-but-computationally-hard\" region, or say \"hybrid-hard phase\", appears whenever the reconstruction bound is not tight of the corresponding reconstruction o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09479","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-17T23:42:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3psusO4DOQ52JFsuQU4WKZrWC+nU10PJCh+t6jL5aWQ+xkfL9JcqWUSOhb3UErHW4qcuJwEBUwLIYcZ4DR0wDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:19:02.269606Z"},"content_sha256":"283da0e4ee09d32d34afb8bb61452050b3fee11aaf189e7d0bb1c12e082c1d73","schema_version":"1.0","event_id":"sha256:283da0e4ee09d32d34afb8bb61452050b3fee11aaf189e7d0bb1c12e082c1d73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NRAPWWNHIPC3F62SLP2FHLSGGT/bundle.json","state_url":"https://pith.science/pith/NRAPWWNHIPC3F62SLP2FHLSGGT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NRAPWWNHIPC3F62SLP2FHLSGGT/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-26T08:19:02Z","links":{"resolver":"https://pith.science/pith/NRAPWWNHIPC3F62SLP2FHLSGGT","bundle":"https://pith.science/pith/NRAPWWNHIPC3F62SLP2FHLSGGT/bundle.json","state":"https://pith.science/pith/NRAPWWNHIPC3F62SLP2FHLSGGT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NRAPWWNHIPC3F62SLP2FHLSGGT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NRAPWWNHIPC3F62SLP2FHLSGGT","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":"84852faba021c4a9cbca1899546da1ca0cf45080b38aa07e4742b452c21bf6f7","cross_cats_sorted":["cs.LG","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-22T17:57:27Z","title_canon_sha256":"0359433c995267fb64192d2419fa83d3d3bd179b851cf74b2d1c645dd29a63b0"},"schema_version":"1.0","source":{"id":"1906.09479","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.09479","created_at":"2026-05-17T23:42:37Z"},{"alias_kind":"arxiv_version","alias_value":"1906.09479v1","created_at":"2026-05-17T23:42:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09479","created_at":"2026-05-17T23:42:37Z"},{"alias_kind":"pith_short_12","alias_value":"NRAPWWNHIPC3","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NRAPWWNHIPC3F62S","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NRAPWWNH","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:283da0e4ee09d32d34afb8bb61452050b3fee11aaf189e7d0bb1c12e082c1d73","target":"graph","created_at":"2026-05-17T23:42: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":"The tree reconstruction problem is to collect and analyze massive data at the $n$th level of the tree, to identify whether there is non-vanishing information of the root, as $n$ goes to infinity. Its connection to the clustering problem in the setting of the stochastic block model, which has wide applications in machine learning and data mining, has been well established. For the stochastic block model, an \"information-theoretically-solvable-but-computationally-hard\" region, or say \"hybrid-hard phase\", appears whenever the reconstruction bound is not tight of the corresponding reconstruction o","authors_text":"Ning Ning, Wenjian Liu","cross_cats":["cs.LG","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-22T17:57:27Z","title":"The non-tightness of the reconstruction threshold of a 4 states symmetric model with different in-block and out-block mutations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09479","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:c8ab6a98e7b7f3abb2ab13248b0dd859fc3e2a87b3184a0afe345493faa9c80e","target":"record","created_at":"2026-05-17T23:42: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":"84852faba021c4a9cbca1899546da1ca0cf45080b38aa07e4742b452c21bf6f7","cross_cats_sorted":["cs.LG","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-22T17:57:27Z","title_canon_sha256":"0359433c995267fb64192d2419fa83d3d3bd179b851cf74b2d1c645dd29a63b0"},"schema_version":"1.0","source":{"id":"1906.09479","kind":"arxiv","version":1}},"canonical_sha256":"6c40fb59a743c5b2fb525bf453ae4634e2b1980d34f6df16dc143e5d3f51e01d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c40fb59a743c5b2fb525bf453ae4634e2b1980d34f6df16dc143e5d3f51e01d","first_computed_at":"2026-05-17T23:42:37.890426Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:37.890426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nbURvF2lkqRhq9Hyc2e27JZHO9qOyd32GyWndutlP78PRge9yg5Xn0zy1W/nSJ8irwpjHENr0WbLP9LZtU47AQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:37.891149Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.09479","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8ab6a98e7b7f3abb2ab13248b0dd859fc3e2a87b3184a0afe345493faa9c80e","sha256:283da0e4ee09d32d34afb8bb61452050b3fee11aaf189e7d0bb1c12e082c1d73"],"state_sha256":"ce8115c25c983d1447ad4e2a5ef187aa4e4efb34379f22d26a7719a901879e85"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hdqr36M5P8iCB8qHQ4tXL12BnndAfN5cF671v94tCq8vnfYESPcUUvAuKSgF13siq5RtF4i4JvS2VDWaM+FFBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:19:02.273365Z","bundle_sha256":"3526a910a042a6365eda028ebffdb00115eeb7c3e21ea4183016b04fbd56a05c"}}