{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:55VCDN4PH3DF6J427ZXSUQCJ34","short_pith_number":"pith:55VCDN4P","canonical_record":{"source":{"id":"2210.00453","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-02T07:59:51Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"116972bf72151de4bdb35c8d23bb796c85806cc185889f3d2c71119e3d684d71","abstract_canon_sha256":"6e58ae59aeaf46ccbe0ea4f9814ac61497edb8723976048e0332035aeb14ebf0"},"schema_version":"1.0"},"canonical_sha256":"ef6a21b78f3ec65f279afe6f2a4049df2776c5a7a635b9686bddc803d50f8898","source":{"kind":"arxiv","id":"2210.00453","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.00453","created_at":"2026-07-05T06:42:02Z"},{"alias_kind":"arxiv_version","alias_value":"2210.00453v4","created_at":"2026-07-05T06:42:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.00453","created_at":"2026-07-05T06:42:02Z"},{"alias_kind":"pith_short_12","alias_value":"55VCDN4PH3DF","created_at":"2026-07-05T06:42:02Z"},{"alias_kind":"pith_short_16","alias_value":"55VCDN4PH3DF6J42","created_at":"2026-07-05T06:42:02Z"},{"alias_kind":"pith_short_8","alias_value":"55VCDN4P","created_at":"2026-07-05T06:42:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:55VCDN4PH3DF6J427ZXSUQCJ34","target":"record","payload":{"canonical_record":{"source":{"id":"2210.00453","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-02T07:59:51Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"116972bf72151de4bdb35c8d23bb796c85806cc185889f3d2c71119e3d684d71","abstract_canon_sha256":"6e58ae59aeaf46ccbe0ea4f9814ac61497edb8723976048e0332035aeb14ebf0"},"schema_version":"1.0"},"canonical_sha256":"ef6a21b78f3ec65f279afe6f2a4049df2776c5a7a635b9686bddc803d50f8898","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:42:02.816457Z","signature_b64":"PNAHX7bamWAWT82lfvcx0Dh7po1Ndl9NIpwogTPn21GJPwbN1L2lRdKtgclEyRXdlZBn2/n2f2mqfgr3keZpAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef6a21b78f3ec65f279afe6f2a4049df2776c5a7a635b9686bddc803d50f8898","last_reissued_at":"2026-07-05T06:42:02.816100Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:42:02.816100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2210.00453","source_version":4,"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-05T06:42:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W753tZD/7g+UDt4yJZ4xY8DEDaCiNPo8PhP5fOamRIny7TeNUp1JPjNj7QBxmPSB4QP4t02HIgLUUdgXDYYTCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T17:29:52.494706Z"},"content_sha256":"44ae94e943b61c93aa015c0ea7df2d6a5b64abbece32e71f106bd2cc4a79ae66","schema_version":"1.0","event_id":"sha256:44ae94e943b61c93aa015c0ea7df2d6a5b64abbece32e71f106bd2cc4a79ae66"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:55VCDN4PH3DF6J427ZXSUQCJ34","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neural Graphical Models","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Harsh Shrivastava, Urszula Chajewska","submitted_at":"2022-10-02T07:59:51Z","abstract_excerpt":"Probabilistic Graphical Models are often used to understand dynamics of a system. They can model relationships between features (nodes) and the underlying distribution. Theoretically these models can represent very complex dependency functions, but in practice often simplifying assumptions are made due to computational limitations associated with graph operations. In this work we introduce Neural Graphical Models (NGMs) which attempt to represent complex feature dependencies with reasonable computational costs. Given a graph of feature relationships and corresponding samples, we capture the de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.00453","kind":"arxiv","version":4},"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/2210.00453/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-05T06:42:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tIjayC4wGrKxjj1YhLzT3Ps9AfIXDk2o3Cpk3JyRGy2t3ZIuLsKnfcrPJzr5g3ZFVm2IsXJjzczUhkO77ceLAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T17:29:52.495565Z"},"content_sha256":"59678819acd76362c603bfcd2b0935cc0c955b2f11c5f4b54b3d12538326e228","schema_version":"1.0","event_id":"sha256:59678819acd76362c603bfcd2b0935cc0c955b2f11c5f4b54b3d12538326e228"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/55VCDN4PH3DF6J427ZXSUQCJ34/bundle.json","state_url":"https://pith.science/pith/55VCDN4PH3DF6J427ZXSUQCJ34/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/55VCDN4PH3DF6J427ZXSUQCJ34/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-15T17:29:52Z","links":{"resolver":"https://pith.science/pith/55VCDN4PH3DF6J427ZXSUQCJ34","bundle":"https://pith.science/pith/55VCDN4PH3DF6J427ZXSUQCJ34/bundle.json","state":"https://pith.science/pith/55VCDN4PH3DF6J427ZXSUQCJ34/state.json","well_known_bundle":"https://pith.science/.well-known/pith/55VCDN4PH3DF6J427ZXSUQCJ34/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:55VCDN4PH3DF6J427ZXSUQCJ34","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":"6e58ae59aeaf46ccbe0ea4f9814ac61497edb8723976048e0332035aeb14ebf0","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-02T07:59:51Z","title_canon_sha256":"116972bf72151de4bdb35c8d23bb796c85806cc185889f3d2c71119e3d684d71"},"schema_version":"1.0","source":{"id":"2210.00453","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.00453","created_at":"2026-07-05T06:42:02Z"},{"alias_kind":"arxiv_version","alias_value":"2210.00453v4","created_at":"2026-07-05T06:42:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.00453","created_at":"2026-07-05T06:42:02Z"},{"alias_kind":"pith_short_12","alias_value":"55VCDN4PH3DF","created_at":"2026-07-05T06:42:02Z"},{"alias_kind":"pith_short_16","alias_value":"55VCDN4PH3DF6J42","created_at":"2026-07-05T06:42:02Z"},{"alias_kind":"pith_short_8","alias_value":"55VCDN4P","created_at":"2026-07-05T06:42:02Z"}],"graph_snapshots":[{"event_id":"sha256:59678819acd76362c603bfcd2b0935cc0c955b2f11c5f4b54b3d12538326e228","target":"graph","created_at":"2026-07-05T06:42:02Z","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/2210.00453/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Probabilistic Graphical Models are often used to understand dynamics of a system. They can model relationships between features (nodes) and the underlying distribution. Theoretically these models can represent very complex dependency functions, but in practice often simplifying assumptions are made due to computational limitations associated with graph operations. In this work we introduce Neural Graphical Models (NGMs) which attempt to represent complex feature dependencies with reasonable computational costs. Given a graph of feature relationships and corresponding samples, we capture the de","authors_text":"Harsh Shrivastava, Urszula Chajewska","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-02T07:59:51Z","title":"Neural Graphical Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.00453","kind":"arxiv","version":4},"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:44ae94e943b61c93aa015c0ea7df2d6a5b64abbece32e71f106bd2cc4a79ae66","target":"record","created_at":"2026-07-05T06:42:02Z","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":"6e58ae59aeaf46ccbe0ea4f9814ac61497edb8723976048e0332035aeb14ebf0","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2022-10-02T07:59:51Z","title_canon_sha256":"116972bf72151de4bdb35c8d23bb796c85806cc185889f3d2c71119e3d684d71"},"schema_version":"1.0","source":{"id":"2210.00453","kind":"arxiv","version":4}},"canonical_sha256":"ef6a21b78f3ec65f279afe6f2a4049df2776c5a7a635b9686bddc803d50f8898","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef6a21b78f3ec65f279afe6f2a4049df2776c5a7a635b9686bddc803d50f8898","first_computed_at":"2026-07-05T06:42:02.816100Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:42:02.816100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PNAHX7bamWAWT82lfvcx0Dh7po1Ndl9NIpwogTPn21GJPwbN1L2lRdKtgclEyRXdlZBn2/n2f2mqfgr3keZpAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:42:02.816457Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.00453","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44ae94e943b61c93aa015c0ea7df2d6a5b64abbece32e71f106bd2cc4a79ae66","sha256:59678819acd76362c603bfcd2b0935cc0c955b2f11c5f4b54b3d12538326e228"],"state_sha256":"1dd54d0734d90a6cf527622d9a227f99667f274f7029c81b0539604586a8561a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eha0ywuldrr6ClLNiO1w7fDbdiIaZL7ZM9+oogxcZQ0bfSnq9dMCntTpmeGYGr/QJAn0LyfAzt6oyociTAq6Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T17:29:52.503050Z","bundle_sha256":"d66b66dda4fac6e5410d0261643821f436518f2dd71a509a1cc444cf933b0704"}}