{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:7Q7NWST5NQXMUDKQPXP3EKGZBW","short_pith_number":"pith:7Q7NWST5","canonical_record":{"source":{"id":"2102.02431","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-04T06:13:52Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"e14efc996659ff45605a37631442a14c53a5fba2203cb2b2379fc6837016d2ac","abstract_canon_sha256":"636eb051558a5709ac5c339c50ac080958fda67adb816fd70aa145b927913360"},"schema_version":"1.0"},"canonical_sha256":"fc3edb4a7d6c2eca0d507ddfb228d90db264bfad4adceb3cdb16910d06bc2dae","source":{"kind":"arxiv","id":"2102.02431","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.02431","created_at":"2026-07-05T03:19:41Z"},{"alias_kind":"arxiv_version","alias_value":"2102.02431v1","created_at":"2026-07-05T03:19:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.02431","created_at":"2026-07-05T03:19:41Z"},{"alias_kind":"pith_short_12","alias_value":"7Q7NWST5NQXM","created_at":"2026-07-05T03:19:41Z"},{"alias_kind":"pith_short_16","alias_value":"7Q7NWST5NQXMUDKQ","created_at":"2026-07-05T03:19:41Z"},{"alias_kind":"pith_short_8","alias_value":"7Q7NWST5","created_at":"2026-07-05T03:19:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:7Q7NWST5NQXMUDKQPXP3EKGZBW","target":"record","payload":{"canonical_record":{"source":{"id":"2102.02431","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-04T06:13:52Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"e14efc996659ff45605a37631442a14c53a5fba2203cb2b2379fc6837016d2ac","abstract_canon_sha256":"636eb051558a5709ac5c339c50ac080958fda67adb816fd70aa145b927913360"},"schema_version":"1.0"},"canonical_sha256":"fc3edb4a7d6c2eca0d507ddfb228d90db264bfad4adceb3cdb16910d06bc2dae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:19:41.824356Z","signature_b64":"L2BxRrvJQ0HOWMLmfWgFqW/CFRsDs/O7gKWE1JLXL6NJSLOvJewKMeIHgFLiEub5yM39/AMmy+4D48vBHLwrAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc3edb4a7d6c2eca0d507ddfb228d90db264bfad4adceb3cdb16910d06bc2dae","last_reissued_at":"2026-07-05T03:19:41.823875Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:19:41.823875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2102.02431","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-07-05T03:19:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6PQslKAJelFmE0TQge8Dak9p2BjnXwBHcdAh3c1aUpXJ7Z9CtUJlxbZExTJyoknGlzsqbw/mBbpHZJOH/VaJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T07:04:27.729025Z"},"content_sha256":"3f04a93fa29ec841eafeb555a10b09dd005e6a4c0f37184184d849436c2d3d7c","schema_version":"1.0","event_id":"sha256:3f04a93fa29ec841eafeb555a10b09dd005e6a4c0f37184184d849436c2d3d7c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:7Q7NWST5NQXMUDKQPXP3EKGZBW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Coding for Model Selection and Anomaly Detection in Gaussian Graphical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Anders Host-Madsen, Andras Bratincsak, June Zhang, Mojtaba Abolfazli","submitted_at":"2021-02-04T06:13:52Z","abstract_excerpt":"A classic application of description length is for model selection with the minimum description length (MDL) principle. The focus of this paper is to extend description length for data analysis beyond simple model selection and sequences of scalars. More specifically, we extend the description length for data analysis in Gaussian graphical models. These are powerful tools to model interactions among variables in a sequence of i.i.d Gaussian data in the form of a graph. Our method uses universal graph coding methods to accurately account for model complexity, and therefore provide a more rigoro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.02431","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2102.02431/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-05T03:19:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"47JvI+RqSzkt5wiKQbMM03gkoAdL2PuAUIA1ygQ8KYXO6hnk8qTX8VRJIFVnEufUJKDzgpJQcfgna5WufPj/AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T07:04:27.729517Z"},"content_sha256":"6f79184c4fe21a5737f9fb46096e617bff7e00d37158f272fc3c1d876a03dce0","schema_version":"1.0","event_id":"sha256:6f79184c4fe21a5737f9fb46096e617bff7e00d37158f272fc3c1d876a03dce0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7Q7NWST5NQXMUDKQPXP3EKGZBW/bundle.json","state_url":"https://pith.science/pith/7Q7NWST5NQXMUDKQPXP3EKGZBW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7Q7NWST5NQXMUDKQPXP3EKGZBW/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-01T07:04:27Z","links":{"resolver":"https://pith.science/pith/7Q7NWST5NQXMUDKQPXP3EKGZBW","bundle":"https://pith.science/pith/7Q7NWST5NQXMUDKQPXP3EKGZBW/bundle.json","state":"https://pith.science/pith/7Q7NWST5NQXMUDKQPXP3EKGZBW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7Q7NWST5NQXMUDKQPXP3EKGZBW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:7Q7NWST5NQXMUDKQPXP3EKGZBW","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":"636eb051558a5709ac5c339c50ac080958fda67adb816fd70aa145b927913360","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-04T06:13:52Z","title_canon_sha256":"e14efc996659ff45605a37631442a14c53a5fba2203cb2b2379fc6837016d2ac"},"schema_version":"1.0","source":{"id":"2102.02431","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.02431","created_at":"2026-07-05T03:19:41Z"},{"alias_kind":"arxiv_version","alias_value":"2102.02431v1","created_at":"2026-07-05T03:19:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.02431","created_at":"2026-07-05T03:19:41Z"},{"alias_kind":"pith_short_12","alias_value":"7Q7NWST5NQXM","created_at":"2026-07-05T03:19:41Z"},{"alias_kind":"pith_short_16","alias_value":"7Q7NWST5NQXMUDKQ","created_at":"2026-07-05T03:19:41Z"},{"alias_kind":"pith_short_8","alias_value":"7Q7NWST5","created_at":"2026-07-05T03:19:41Z"}],"graph_snapshots":[{"event_id":"sha256:6f79184c4fe21a5737f9fb46096e617bff7e00d37158f272fc3c1d876a03dce0","target":"graph","created_at":"2026-07-05T03:19:41Z","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/2102.02431/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A classic application of description length is for model selection with the minimum description length (MDL) principle. The focus of this paper is to extend description length for data analysis beyond simple model selection and sequences of scalars. More specifically, we extend the description length for data analysis in Gaussian graphical models. These are powerful tools to model interactions among variables in a sequence of i.i.d Gaussian data in the form of a graph. Our method uses universal graph coding methods to accurately account for model complexity, and therefore provide a more rigoro","authors_text":"Anders Host-Madsen, Andras Bratincsak, June Zhang, Mojtaba Abolfazli","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-04T06:13:52Z","title":"Graph Coding for Model Selection and Anomaly Detection in Gaussian Graphical Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.02431","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:3f04a93fa29ec841eafeb555a10b09dd005e6a4c0f37184184d849436c2d3d7c","target":"record","created_at":"2026-07-05T03:19:41Z","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":"636eb051558a5709ac5c339c50ac080958fda67adb816fd70aa145b927913360","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-04T06:13:52Z","title_canon_sha256":"e14efc996659ff45605a37631442a14c53a5fba2203cb2b2379fc6837016d2ac"},"schema_version":"1.0","source":{"id":"2102.02431","kind":"arxiv","version":1}},"canonical_sha256":"fc3edb4a7d6c2eca0d507ddfb228d90db264bfad4adceb3cdb16910d06bc2dae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc3edb4a7d6c2eca0d507ddfb228d90db264bfad4adceb3cdb16910d06bc2dae","first_computed_at":"2026-07-05T03:19:41.823875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:19:41.823875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L2BxRrvJQ0HOWMLmfWgFqW/CFRsDs/O7gKWE1JLXL6NJSLOvJewKMeIHgFLiEub5yM39/AMmy+4D48vBHLwrAA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:19:41.824356Z","signed_message":"canonical_sha256_bytes"},"source_id":"2102.02431","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3f04a93fa29ec841eafeb555a10b09dd005e6a4c0f37184184d849436c2d3d7c","sha256:6f79184c4fe21a5737f9fb46096e617bff7e00d37158f272fc3c1d876a03dce0"],"state_sha256":"b9290169f4f426062fa1d20bc471719173bd264de0ae402da549299accdc91c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fWLW7ovb6I4oTASSAtcH+tXobC+NLEE6zF+x19I9Gtfi0eRkpbbMVQ7h5G5iXk010FXzPlvXCfmbbROVDOUHDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T07:04:27.732808Z","bundle_sha256":"6f9f77ff5c9070a487bf504b3f45d927811fd4ae2069b25085c67ac50c76e4c1"}}