{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:QUHDCVBXO645JMYQPSSBC6VYFB","short_pith_number":"pith:QUHDCVBX","canonical_record":{"source":{"id":"2605.14168","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T22:48:18Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"f21fdc78864aed1b0a22599ee18ecb2c375b5c433c0cb8406f5d2849f3dd1163","abstract_canon_sha256":"bae6b23f8fd3863b10e6c610253028878a8f78ba61ee60d7321c29bb4d18b304"},"schema_version":"1.0"},"canonical_sha256":"850e31543777b9d4b3107ca4117ab82860e561f8283e93c4da206b2d9d555840","source":{"kind":"arxiv","id":"2605.14168","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14168","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14168v1","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14168","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"QUHDCVBXO645","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"QUHDCVBXO645JMYQ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"QUHDCVBX","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:QUHDCVBXO645JMYQPSSBC6VYFB","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14168","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T22:48:18Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"f21fdc78864aed1b0a22599ee18ecb2c375b5c433c0cb8406f5d2849f3dd1163","abstract_canon_sha256":"bae6b23f8fd3863b10e6c610253028878a8f78ba61ee60d7321c29bb4d18b304"},"schema_version":"1.0"},"canonical_sha256":"850e31543777b9d4b3107ca4117ab82860e561f8283e93c4da206b2d9d555840","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:11.389258Z","signature_b64":"G4yB6O70CSDkFIIA+iD6Vwy7DBIs3WTjYOcIgkYCjrgJ0KJfOgBN6WWZeBCnqkRfgin5u4qZv9tWwHJaK/hgAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"850e31543777b9d4b3107ca4117ab82860e561f8283e93c4da206b2d9d555840","last_reissued_at":"2026-05-17T23:39:11.388621Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:11.388621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14168","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-05-17T23:39:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hASRhTtW96uYFzKX+5pystGsEbxgfFnC22SeCpLW/4+gasF9Q/S2/8dNMAh6pRWl04wgqsjPq8pwt5nHcvVXDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T06:36:24.729922Z"},"content_sha256":"5bca9306f458e7f2810641bf9dd8c682aed3193458d9e5cb2beceedf8af3ac72","schema_version":"1.0","event_id":"sha256:5bca9306f458e7f2810641bf9dd8c682aed3193458d9e5cb2beceedf8af3ac72"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:QUHDCVBXO645JMYQPSSBC6VYFB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finite Sample Bounds for Learning with Score Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Score matching provides the first non-asymptotic sample bounds with polynomial dependence on dimension for exponential families of polynomials.","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Abhijith Jayakumar, Andrey Y. Lokhov, Devin Smedira, Marc Vuffray, Sidhant Misra","submitted_at":"2026-05-13T22:48:18Z","abstract_excerpt":"Learning of continuous exponential family distributions with unbounded support remains an important area of research for both theory and applications in high-dimensional statistics. In recent years, score matching has become a widely used method for learning exponential families with continuous variables due to its computational ease when compared against maximum likelihood estimation. However, theoretical understanding of the statistical properties of score matching is still lacking. In this work, we provide a non-asymptotic sample complexity analysis for learning the structure of exponential"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"we provide a non-asymptotic sample complexity analysis for learning the structure of exponential families of polynomials with score matching. The derived sample bounds show a polynomial dependence on the model dimension. These bounds are the first of its kind, as all prior work has shown only asymptotic bounds on the sample complexity.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The target distribution exactly belongs to the exponential family of polynomials with unbounded support, and standard regularity conditions on the score function and Fisher information hold so that the derived polynomial sample bounds are valid.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"First non-asymptotic sample complexity bounds for structure learning of polynomial exponential families via score matching, with polynomial dependence on model dimension.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Score matching provides the first non-asymptotic sample bounds with polynomial dependence on dimension for exponential families of polynomials.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"b4b9f64f2667bb24e47e71b7ed606232ec6e876c225fbb4c821c2843c358f34e"},"source":{"id":"2605.14168","kind":"arxiv","version":1},"verdict":{"id":"3803d5f9-9082-43bb-aa58-b197e8498c3b","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T04:54:16.196293Z","strongest_claim":"we provide a non-asymptotic sample complexity analysis for learning the structure of exponential families of polynomials with score matching. The derived sample bounds show a polynomial dependence on the model dimension. These bounds are the first of its kind, as all prior work has shown only asymptotic bounds on the sample complexity.","one_line_summary":"First non-asymptotic sample complexity bounds for structure learning of polynomial exponential families via score matching, with polynomial dependence on model dimension.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The target distribution exactly belongs to the exponential family of polynomials with unbounded support, and standard regularity conditions on the score function and Fisher information hold so that the derived polynomial sample bounds are valid.","pith_extraction_headline":"Score matching provides the first non-asymptotic sample bounds with polynomial dependence on dimension for exponential families of polynomials."},"references":{"count":30,"sample":[{"doi":"","year":null,"title":"Convergence of diffusion models under the manifold hypothesis in high-dimensions","work_id":"9f354366-5e29-4434-bea2-32e9b71b2c6a","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"International Conference on Machine Learning , pages=","work_id":"25267bfd-f675-4749-b431-c524567135c0","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"International conference on artificial intelligence and statistics , pages=","work_id":"9730ae5c-5630-48a4-ba3c-aa372aabc18f","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"arXiv preprint arXiv:2512.24378 , year=","work_id":"5491c843-3df0-40ec-b40d-e1a4e0b25010","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"The Thirty Eighth Annual Conference on Learning Theory , pages=","work_id":"02f35a26-cabe-443e-8524-da89344f2403","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":30,"snapshot_sha256":"f7bea36d0558b504647195d93aab815f8c6ca090d4f14c9c69c724264a56d414","internal_anchors":1},"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":"3803d5f9-9082-43bb-aa58-b197e8498c3b"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tsjO62vn5blRgmtRgk2DUE+mPNixX8AVjJy8bSBLqZ2ae+W4/b1qeE/Gk2Vh7fKMUCXR0fDm941KwAM7zLuoDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T06:36:24.731005Z"},"content_sha256":"13d36822772f855113ad621ec2ae9a8a9d8cce5682edbcb4f766ee3a610d9371","schema_version":"1.0","event_id":"sha256:13d36822772f855113ad621ec2ae9a8a9d8cce5682edbcb4f766ee3a610d9371"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QUHDCVBXO645JMYQPSSBC6VYFB/bundle.json","state_url":"https://pith.science/pith/QUHDCVBXO645JMYQPSSBC6VYFB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QUHDCVBXO645JMYQPSSBC6VYFB/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-05-25T06:36:24Z","links":{"resolver":"https://pith.science/pith/QUHDCVBXO645JMYQPSSBC6VYFB","bundle":"https://pith.science/pith/QUHDCVBXO645JMYQPSSBC6VYFB/bundle.json","state":"https://pith.science/pith/QUHDCVBXO645JMYQPSSBC6VYFB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QUHDCVBXO645JMYQPSSBC6VYFB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QUHDCVBXO645JMYQPSSBC6VYFB","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":"bae6b23f8fd3863b10e6c610253028878a8f78ba61ee60d7321c29bb4d18b304","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T22:48:18Z","title_canon_sha256":"f21fdc78864aed1b0a22599ee18ecb2c375b5c433c0cb8406f5d2849f3dd1163"},"schema_version":"1.0","source":{"id":"2605.14168","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14168","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14168v1","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14168","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"QUHDCVBXO645","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"QUHDCVBXO645JMYQ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"QUHDCVBX","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:13d36822772f855113ad621ec2ae9a8a9d8cce5682edbcb4f766ee3a610d9371","target":"graph","created_at":"2026-05-17T23:39:11Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"we provide a non-asymptotic sample complexity analysis for learning the structure of exponential families of polynomials with score matching. The derived sample bounds show a polynomial dependence on the model dimension. These bounds are the first of its kind, as all prior work has shown only asymptotic bounds on the sample complexity."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The target distribution exactly belongs to the exponential family of polynomials with unbounded support, and standard regularity conditions on the score function and Fisher information hold so that the derived polynomial sample bounds are valid."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"First non-asymptotic sample complexity bounds for structure learning of polynomial exponential families via score matching, with polynomial dependence on model dimension."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Score matching provides the first non-asymptotic sample bounds with polynomial dependence on dimension for exponential families of polynomials."}],"snapshot_sha256":"b4b9f64f2667bb24e47e71b7ed606232ec6e876c225fbb4c821c2843c358f34e"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Learning of continuous exponential family distributions with unbounded support remains an important area of research for both theory and applications in high-dimensional statistics. In recent years, score matching has become a widely used method for learning exponential families with continuous variables due to its computational ease when compared against maximum likelihood estimation. However, theoretical understanding of the statistical properties of score matching is still lacking. In this work, we provide a non-asymptotic sample complexity analysis for learning the structure of exponential","authors_text":"Abhijith Jayakumar, Andrey Y. Lokhov, Devin Smedira, Marc Vuffray, Sidhant Misra","cross_cats":["cs.DS","stat.ML"],"headline":"Score matching provides the first non-asymptotic sample bounds with polynomial dependence on dimension for exponential families of polynomials.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T22:48:18Z","title":"Finite Sample Bounds for Learning with Score Matching"},"references":{"count":30,"internal_anchors":1,"resolved_work":30,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Convergence of diffusion models under the manifold hypothesis in high-dimensions","work_id":"9f354366-5e29-4434-bea2-32e9b71b2c6a","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"International Conference on Machine Learning , pages=","work_id":"25267bfd-f675-4749-b431-c524567135c0","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"International conference on artificial intelligence and statistics , pages=","work_id":"9730ae5c-5630-48a4-ba3c-aa372aabc18f","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"arXiv preprint arXiv:2512.24378 , year=","work_id":"5491c843-3df0-40ec-b40d-e1a4e0b25010","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"The Thirty Eighth Annual Conference on Learning Theory , pages=","work_id":"02f35a26-cabe-443e-8524-da89344f2403","year":2025}],"snapshot_sha256":"f7bea36d0558b504647195d93aab815f8c6ca090d4f14c9c69c724264a56d414"},"source":{"id":"2605.14168","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T04:54:16.196293Z","id":"3803d5f9-9082-43bb-aa58-b197e8498c3b","model_set":{"reader":"grok-4.3"},"one_line_summary":"First non-asymptotic sample complexity bounds for structure learning of polynomial exponential families via score matching, with polynomial dependence on model dimension.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Score matching provides the first non-asymptotic sample bounds with polynomial dependence on dimension for exponential families of polynomials.","strongest_claim":"we provide a non-asymptotic sample complexity analysis for learning the structure of exponential families of polynomials with score matching. The derived sample bounds show a polynomial dependence on the model dimension. These bounds are the first of its kind, as all prior work has shown only asymptotic bounds on the sample complexity.","weakest_assumption":"The target distribution exactly belongs to the exponential family of polynomials with unbounded support, and standard regularity conditions on the score function and Fisher information hold so that the derived polynomial sample bounds are valid."}},"verdict_id":"3803d5f9-9082-43bb-aa58-b197e8498c3b"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5bca9306f458e7f2810641bf9dd8c682aed3193458d9e5cb2beceedf8af3ac72","target":"record","created_at":"2026-05-17T23:39:11Z","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":"bae6b23f8fd3863b10e6c610253028878a8f78ba61ee60d7321c29bb4d18b304","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T22:48:18Z","title_canon_sha256":"f21fdc78864aed1b0a22599ee18ecb2c375b5c433c0cb8406f5d2849f3dd1163"},"schema_version":"1.0","source":{"id":"2605.14168","kind":"arxiv","version":1}},"canonical_sha256":"850e31543777b9d4b3107ca4117ab82860e561f8283e93c4da206b2d9d555840","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"850e31543777b9d4b3107ca4117ab82860e561f8283e93c4da206b2d9d555840","first_computed_at":"2026-05-17T23:39:11.388621Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:11.388621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G4yB6O70CSDkFIIA+iD6Vwy7DBIs3WTjYOcIgkYCjrgJ0KJfOgBN6WWZeBCnqkRfgin5u4qZv9tWwHJaK/hgAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:11.389258Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14168","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5bca9306f458e7f2810641bf9dd8c682aed3193458d9e5cb2beceedf8af3ac72","sha256:13d36822772f855113ad621ec2ae9a8a9d8cce5682edbcb4f766ee3a610d9371"],"state_sha256":"c0cd61ea5029eca9d7f7ae318b539ddb041547e866aa84d0c20d258e989b92fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+vbNfuo87KxyhAeWKGTxjMyIQ7qzOJepCaqZZXsFCtbdUiAQo188I9P9RA9IzccMzgmLeCzrerG9yEjQrbKhAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T06:36:24.735707Z","bundle_sha256":"a6817364bcc24753f1eeca34cb699479f80d9c403b85e94c3ebd2083cccf1095"}}