{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MFYYYS7TFK7WGRFHBMOYKVZZ2K","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":"6fe3adc17cd40a43567ec54e86c84bc4480bbf6c5dce023de59ac2a62d1e26f3","cross_cats_sorted":["math.PR","stat.ME"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.CO","submitted_at":"2026-06-18T08:04:12Z","title_canon_sha256":"ed6cf551c49e1950d2edd7ff7d1204d5123a1670eeb34b6b0cb9758a29908429"},"schema_version":"1.0","source":{"id":"2606.19909","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.19909","created_at":"2026-06-19T16:12:38Z"},{"alias_kind":"arxiv_version","alias_value":"2606.19909v1","created_at":"2026-06-19T16:12:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.19909","created_at":"2026-06-19T16:12:38Z"},{"alias_kind":"pith_short_12","alias_value":"MFYYYS7TFK7W","created_at":"2026-06-19T16:12:38Z"},{"alias_kind":"pith_short_16","alias_value":"MFYYYS7TFK7WGRFH","created_at":"2026-06-19T16:12:38Z"},{"alias_kind":"pith_short_8","alias_value":"MFYYYS7T","created_at":"2026-06-19T16:12:38Z"}],"graph_snapshots":[{"event_id":"sha256:9ebc401bbb91ea20d3cb348085c0afe7c5399b6faeeb8edfb6f6584f99ec498f","target":"graph","created_at":"2026-06-19T16:12:38Z","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/2606.19909/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Augustin Chevallier","cross_cats":["math.PR","stat.ME"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.CO","submitted_at":"2026-06-18T08:04:12Z","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"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.19909","kind":"arxiv","version":1},"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:66539e2d9371712fb41681fe936edbc67fa0e01fdc70e5dc29a57b7b16ee6f1a","target":"record","created_at":"2026-06-19T16:12:38Z","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":"6fe3adc17cd40a43567ec54e86c84bc4480bbf6c5dce023de59ac2a62d1e26f3","cross_cats_sorted":["math.PR","stat.ME"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.CO","submitted_at":"2026-06-18T08:04:12Z","title_canon_sha256":"ed6cf551c49e1950d2edd7ff7d1204d5123a1670eeb34b6b0cb9758a29908429"},"schema_version":"1.0","source":{"id":"2606.19909","kind":"arxiv","version":1}},"canonical_sha256":"61718c4bf32abf6344a70b1d855739d2866dc336f0b04d70bbf075bffee1ba4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"61718c4bf32abf6344a70b1d855739d2866dc336f0b04d70bbf075bffee1ba4a","first_computed_at":"2026-06-19T16:12:38.422485Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:12:38.422485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ajk1R5crTsya1YVNB6/sdslfkqK/WLrCj4JBvehC2J5s4GFwHpsP//4OW4nM1fN7C1XK4YllGcJfxo6TM62LAA==","signature_status":"signed_v1","signed_at":"2026-06-19T16:12:38.422869Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.19909","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66539e2d9371712fb41681fe936edbc67fa0e01fdc70e5dc29a57b7b16ee6f1a","sha256:9ebc401bbb91ea20d3cb348085c0afe7c5399b6faeeb8edfb6f6584f99ec498f"],"state_sha256":"36caa99414a4a9152697658de16f09bdbfea6ef536972f3e167e467129f74112"}