{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:J5PABD3MU3ABRAIXGJFB7RTASU","short_pith_number":"pith:J5PABD3M","schema_version":"1.0","canonical_sha256":"4f5e008f6ca6c0188117324a1fc660951ad5eb6ebd1713ce5059fa9f4447ce39","source":{"kind":"arxiv","id":"1811.03744","version":1},"attestation_state":"computed","paper":{"title":"Density estimation for shift-invariant multidimensional distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Anindya De, Philip M. Long, Rocco A. Servedio","submitted_at":"2018-11-09T02:29:43Z","abstract_excerpt":"We study density estimation for classes of shift-invariant distributions over $\\mathbb{R}^d$. A multidimensional distribution is \"shift-invariant\" if, roughly speaking, it is close in total variation distance to a small shift of it in any direction. Shift-invariance relaxes smoothness assumptions commonly used in non-parametric density estimation to allow jump discontinuities. The different classes of distributions that we consider correspond to different rates of tail decay.\n  For each such class we give an efficient algorithm that learns any distribution in the class from independent samples"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1811.03744","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-09T02:29:43Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"cb91b933dd8cd66fe877d6951458f7b09e1aa74f49266f0c15ba652cd35b1cd1","abstract_canon_sha256":"80b7bf4ecfb5232883367097c10cdc20387ae35c8a78cc8d88e1e835688d960b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:12.147524Z","signature_b64":"RPlrrJuglKe+DpJBZGVJtDdIJRX0kg57QkKgLbCKVcF6JoS+M0Hx7er1PQAx237C/PS838JeyQ5Cvio6FqqNDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f5e008f6ca6c0188117324a1fc660951ad5eb6ebd1713ce5059fa9f4447ce39","last_reissued_at":"2026-05-18T00:01:12.146940Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:12.146940Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Density estimation for shift-invariant multidimensional distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Anindya De, Philip M. Long, Rocco A. Servedio","submitted_at":"2018-11-09T02:29:43Z","abstract_excerpt":"We study density estimation for classes of shift-invariant distributions over $\\mathbb{R}^d$. A multidimensional distribution is \"shift-invariant\" if, roughly speaking, it is close in total variation distance to a small shift of it in any direction. Shift-invariance relaxes smoothness assumptions commonly used in non-parametric density estimation to allow jump discontinuities. The different classes of distributions that we consider correspond to different rates of tail decay.\n  For each such class we give an efficient algorithm that learns any distribution in the class from independent samples"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03744","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.03744","created_at":"2026-05-18T00:01:12.147053+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.03744v1","created_at":"2026-05-18T00:01:12.147053+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03744","created_at":"2026-05-18T00:01:12.147053+00:00"},{"alias_kind":"pith_short_12","alias_value":"J5PABD3MU3AB","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"J5PABD3MU3ABRAIX","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"J5PABD3M","created_at":"2026-05-18T12:32:31.084164+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.08306","citing_title":"A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J5PABD3MU3ABRAIXGJFB7RTASU","json":"https://pith.science/pith/J5PABD3MU3ABRAIXGJFB7RTASU.json","graph_json":"https://pith.science/api/pith-number/J5PABD3MU3ABRAIXGJFB7RTASU/graph.json","events_json":"https://pith.science/api/pith-number/J5PABD3MU3ABRAIXGJFB7RTASU/events.json","paper":"https://pith.science/paper/J5PABD3M"},"agent_actions":{"view_html":"https://pith.science/pith/J5PABD3MU3ABRAIXGJFB7RTASU","download_json":"https://pith.science/pith/J5PABD3MU3ABRAIXGJFB7RTASU.json","view_paper":"https://pith.science/paper/J5PABD3M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.03744&json=true","fetch_graph":"https://pith.science/api/pith-number/J5PABD3MU3ABRAIXGJFB7RTASU/graph.json","fetch_events":"https://pith.science/api/pith-number/J5PABD3MU3ABRAIXGJFB7RTASU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J5PABD3MU3ABRAIXGJFB7RTASU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J5PABD3MU3ABRAIXGJFB7RTASU/action/storage_attestation","attest_author":"https://pith.science/pith/J5PABD3MU3ABRAIXGJFB7RTASU/action/author_attestation","sign_citation":"https://pith.science/pith/J5PABD3MU3ABRAIXGJFB7RTASU/action/citation_signature","submit_replication":"https://pith.science/pith/J5PABD3MU3ABRAIXGJFB7RTASU/action/replication_record"}},"created_at":"2026-05-18T00:01:12.147053+00:00","updated_at":"2026-05-18T00:01:12.147053+00:00"}