{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:KEXEB6CQXZ6A23KGBOX7HWXDHF","short_pith_number":"pith:KEXEB6CQ","schema_version":"1.0","canonical_sha256":"512e40f850be7c0d6d460baff3dae339797b84766454a5993c010c5aff41d381","source":{"kind":"arxiv","id":"1103.5925","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1103.5925","created_at":"2026-05-18T04:25:27.186531+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.5925v1","created_at":"2026-05-18T04:25:27.186531+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.5925","created_at":"2026-05-18T04:25:27.186531+00:00"},{"alias_kind":"pith_short_12","alias_value":"KEXEB6CQXZ6A","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"KEXEB6CQXZ6A23KG","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"KEXEB6CQ","created_at":"2026-05-18T12:26:32.869790+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KEXEB6CQXZ6A23KGBOX7HWXDHF","json":"https://pith.science/pith/KEXEB6CQXZ6A23KGBOX7HWXDHF.json","graph_json":"https://pith.science/api/pith-number/KEXEB6CQXZ6A23KGBOX7HWXDHF/graph.json","events_json":"https://pith.science/api/pith-number/KEXEB6CQXZ6A23KGBOX7HWXDHF/events.json","paper":"https://pith.science/paper/KEXEB6CQ"},"agent_actions":{"view_html":"https://pith.science/pith/KEXEB6CQXZ6A23KGBOX7HWXDHF","download_json":"https://pith.science/pith/KEXEB6CQXZ6A23KGBOX7HWXDHF.json","view_paper":"https://pith.science/paper/KEXEB6CQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.5925&json=true","fetch_graph":"https://pith.science/api/pith-number/KEXEB6CQXZ6A23KGBOX7HWXDHF/graph.json","fetch_events":"https://pith.science/api/pith-number/KEXEB6CQXZ6A23KGBOX7HWXDHF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KEXEB6CQXZ6A23KGBOX7HWXDHF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KEXEB6CQXZ6A23KGBOX7HWXDHF/action/storage_attestation","attest_author":"https://pith.science/pith/KEXEB6CQXZ6A23KGBOX7HWXDHF/action/author_attestation","sign_citation":"https://pith.science/pith/KEXEB6CQXZ6A23KGBOX7HWXDHF/action/citation_signature","submit_replication":"https://pith.science/pith/KEXEB6CQXZ6A23KGBOX7HWXDHF/action/replication_record"}},"created_at":"2026-05-18T04:25:27.186531+00:00","updated_at":"2026-05-18T04:25:27.186531+00:00"}