{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SD3EGR6ZIX5DCQGWSOCDDCV5I4","short_pith_number":"pith:SD3EGR6Z","canonical_record":{"source":{"id":"1511.05371","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-17T12:10:03Z","cross_cats_sorted":[],"title_canon_sha256":"908eb43608903012e39a374882561becbd4fdb0f0734bc4f7d9b3f15503a2a2f","abstract_canon_sha256":"4d425ab3456f7bc02fe047b68ea66501702d19da1897c94bdd26f613ae22ef5d"},"schema_version":"1.0"},"canonical_sha256":"90f64347d945fa3140d69384318abd47168582d5fa97d42255043286695e8516","source":{"kind":"arxiv","id":"1511.05371","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05371","created_at":"2026-05-18T01:26:40Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05371v1","created_at":"2026-05-18T01:26:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05371","created_at":"2026-05-18T01:26:40Z"},{"alias_kind":"pith_short_12","alias_value":"SD3EGR6ZIX5D","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"SD3EGR6ZIX5DCQGW","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"SD3EGR6Z","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SD3EGR6ZIX5DCQGWSOCDDCV5I4","target":"record","payload":{"canonical_record":{"source":{"id":"1511.05371","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-17T12:10:03Z","cross_cats_sorted":[],"title_canon_sha256":"908eb43608903012e39a374882561becbd4fdb0f0734bc4f7d9b3f15503a2a2f","abstract_canon_sha256":"4d425ab3456f7bc02fe047b68ea66501702d19da1897c94bdd26f613ae22ef5d"},"schema_version":"1.0"},"canonical_sha256":"90f64347d945fa3140d69384318abd47168582d5fa97d42255043286695e8516","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:40.442557Z","signature_b64":"sBfxWRxvb+WSFIMoCF+E3EECYiWcJnJtykI784kQtAXxNm0POGRziB0MiScRhWXovqAegjUPy5yMNYlmJ2RMAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90f64347d945fa3140d69384318abd47168582d5fa97d42255043286695e8516","last_reissued_at":"2026-05-18T01:26:40.441833Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:40.441833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.05371","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-18T01:26:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j3uji9lI4El0J7ACfyQAdaIJMRxsCfKvJdggqu15PC9inNqWtnG/IRVEYLWRQ8iXlmUz838CYxYnARIPqwFuBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:26:43.812834Z"},"content_sha256":"879ca4e6aafd1672c26956511a88d20687de561aa398ca0496c7ae73b1006809","schema_version":"1.0","event_id":"sha256:879ca4e6aafd1672c26956511a88d20687de561aa398ca0496c7ae73b1006809"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SD3EGR6ZIX5DCQGWSOCDDCV5I4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constant Time EXPected Similarity Estimation using Stochastic Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"G\\\"unther Palm, Markus Schneider, Wolfgang Ertel","submitted_at":"2015-11-17T12:10:03Z","abstract_excerpt":"A new algorithm named EXPected Similarity Estimation (EXPoSE) was recently proposed to solve the problem of large-scale anomaly detection. It is a non-parametric and distribution free kernel method based on the Hilbert space embedding of probability measures. Given a dataset of $n$ samples, EXPoSE needs only $\\mathcal{O}(n)$ (linear time) to build a model and $\\mathcal{O}(1)$ (constant time) to make a prediction. In this work we improve the linear computational complexity and show that an $\\epsilon$-accurate model can be estimated in constant time, which has significant implications for large-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05371","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-18T01:26:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"75CDOvP/T8pWjVRq7Vb/HIwIh70Y9Ytge+UXbXnx4BGH/kBasCgCM2+Ixaw2TiUzlYxcXeon7QfS2DXxgLHwAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:26:43.813580Z"},"content_sha256":"dd637d84b4388a824b4d18ae48223d9a0012ee3704dbb5cb9d5a92aadf5d91e5","schema_version":"1.0","event_id":"sha256:dd637d84b4388a824b4d18ae48223d9a0012ee3704dbb5cb9d5a92aadf5d91e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SD3EGR6ZIX5DCQGWSOCDDCV5I4/bundle.json","state_url":"https://pith.science/pith/SD3EGR6ZIX5DCQGWSOCDDCV5I4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SD3EGR6ZIX5DCQGWSOCDDCV5I4/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-09T09:26:43Z","links":{"resolver":"https://pith.science/pith/SD3EGR6ZIX5DCQGWSOCDDCV5I4","bundle":"https://pith.science/pith/SD3EGR6ZIX5DCQGWSOCDDCV5I4/bundle.json","state":"https://pith.science/pith/SD3EGR6ZIX5DCQGWSOCDDCV5I4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SD3EGR6ZIX5DCQGWSOCDDCV5I4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SD3EGR6ZIX5DCQGWSOCDDCV5I4","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":"4d425ab3456f7bc02fe047b68ea66501702d19da1897c94bdd26f613ae22ef5d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-17T12:10:03Z","title_canon_sha256":"908eb43608903012e39a374882561becbd4fdb0f0734bc4f7d9b3f15503a2a2f"},"schema_version":"1.0","source":{"id":"1511.05371","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05371","created_at":"2026-05-18T01:26:40Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05371v1","created_at":"2026-05-18T01:26:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05371","created_at":"2026-05-18T01:26:40Z"},{"alias_kind":"pith_short_12","alias_value":"SD3EGR6ZIX5D","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"SD3EGR6ZIX5DCQGW","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"SD3EGR6Z","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:dd637d84b4388a824b4d18ae48223d9a0012ee3704dbb5cb9d5a92aadf5d91e5","target":"graph","created_at":"2026-05-18T01:26:40Z","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":"A new algorithm named EXPected Similarity Estimation (EXPoSE) was recently proposed to solve the problem of large-scale anomaly detection. It is a non-parametric and distribution free kernel method based on the Hilbert space embedding of probability measures. Given a dataset of $n$ samples, EXPoSE needs only $\\mathcal{O}(n)$ (linear time) to build a model and $\\mathcal{O}(1)$ (constant time) to make a prediction. In this work we improve the linear computational complexity and show that an $\\epsilon$-accurate model can be estimated in constant time, which has significant implications for large-","authors_text":"G\\\"unther Palm, Markus Schneider, Wolfgang Ertel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-17T12:10:03Z","title":"Constant Time EXPected Similarity Estimation using Stochastic Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05371","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:879ca4e6aafd1672c26956511a88d20687de561aa398ca0496c7ae73b1006809","target":"record","created_at":"2026-05-18T01:26:40Z","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":"4d425ab3456f7bc02fe047b68ea66501702d19da1897c94bdd26f613ae22ef5d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-17T12:10:03Z","title_canon_sha256":"908eb43608903012e39a374882561becbd4fdb0f0734bc4f7d9b3f15503a2a2f"},"schema_version":"1.0","source":{"id":"1511.05371","kind":"arxiv","version":1}},"canonical_sha256":"90f64347d945fa3140d69384318abd47168582d5fa97d42255043286695e8516","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90f64347d945fa3140d69384318abd47168582d5fa97d42255043286695e8516","first_computed_at":"2026-05-18T01:26:40.441833Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:40.441833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sBfxWRxvb+WSFIMoCF+E3EECYiWcJnJtykI784kQtAXxNm0POGRziB0MiScRhWXovqAegjUPy5yMNYlmJ2RMAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:40.442557Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.05371","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:879ca4e6aafd1672c26956511a88d20687de561aa398ca0496c7ae73b1006809","sha256:dd637d84b4388a824b4d18ae48223d9a0012ee3704dbb5cb9d5a92aadf5d91e5"],"state_sha256":"37cef461e659833525ba67aa931583666aa2b0d3db552b97b8fee8bdb5a8134b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d1+0G2QZJFDMM1tle0e6u0QkS+6kMMRz0qMRYvDPpGsd5rsT826ahW5WqnbJJhAft9788HvMd4p5gFiGXX7EDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T09:26:43.817927Z","bundle_sha256":"8c4ad08a765fe37ee427e38eb1c6cc11b09a6e0da6e8d333dfa18680279e06d2"}}