{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KEXEB6CQXZ6A23KGBOX7HWXDHF","short_pith_number":"pith:KEXEB6CQ","canonical_record":{"source":{"id":"1103.5925","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2011-03-30T13:35:36Z","cross_cats_sorted":[],"title_canon_sha256":"2eff615810020d80663998381bdc1d0b8133f5e65da9128abf799747040eb7b6","abstract_canon_sha256":"5d9d0ae25efe9a4174f79be7fe6060340b0384225a9cb2c6873a974e0315e5e2"},"schema_version":"1.0"},"canonical_sha256":"512e40f850be7c0d6d460baff3dae339797b84766454a5993c010c5aff41d381","source":{"kind":"arxiv","id":"1103.5925","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.5925","created_at":"2026-05-18T04:25:27Z"},{"alias_kind":"arxiv_version","alias_value":"1103.5925v1","created_at":"2026-05-18T04:25:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5925","created_at":"2026-05-18T04:25:27Z"},{"alias_kind":"pith_short_12","alias_value":"KEXEB6CQXZ6A","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KEXEB6CQXZ6A23KG","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KEXEB6CQ","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KEXEB6CQXZ6A23KGBOX7HWXDHF","target":"record","payload":{"canonical_record":{"source":{"id":"1103.5925","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2011-03-30T13:35:36Z","cross_cats_sorted":[],"title_canon_sha256":"2eff615810020d80663998381bdc1d0b8133f5e65da9128abf799747040eb7b6","abstract_canon_sha256":"5d9d0ae25efe9a4174f79be7fe6060340b0384225a9cb2c6873a974e0315e5e2"},"schema_version":"1.0"},"canonical_sha256":"512e40f850be7c0d6d460baff3dae339797b84766454a5993c010c5aff41d381","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:27.187138Z","signature_b64":"7+Vzv4F0ESdCh4RST61G4GOvSjWuhB1ydQ49jYMT3si0WmESzup2rQMy+oXlwOfYrbNFDq4dKVs1blDuNy7fCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"512e40f850be7c0d6d460baff3dae339797b84766454a5993c010c5aff41d381","last_reissued_at":"2026-05-18T04:25:27.186429Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:27.186429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.5925","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-18T04:25:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YKcJU9r80tv9JP7bmqcyP+0yfopi39Mjaz5pREFN4eHvR5vdsu2aW8C+5InDIpYeNWDoRd+kNOfeOAmNB3rqAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:19:35.672892Z"},"content_sha256":"876cd96482bbe546970eef400aaa3fe7a0edb8bca97de2608ff4602b3a54eab2","schema_version":"1.0","event_id":"sha256:876cd96482bbe546970eef400aaa3fe7a0edb8bca97de2608ff4602b3a54eab2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KEXEB6CQXZ6A23KGBOX7HWXDHF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear programming problems for frontier estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Alexander Nazin, Anatoli Iouditski, Guillaume Bouchard, St\\'ephane Girard","submitted_at":"2011-03-30T13:35:36Z","abstract_excerpt":"We propose new estimates for the frontier of a set of points. They are defined as kernel estimates covering all the points and whose associated support is of smallest surface. The estimates are written as linear combinatio- ns of kernel functions applied to the points of the sample. The coefficients of the linear combination are then computed by solving a linear programming problem. In the general case, the solution of the optimizat- ion problem is sparse, that is, only a few coefficients are non zero. The corresponding points play the role of support vectors in the statistical learning theory"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5925","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-18T04:25:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m9wdV4fSrFML4GPOIiwlrgEFh1fnwYBqeL+M5cpwmgI77PPZa2Yna3rBBffq/n8sVVjT5GHZS+2wy2XXDf2oBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:19:35.673456Z"},"content_sha256":"32246bc56c54745b565055f0a10a5a388217f5b23a1622a39542da5dc297d083","schema_version":"1.0","event_id":"sha256:32246bc56c54745b565055f0a10a5a388217f5b23a1622a39542da5dc297d083"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KEXEB6CQXZ6A23KGBOX7HWXDHF/bundle.json","state_url":"https://pith.science/pith/KEXEB6CQXZ6A23KGBOX7HWXDHF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KEXEB6CQXZ6A23KGBOX7HWXDHF/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-07T14:19:35Z","links":{"resolver":"https://pith.science/pith/KEXEB6CQXZ6A23KGBOX7HWXDHF","bundle":"https://pith.science/pith/KEXEB6CQXZ6A23KGBOX7HWXDHF/bundle.json","state":"https://pith.science/pith/KEXEB6CQXZ6A23KGBOX7HWXDHF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KEXEB6CQXZ6A23KGBOX7HWXDHF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KEXEB6CQXZ6A23KGBOX7HWXDHF","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":"5d9d0ae25efe9a4174f79be7fe6060340b0384225a9cb2c6873a974e0315e5e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2011-03-30T13:35:36Z","title_canon_sha256":"2eff615810020d80663998381bdc1d0b8133f5e65da9128abf799747040eb7b6"},"schema_version":"1.0","source":{"id":"1103.5925","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.5925","created_at":"2026-05-18T04:25:27Z"},{"alias_kind":"arxiv_version","alias_value":"1103.5925v1","created_at":"2026-05-18T04:25:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5925","created_at":"2026-05-18T04:25:27Z"},{"alias_kind":"pith_short_12","alias_value":"KEXEB6CQXZ6A","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KEXEB6CQXZ6A23KG","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KEXEB6CQ","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:32246bc56c54745b565055f0a10a5a388217f5b23a1622a39542da5dc297d083","target":"graph","created_at":"2026-05-18T04:25:27Z","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 propose new estimates for the frontier of a set of points. They are defined as kernel estimates covering all the points and whose associated support is of smallest surface. The estimates are written as linear combinatio- ns of kernel functions applied to the points of the sample. The coefficients of the linear combination are then computed by solving a linear programming problem. In the general case, the solution of the optimizat- ion problem is sparse, that is, only a few coefficients are non zero. The corresponding points play the role of support vectors in the statistical learning theory","authors_text":"Alexander Nazin, Anatoli Iouditski, Guillaume Bouchard, St\\'ephane Girard","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2011-03-30T13:35:36Z","title":"Linear programming problems for frontier estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.5925","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:876cd96482bbe546970eef400aaa3fe7a0edb8bca97de2608ff4602b3a54eab2","target":"record","created_at":"2026-05-18T04:25:27Z","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":"5d9d0ae25efe9a4174f79be7fe6060340b0384225a9cb2c6873a974e0315e5e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2011-03-30T13:35:36Z","title_canon_sha256":"2eff615810020d80663998381bdc1d0b8133f5e65da9128abf799747040eb7b6"},"schema_version":"1.0","source":{"id":"1103.5925","kind":"arxiv","version":1}},"canonical_sha256":"512e40f850be7c0d6d460baff3dae339797b84766454a5993c010c5aff41d381","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"512e40f850be7c0d6d460baff3dae339797b84766454a5993c010c5aff41d381","first_computed_at":"2026-05-18T04:25:27.186429Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:25:27.186429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7+Vzv4F0ESdCh4RST61G4GOvSjWuhB1ydQ49jYMT3si0WmESzup2rQMy+oXlwOfYrbNFDq4dKVs1blDuNy7fCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:25:27.187138Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.5925","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:876cd96482bbe546970eef400aaa3fe7a0edb8bca97de2608ff4602b3a54eab2","sha256:32246bc56c54745b565055f0a10a5a388217f5b23a1622a39542da5dc297d083"],"state_sha256":"924f5f580fc7681329f77362c05e934b3887ec72f68eb5075fc19d44684aa410"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aeIhcmEjd9T4WHabyTKqeWxr8b9gOD7eokzbX9sk4U24sAlJMrobWRzlPyUHSIZObxCY0vUskwKJVhxbJfu1BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:19:35.676480Z","bundle_sha256":"953a389b5f3c967992f42aea31689bf4d6434f9e6703a9a9af44c609c84b28b7"}}