{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2NZ7PMLTMZI72TVTQ4LTEN6EK5","short_pith_number":"pith:2NZ7PMLT","schema_version":"1.0","canonical_sha256":"d373f7b1736651fd4eb387173237c457538bcdc5ec929495b89aef29f0a4dbbc","source":{"kind":"arxiv","id":"1405.0362","version":2},"attestation_state":"computed","paper":{"title":"An efficient algorithm for T-estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.CO","authors_text":"Nelo Magalh\\~aes, Yves Rozenholc","submitted_at":"2014-05-02T09:00:01Z","abstract_excerpt":"We introduce an efficient and exact algorithm, together with a faster but approximate version, which implements with a sub-quadratic complexity the hold-out derived from T-estimation. We study empirically the performance of this hold-out in the context of density estimation considering well-known competitors (hold-out derived from least-squares or Kullback-Leibler divergence, model selection procedures, etc.) and classical problems including histogram or bandwidth selection. Our algorithms are integrated in a companion R-package called {\\it Density.T.HoldOut} available on the CRAN: {\\url{http:"},"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":"1405.0362","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-05-02T09:00:01Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"549b5be7c33c1137857a7a773efb2149a0c5848bc0b0a8a9ad83ee61fb4f8a1c","abstract_canon_sha256":"80ef37911bebd04e972a606d4608a928dc9f9a3efcc306b5a75ff3506f1fd387"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:38.177475Z","signature_b64":"iyNbBQF5fnVFN3YL8NPrZlixny+G/T5WOKRDBnBOP8ozkgZ+drrB1Rswa3M0I4zpx8Iwe7l0rQid8cZGNGRzBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d373f7b1736651fd4eb387173237c457538bcdc5ec929495b89aef29f0a4dbbc","last_reissued_at":"2026-05-18T01:09:38.177021Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:38.177021Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An efficient algorithm for T-estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.CO","authors_text":"Nelo Magalh\\~aes, Yves Rozenholc","submitted_at":"2014-05-02T09:00:01Z","abstract_excerpt":"We introduce an efficient and exact algorithm, together with a faster but approximate version, which implements with a sub-quadratic complexity the hold-out derived from T-estimation. We study empirically the performance of this hold-out in the context of density estimation considering well-known competitors (hold-out derived from least-squares or Kullback-Leibler divergence, model selection procedures, etc.) and classical problems including histogram or bandwidth selection. Our algorithms are integrated in a companion R-package called {\\it Density.T.HoldOut} available on the CRAN: {\\url{http:"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0362","kind":"arxiv","version":2},"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":"1405.0362","created_at":"2026-05-18T01:09:38.177083+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.0362v2","created_at":"2026-05-18T01:09:38.177083+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0362","created_at":"2026-05-18T01:09:38.177083+00:00"},{"alias_kind":"pith_short_12","alias_value":"2NZ7PMLTMZI7","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"2NZ7PMLTMZI72TVT","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"2NZ7PMLT","created_at":"2026-05-18T12:28:11.866339+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/2NZ7PMLTMZI72TVTQ4LTEN6EK5","json":"https://pith.science/pith/2NZ7PMLTMZI72TVTQ4LTEN6EK5.json","graph_json":"https://pith.science/api/pith-number/2NZ7PMLTMZI72TVTQ4LTEN6EK5/graph.json","events_json":"https://pith.science/api/pith-number/2NZ7PMLTMZI72TVTQ4LTEN6EK5/events.json","paper":"https://pith.science/paper/2NZ7PMLT"},"agent_actions":{"view_html":"https://pith.science/pith/2NZ7PMLTMZI72TVTQ4LTEN6EK5","download_json":"https://pith.science/pith/2NZ7PMLTMZI72TVTQ4LTEN6EK5.json","view_paper":"https://pith.science/paper/2NZ7PMLT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.0362&json=true","fetch_graph":"https://pith.science/api/pith-number/2NZ7PMLTMZI72TVTQ4LTEN6EK5/graph.json","fetch_events":"https://pith.science/api/pith-number/2NZ7PMLTMZI72TVTQ4LTEN6EK5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2NZ7PMLTMZI72TVTQ4LTEN6EK5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2NZ7PMLTMZI72TVTQ4LTEN6EK5/action/storage_attestation","attest_author":"https://pith.science/pith/2NZ7PMLTMZI72TVTQ4LTEN6EK5/action/author_attestation","sign_citation":"https://pith.science/pith/2NZ7PMLTMZI72TVTQ4LTEN6EK5/action/citation_signature","submit_replication":"https://pith.science/pith/2NZ7PMLTMZI72TVTQ4LTEN6EK5/action/replication_record"}},"created_at":"2026-05-18T01:09:38.177083+00:00","updated_at":"2026-05-18T01:09:38.177083+00:00"}