{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:FOTLTGLY4I5C7D5T4LUVXN35PL","short_pith_number":"pith:FOTLTGLY","canonical_record":{"source":{"id":"2211.05690","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2022-11-10T16:50:50Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"d17b8eae345091fe48f10e04fc0fc431568d1606aabc29475680cfe99f9ab2f6","abstract_canon_sha256":"ec5f188641d7ed62d80609a7a7c9eb7f40b54e72f597f7700f1c350e11ed4a89"},"schema_version":"1.0"},"canonical_sha256":"2ba6b99978e23a2f8fb3e2e95bb77d7af662e82b4e55a28fec8f6216b48207c3","source":{"kind":"arxiv","id":"2211.05690","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.05690","created_at":"2026-07-05T08:16:39Z"},{"alias_kind":"arxiv_version","alias_value":"2211.05690v2","created_at":"2026-07-05T08:16:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.05690","created_at":"2026-07-05T08:16:39Z"},{"alias_kind":"pith_short_12","alias_value":"FOTLTGLY4I5C","created_at":"2026-07-05T08:16:39Z"},{"alias_kind":"pith_short_16","alias_value":"FOTLTGLY4I5C7D5T","created_at":"2026-07-05T08:16:39Z"},{"alias_kind":"pith_short_8","alias_value":"FOTLTGLY","created_at":"2026-07-05T08:16:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:FOTLTGLY4I5C7D5T4LUVXN35PL","target":"record","payload":{"canonical_record":{"source":{"id":"2211.05690","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2022-11-10T16:50:50Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"d17b8eae345091fe48f10e04fc0fc431568d1606aabc29475680cfe99f9ab2f6","abstract_canon_sha256":"ec5f188641d7ed62d80609a7a7c9eb7f40b54e72f597f7700f1c350e11ed4a89"},"schema_version":"1.0"},"canonical_sha256":"2ba6b99978e23a2f8fb3e2e95bb77d7af662e82b4e55a28fec8f6216b48207c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:16:39.722994Z","signature_b64":"K8QbOZHHhwW/Em85kADb0DsvqN3UFVHXFNy6giCjVn3afjStAAP1d4kBPh156syHVcdDXHyG/SxesjXLr8xBAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ba6b99978e23a2f8fb3e2e95bb77d7af662e82b4e55a28fec8f6216b48207c3","last_reissued_at":"2026-07-05T08:16:39.722503Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:16:39.722503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.05690","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-05T08:16:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8l8px5F5ergng9dFlkRAid6PcGD1pI97KL+Oe58QIaJpu4XyMUgnK451q+SmX1dtLbYytOpwqCS6BRDyukyuAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T04:54:47.328854Z"},"content_sha256":"905bc2d6449fa04b21e0875244ae8e99d049d5c030d253a2c844acda4971b810","schema_version":"1.0","event_id":"sha256:905bc2d6449fa04b21e0875244ae8e99d049d5c030d253a2c844acda4971b810"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:FOTLTGLY4I5C7D5T4LUVXN35PL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Model Selection of Gaussian Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Abrar Zahin, Gautam Dasarathy, Lalitha Sankar, Oliver Kosut, Rajasekhar Anguluri","submitted_at":"2022-11-10T16:50:50Z","abstract_excerpt":"In Gaussian graphical model selection, noise-corrupted samples present significant challenges. It is known that even minimal amounts of noise can obscure the underlying structure, leading to fundamental identifiability issues. A recent line of work addressing this \"robust model selection\" problem narrows its focus to tree-structured graphical models. Even within this specific class of models, exact structure recovery is shown to be impossible. However, several algorithms have been developed that are known to provably recover the underlying tree-structure up to an (unavoidable) equivalence clas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.05690","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/2211.05690/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-05T08:16:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qdg/ok1jSW+X1KEFdsbBrFZGuIY8mEOJERsnOrEhHFrjiIVQwW+29YYHFTEa8C0yKucK0LAMtlTigJG0ktk2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T04:54:47.329356Z"},"content_sha256":"cf3d9eba0f76432d74d8a7b7ee73321a6d7f44b08c2482666f9ac53a3c12797c","schema_version":"1.0","event_id":"sha256:cf3d9eba0f76432d74d8a7b7ee73321a6d7f44b08c2482666f9ac53a3c12797c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FOTLTGLY4I5C7D5T4LUVXN35PL/bundle.json","state_url":"https://pith.science/pith/FOTLTGLY4I5C7D5T4LUVXN35PL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FOTLTGLY4I5C7D5T4LUVXN35PL/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-01T04:54:47Z","links":{"resolver":"https://pith.science/pith/FOTLTGLY4I5C7D5T4LUVXN35PL","bundle":"https://pith.science/pith/FOTLTGLY4I5C7D5T4LUVXN35PL/bundle.json","state":"https://pith.science/pith/FOTLTGLY4I5C7D5T4LUVXN35PL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FOTLTGLY4I5C7D5T4LUVXN35PL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:FOTLTGLY4I5C7D5T4LUVXN35PL","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":"ec5f188641d7ed62d80609a7a7c9eb7f40b54e72f597f7700f1c350e11ed4a89","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2022-11-10T16:50:50Z","title_canon_sha256":"d17b8eae345091fe48f10e04fc0fc431568d1606aabc29475680cfe99f9ab2f6"},"schema_version":"1.0","source":{"id":"2211.05690","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.05690","created_at":"2026-07-05T08:16:39Z"},{"alias_kind":"arxiv_version","alias_value":"2211.05690v2","created_at":"2026-07-05T08:16:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.05690","created_at":"2026-07-05T08:16:39Z"},{"alias_kind":"pith_short_12","alias_value":"FOTLTGLY4I5C","created_at":"2026-07-05T08:16:39Z"},{"alias_kind":"pith_short_16","alias_value":"FOTLTGLY4I5C7D5T","created_at":"2026-07-05T08:16:39Z"},{"alias_kind":"pith_short_8","alias_value":"FOTLTGLY","created_at":"2026-07-05T08:16:39Z"}],"graph_snapshots":[{"event_id":"sha256:cf3d9eba0f76432d74d8a7b7ee73321a6d7f44b08c2482666f9ac53a3c12797c","target":"graph","created_at":"2026-07-05T08:16:39Z","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/2211.05690/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In Gaussian graphical model selection, noise-corrupted samples present significant challenges. It is known that even minimal amounts of noise can obscure the underlying structure, leading to fundamental identifiability issues. A recent line of work addressing this \"robust model selection\" problem narrows its focus to tree-structured graphical models. Even within this specific class of models, exact structure recovery is shown to be impossible. However, several algorithms have been developed that are known to provably recover the underlying tree-structure up to an (unavoidable) equivalence clas","authors_text":"Abrar Zahin, Gautam Dasarathy, Lalitha Sankar, Oliver Kosut, Rajasekhar Anguluri","cross_cats":["cs.LG","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2022-11-10T16:50:50Z","title":"Robust Model Selection of Gaussian Graphical Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.05690","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:905bc2d6449fa04b21e0875244ae8e99d049d5c030d253a2c844acda4971b810","target":"record","created_at":"2026-07-05T08:16:39Z","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":"ec5f188641d7ed62d80609a7a7c9eb7f40b54e72f597f7700f1c350e11ed4a89","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2022-11-10T16:50:50Z","title_canon_sha256":"d17b8eae345091fe48f10e04fc0fc431568d1606aabc29475680cfe99f9ab2f6"},"schema_version":"1.0","source":{"id":"2211.05690","kind":"arxiv","version":2}},"canonical_sha256":"2ba6b99978e23a2f8fb3e2e95bb77d7af662e82b4e55a28fec8f6216b48207c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ba6b99978e23a2f8fb3e2e95bb77d7af662e82b4e55a28fec8f6216b48207c3","first_computed_at":"2026-07-05T08:16:39.722503Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:16:39.722503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K8QbOZHHhwW/Em85kADb0DsvqN3UFVHXFNy6giCjVn3afjStAAP1d4kBPh156syHVcdDXHyG/SxesjXLr8xBAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:16:39.722994Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.05690","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:905bc2d6449fa04b21e0875244ae8e99d049d5c030d253a2c844acda4971b810","sha256:cf3d9eba0f76432d74d8a7b7ee73321a6d7f44b08c2482666f9ac53a3c12797c"],"state_sha256":"fa15d6e820e7fee61d6d0f7c5360d2b2a5b4d737976c05d9348487bb5885dee2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/8/MWHYmnBc9tMPIxcsSH3hYBaPDM6Ut9OKBP8TZcVRNqSkGVFKH9CFN2FgZThOrN/jK3p56nLlbI9MIgqY1DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T04:54:47.333703Z","bundle_sha256":"002b8afff444b6fb334e2b0d7c778067b01b87521fee38101cc9a6a76b5e0b4a"}}