{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KNWNJ75YTQKFEBMOWZ5527AEO4","short_pith_number":"pith:KNWNJ75Y","canonical_record":{"source":{"id":"1802.03938","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-12T08:51:57Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d9a40bd49149b360756a67b36724c11111a2db647804eeb2256ce319b136f491","abstract_canon_sha256":"653244d2df60a710c3a4fb5506476fe38b94b6c00636066b3d77cf8354ff1e49"},"schema_version":"1.0"},"canonical_sha256":"536cd4ffb89c1452058eb67bdd7c04772f879ff980c51170fa7913a8b472bbb3","source":{"kind":"arxiv","id":"1802.03938","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03938","created_at":"2026-05-18T00:23:49Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03938v1","created_at":"2026-05-18T00:23:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03938","created_at":"2026-05-18T00:23:49Z"},{"alias_kind":"pith_short_12","alias_value":"KNWNJ75YTQKF","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KNWNJ75YTQKFEBMO","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KNWNJ75Y","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KNWNJ75YTQKFEBMOWZ5527AEO4","target":"record","payload":{"canonical_record":{"source":{"id":"1802.03938","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-12T08:51:57Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d9a40bd49149b360756a67b36724c11111a2db647804eeb2256ce319b136f491","abstract_canon_sha256":"653244d2df60a710c3a4fb5506476fe38b94b6c00636066b3d77cf8354ff1e49"},"schema_version":"1.0"},"canonical_sha256":"536cd4ffb89c1452058eb67bdd7c04772f879ff980c51170fa7913a8b472bbb3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:49.940096Z","signature_b64":"yTcbsrdtMoUm6Qw4H4XKNd1Vmi3Ta6KmiUwBP7mzwceptp5ns0PVvFnQHTmINet8yvtaK9Xcrg3xOtEDPcPhAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"536cd4ffb89c1452058eb67bdd7c04772f879ff980c51170fa7913a8b472bbb3","last_reissued_at":"2026-05-18T00:23:49.939478Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:49.939478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.03938","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:23:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8JPOF7CjHh3YmiiUCZ8p4IbkutC8cii/WrWdylSd5BvBWuOLieCJrn1ppBm2797l2VdXRb0RxawUX7aPEi+tBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:28:11.916147Z"},"content_sha256":"50e6d276e4aa2fa7c98046a85ab92e09e3fd828c6f610fea68baf63dbe1ee139","schema_version":"1.0","event_id":"sha256:50e6d276e4aa2fa7c98046a85ab92e09e3fd828c6f610fea68baf63dbe1ee139"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KNWNJ75YTQKFEBMOWZ5527AEO4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Revisiting the Vector Space Model: Sparse Weighted Nearest-Neighbor Method for Extreme Multi-Label Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Kei Kobayashi, Mihoko Minami, Tatsuhiro Aoshima","submitted_at":"2018-02-12T08:51:57Z","abstract_excerpt":"Machine learning has played an important role in information retrieval (IR) in recent times. In search engines, for example, query keywords are accepted and documents are returned in order of relevance to the given query; this can be cast as a multi-label ranking problem in machine learning. Generally, the number of candidate documents is extremely large (from several thousand to several million); thus, the classifier must handle many labels. This problem is referred to as extreme multi-label classification (XMLC). In this paper, we propose a novel approach to XMLC termed the Sparse Weighted N"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03938","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:23:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VMVVVQMtx2y9D8nvCJaZR7g5RbUwhmXUYkSSg0mpeUK07EAjnMxy95HK3aPOUzyGzDKpeTsSbwvgKoCy+WJiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:28:11.916507Z"},"content_sha256":"e746a4ee524d2b0bcf09221f4cd6253c890ff2ebf51320d91a6ff1c36687031f","schema_version":"1.0","event_id":"sha256:e746a4ee524d2b0bcf09221f4cd6253c890ff2ebf51320d91a6ff1c36687031f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KNWNJ75YTQKFEBMOWZ5527AEO4/bundle.json","state_url":"https://pith.science/pith/KNWNJ75YTQKFEBMOWZ5527AEO4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KNWNJ75YTQKFEBMOWZ5527AEO4/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-05T09:28:11Z","links":{"resolver":"https://pith.science/pith/KNWNJ75YTQKFEBMOWZ5527AEO4","bundle":"https://pith.science/pith/KNWNJ75YTQKFEBMOWZ5527AEO4/bundle.json","state":"https://pith.science/pith/KNWNJ75YTQKFEBMOWZ5527AEO4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KNWNJ75YTQKFEBMOWZ5527AEO4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KNWNJ75YTQKFEBMOWZ5527AEO4","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":"653244d2df60a710c3a4fb5506476fe38b94b6c00636066b3d77cf8354ff1e49","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-12T08:51:57Z","title_canon_sha256":"d9a40bd49149b360756a67b36724c11111a2db647804eeb2256ce319b136f491"},"schema_version":"1.0","source":{"id":"1802.03938","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.03938","created_at":"2026-05-18T00:23:49Z"},{"alias_kind":"arxiv_version","alias_value":"1802.03938v1","created_at":"2026-05-18T00:23:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03938","created_at":"2026-05-18T00:23:49Z"},{"alias_kind":"pith_short_12","alias_value":"KNWNJ75YTQKF","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KNWNJ75YTQKFEBMO","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KNWNJ75Y","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:e746a4ee524d2b0bcf09221f4cd6253c890ff2ebf51320d91a6ff1c36687031f","target":"graph","created_at":"2026-05-18T00:23: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":"Machine learning has played an important role in information retrieval (IR) in recent times. In search engines, for example, query keywords are accepted and documents are returned in order of relevance to the given query; this can be cast as a multi-label ranking problem in machine learning. Generally, the number of candidate documents is extremely large (from several thousand to several million); thus, the classifier must handle many labels. This problem is referred to as extreme multi-label classification (XMLC). In this paper, we propose a novel approach to XMLC termed the Sparse Weighted N","authors_text":"Kei Kobayashi, Mihoko Minami, Tatsuhiro Aoshima","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-12T08:51:57Z","title":"Revisiting the Vector Space Model: Sparse Weighted Nearest-Neighbor Method for Extreme Multi-Label Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03938","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:50e6d276e4aa2fa7c98046a85ab92e09e3fd828c6f610fea68baf63dbe1ee139","target":"record","created_at":"2026-05-18T00:23: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":"653244d2df60a710c3a4fb5506476fe38b94b6c00636066b3d77cf8354ff1e49","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-02-12T08:51:57Z","title_canon_sha256":"d9a40bd49149b360756a67b36724c11111a2db647804eeb2256ce319b136f491"},"schema_version":"1.0","source":{"id":"1802.03938","kind":"arxiv","version":1}},"canonical_sha256":"536cd4ffb89c1452058eb67bdd7c04772f879ff980c51170fa7913a8b472bbb3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"536cd4ffb89c1452058eb67bdd7c04772f879ff980c51170fa7913a8b472bbb3","first_computed_at":"2026-05-18T00:23:49.939478Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:49.939478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yTcbsrdtMoUm6Qw4H4XKNd1Vmi3Ta6KmiUwBP7mzwceptp5ns0PVvFnQHTmINet8yvtaK9Xcrg3xOtEDPcPhAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:49.940096Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.03938","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50e6d276e4aa2fa7c98046a85ab92e09e3fd828c6f610fea68baf63dbe1ee139","sha256:e746a4ee524d2b0bcf09221f4cd6253c890ff2ebf51320d91a6ff1c36687031f"],"state_sha256":"c93a3fe22493e086120ffff10ea240b2ba1f5fc9e319779bd67d1da886a38fcf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1DNHsl+MGiQ4deOADK1wRj3+IZWlhGWSnpQbDHr1gTiamoPfe+Icj7Zc0quCnbuHcfQUz78Ww+fD+m5OpvaZDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T09:28:11.918425Z","bundle_sha256":"8b9fb602867900e223bc371147ff401b88649646490a9ebbe1af975a2866f354"}}