{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EIHKRQNMKAP6SNPSPSTRSKIBJY","short_pith_number":"pith:EIHKRQNM","canonical_record":{"source":{"id":"1604.02477","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-08T20:41:54Z","cross_cats_sorted":["cs.CV","cs.IT","math.IT"],"title_canon_sha256":"0808b8694313810e1fd6d1a2779476fc5069c9f7f007b26ddb6805f7e6d5f57a","abstract_canon_sha256":"03a57e99f86fdf4f8e6423afedf6d4bae095ccaf00bb762b6e1517977658dfbb"},"schema_version":"1.0"},"canonical_sha256":"220ea8c1ac501fe935f27ca71929014e231b9a0bf824d7cd5b27200fce4f86eb","source":{"kind":"arxiv","id":"1604.02477","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02477","created_at":"2026-05-18T01:04:49Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02477v4","created_at":"2026-05-18T01:04:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02477","created_at":"2026-05-18T01:04:49Z"},{"alias_kind":"pith_short_12","alias_value":"EIHKRQNMKAP6","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EIHKRQNMKAP6SNPS","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EIHKRQNM","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EIHKRQNMKAP6SNPSPSTRSKIBJY","target":"record","payload":{"canonical_record":{"source":{"id":"1604.02477","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-08T20:41:54Z","cross_cats_sorted":["cs.CV","cs.IT","math.IT"],"title_canon_sha256":"0808b8694313810e1fd6d1a2779476fc5069c9f7f007b26ddb6805f7e6d5f57a","abstract_canon_sha256":"03a57e99f86fdf4f8e6423afedf6d4bae095ccaf00bb762b6e1517977658dfbb"},"schema_version":"1.0"},"canonical_sha256":"220ea8c1ac501fe935f27ca71929014e231b9a0bf824d7cd5b27200fce4f86eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:49.986967Z","signature_b64":"0m3tgk3AUKxKi2/TqWTiBwWDe2wlV1hvNGrMTzd6VTaDLrlOzvMEJyxIjZVm0Z1zeDa9iCXaX9fTAr8WsSgQAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"220ea8c1ac501fe935f27ca71929014e231b9a0bf824d7cd5b27200fce4f86eb","last_reissued_at":"2026-05-18T01:04:49.986560Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:49.986560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.02477","source_version":4,"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:04:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qCdoH8SzfK41uoCSyGIUy3GoPAmOasJyy5Le6yCZRWR1RCwTC0+RbBx/kBMZZdfVLbDPLz1c5quomKXaiGBoDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:16:30.451214Z"},"content_sha256":"ef50b5a0fdc90395981bb430c384cfcef53211b9fc8d79187e34a2f8af02901d","schema_version":"1.0","event_id":"sha256:ef50b5a0fdc90395981bb430c384cfcef53211b9fc8d79187e34a2f8af02901d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EIHKRQNMKAP6SNPSPSTRSKIBJY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"One-class classifiers based on entropic spanning graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Cesare Alippi, Lorenzo Livi","submitted_at":"2016-04-08T20:41:54Z","abstract_excerpt":"One-class classifiers offer valuable tools to assess the presence of outliers in data. In this paper, we propose a design methodology for one-class classifiers based on entropic spanning graphs. Our approach takes into account the possibility to process also non-numeric data by means of an embedding procedure. The spanning graph is learned on the embedded input data and the outcoming partition of vertices defines the classifier. The final partition is derived by exploiting a criterion based on mutual information minimization. Here, we compute the mutual information by using a convenient formul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02477","kind":"arxiv","version":4},"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:04:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uPrzLzQKAvXDDWmjVEh0w7B+yM7stbrbAf1cMq802vWIhtFmSb+r3JZZDl6m7GBGoDpa8/YOXL6HwNxG/0KODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:16:30.451579Z"},"content_sha256":"6dcc984112c368646710850555feebbaa1a84ec8bbb1ebc3a483864806f05672","schema_version":"1.0","event_id":"sha256:6dcc984112c368646710850555feebbaa1a84ec8bbb1ebc3a483864806f05672"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EIHKRQNMKAP6SNPSPSTRSKIBJY/bundle.json","state_url":"https://pith.science/pith/EIHKRQNMKAP6SNPSPSTRSKIBJY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EIHKRQNMKAP6SNPSPSTRSKIBJY/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-05T21:16:30Z","links":{"resolver":"https://pith.science/pith/EIHKRQNMKAP6SNPSPSTRSKIBJY","bundle":"https://pith.science/pith/EIHKRQNMKAP6SNPSPSTRSKIBJY/bundle.json","state":"https://pith.science/pith/EIHKRQNMKAP6SNPSPSTRSKIBJY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EIHKRQNMKAP6SNPSPSTRSKIBJY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EIHKRQNMKAP6SNPSPSTRSKIBJY","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":"03a57e99f86fdf4f8e6423afedf6d4bae095ccaf00bb762b6e1517977658dfbb","cross_cats_sorted":["cs.CV","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-08T20:41:54Z","title_canon_sha256":"0808b8694313810e1fd6d1a2779476fc5069c9f7f007b26ddb6805f7e6d5f57a"},"schema_version":"1.0","source":{"id":"1604.02477","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02477","created_at":"2026-05-18T01:04:49Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02477v4","created_at":"2026-05-18T01:04:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02477","created_at":"2026-05-18T01:04:49Z"},{"alias_kind":"pith_short_12","alias_value":"EIHKRQNMKAP6","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EIHKRQNMKAP6SNPS","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EIHKRQNM","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:6dcc984112c368646710850555feebbaa1a84ec8bbb1ebc3a483864806f05672","target":"graph","created_at":"2026-05-18T01:04:49Z","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":"One-class classifiers offer valuable tools to assess the presence of outliers in data. In this paper, we propose a design methodology for one-class classifiers based on entropic spanning graphs. Our approach takes into account the possibility to process also non-numeric data by means of an embedding procedure. The spanning graph is learned on the embedded input data and the outcoming partition of vertices defines the classifier. The final partition is derived by exploiting a criterion based on mutual information minimization. Here, we compute the mutual information by using a convenient formul","authors_text":"Cesare Alippi, Lorenzo Livi","cross_cats":["cs.CV","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-08T20:41:54Z","title":"One-class classifiers based on entropic spanning graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02477","kind":"arxiv","version":4},"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:ef50b5a0fdc90395981bb430c384cfcef53211b9fc8d79187e34a2f8af02901d","target":"record","created_at":"2026-05-18T01:04:49Z","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":"03a57e99f86fdf4f8e6423afedf6d4bae095ccaf00bb762b6e1517977658dfbb","cross_cats_sorted":["cs.CV","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-08T20:41:54Z","title_canon_sha256":"0808b8694313810e1fd6d1a2779476fc5069c9f7f007b26ddb6805f7e6d5f57a"},"schema_version":"1.0","source":{"id":"1604.02477","kind":"arxiv","version":4}},"canonical_sha256":"220ea8c1ac501fe935f27ca71929014e231b9a0bf824d7cd5b27200fce4f86eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"220ea8c1ac501fe935f27ca71929014e231b9a0bf824d7cd5b27200fce4f86eb","first_computed_at":"2026-05-18T01:04:49.986560Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:49.986560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0m3tgk3AUKxKi2/TqWTiBwWDe2wlV1hvNGrMTzd6VTaDLrlOzvMEJyxIjZVm0Z1zeDa9iCXaX9fTAr8WsSgQAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:49.986967Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.02477","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef50b5a0fdc90395981bb430c384cfcef53211b9fc8d79187e34a2f8af02901d","sha256:6dcc984112c368646710850555feebbaa1a84ec8bbb1ebc3a483864806f05672"],"state_sha256":"0ba99828d302ddc5e294e0c9795378d17af1c13f1f85e3b851e0b498f6c4945c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q8YnYoP3LGf7kvLXRKGLkNpGHK/Pcc8CIUBHQOpp7rDALN/EKbtLPtrscCqTYEyUiX5j8CPhHYBTs+dtSHGLDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:16:30.453786Z","bundle_sha256":"7c3be6e65a24b21e0c205ceffd1b834e81b185139d5daae495192d1ee9762cdd"}}