{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CFEXDO7IEIL2XJJPGTYJHJRBOK","short_pith_number":"pith:CFEXDO7I","canonical_record":{"source":{"id":"1801.01687","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-05T10:11:53Z","cross_cats_sorted":[],"title_canon_sha256":"0bce908d12e64ffea810c13f1a90dfdb1bbbbf0e7b528aab33248c2ce4cb5248","abstract_canon_sha256":"837c4ba8004307a8e87ec373728a2fc869c5f383737b093b9d698fa07be512da"},"schema_version":"1.0"},"canonical_sha256":"114971bbe82217aba52f34f093a62172848241ab5513c620f70a83941d506608","source":{"kind":"arxiv","id":"1801.01687","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.01687","created_at":"2026-05-18T00:26:41Z"},{"alias_kind":"arxiv_version","alias_value":"1801.01687v1","created_at":"2026-05-18T00:26:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01687","created_at":"2026-05-18T00:26:41Z"},{"alias_kind":"pith_short_12","alias_value":"CFEXDO7IEIL2","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CFEXDO7IEIL2XJJP","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CFEXDO7I","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CFEXDO7IEIL2XJJPGTYJHJRBOK","target":"record","payload":{"canonical_record":{"source":{"id":"1801.01687","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-05T10:11:53Z","cross_cats_sorted":[],"title_canon_sha256":"0bce908d12e64ffea810c13f1a90dfdb1bbbbf0e7b528aab33248c2ce4cb5248","abstract_canon_sha256":"837c4ba8004307a8e87ec373728a2fc869c5f383737b093b9d698fa07be512da"},"schema_version":"1.0"},"canonical_sha256":"114971bbe82217aba52f34f093a62172848241ab5513c620f70a83941d506608","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:41.386135Z","signature_b64":"cXmuGtI8wzRk61kw/GKWW6lX2C83eGvZGfJtedEon6S3I3Vrr05yJGLfRfEUiTI1AmP8F7VQ3RGP8NigMXUuBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"114971bbe82217aba52f34f093a62172848241ab5513c620f70a83941d506608","last_reissued_at":"2026-05-18T00:26:41.385596Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:41.385596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.01687","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:26:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7zcntM9Jo6Xe1j4mQl/etKVvqkmTk7kipJCMyM3WTN86EqivQEpIRLGpVRZvhNtCJ+VBZ4F3SYckLTWlqj9vCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:05:34.853494Z"},"content_sha256":"9358ff03c50b414909ce42bbde4f47ae23481d289177a873639e27f0a505922f","schema_version":"1.0","event_id":"sha256:9358ff03c50b414909ce42bbde4f47ae23481d289177a873639e27f0a505922f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CFEXDO7IEIL2XJJPGTYJHJRBOK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerated Training for Massive Classification via Dynamic Class Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Dahua Lin, Junjie Yan, Lei Yang, Xingcheng Zhang","submitted_at":"2018-01-05T10:11:53Z","abstract_excerpt":"Massive classification, a classification task defined over a vast number of classes (hundreds of thousands or even millions), has become an essential part of many real-world systems, such as face recognition. Existing methods, including the deep networks that achieved remarkable success in recent years, were mostly devised for problems with a moderate number of classes. They would meet with substantial difficulties, e.g. excessive memory demand and computational cost, when applied to massive problems. We present a new method to tackle this problem. This method can efficiently and accurately id"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01687","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:26:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KKiaMhS/8Hqlaq8KG8//p532FEZAl8i7YmFO39PCnR+GdDeE6395nohLxvNCgHfLkhUzqBm3ZQJ2r9PnZ1PRAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:05:34.853869Z"},"content_sha256":"580d6bd672fabd9ba6c0e1613c460b4c2218b07e803a52de688d1c8c2371aa8c","schema_version":"1.0","event_id":"sha256:580d6bd672fabd9ba6c0e1613c460b4c2218b07e803a52de688d1c8c2371aa8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CFEXDO7IEIL2XJJPGTYJHJRBOK/bundle.json","state_url":"https://pith.science/pith/CFEXDO7IEIL2XJJPGTYJHJRBOK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CFEXDO7IEIL2XJJPGTYJHJRBOK/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-01T12:05:34Z","links":{"resolver":"https://pith.science/pith/CFEXDO7IEIL2XJJPGTYJHJRBOK","bundle":"https://pith.science/pith/CFEXDO7IEIL2XJJPGTYJHJRBOK/bundle.json","state":"https://pith.science/pith/CFEXDO7IEIL2XJJPGTYJHJRBOK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CFEXDO7IEIL2XJJPGTYJHJRBOK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CFEXDO7IEIL2XJJPGTYJHJRBOK","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":"837c4ba8004307a8e87ec373728a2fc869c5f383737b093b9d698fa07be512da","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-05T10:11:53Z","title_canon_sha256":"0bce908d12e64ffea810c13f1a90dfdb1bbbbf0e7b528aab33248c2ce4cb5248"},"schema_version":"1.0","source":{"id":"1801.01687","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.01687","created_at":"2026-05-18T00:26:41Z"},{"alias_kind":"arxiv_version","alias_value":"1801.01687v1","created_at":"2026-05-18T00:26:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01687","created_at":"2026-05-18T00:26:41Z"},{"alias_kind":"pith_short_12","alias_value":"CFEXDO7IEIL2","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CFEXDO7IEIL2XJJP","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CFEXDO7I","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:580d6bd672fabd9ba6c0e1613c460b4c2218b07e803a52de688d1c8c2371aa8c","target":"graph","created_at":"2026-05-18T00:26:41Z","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":"Massive classification, a classification task defined over a vast number of classes (hundreds of thousands or even millions), has become an essential part of many real-world systems, such as face recognition. Existing methods, including the deep networks that achieved remarkable success in recent years, were mostly devised for problems with a moderate number of classes. They would meet with substantial difficulties, e.g. excessive memory demand and computational cost, when applied to massive problems. We present a new method to tackle this problem. This method can efficiently and accurately id","authors_text":"Dahua Lin, Junjie Yan, Lei Yang, Xingcheng Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-05T10:11:53Z","title":"Accelerated Training for Massive Classification via Dynamic Class Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01687","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:9358ff03c50b414909ce42bbde4f47ae23481d289177a873639e27f0a505922f","target":"record","created_at":"2026-05-18T00:26:41Z","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":"837c4ba8004307a8e87ec373728a2fc869c5f383737b093b9d698fa07be512da","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-01-05T10:11:53Z","title_canon_sha256":"0bce908d12e64ffea810c13f1a90dfdb1bbbbf0e7b528aab33248c2ce4cb5248"},"schema_version":"1.0","source":{"id":"1801.01687","kind":"arxiv","version":1}},"canonical_sha256":"114971bbe82217aba52f34f093a62172848241ab5513c620f70a83941d506608","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"114971bbe82217aba52f34f093a62172848241ab5513c620f70a83941d506608","first_computed_at":"2026-05-18T00:26:41.385596Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:41.385596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cXmuGtI8wzRk61kw/GKWW6lX2C83eGvZGfJtedEon6S3I3Vrr05yJGLfRfEUiTI1AmP8F7VQ3RGP8NigMXUuBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:41.386135Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.01687","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9358ff03c50b414909ce42bbde4f47ae23481d289177a873639e27f0a505922f","sha256:580d6bd672fabd9ba6c0e1613c460b4c2218b07e803a52de688d1c8c2371aa8c"],"state_sha256":"b9dc5f542da8c4df93142bde249d2092a60418eeb58fc7453b1c9df1221c3967"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oCtbO5Q+Sw0pZ1TTJ5VARzLPr/V6QD03GHNzOiB9WM9i6gEMSP5pM7bp7FwjReCOPTzvXl4PKR9Ha+UqlLssBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:05:34.855901Z","bundle_sha256":"a79cb45ab96b5c86737ae516d368300d0ae02cf9912148c5201f855a9125fb07"}}