{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UTBUGNP55D2VHCFRIHC2IZRJL5","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":"4a31be712019dc99949a406249b9f4734cb849d6d73c82e2c7fc0b9c150d7cbe","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-07-28T06:08:44Z","title_canon_sha256":"40fe98bd0d565e5db723b40c9b698d95c30f81d86d4b17ba66213d8708b79c8d"},"schema_version":"1.0","source":{"id":"1707.09114","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.09114","created_at":"2026-05-18T00:39:17Z"},{"alias_kind":"arxiv_version","alias_value":"1707.09114v1","created_at":"2026-05-18T00:39:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.09114","created_at":"2026-05-18T00:39:17Z"},{"alias_kind":"pith_short_12","alias_value":"UTBUGNP55D2V","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"UTBUGNP55D2VHCFR","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"UTBUGNP5","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:a5c2b4479c019937bd39f3eebf92ffdfcecfe9481e15979356f92f15ee70ac10","target":"graph","created_at":"2026-05-18T00:39: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"},"paper":{"abstract_excerpt":"We consider the problem of undirected graphical model inference. In many applications, instead of perfectly recovering the unknown graph structure, a more realistic goal is to infer some graph invariants (e.g., the maximum degree, the number of connected subgraphs, the number of isolated nodes). In this paper, we propose a new inferential framework for testing nested multiple hypotheses and constructing confidence intervals of the unknown graph invariants under undirected graphical models. Compared to perfect graph recovery, our methods require significantly weaker conditions. This paper makes","authors_text":"Han Liu, Junwei Lu, Matey Neykov","cross_cats":["stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-07-28T06:08:44Z","title":"Adaptive Inferential Method for Monotone Graph Invariants"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.09114","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:8ad56e00d1e97cd05c7922104f54bef9f653325d768f804044ef7d6dd667692e","target":"record","created_at":"2026-05-18T00:39: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":"4a31be712019dc99949a406249b9f4734cb849d6d73c82e2c7fc0b9c150d7cbe","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-07-28T06:08:44Z","title_canon_sha256":"40fe98bd0d565e5db723b40c9b698d95c30f81d86d4b17ba66213d8708b79c8d"},"schema_version":"1.0","source":{"id":"1707.09114","kind":"arxiv","version":1}},"canonical_sha256":"a4c34335fde8f55388b141c5a466295f47d3c445143a005a10e3a4b564f2520f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4c34335fde8f55388b141c5a466295f47d3c445143a005a10e3a4b564f2520f","first_computed_at":"2026-05-18T00:39:17.051546Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:17.051546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C407ChDzq4KBR/PGSp1Ko/09UEkJQqFiQeplAUcOoxMSlyz59A9SCMgKRzNgSqa/W677iehcl6vzg8S5IrBcDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:17.052188Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.09114","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ad56e00d1e97cd05c7922104f54bef9f653325d768f804044ef7d6dd667692e","sha256:a5c2b4479c019937bd39f3eebf92ffdfcecfe9481e15979356f92f15ee70ac10"],"state_sha256":"1d23a015545f0a23d32cbc23f697bd595a00971d7d6466ca3945bd7d11f4058f"}