{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:F6H7RJCVZVVL7YI7V2LLN52LSR","short_pith_number":"pith:F6H7RJCV","canonical_record":{"source":{"id":"1804.05260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-04-14T18:24:06Z","cross_cats_sorted":["cs.AI","cs.CV","cs.LG"],"title_canon_sha256":"8cc976ddb872a9a765e3ef0ce361fbcec8a476a22060b1ce5c0e481dc892c3a5","abstract_canon_sha256":"0f1dc968c43442790650668c0dcb818f980a361abd9e1c8dc8cbe85469c69cc6"},"schema_version":"1.0"},"canonical_sha256":"2f8ff8a455cd6abfe11fae96b6f74b947279ccdacd8b2c884a06cae603e96e2e","source":{"kind":"arxiv","id":"1804.05260","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.05260","created_at":"2026-05-18T00:18:28Z"},{"alias_kind":"arxiv_version","alias_value":"1804.05260v1","created_at":"2026-05-18T00:18:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05260","created_at":"2026-05-18T00:18:28Z"},{"alias_kind":"pith_short_12","alias_value":"F6H7RJCVZVVL","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"F6H7RJCVZVVL7YI7","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"F6H7RJCV","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:F6H7RJCVZVVL7YI7V2LLN52LSR","target":"record","payload":{"canonical_record":{"source":{"id":"1804.05260","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-04-14T18:24:06Z","cross_cats_sorted":["cs.AI","cs.CV","cs.LG"],"title_canon_sha256":"8cc976ddb872a9a765e3ef0ce361fbcec8a476a22060b1ce5c0e481dc892c3a5","abstract_canon_sha256":"0f1dc968c43442790650668c0dcb818f980a361abd9e1c8dc8cbe85469c69cc6"},"schema_version":"1.0"},"canonical_sha256":"2f8ff8a455cd6abfe11fae96b6f74b947279ccdacd8b2c884a06cae603e96e2e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:28.482569Z","signature_b64":"OEZh0FX8UtB+UexnUKeMgrmcStTVVZWZsHiPmeS5j38HyJ8wR7GxmooEva2be2ccxYHnwmtU5x1Iq0SNZJePDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f8ff8a455cd6abfe11fae96b6f74b947279ccdacd8b2c884a06cae603e96e2e","last_reissued_at":"2026-05-18T00:18:28.482240Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:28.482240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.05260","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-18T00:18:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1QcmRlz6V7bAgn9xL47rlBKTRCl9OAg55l/LqEUKQh2JKJLch64D7MJfOY8NVgqrZCXg+IDrCFyEH16eAG4UCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:19:55.048816Z"},"content_sha256":"ada4632499931dd2440d932800523dd0910cffc836b06d9061e3e7dfcda23c2e","schema_version":"1.0","event_id":"sha256:ada4632499931dd2440d932800523dd0910cffc836b06d9061e3e7dfcda23c2e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:F6H7RJCVZVVL7YI7V2LLN52LSR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ClassiNet -- Predicting Missing Features for Short-Text Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV","cs.LG"],"primary_cat":"cs.CL","authors_text":"Danushka Bollegala, Ken-ichi Kawarabayashi, Takanori Maehara, Vincent Atanasov","submitted_at":"2018-04-14T18:24:06Z","abstract_excerpt":"The fundamental problem in short-text classification is \\emph{feature sparseness} -- the lack of feature overlap between a trained model and a test instance to be classified. We propose \\emph{ClassiNet} -- a network of classifiers trained for predicting missing features in a given instance, to overcome the feature sparseness problem. Using a set of unlabeled training instances, we first learn binary classifiers as feature predictors for predicting whether a particular feature occurs in a given instance. Next, each feature predictor is represented as a vertex $v_i$ in the ClassiNet where a one-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05260","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-18T00:18:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o6yaZM3obYJkUm8C9zhOIXXroaOHlRa6wb144E9EaawwepY1GPpaKfa8H0Ut1GmbPJYMHRDvNNwRRT8zEWeYBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:19:55.049166Z"},"content_sha256":"ae7704fd43d957833264aeab80c9470e0fc5d32e4e45702090dea885ccc67108","schema_version":"1.0","event_id":"sha256:ae7704fd43d957833264aeab80c9470e0fc5d32e4e45702090dea885ccc67108"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F6H7RJCVZVVL7YI7V2LLN52LSR/bundle.json","state_url":"https://pith.science/pith/F6H7RJCVZVVL7YI7V2LLN52LSR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F6H7RJCVZVVL7YI7V2LLN52LSR/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-03T00:19:55Z","links":{"resolver":"https://pith.science/pith/F6H7RJCVZVVL7YI7V2LLN52LSR","bundle":"https://pith.science/pith/F6H7RJCVZVVL7YI7V2LLN52LSR/bundle.json","state":"https://pith.science/pith/F6H7RJCVZVVL7YI7V2LLN52LSR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F6H7RJCVZVVL7YI7V2LLN52LSR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:F6H7RJCVZVVL7YI7V2LLN52LSR","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":"0f1dc968c43442790650668c0dcb818f980a361abd9e1c8dc8cbe85469c69cc6","cross_cats_sorted":["cs.AI","cs.CV","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-04-14T18:24:06Z","title_canon_sha256":"8cc976ddb872a9a765e3ef0ce361fbcec8a476a22060b1ce5c0e481dc892c3a5"},"schema_version":"1.0","source":{"id":"1804.05260","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.05260","created_at":"2026-05-18T00:18:28Z"},{"alias_kind":"arxiv_version","alias_value":"1804.05260v1","created_at":"2026-05-18T00:18:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05260","created_at":"2026-05-18T00:18:28Z"},{"alias_kind":"pith_short_12","alias_value":"F6H7RJCVZVVL","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"F6H7RJCVZVVL7YI7","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"F6H7RJCV","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:ae7704fd43d957833264aeab80c9470e0fc5d32e4e45702090dea885ccc67108","target":"graph","created_at":"2026-05-18T00:18:28Z","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":"The fundamental problem in short-text classification is \\emph{feature sparseness} -- the lack of feature overlap between a trained model and a test instance to be classified. We propose \\emph{ClassiNet} -- a network of classifiers trained for predicting missing features in a given instance, to overcome the feature sparseness problem. Using a set of unlabeled training instances, we first learn binary classifiers as feature predictors for predicting whether a particular feature occurs in a given instance. Next, each feature predictor is represented as a vertex $v_i$ in the ClassiNet where a one-","authors_text":"Danushka Bollegala, Ken-ichi Kawarabayashi, Takanori Maehara, Vincent Atanasov","cross_cats":["cs.AI","cs.CV","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-04-14T18:24:06Z","title":"ClassiNet -- Predicting Missing Features for Short-Text Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05260","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:ada4632499931dd2440d932800523dd0910cffc836b06d9061e3e7dfcda23c2e","target":"record","created_at":"2026-05-18T00:18:28Z","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":"0f1dc968c43442790650668c0dcb818f980a361abd9e1c8dc8cbe85469c69cc6","cross_cats_sorted":["cs.AI","cs.CV","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-04-14T18:24:06Z","title_canon_sha256":"8cc976ddb872a9a765e3ef0ce361fbcec8a476a22060b1ce5c0e481dc892c3a5"},"schema_version":"1.0","source":{"id":"1804.05260","kind":"arxiv","version":1}},"canonical_sha256":"2f8ff8a455cd6abfe11fae96b6f74b947279ccdacd8b2c884a06cae603e96e2e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f8ff8a455cd6abfe11fae96b6f74b947279ccdacd8b2c884a06cae603e96e2e","first_computed_at":"2026-05-18T00:18:28.482240Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:28.482240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OEZh0FX8UtB+UexnUKeMgrmcStTVVZWZsHiPmeS5j38HyJ8wR7GxmooEva2be2ccxYHnwmtU5x1Iq0SNZJePDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:28.482569Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.05260","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ada4632499931dd2440d932800523dd0910cffc836b06d9061e3e7dfcda23c2e","sha256:ae7704fd43d957833264aeab80c9470e0fc5d32e4e45702090dea885ccc67108"],"state_sha256":"047194d6fcc22ea03855953055f467b05c077a0818b4085b4f66cb0ae2bd3a4c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zzKpy2loJWw04r4TTU5l57QBIblR0bueWAt/0OobZTRqG3bnu/u24doqen770+bpofcuMnT70+rK7WNmVeuCDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T00:19:55.051582Z","bundle_sha256":"f5461285010b609a4ed7c6af0b0917fba09e79f89f5b248b80704d1096667239"}}