{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:INUDASPVSQTQFJDGMQA4LBCEWH","short_pith_number":"pith:INUDASPV","canonical_record":{"source":{"id":"1801.03345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-01-10T12:32:19Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"cb6f2b8c5a9b02cf96aaf9b2b2ba556b9edee8857b111ca9996ab1d75454c551","abstract_canon_sha256":"7554b6a5d0330a60e69b8fc8443f82603a5953f1d1789dcce79d0cff57dd499a"},"schema_version":"1.0"},"canonical_sha256":"43683049f5942702a4666401c58444b1f6bfaa06e91be43b75851ce2d76b102e","source":{"kind":"arxiv","id":"1801.03345","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.03345","created_at":"2026-05-18T00:26:17Z"},{"alias_kind":"arxiv_version","alias_value":"1801.03345v1","created_at":"2026-05-18T00:26:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03345","created_at":"2026-05-18T00:26:17Z"},{"alias_kind":"pith_short_12","alias_value":"INUDASPVSQTQ","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"INUDASPVSQTQFJDG","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"INUDASPV","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:INUDASPVSQTQFJDGMQA4LBCEWH","target":"record","payload":{"canonical_record":{"source":{"id":"1801.03345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-01-10T12:32:19Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"cb6f2b8c5a9b02cf96aaf9b2b2ba556b9edee8857b111ca9996ab1d75454c551","abstract_canon_sha256":"7554b6a5d0330a60e69b8fc8443f82603a5953f1d1789dcce79d0cff57dd499a"},"schema_version":"1.0"},"canonical_sha256":"43683049f5942702a4666401c58444b1f6bfaa06e91be43b75851ce2d76b102e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:17.326064Z","signature_b64":"0j5r7vVVjawTnN6Dw10V3wfsrZc9RFd1HR5npYA6UI6yI08nUYZZs/a6yCRzCI057BgA6/bFRBTlxcHdOB7KBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43683049f5942702a4666401c58444b1f6bfaa06e91be43b75851ce2d76b102e","last_reissued_at":"2026-05-18T00:26:17.325395Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:17.325395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.03345","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:26:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8z/E++YpE4w60+tVCo1SaW7f9GOy20+7hbnUEfUEqLdPbjYbxtaUPssi+LwliCi+X5YhTBJ/Jsd1ODrlnhXiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:34:58.457361Z"},"content_sha256":"1963963cc7b48bc8b4e5fa3bc077db0e318ad8117c1139d7eeff9a62f2fba0e3","schema_version":"1.0","event_id":"sha256:1963963cc7b48bc8b4e5fa3bc077db0e318ad8117c1139d7eeff9a62f2fba0e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:INUDASPVSQTQFJDGMQA4LBCEWH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal functional supervised classification with separation condition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Cl\\'ement Marteau (ICJ), S\\'ebastien Gadat (TSE), S\\'ebastien Gerchinovitz (IMT)","submitted_at":"2018-01-10T12:32:19Z","abstract_excerpt":"We consider the binary supervised classification problem with the Gaussian functional model introduced in [7]. Taking advantage of the Gaussian structure, we design a natural plug-in classifier and derive a family of upper bounds on its worst-case excess risk over Sobolev spaces. These bounds are parametrized by a separation distance quantifying the difficulty of the problem, and are proved to be optimal (up to logarithmic factors) through matching minimax lower bounds. Using the recent works of [9] and [14] we also derive a logarithmic lower bound showing that the popular k-nearest neighbors "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03345","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:26:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x4rBSrioIliZO/GTTMbP6uoXd5w8FIZaFlFtMVrsdKVwhzFEXx6jF7lYhxpowgsS4IQ1yjt5M3eTsITIHjePBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:34:58.458008Z"},"content_sha256":"2f7f409ef303888c6e5ab60b9351bed8fabb00988e1c4631507961833b9777bb","schema_version":"1.0","event_id":"sha256:2f7f409ef303888c6e5ab60b9351bed8fabb00988e1c4631507961833b9777bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/INUDASPVSQTQFJDGMQA4LBCEWH/bundle.json","state_url":"https://pith.science/pith/INUDASPVSQTQFJDGMQA4LBCEWH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/INUDASPVSQTQFJDGMQA4LBCEWH/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-05-27T05:34:58Z","links":{"resolver":"https://pith.science/pith/INUDASPVSQTQFJDGMQA4LBCEWH","bundle":"https://pith.science/pith/INUDASPVSQTQFJDGMQA4LBCEWH/bundle.json","state":"https://pith.science/pith/INUDASPVSQTQFJDGMQA4LBCEWH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/INUDASPVSQTQFJDGMQA4LBCEWH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:INUDASPVSQTQFJDGMQA4LBCEWH","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":"7554b6a5d0330a60e69b8fc8443f82603a5953f1d1789dcce79d0cff57dd499a","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-01-10T12:32:19Z","title_canon_sha256":"cb6f2b8c5a9b02cf96aaf9b2b2ba556b9edee8857b111ca9996ab1d75454c551"},"schema_version":"1.0","source":{"id":"1801.03345","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.03345","created_at":"2026-05-18T00:26:17Z"},{"alias_kind":"arxiv_version","alias_value":"1801.03345v1","created_at":"2026-05-18T00:26:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.03345","created_at":"2026-05-18T00:26:17Z"},{"alias_kind":"pith_short_12","alias_value":"INUDASPVSQTQ","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"INUDASPVSQTQFJDG","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"INUDASPV","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:2f7f409ef303888c6e5ab60b9351bed8fabb00988e1c4631507961833b9777bb","target":"graph","created_at":"2026-05-18T00:26:17Z","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 consider the binary supervised classification problem with the Gaussian functional model introduced in [7]. Taking advantage of the Gaussian structure, we design a natural plug-in classifier and derive a family of upper bounds on its worst-case excess risk over Sobolev spaces. These bounds are parametrized by a separation distance quantifying the difficulty of the problem, and are proved to be optimal (up to logarithmic factors) through matching minimax lower bounds. Using the recent works of [9] and [14] we also derive a logarithmic lower bound showing that the popular k-nearest neighbors ","authors_text":"Cl\\'ement Marteau (ICJ), S\\'ebastien Gadat (TSE), S\\'ebastien Gerchinovitz (IMT)","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-01-10T12:32:19Z","title":"Optimal functional supervised classification with separation condition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.03345","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:1963963cc7b48bc8b4e5fa3bc077db0e318ad8117c1139d7eeff9a62f2fba0e3","target":"record","created_at":"2026-05-18T00:26:17Z","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":"7554b6a5d0330a60e69b8fc8443f82603a5953f1d1789dcce79d0cff57dd499a","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2018-01-10T12:32:19Z","title_canon_sha256":"cb6f2b8c5a9b02cf96aaf9b2b2ba556b9edee8857b111ca9996ab1d75454c551"},"schema_version":"1.0","source":{"id":"1801.03345","kind":"arxiv","version":1}},"canonical_sha256":"43683049f5942702a4666401c58444b1f6bfaa06e91be43b75851ce2d76b102e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43683049f5942702a4666401c58444b1f6bfaa06e91be43b75851ce2d76b102e","first_computed_at":"2026-05-18T00:26:17.325395Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:17.325395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0j5r7vVVjawTnN6Dw10V3wfsrZc9RFd1HR5npYA6UI6yI08nUYZZs/a6yCRzCI057BgA6/bFRBTlxcHdOB7KBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:17.326064Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.03345","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1963963cc7b48bc8b4e5fa3bc077db0e318ad8117c1139d7eeff9a62f2fba0e3","sha256:2f7f409ef303888c6e5ab60b9351bed8fabb00988e1c4631507961833b9777bb"],"state_sha256":"8c9ada6a73aeca281d8c6d3d9e8c8d7bc0be662709f34343b91386a96df0de70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gqsr2u40IJtqtkEXGaEXBueWIT6QhGPXdCqUzsh6eoAaxkEdAzuQcS4d0gBIkjx/8p4269n0XIsFoGxKdvD5Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:34:58.461742Z","bundle_sha256":"25e9edaaf3837fc88396cfb5b814ad32a65e6fd31820af55a64b44fe381f9db2"}}