{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4VI7SO2QUFLBJ2MDAOBD24K2XM","short_pith_number":"pith:4VI7SO2Q","canonical_record":{"source":{"id":"1905.07088","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-17T02:02:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"9a01ddcb8f4aecd0ba3c8a52bc3bb262e1db2cdee9768ba417b082e026eaee54","abstract_canon_sha256":"c25995d88d1d1eba68e78aa99e253faf355ad3513edb1bd4446a78298e193121"},"schema_version":"1.0"},"canonical_sha256":"e551f93b50a15614e98303823d715abb1934232d11878b97afa6eac0254a759c","source":{"kind":"arxiv","id":"1905.07088","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07088","created_at":"2026-05-17T23:42:07Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07088v2","created_at":"2026-05-17T23:42:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07088","created_at":"2026-05-17T23:42:07Z"},{"alias_kind":"pith_short_12","alias_value":"4VI7SO2QUFLB","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4VI7SO2QUFLBJ2MD","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4VI7SO2Q","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4VI7SO2QUFLBJ2MDAOBD24K2XM","target":"record","payload":{"canonical_record":{"source":{"id":"1905.07088","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-17T02:02:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"9a01ddcb8f4aecd0ba3c8a52bc3bb262e1db2cdee9768ba417b082e026eaee54","abstract_canon_sha256":"c25995d88d1d1eba68e78aa99e253faf355ad3513edb1bd4446a78298e193121"},"schema_version":"1.0"},"canonical_sha256":"e551f93b50a15614e98303823d715abb1934232d11878b97afa6eac0254a759c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:07.930978Z","signature_b64":"1yCIJ0qd3ytoD3NkAAUAvpmv4uHduYkCAiLFZF+8f0g9LK0O1psQtbDggy871lbVsJh97V1s4GFtespTitDICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e551f93b50a15614e98303823d715abb1934232d11878b97afa6eac0254a759c","last_reissued_at":"2026-05-17T23:42:07.930376Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:07.930376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.07088","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-05-17T23:42:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xon2MRYSbyjx6UxCxf3xe8EawP9ZUgXnORTBnwlpPnwt3zMxdDKg8nX5GCT7xRBXCQgLpQw5ls6ra06EJFzFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:38:00.317521Z"},"content_sha256":"a8b2b24c09814b87b00e9b1f2674abde03f7a3ad273c375bab176060badceb0e","schema_version":"1.0","event_id":"sha256:a8b2b24c09814b87b00e9b1f2674abde03f7a3ad273c375bab176060badceb0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4VI7SO2QUFLBJ2MDAOBD24K2XM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sliced Score Matching: A Scalable Approach to Density and Score Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jiaxin Shi, Sahaj Garg, Stefano Ermon, Yang Song","submitted_at":"2019-05-17T02:02:30Z","abstract_excerpt":"Score matching is a popular method for estimating unnormalized statistical models. However, it has been so far limited to simple, shallow models or low-dimensional data, due to the difficulty of computing the Hessian of log-density functions. We show this difficulty can be mitigated by projecting the scores onto random vectors before comparing them. This objective, called sliced score matching, only involves Hessian-vector products, which can be easily implemented using reverse-mode automatic differentiation. Therefore, sliced score matching is amenable to more complex models and higher dimens"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07088","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":""},"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-05-17T23:42:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"725E0QUNlY+ZWQ3VGzlPbWgrhfV787bkAj4zxfC1ddeq+NMWV7N9BoI6qAftLL+uzp3SlzGFMP05NZfSMARnBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T04:38:00.317905Z"},"content_sha256":"2506247fa5785ebf21f917ea6070dadea7c2a74c0c7d15e0bac4089ec1d28fa1","schema_version":"1.0","event_id":"sha256:2506247fa5785ebf21f917ea6070dadea7c2a74c0c7d15e0bac4089ec1d28fa1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4VI7SO2QUFLBJ2MDAOBD24K2XM/bundle.json","state_url":"https://pith.science/pith/4VI7SO2QUFLBJ2MDAOBD24K2XM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4VI7SO2QUFLBJ2MDAOBD24K2XM/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-06-03T04:38:00Z","links":{"resolver":"https://pith.science/pith/4VI7SO2QUFLBJ2MDAOBD24K2XM","bundle":"https://pith.science/pith/4VI7SO2QUFLBJ2MDAOBD24K2XM/bundle.json","state":"https://pith.science/pith/4VI7SO2QUFLBJ2MDAOBD24K2XM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4VI7SO2QUFLBJ2MDAOBD24K2XM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4VI7SO2QUFLBJ2MDAOBD24K2XM","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":"c25995d88d1d1eba68e78aa99e253faf355ad3513edb1bd4446a78298e193121","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-17T02:02:30Z","title_canon_sha256":"9a01ddcb8f4aecd0ba3c8a52bc3bb262e1db2cdee9768ba417b082e026eaee54"},"schema_version":"1.0","source":{"id":"1905.07088","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07088","created_at":"2026-05-17T23:42:07Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07088v2","created_at":"2026-05-17T23:42:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07088","created_at":"2026-05-17T23:42:07Z"},{"alias_kind":"pith_short_12","alias_value":"4VI7SO2QUFLB","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4VI7SO2QUFLBJ2MD","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4VI7SO2Q","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:2506247fa5785ebf21f917ea6070dadea7c2a74c0c7d15e0bac4089ec1d28fa1","target":"graph","created_at":"2026-05-17T23:42:07Z","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":"Score matching is a popular method for estimating unnormalized statistical models. However, it has been so far limited to simple, shallow models or low-dimensional data, due to the difficulty of computing the Hessian of log-density functions. We show this difficulty can be mitigated by projecting the scores onto random vectors before comparing them. This objective, called sliced score matching, only involves Hessian-vector products, which can be easily implemented using reverse-mode automatic differentiation. Therefore, sliced score matching is amenable to more complex models and higher dimens","authors_text":"Jiaxin Shi, Sahaj Garg, Stefano Ermon, Yang Song","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-17T02:02:30Z","title":"Sliced Score Matching: A Scalable Approach to Density and Score Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07088","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:a8b2b24c09814b87b00e9b1f2674abde03f7a3ad273c375bab176060badceb0e","target":"record","created_at":"2026-05-17T23:42:07Z","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":"c25995d88d1d1eba68e78aa99e253faf355ad3513edb1bd4446a78298e193121","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-17T02:02:30Z","title_canon_sha256":"9a01ddcb8f4aecd0ba3c8a52bc3bb262e1db2cdee9768ba417b082e026eaee54"},"schema_version":"1.0","source":{"id":"1905.07088","kind":"arxiv","version":2}},"canonical_sha256":"e551f93b50a15614e98303823d715abb1934232d11878b97afa6eac0254a759c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e551f93b50a15614e98303823d715abb1934232d11878b97afa6eac0254a759c","first_computed_at":"2026-05-17T23:42:07.930376Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:07.930376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1yCIJ0qd3ytoD3NkAAUAvpmv4uHduYkCAiLFZF+8f0g9LK0O1psQtbDggy871lbVsJh97V1s4GFtespTitDICg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:07.930978Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.07088","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8b2b24c09814b87b00e9b1f2674abde03f7a3ad273c375bab176060badceb0e","sha256:2506247fa5785ebf21f917ea6070dadea7c2a74c0c7d15e0bac4089ec1d28fa1"],"state_sha256":"e3bc8e5cebba46a2aa7f82f8da0615c48ddfd4557bd73dad147236cd72056c2c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1+LV5bqlvtgoy9mKS+cMUzMCF7BB2+kQyGdJW9bC93QuXIR5hy/7Rz+wiftUYTfQKkWd8MU0ojUn6PtEfMipAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T04:38:00.319948Z","bundle_sha256":"306fa8cb51ff788af8640103cbd03cb29511c1b19dc78e25f7e19606b1d04d1e"}}