{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MFYYYS7TFK7WGRFHBMOYKVZZ2K","short_pith_number":"pith:MFYYYS7T","schema_version":"1.0","canonical_sha256":"61718c4bf32abf6344a70b1d855739d2866dc336f0b04d70bbf075bffee1ba4a","source":{"kind":"arxiv","id":"2606.19909","version":1},"attestation_state":"computed","paper":{"title":"Establishing an $\\Omega(\\sqrt{d})$ complexity lower bound for PDMP samplers and how to break it: a sub-$\\sqrt{d}$ algorithm for Gaussian-tailed targets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR","stat.ME"],"primary_cat":"stat.CO","authors_text":"Augustin Chevallier","submitted_at":"2026-06-18T08:04:12Z","abstract_excerpt":"Despite the theoretical appeal of their non-reversibility, to date, no Piecewise Deterministic Markov Process (PDMP) samplers have been developed that scale better than $\\mathcal{O}(\\sqrt{d})$ in computational complexity with respect to the target dimension $d$. We prove that this is a fundamental limitation by establishing an $\\Omega(\\sqrt{d})$ lower bound on the algorithmic complexity of PDMP samplers in a standard setup. By relaxing the assumption that the target density must remain invariant at all continuous times, we then demonstrate how to bypass this barrier. Specifically, we introduce"},"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":"2606.19909","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.CO","submitted_at":"2026-06-18T08:04:12Z","cross_cats_sorted":["math.PR","stat.ME"],"title_canon_sha256":"ed6cf551c49e1950d2edd7ff7d1204d5123a1670eeb34b6b0cb9758a29908429","abstract_canon_sha256":"6fe3adc17cd40a43567ec54e86c84bc4480bbf6c5dce023de59ac2a62d1e26f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:12:38.422869Z","signature_b64":"Ajk1R5crTsya1YVNB6/sdslfkqK/WLrCj4JBvehC2J5s4GFwHpsP//4OW4nM1fN7C1XK4YllGcJfxo6TM62LAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61718c4bf32abf6344a70b1d855739d2866dc336f0b04d70bbf075bffee1ba4a","last_reissued_at":"2026-06-19T16:12:38.422485Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:12:38.422485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Establishing an $\\Omega(\\sqrt{d})$ complexity lower bound for PDMP samplers and how to break it: a sub-$\\sqrt{d}$ algorithm for Gaussian-tailed targets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.PR","stat.ME"],"primary_cat":"stat.CO","authors_text":"Augustin Chevallier","submitted_at":"2026-06-18T08:04:12Z","abstract_excerpt":"Despite the theoretical appeal of their non-reversibility, to date, no Piecewise Deterministic Markov Process (PDMP) samplers have been developed that scale better than $\\mathcal{O}(\\sqrt{d})$ in computational complexity with respect to the target dimension $d$. We prove that this is a fundamental limitation by establishing an $\\Omega(\\sqrt{d})$ lower bound on the algorithmic complexity of PDMP samplers in a standard setup. By relaxing the assumption that the target density must remain invariant at all continuous times, we then demonstrate how to bypass this barrier. Specifically, we introduce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.19909","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/2606.19909/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.19909","created_at":"2026-06-19T16:12:38.422546+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.19909v1","created_at":"2026-06-19T16:12:38.422546+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.19909","created_at":"2026-06-19T16:12:38.422546+00:00"},{"alias_kind":"pith_short_12","alias_value":"MFYYYS7TFK7W","created_at":"2026-06-19T16:12:38.422546+00:00"},{"alias_kind":"pith_short_16","alias_value":"MFYYYS7TFK7WGRFH","created_at":"2026-06-19T16:12:38.422546+00:00"},{"alias_kind":"pith_short_8","alias_value":"MFYYYS7T","created_at":"2026-06-19T16:12:38.422546+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MFYYYS7TFK7WGRFHBMOYKVZZ2K","json":"https://pith.science/pith/MFYYYS7TFK7WGRFHBMOYKVZZ2K.json","graph_json":"https://pith.science/api/pith-number/MFYYYS7TFK7WGRFHBMOYKVZZ2K/graph.json","events_json":"https://pith.science/api/pith-number/MFYYYS7TFK7WGRFHBMOYKVZZ2K/events.json","paper":"https://pith.science/paper/MFYYYS7T"},"agent_actions":{"view_html":"https://pith.science/pith/MFYYYS7TFK7WGRFHBMOYKVZZ2K","download_json":"https://pith.science/pith/MFYYYS7TFK7WGRFHBMOYKVZZ2K.json","view_paper":"https://pith.science/paper/MFYYYS7T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.19909&json=true","fetch_graph":"https://pith.science/api/pith-number/MFYYYS7TFK7WGRFHBMOYKVZZ2K/graph.json","fetch_events":"https://pith.science/api/pith-number/MFYYYS7TFK7WGRFHBMOYKVZZ2K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MFYYYS7TFK7WGRFHBMOYKVZZ2K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MFYYYS7TFK7WGRFHBMOYKVZZ2K/action/storage_attestation","attest_author":"https://pith.science/pith/MFYYYS7TFK7WGRFHBMOYKVZZ2K/action/author_attestation","sign_citation":"https://pith.science/pith/MFYYYS7TFK7WGRFHBMOYKVZZ2K/action/citation_signature","submit_replication":"https://pith.science/pith/MFYYYS7TFK7WGRFHBMOYKVZZ2K/action/replication_record"}},"created_at":"2026-06-19T16:12:38.422546+00:00","updated_at":"2026-06-19T16:12:38.422546+00:00"}