{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ABYMTHBYSC3DUCKHDYECAWL3RL","short_pith_number":"pith:ABYMTHBY","canonical_record":{"source":{"id":"1802.05104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-02-14T14:17:33Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"e5a4787c4799c92a5bb186cc82727f1021c525f98c885ec5a33f15b24d908090","abstract_canon_sha256":"f21a270baffe2993dc109779f11c4adf25f8efb477e792f583349708414c9bfd"},"schema_version":"1.0"},"canonical_sha256":"0070c99c3890b63a09471e0820597b8afc01629592802456f06e83b8ed6b10ee","source":{"kind":"arxiv","id":"1802.05104","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05104","created_at":"2026-05-18T00:23:20Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05104v1","created_at":"2026-05-18T00:23:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05104","created_at":"2026-05-18T00:23:20Z"},{"alias_kind":"pith_short_12","alias_value":"ABYMTHBYSC3D","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ABYMTHBYSC3DUCKH","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ABYMTHBY","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ABYMTHBYSC3DUCKHDYECAWL3RL","target":"record","payload":{"canonical_record":{"source":{"id":"1802.05104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-02-14T14:17:33Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"e5a4787c4799c92a5bb186cc82727f1021c525f98c885ec5a33f15b24d908090","abstract_canon_sha256":"f21a270baffe2993dc109779f11c4adf25f8efb477e792f583349708414c9bfd"},"schema_version":"1.0"},"canonical_sha256":"0070c99c3890b63a09471e0820597b8afc01629592802456f06e83b8ed6b10ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:20.463129Z","signature_b64":"4vY2sWQ4ejw5y7kQvVhzSQRvP0kfwPx61tF0s+Y/qNjCpI7mlj0JrZPmdZ+n0S3FA7kn0gOChBc+l5Ep8nOvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0070c99c3890b63a09471e0820597b8afc01629592802456f06e83b8ed6b10ee","last_reissued_at":"2026-05-18T00:23:20.462391Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:20.462391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.05104","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-18T00:23:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZMk7ykK4+2pCr1w4ftLuAuT6JoqdKCsb7IEZyb77mN9tZGJMpbhywmMZ08DrQVc2mT6Z0Sn9rq5AcqcJ50W8Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T04:18:33.685886Z"},"content_sha256":"fccdb70d5a91b96c7a8f1f3735da02e6761d07bbf5b9b747a52feee11eb583cb","schema_version":"1.0","event_id":"sha256:fccdb70d5a91b96c7a8f1f3735da02e6761d07bbf5b9b747a52feee11eb583cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ABYMTHBYSC3DUCKHDYECAWL3RL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An adaptive procedure for Fourier estimators: illustration to deconvolution and decompounding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"C\\'eline Duval (MAP5 - UMR 8145), Johanna Kappus","submitted_at":"2018-02-14T14:17:33Z","abstract_excerpt":"We introduce a new procedure to select the optimal cutoff parameter for Fourier density estimators that leads to adaptive rate optimal estimators, up to a logarithmic factor. This adaptive procedure applies for different inverse problems. We illustrate it on two classical examples: deconvolution and decompounding, i.e. non-parametric estimation of the jump density of a compound Poisson process from the observation of n increments of length $\\Delta$ > 0. For this latter example, we first build an estimator for which we provide an upper bound for its L 2-risk that is valid simultaneously for sam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05104","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-18T00:23:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LHww+MzNYJLprC3BDupgI+BVNmmrw92pPk/qlwmFtt5335Hl6WXJCEhCP3IqvpbNgwgjyuShEBBK/Qze3Cp0Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T04:18:33.686431Z"},"content_sha256":"93c0fc3262125368c3ee8e12d449213b0b5f9cce45d75aa9215fd594c4cc7e39","schema_version":"1.0","event_id":"sha256:93c0fc3262125368c3ee8e12d449213b0b5f9cce45d75aa9215fd594c4cc7e39"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ABYMTHBYSC3DUCKHDYECAWL3RL/bundle.json","state_url":"https://pith.science/pith/ABYMTHBYSC3DUCKHDYECAWL3RL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ABYMTHBYSC3DUCKHDYECAWL3RL/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-07T04:18:33Z","links":{"resolver":"https://pith.science/pith/ABYMTHBYSC3DUCKHDYECAWL3RL","bundle":"https://pith.science/pith/ABYMTHBYSC3DUCKHDYECAWL3RL/bundle.json","state":"https://pith.science/pith/ABYMTHBYSC3DUCKHDYECAWL3RL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ABYMTHBYSC3DUCKHDYECAWL3RL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ABYMTHBYSC3DUCKHDYECAWL3RL","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":"f21a270baffe2993dc109779f11c4adf25f8efb477e792f583349708414c9bfd","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-02-14T14:17:33Z","title_canon_sha256":"e5a4787c4799c92a5bb186cc82727f1021c525f98c885ec5a33f15b24d908090"},"schema_version":"1.0","source":{"id":"1802.05104","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05104","created_at":"2026-05-18T00:23:20Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05104v1","created_at":"2026-05-18T00:23:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05104","created_at":"2026-05-18T00:23:20Z"},{"alias_kind":"pith_short_12","alias_value":"ABYMTHBYSC3D","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ABYMTHBYSC3DUCKH","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ABYMTHBY","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:93c0fc3262125368c3ee8e12d449213b0b5f9cce45d75aa9215fd594c4cc7e39","target":"graph","created_at":"2026-05-18T00:23:20Z","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 introduce a new procedure to select the optimal cutoff parameter for Fourier density estimators that leads to adaptive rate optimal estimators, up to a logarithmic factor. This adaptive procedure applies for different inverse problems. We illustrate it on two classical examples: deconvolution and decompounding, i.e. non-parametric estimation of the jump density of a compound Poisson process from the observation of n increments of length $\\Delta$ > 0. For this latter example, we first build an estimator for which we provide an upper bound for its L 2-risk that is valid simultaneously for sam","authors_text":"C\\'eline Duval (MAP5 - UMR 8145), Johanna Kappus","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-02-14T14:17:33Z","title":"An adaptive procedure for Fourier estimators: illustration to deconvolution and decompounding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05104","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:fccdb70d5a91b96c7a8f1f3735da02e6761d07bbf5b9b747a52feee11eb583cb","target":"record","created_at":"2026-05-18T00:23:20Z","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":"f21a270baffe2993dc109779f11c4adf25f8efb477e792f583349708414c9bfd","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-02-14T14:17:33Z","title_canon_sha256":"e5a4787c4799c92a5bb186cc82727f1021c525f98c885ec5a33f15b24d908090"},"schema_version":"1.0","source":{"id":"1802.05104","kind":"arxiv","version":1}},"canonical_sha256":"0070c99c3890b63a09471e0820597b8afc01629592802456f06e83b8ed6b10ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0070c99c3890b63a09471e0820597b8afc01629592802456f06e83b8ed6b10ee","first_computed_at":"2026-05-18T00:23:20.462391Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:20.462391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4vY2sWQ4ejw5y7kQvVhzSQRvP0kfwPx61tF0s+Y/qNjCpI7mlj0JrZPmdZ+n0S3FA7kn0gOChBc+l5Ep8nOvBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:20.463129Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.05104","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fccdb70d5a91b96c7a8f1f3735da02e6761d07bbf5b9b747a52feee11eb583cb","sha256:93c0fc3262125368c3ee8e12d449213b0b5f9cce45d75aa9215fd594c4cc7e39"],"state_sha256":"07dbc0c726f72ad7c4742157b7d353ad7c2657373ecd23824f74fe1257ce11d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"59LOqU2/ENRl/ad1mTGvaA5nafuVG4M1LUUhM+8cUEH7wZaZkZH8SHIMiVJdv24gLsU06CERLaVYki6VaO81Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T04:18:33.689217Z","bundle_sha256":"774319c1823174b45108790ed64a8d374bd4df8669e2ac4d18e561664163f85b"}}