{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CQ7UWYEW4IT2QHUYATIITWZTTE","short_pith_number":"pith:CQ7UWYEW","canonical_record":{"source":{"id":"1604.03200","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-04-12T01:52:38Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6073cccb942b3b8ad8b49e7b0d27d281120e83c2d5f635c36feca51e9adde924","abstract_canon_sha256":"64b3a6d0a5dcae50a0227a19a29253f6d9f2d87f4ae25d09d0f41ce3504d8aa8"},"schema_version":"1.0"},"canonical_sha256":"143f4b6096e227a81e9804d089db33991f5bfaee6c1dc288e7304b0de63980f3","source":{"kind":"arxiv","id":"1604.03200","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03200","created_at":"2026-05-18T01:17:16Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03200v1","created_at":"2026-05-18T01:17:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03200","created_at":"2026-05-18T01:17:16Z"},{"alias_kind":"pith_short_12","alias_value":"CQ7UWYEW4IT2","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CQ7UWYEW4IT2QHUY","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CQ7UWYEW","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CQ7UWYEW4IT2QHUYATIITWZTTE","target":"record","payload":{"canonical_record":{"source":{"id":"1604.03200","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-04-12T01:52:38Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6073cccb942b3b8ad8b49e7b0d27d281120e83c2d5f635c36feca51e9adde924","abstract_canon_sha256":"64b3a6d0a5dcae50a0227a19a29253f6d9f2d87f4ae25d09d0f41ce3504d8aa8"},"schema_version":"1.0"},"canonical_sha256":"143f4b6096e227a81e9804d089db33991f5bfaee6c1dc288e7304b0de63980f3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:16.177651Z","signature_b64":"O/DmdDV75LGSWBTLnQBv/s/OUC/9effJqtaS0UrEwOCUxQQFS4hGN5886DHbuG9h02IZf3HTtNIHi1S9r5BaAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"143f4b6096e227a81e9804d089db33991f5bfaee6c1dc288e7304b0de63980f3","last_reissued_at":"2026-05-18T01:17:16.177003Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:16.177003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.03200","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:17:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Drtbk4hHC9z/FFrnR30J1QYM/nwTSu1+8ttpcu3pJlTWpvsl+TGYLLYmoNqKgerMHmFOIyX4WoapS+PUbeJQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:10:22.886837Z"},"content_sha256":"25707f9b94cda54a065bf77410012de834a78156daef504d3cda89cc51ffb06a","schema_version":"1.0","event_id":"sha256:25707f9b94cda54a065bf77410012de834a78156daef504d3cda89cc51ffb06a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CQ7UWYEW4IT2QHUYATIITWZTTE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Classification of Multi-Labelled Text Streams by Clashing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Ilias Flaounas, Nello Cristianini, Ricardo \\~Nanculef","submitted_at":"2016-04-12T01:52:38Z","abstract_excerpt":"We present a method for the classification of multi-labelled text documents explicitly designed for data stream applications that require to process a virtually infinite sequence of data using constant memory and constant processing time. Our method is composed of an online procedure used to efficiently map text into a low-dimensional feature space and a partition of this space into a set of regions for which the system extracts and keeps statistics used to predict multi-label text annotations. Documents are fed into the system as a sequence of words, mapped to a region of the partition, and a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03200","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:17:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uNiNi4432HAUO+JVM1pwa1hW0h5uts6ZZxk/oYFn561iakq57WSR+2/PCJRm7Uf4Z8hYyajqRbX7Z/tThBbhAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:10:22.887529Z"},"content_sha256":"61e47521162ea2762600fb59ae647a987df523b769fbc7926e1bcb47ca1140f3","schema_version":"1.0","event_id":"sha256:61e47521162ea2762600fb59ae647a987df523b769fbc7926e1bcb47ca1140f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CQ7UWYEW4IT2QHUYATIITWZTTE/bundle.json","state_url":"https://pith.science/pith/CQ7UWYEW4IT2QHUYATIITWZTTE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CQ7UWYEW4IT2QHUYATIITWZTTE/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-05-27T13:10:22Z","links":{"resolver":"https://pith.science/pith/CQ7UWYEW4IT2QHUYATIITWZTTE","bundle":"https://pith.science/pith/CQ7UWYEW4IT2QHUYATIITWZTTE/bundle.json","state":"https://pith.science/pith/CQ7UWYEW4IT2QHUYATIITWZTTE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CQ7UWYEW4IT2QHUYATIITWZTTE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CQ7UWYEW4IT2QHUYATIITWZTTE","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":"64b3a6d0a5dcae50a0227a19a29253f6d9f2d87f4ae25d09d0f41ce3504d8aa8","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-04-12T01:52:38Z","title_canon_sha256":"6073cccb942b3b8ad8b49e7b0d27d281120e83c2d5f635c36feca51e9adde924"},"schema_version":"1.0","source":{"id":"1604.03200","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03200","created_at":"2026-05-18T01:17:16Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03200v1","created_at":"2026-05-18T01:17:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03200","created_at":"2026-05-18T01:17:16Z"},{"alias_kind":"pith_short_12","alias_value":"CQ7UWYEW4IT2","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CQ7UWYEW4IT2QHUY","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CQ7UWYEW","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:61e47521162ea2762600fb59ae647a987df523b769fbc7926e1bcb47ca1140f3","target":"graph","created_at":"2026-05-18T01:17:16Z","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":"We present a method for the classification of multi-labelled text documents explicitly designed for data stream applications that require to process a virtually infinite sequence of data using constant memory and constant processing time. Our method is composed of an online procedure used to efficiently map text into a low-dimensional feature space and a partition of this space into a set of regions for which the system extracts and keeps statistics used to predict multi-label text annotations. Documents are fed into the system as a sequence of words, mapped to a region of the partition, and a","authors_text":"Ilias Flaounas, Nello Cristianini, Ricardo \\~Nanculef","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-04-12T01:52:38Z","title":"Efficient Classification of Multi-Labelled Text Streams by Clashing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03200","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:25707f9b94cda54a065bf77410012de834a78156daef504d3cda89cc51ffb06a","target":"record","created_at":"2026-05-18T01:17:16Z","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":"64b3a6d0a5dcae50a0227a19a29253f6d9f2d87f4ae25d09d0f41ce3504d8aa8","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-04-12T01:52:38Z","title_canon_sha256":"6073cccb942b3b8ad8b49e7b0d27d281120e83c2d5f635c36feca51e9adde924"},"schema_version":"1.0","source":{"id":"1604.03200","kind":"arxiv","version":1}},"canonical_sha256":"143f4b6096e227a81e9804d089db33991f5bfaee6c1dc288e7304b0de63980f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"143f4b6096e227a81e9804d089db33991f5bfaee6c1dc288e7304b0de63980f3","first_computed_at":"2026-05-18T01:17:16.177003Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:16.177003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O/DmdDV75LGSWBTLnQBv/s/OUC/9effJqtaS0UrEwOCUxQQFS4hGN5886DHbuG9h02IZf3HTtNIHi1S9r5BaAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:16.177651Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.03200","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25707f9b94cda54a065bf77410012de834a78156daef504d3cda89cc51ffb06a","sha256:61e47521162ea2762600fb59ae647a987df523b769fbc7926e1bcb47ca1140f3"],"state_sha256":"8138fef92dc4d72c5478f828dc0dfa063c858573f2d7386d8315deb09d2b2e91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z8fK3tPbO2z3ZJ5p7JxHWzGZaNYv1uBhfniOVExaeIq5h4Tj9yG2lOY7dqSimoCtx2u6F1wrDCAmZUgcbPEIDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:10:22.891302Z","bundle_sha256":"efb4d85db5a99d2ec0e2372ad18a50307cf5a8a454e58e7d16bb75956b43760d"}}