{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:564KGLOPGFDJD2BG3OCYPFFMTR","short_pith_number":"pith:564KGLOP","canonical_record":{"source":{"id":"2408.15624","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2024-08-28T08:25:03Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"4791a668460c8294e2a49045ca704dc83b3026e8d0c9dc38ce6c35c6616eaac2","abstract_canon_sha256":"11eb0ba715485eb50984fa4f049cf32dfe2145c47d4d81d657df61a08ca28f9e"},"schema_version":"1.0"},"canonical_sha256":"efb8a32dcf314691e826db858794ac9c472fad26871d57e8efe61ed338f17d9c","source":{"kind":"arxiv","id":"2408.15624","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.15624","created_at":"2026-07-05T11:51:17Z"},{"alias_kind":"arxiv_version","alias_value":"2408.15624v2","created_at":"2026-07-05T11:51:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.15624","created_at":"2026-07-05T11:51:17Z"},{"alias_kind":"pith_short_12","alias_value":"564KGLOPGFDJ","created_at":"2026-07-05T11:51:17Z"},{"alias_kind":"pith_short_16","alias_value":"564KGLOPGFDJD2BG","created_at":"2026-07-05T11:51:17Z"},{"alias_kind":"pith_short_8","alias_value":"564KGLOP","created_at":"2026-07-05T11:51:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:564KGLOPGFDJD2BG3OCYPFFMTR","target":"record","payload":{"canonical_record":{"source":{"id":"2408.15624","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2024-08-28T08:25:03Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"4791a668460c8294e2a49045ca704dc83b3026e8d0c9dc38ce6c35c6616eaac2","abstract_canon_sha256":"11eb0ba715485eb50984fa4f049cf32dfe2145c47d4d81d657df61a08ca28f9e"},"schema_version":"1.0"},"canonical_sha256":"efb8a32dcf314691e826db858794ac9c472fad26871d57e8efe61ed338f17d9c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:51:17.129792Z","signature_b64":"EfO/3uKVMtc/urYgYlsGambEsktI1r/u8RxDCvLnOSfPPqaIDY8noK+3yDp4RLIoboFX/GFWM1VS9i7cJZRWAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efb8a32dcf314691e826db858794ac9c472fad26871d57e8efe61ed338f17d9c","last_reissued_at":"2026-07-05T11:51:17.129305Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:51:17.129305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.15624","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-07-05T11:51:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VZ4nelYRnEq01B9g6sk7367Hk56JreG/NvmOIJDXvNY1UDMtHkAh1WIjxoNBDnWL8P1jEwl0PIJi0SXmb4+MAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T13:18:15.812579Z"},"content_sha256":"544dc6b6fd9be6d53af0d6a6e2ffaa3ba4333d940ad120ade5ea2432eafe8e3a","schema_version":"1.0","event_id":"sha256:544dc6b6fd9be6d53af0d6a6e2ffaa3ba4333d940ad120ade5ea2432eafe8e3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:564KGLOPGFDJD2BG3OCYPFFMTR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning latent tree models with small query complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Gabor Lugosi, Luc Devroye, Piotr Zwiernik","submitted_at":"2024-08-28T08:25:03Z","abstract_excerpt":"We consider the problem of structure recovery in a graphical model of a tree where some variables are latent. Specifically, we focus on the Gaussian case, which can be reformulated as a well-studied problem: recovering a semi-labeled tree from a distance metric. We introduce randomized procedures that achieve query complexity of optimal order. Additionally, we provide statistical analysis for scenarios where the tree distances are noisy. The Gaussian setting can be extended to other situations, including the binary case and non-paranormal distributions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.15624","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2408.15624/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:51:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6v8Wnxu8uMvKvKjG5Mdk8BRQrwj7JNZGRwDTLY14vqPeQqXHtbUfd2BZbcFbzPvppM5+FEELY8LlKDTw9mZqDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T13:18:15.812970Z"},"content_sha256":"d70eaa379fad0aa3f42dfd20504c6d7c296a6ca1fb78c974273aa5a22a7da154","schema_version":"1.0","event_id":"sha256:d70eaa379fad0aa3f42dfd20504c6d7c296a6ca1fb78c974273aa5a22a7da154"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/564KGLOPGFDJD2BG3OCYPFFMTR/bundle.json","state_url":"https://pith.science/pith/564KGLOPGFDJD2BG3OCYPFFMTR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/564KGLOPGFDJD2BG3OCYPFFMTR/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-08-06T13:18:15Z","links":{"resolver":"https://pith.science/pith/564KGLOPGFDJD2BG3OCYPFFMTR","bundle":"https://pith.science/pith/564KGLOPGFDJD2BG3OCYPFFMTR/bundle.json","state":"https://pith.science/pith/564KGLOPGFDJD2BG3OCYPFFMTR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/564KGLOPGFDJD2BG3OCYPFFMTR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:564KGLOPGFDJD2BG3OCYPFFMTR","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":"11eb0ba715485eb50984fa4f049cf32dfe2145c47d4d81d657df61a08ca28f9e","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2024-08-28T08:25:03Z","title_canon_sha256":"4791a668460c8294e2a49045ca704dc83b3026e8d0c9dc38ce6c35c6616eaac2"},"schema_version":"1.0","source":{"id":"2408.15624","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.15624","created_at":"2026-07-05T11:51:17Z"},{"alias_kind":"arxiv_version","alias_value":"2408.15624v2","created_at":"2026-07-05T11:51:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.15624","created_at":"2026-07-05T11:51:17Z"},{"alias_kind":"pith_short_12","alias_value":"564KGLOPGFDJ","created_at":"2026-07-05T11:51:17Z"},{"alias_kind":"pith_short_16","alias_value":"564KGLOPGFDJD2BG","created_at":"2026-07-05T11:51:17Z"},{"alias_kind":"pith_short_8","alias_value":"564KGLOP","created_at":"2026-07-05T11:51:17Z"}],"graph_snapshots":[{"event_id":"sha256:d70eaa379fad0aa3f42dfd20504c6d7c296a6ca1fb78c974273aa5a22a7da154","target":"graph","created_at":"2026-07-05T11:51:17Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2408.15624/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of structure recovery in a graphical model of a tree where some variables are latent. Specifically, we focus on the Gaussian case, which can be reformulated as a well-studied problem: recovering a semi-labeled tree from a distance metric. We introduce randomized procedures that achieve query complexity of optimal order. Additionally, we provide statistical analysis for scenarios where the tree distances are noisy. The Gaussian setting can be extended to other situations, including the binary case and non-paranormal distributions.","authors_text":"Gabor Lugosi, Luc Devroye, Piotr Zwiernik","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2024-08-28T08:25:03Z","title":"Learning latent tree models with small query complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.15624","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:544dc6b6fd9be6d53af0d6a6e2ffaa3ba4333d940ad120ade5ea2432eafe8e3a","target":"record","created_at":"2026-07-05T11:51:17Z","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":"11eb0ba715485eb50984fa4f049cf32dfe2145c47d4d81d657df61a08ca28f9e","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2024-08-28T08:25:03Z","title_canon_sha256":"4791a668460c8294e2a49045ca704dc83b3026e8d0c9dc38ce6c35c6616eaac2"},"schema_version":"1.0","source":{"id":"2408.15624","kind":"arxiv","version":2}},"canonical_sha256":"efb8a32dcf314691e826db858794ac9c472fad26871d57e8efe61ed338f17d9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"efb8a32dcf314691e826db858794ac9c472fad26871d57e8efe61ed338f17d9c","first_computed_at":"2026-07-05T11:51:17.129305Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:51:17.129305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EfO/3uKVMtc/urYgYlsGambEsktI1r/u8RxDCvLnOSfPPqaIDY8noK+3yDp4RLIoboFX/GFWM1VS9i7cJZRWAw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:51:17.129792Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.15624","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:544dc6b6fd9be6d53af0d6a6e2ffaa3ba4333d940ad120ade5ea2432eafe8e3a","sha256:d70eaa379fad0aa3f42dfd20504c6d7c296a6ca1fb78c974273aa5a22a7da154"],"state_sha256":"43bfabe2f9d6362f3aa8d9b9571e6b43f20071f683200e5ee9991526f07ce24a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3mpBqumA7HyEkxmhziGsegTPnyeoH9lAbY0Hq3ox+kdWPF7i9MkPLyBm4fD25jAwh7K+XySrObyqRfaH0suDCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T13:18:15.817156Z","bundle_sha256":"78ba691ac70de548a2cdf5ed48eaac7ab816e7507fc1ea09e98c77a6da6412ab"}}