{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:KDZWTE4AMOSIHJTFBH5KJ3HA7L","short_pith_number":"pith:KDZWTE4A","canonical_record":{"source":{"id":"1504.04739","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-04-18T16:19:22Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c113ec075b542baecb820328444c66762669d3219dd9a9d3403f9484c9794cf4","abstract_canon_sha256":"e57f7bef275438b7250f1b0e600e49f4304d1163dde57052c091a1c6d7a33074"},"schema_version":"1.0"},"canonical_sha256":"50f369938063a483a66509faa4ece0faf0f577dd35c515fc9a0f0906eb4cc8e7","source":{"kind":"arxiv","id":"1504.04739","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04739","created_at":"2026-05-18T02:18:24Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04739v1","created_at":"2026-05-18T02:18:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04739","created_at":"2026-05-18T02:18:24Z"},{"alias_kind":"pith_short_12","alias_value":"KDZWTE4AMOSI","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KDZWTE4AMOSIHJTF","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KDZWTE4A","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:KDZWTE4AMOSIHJTFBH5KJ3HA7L","target":"record","payload":{"canonical_record":{"source":{"id":"1504.04739","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-04-18T16:19:22Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c113ec075b542baecb820328444c66762669d3219dd9a9d3403f9484c9794cf4","abstract_canon_sha256":"e57f7bef275438b7250f1b0e600e49f4304d1163dde57052c091a1c6d7a33074"},"schema_version":"1.0"},"canonical_sha256":"50f369938063a483a66509faa4ece0faf0f577dd35c515fc9a0f0906eb4cc8e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:24.938674Z","signature_b64":"2L4+MIdLWl7UAl8mlMzk5Ti0xKTJc449Ghwjolva2EANHlsEGSdqqRPdJ6G1bagFyT7BcrQwFUEUsBQuzk8VDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50f369938063a483a66509faa4ece0faf0f577dd35c515fc9a0f0906eb4cc8e7","last_reissued_at":"2026-05-18T02:18:24.938000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:24.938000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.04739","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-18T02:18:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n/XXsKSEmYRiZd3zQved+4ctyO+fHuudQpuw20UZ8vdkpfJB5uvg1RFpZo8AgVmcqRSTtEPxGBKpbnGstXAdDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T00:40:32.328932Z"},"content_sha256":"f12c7410e264aa26d88c9d3715c56cfa3914ce9249f7e07a28064a6dc0c9596f","schema_version":"1.0","event_id":"sha256:f12c7410e264aa26d88c9d3715c56cfa3914ce9249f7e07a28064a6dc0c9596f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:KDZWTE4AMOSIHJTFBH5KJ3HA7L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast optimization of Multithreshold Entropy Linear Classifier","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Rafal Jozefowicz, Wojciech Marian Czarnecki","submitted_at":"2015-04-18T16:19:22Z","abstract_excerpt":"Multithreshold Entropy Linear Classifier (MELC) is a density based model which searches for a linear projection maximizing the Cauchy-Schwarz Divergence of dataset kernel density estimation. Despite its good empirical results, one of its drawbacks is the optimization speed. In this paper we analyze how one can speed it up through solving an approximate problem. We analyze two methods, both similar to the approximate solutions of the Kernel Density Estimation querying and provide adaptive schemes for selecting a crucial parameters based on user-specified acceptable error. Furthermore we show ho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04739","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-18T02:18:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ifeIpLMEkAZE+xMyeTMFGQia7WwMfl26RZJ49OzLMrRMCnIVrP3axy5BbBxPVRQzqDqQO9HVdCo6KZhN6d1rAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T00:40:32.329687Z"},"content_sha256":"3acc2ba0312880234b2dbd97d1bf9730c0dd9bd83ff43be6790b093c02b18b69","schema_version":"1.0","event_id":"sha256:3acc2ba0312880234b2dbd97d1bf9730c0dd9bd83ff43be6790b093c02b18b69"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KDZWTE4AMOSIHJTFBH5KJ3HA7L/bundle.json","state_url":"https://pith.science/pith/KDZWTE4AMOSIHJTFBH5KJ3HA7L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KDZWTE4AMOSIHJTFBH5KJ3HA7L/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-11T00:40:32Z","links":{"resolver":"https://pith.science/pith/KDZWTE4AMOSIHJTFBH5KJ3HA7L","bundle":"https://pith.science/pith/KDZWTE4AMOSIHJTFBH5KJ3HA7L/bundle.json","state":"https://pith.science/pith/KDZWTE4AMOSIHJTFBH5KJ3HA7L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KDZWTE4AMOSIHJTFBH5KJ3HA7L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:KDZWTE4AMOSIHJTFBH5KJ3HA7L","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":"e57f7bef275438b7250f1b0e600e49f4304d1163dde57052c091a1c6d7a33074","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-04-18T16:19:22Z","title_canon_sha256":"c113ec075b542baecb820328444c66762669d3219dd9a9d3403f9484c9794cf4"},"schema_version":"1.0","source":{"id":"1504.04739","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04739","created_at":"2026-05-18T02:18:24Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04739v1","created_at":"2026-05-18T02:18:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04739","created_at":"2026-05-18T02:18:24Z"},{"alias_kind":"pith_short_12","alias_value":"KDZWTE4AMOSI","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"KDZWTE4AMOSIHJTF","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"KDZWTE4A","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:3acc2ba0312880234b2dbd97d1bf9730c0dd9bd83ff43be6790b093c02b18b69","target":"graph","created_at":"2026-05-18T02:18:24Z","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":"Multithreshold Entropy Linear Classifier (MELC) is a density based model which searches for a linear projection maximizing the Cauchy-Schwarz Divergence of dataset kernel density estimation. Despite its good empirical results, one of its drawbacks is the optimization speed. In this paper we analyze how one can speed it up through solving an approximate problem. We analyze two methods, both similar to the approximate solutions of the Kernel Density Estimation querying and provide adaptive schemes for selecting a crucial parameters based on user-specified acceptable error. Furthermore we show ho","authors_text":"Rafal Jozefowicz, Wojciech Marian Czarnecki","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-04-18T16:19:22Z","title":"Fast optimization of Multithreshold Entropy Linear Classifier"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04739","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:f12c7410e264aa26d88c9d3715c56cfa3914ce9249f7e07a28064a6dc0c9596f","target":"record","created_at":"2026-05-18T02:18:24Z","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":"e57f7bef275438b7250f1b0e600e49f4304d1163dde57052c091a1c6d7a33074","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-04-18T16:19:22Z","title_canon_sha256":"c113ec075b542baecb820328444c66762669d3219dd9a9d3403f9484c9794cf4"},"schema_version":"1.0","source":{"id":"1504.04739","kind":"arxiv","version":1}},"canonical_sha256":"50f369938063a483a66509faa4ece0faf0f577dd35c515fc9a0f0906eb4cc8e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50f369938063a483a66509faa4ece0faf0f577dd35c515fc9a0f0906eb4cc8e7","first_computed_at":"2026-05-18T02:18:24.938000Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:24.938000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2L4+MIdLWl7UAl8mlMzk5Ti0xKTJc449Ghwjolva2EANHlsEGSdqqRPdJ6G1bagFyT7BcrQwFUEUsBQuzk8VDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:24.938674Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.04739","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f12c7410e264aa26d88c9d3715c56cfa3914ce9249f7e07a28064a6dc0c9596f","sha256:3acc2ba0312880234b2dbd97d1bf9730c0dd9bd83ff43be6790b093c02b18b69"],"state_sha256":"d5989cf010d834561818beb2766e0faabb57e339b8ac6af0cc99c47453e29d76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4RY5XYSiDrsDfnFRbYWLzSQPQeDHpE/+SFnXe99MxkF//AzO7bbXxXn3x4ZG0GqVdKBKa1EoOMatgGGa15vbCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T00:40:32.333460Z","bundle_sha256":"97a4c032f234c3320ab0969b31d4f1eb19c5375bc4e6b93df4b5e33f12e55d46"}}