{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NGQIJQGH2NFN2U3E2IFVJUTYKM","short_pith_number":"pith:NGQIJQGH","canonical_record":{"source":{"id":"1407.0241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-07-01T13:52:16Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"2bcfae15c2f54be8362e13ef72fdf7942904640df2d56dbee85ffcdb855d5c52","abstract_canon_sha256":"8c4396e4bd9973a25a7ca428b30803de06c34dbfb51476874ed2bc86f4d028f7"},"schema_version":"1.0"},"canonical_sha256":"69a084c0c7d34add5364d20b54d27853110c1d0d89c5a97aa0c5648e77ccce6b","source":{"kind":"arxiv","id":"1407.0241","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.0241","created_at":"2026-05-18T02:48:34Z"},{"alias_kind":"arxiv_version","alias_value":"1407.0241v1","created_at":"2026-05-18T02:48:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0241","created_at":"2026-05-18T02:48:34Z"},{"alias_kind":"pith_short_12","alias_value":"NGQIJQGH2NFN","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NGQIJQGH2NFN2U3E","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NGQIJQGH","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NGQIJQGH2NFN2U3E2IFVJUTYKM","target":"record","payload":{"canonical_record":{"source":{"id":"1407.0241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-07-01T13:52:16Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"2bcfae15c2f54be8362e13ef72fdf7942904640df2d56dbee85ffcdb855d5c52","abstract_canon_sha256":"8c4396e4bd9973a25a7ca428b30803de06c34dbfb51476874ed2bc86f4d028f7"},"schema_version":"1.0"},"canonical_sha256":"69a084c0c7d34add5364d20b54d27853110c1d0d89c5a97aa0c5648e77ccce6b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:34.674638Z","signature_b64":"hWAktjTWNCSlg1a7DUYV9QgAQSHbR18+nzBt8u+9C0+v9g8SsZ1TbFH+XsHZ8ArIp7d4LTicEIJxJIkP9qdpCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69a084c0c7d34add5364d20b54d27853110c1d0d89c5a97aa0c5648e77ccce6b","last_reissued_at":"2026-05-18T02:48:34.673786Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:34.673786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.0241","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-18T02:48:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fXc4tXkCfqJWuuB5COq93jsi3lJ2JE1XdofG+0++X4mPvXYelfzFtG7+FDm/kncz1aNbdgXyKAOzZgFnBpq3Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T16:06:17.258418Z"},"content_sha256":"1a0c60b7b113f9bb5939ba3d7b4e1d8ba93221593335555a721246bdae068b46","schema_version":"1.0","event_id":"sha256:1a0c60b7b113f9bb5939ba3d7b4e1d8ba93221593335555a721246bdae068b46"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NGQIJQGH2NFN2U3E2IFVJUTYKM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotic lower bounds in estimating jumps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Arnaud Gloter, Emmanuelle Cl\\'ement, Sylvain Delattre","submitted_at":"2014-07-01T13:52:16Z","abstract_excerpt":"We study the problem of the efficient estimation of the jumps for stochastic processes. We assume that the stochastic jump process $(X_t)_{t\\in[0,1]}$ is observed discretely, with a sampling step of size $1/n$. In the spirit of Hajek's convolution theorem, we show some lower bounds for the estimation error of the sequence of the jumps $(\\Delta X_{T_k})_k$. As an intermediate result, we prove a LAMN property, with rate $\\sqrt{n}$, when the marks of the underlying jump component are deterministic. We deduce then a convolution theorem, with an explicit asymptotic minimal variance, in the case whe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0241","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"},"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-18T02:48:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jhLAzUtgEoGy14gDH2tiWMRcypoS7fjk3n23ss7mo9Q/0rnEGeX+Ke14PtsBt+A5nczsB2Jtxdg2+iMVdqckBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T16:06:17.258785Z"},"content_sha256":"dcb478962ad2f276917d6ec3bf67bb8138d6a784db2441aa96858de8aecec5d6","schema_version":"1.0","event_id":"sha256:dcb478962ad2f276917d6ec3bf67bb8138d6a784db2441aa96858de8aecec5d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NGQIJQGH2NFN2U3E2IFVJUTYKM/bundle.json","state_url":"https://pith.science/pith/NGQIJQGH2NFN2U3E2IFVJUTYKM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NGQIJQGH2NFN2U3E2IFVJUTYKM/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-04T16:06:17Z","links":{"resolver":"https://pith.science/pith/NGQIJQGH2NFN2U3E2IFVJUTYKM","bundle":"https://pith.science/pith/NGQIJQGH2NFN2U3E2IFVJUTYKM/bundle.json","state":"https://pith.science/pith/NGQIJQGH2NFN2U3E2IFVJUTYKM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NGQIJQGH2NFN2U3E2IFVJUTYKM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NGQIJQGH2NFN2U3E2IFVJUTYKM","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":"8c4396e4bd9973a25a7ca428b30803de06c34dbfb51476874ed2bc86f4d028f7","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-07-01T13:52:16Z","title_canon_sha256":"2bcfae15c2f54be8362e13ef72fdf7942904640df2d56dbee85ffcdb855d5c52"},"schema_version":"1.0","source":{"id":"1407.0241","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.0241","created_at":"2026-05-18T02:48:34Z"},{"alias_kind":"arxiv_version","alias_value":"1407.0241v1","created_at":"2026-05-18T02:48:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0241","created_at":"2026-05-18T02:48:34Z"},{"alias_kind":"pith_short_12","alias_value":"NGQIJQGH2NFN","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NGQIJQGH2NFN2U3E","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NGQIJQGH","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:dcb478962ad2f276917d6ec3bf67bb8138d6a784db2441aa96858de8aecec5d6","target":"graph","created_at":"2026-05-18T02:48:34Z","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":"We study the problem of the efficient estimation of the jumps for stochastic processes. We assume that the stochastic jump process $(X_t)_{t\\in[0,1]}$ is observed discretely, with a sampling step of size $1/n$. In the spirit of Hajek's convolution theorem, we show some lower bounds for the estimation error of the sequence of the jumps $(\\Delta X_{T_k})_k$. As an intermediate result, we prove a LAMN property, with rate $\\sqrt{n}$, when the marks of the underlying jump component are deterministic. We deduce then a convolution theorem, with an explicit asymptotic minimal variance, in the case whe","authors_text":"Arnaud Gloter, Emmanuelle Cl\\'ement, Sylvain Delattre","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-07-01T13:52:16Z","title":"Asymptotic lower bounds in estimating jumps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0241","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:1a0c60b7b113f9bb5939ba3d7b4e1d8ba93221593335555a721246bdae068b46","target":"record","created_at":"2026-05-18T02:48:34Z","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":"8c4396e4bd9973a25a7ca428b30803de06c34dbfb51476874ed2bc86f4d028f7","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-07-01T13:52:16Z","title_canon_sha256":"2bcfae15c2f54be8362e13ef72fdf7942904640df2d56dbee85ffcdb855d5c52"},"schema_version":"1.0","source":{"id":"1407.0241","kind":"arxiv","version":1}},"canonical_sha256":"69a084c0c7d34add5364d20b54d27853110c1d0d89c5a97aa0c5648e77ccce6b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69a084c0c7d34add5364d20b54d27853110c1d0d89c5a97aa0c5648e77ccce6b","first_computed_at":"2026-05-18T02:48:34.673786Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:34.673786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hWAktjTWNCSlg1a7DUYV9QgAQSHbR18+nzBt8u+9C0+v9g8SsZ1TbFH+XsHZ8ArIp7d4LTicEIJxJIkP9qdpCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:34.674638Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.0241","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a0c60b7b113f9bb5939ba3d7b4e1d8ba93221593335555a721246bdae068b46","sha256:dcb478962ad2f276917d6ec3bf67bb8138d6a784db2441aa96858de8aecec5d6"],"state_sha256":"048601d8800958db14c1fb380ab4cd16f1c866a01efa8627794c57780a14703e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D0Bc3AWilR8XdygkUzNuFEEzqlnnmUKAahy/n0enC6zvUCU3eQqR8gkFn/0DyM4N4mYtnV57yVuJ4+1SQ04TAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T16:06:17.260886Z","bundle_sha256":"31ff59a8eff066417ab4a0863ec3004e5e38ae6dc8be1044e61cec09dbee258c"}}