{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SMTDGZI6QLS6BK447VKSAFEF57","short_pith_number":"pith:SMTDGZI6","canonical_record":{"source":{"id":"1602.01818","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-02-04T20:31:44Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"159ccb1b426429bf0f76f2646bd6605942ddbc8de5e45a93d23ebb0f615c9fdd","abstract_canon_sha256":"84f00d51914781b1b7dcbd189edbe1371249c7d9999c35c476322f89a3c7e6d5"},"schema_version":"1.0"},"canonical_sha256":"932633651e82e5e0ab9cfd55201485eff20fbf4af8f0d1534a7d7b43f65690e4","source":{"kind":"arxiv","id":"1602.01818","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01818","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01818v1","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01818","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"SMTDGZI6QLS6","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SMTDGZI6QLS6BK44","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SMTDGZI6","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SMTDGZI6QLS6BK447VKSAFEF57","target":"record","payload":{"canonical_record":{"source":{"id":"1602.01818","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-02-04T20:31:44Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"159ccb1b426429bf0f76f2646bd6605942ddbc8de5e45a93d23ebb0f615c9fdd","abstract_canon_sha256":"84f00d51914781b1b7dcbd189edbe1371249c7d9999c35c476322f89a3c7e6d5"},"schema_version":"1.0"},"canonical_sha256":"932633651e82e5e0ab9cfd55201485eff20fbf4af8f0d1534a7d7b43f65690e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:18.059309Z","signature_b64":"ZVFNE5rKdsCHalqs0c0w19yTYkvudQaF1bchZ1os5yscmKWWLuXO4lzNAXzTN7A3FwD6OovCAYXUoJExobDsDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"932633651e82e5e0ab9cfd55201485eff20fbf4af8f0d1534a7d7b43f65690e4","last_reissued_at":"2026-05-18T01:21:18.058753Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:18.058753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.01818","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:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eIF43r6qJ9HrQufqTV1VC9MyUOCu2731ncc7cZ/xi6Wbz82188s7mAH/B8UTYAOHVHSn+L7z1y1C9q5TVgYWDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:51:59.855120Z"},"content_sha256":"035d9a7ca50242b92bdb5b077a5686f5dca173103f3dd4566a523596a87038c6","schema_version":"1.0","event_id":"sha256:035d9a7ca50242b92bdb5b077a5686f5dca173103f3dd4566a523596a87038c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SMTDGZI6QLS6BK447VKSAFEF57","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random Feature Maps via a Layered Random Projection (LaRP) Framework for Object Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"A. G. Chung, A. Wong, M. J. Shafiee","submitted_at":"2016-02-04T20:31:44Z","abstract_excerpt":"The approximation of nonlinear kernels via linear feature maps has recently gained interest due to their applications in reducing the training and testing time of kernel-based learning algorithms. Current random projection methods avoid the curse of dimensionality by embedding the nonlinear feature space into a low dimensional Euclidean space to create nonlinear kernels. We introduce a Layered Random Projection (LaRP) framework, where we model the linear kernels and nonlinearity separately for increased training efficiency. The proposed LaRP framework was assessed using the MNIST hand-written "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01818","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:21:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o+TiiZz6ytiT1xtXNaB2wZEH7vnvYthqCzJtA77qX0VeNPdPnlD4E7LyZSTRnOlE5ncyPzt9YPz6PNgA9wOxAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:51:59.855485Z"},"content_sha256":"672022bf302a8b28c94d8bbffc8220c5363d0ec2753b3926f7e8e1defa5899d1","schema_version":"1.0","event_id":"sha256:672022bf302a8b28c94d8bbffc8220c5363d0ec2753b3926f7e8e1defa5899d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SMTDGZI6QLS6BK447VKSAFEF57/bundle.json","state_url":"https://pith.science/pith/SMTDGZI6QLS6BK447VKSAFEF57/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SMTDGZI6QLS6BK447VKSAFEF57/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-03T22:51:59Z","links":{"resolver":"https://pith.science/pith/SMTDGZI6QLS6BK447VKSAFEF57","bundle":"https://pith.science/pith/SMTDGZI6QLS6BK447VKSAFEF57/bundle.json","state":"https://pith.science/pith/SMTDGZI6QLS6BK447VKSAFEF57/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SMTDGZI6QLS6BK447VKSAFEF57/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SMTDGZI6QLS6BK447VKSAFEF57","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":"84f00d51914781b1b7dcbd189edbe1371249c7d9999c35c476322f89a3c7e6d5","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-02-04T20:31:44Z","title_canon_sha256":"159ccb1b426429bf0f76f2646bd6605942ddbc8de5e45a93d23ebb0f615c9fdd"},"schema_version":"1.0","source":{"id":"1602.01818","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01818","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01818v1","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01818","created_at":"2026-05-18T01:21:18Z"},{"alias_kind":"pith_short_12","alias_value":"SMTDGZI6QLS6","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SMTDGZI6QLS6BK44","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SMTDGZI6","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:672022bf302a8b28c94d8bbffc8220c5363d0ec2753b3926f7e8e1defa5899d1","target":"graph","created_at":"2026-05-18T01:21:18Z","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 approximation of nonlinear kernels via linear feature maps has recently gained interest due to their applications in reducing the training and testing time of kernel-based learning algorithms. Current random projection methods avoid the curse of dimensionality by embedding the nonlinear feature space into a low dimensional Euclidean space to create nonlinear kernels. We introduce a Layered Random Projection (LaRP) framework, where we model the linear kernels and nonlinearity separately for increased training efficiency. The proposed LaRP framework was assessed using the MNIST hand-written ","authors_text":"A. G. Chung, A. Wong, M. J. Shafiee","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-02-04T20:31:44Z","title":"Random Feature Maps via a Layered Random Projection (LaRP) Framework for Object Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01818","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:035d9a7ca50242b92bdb5b077a5686f5dca173103f3dd4566a523596a87038c6","target":"record","created_at":"2026-05-18T01:21:18Z","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":"84f00d51914781b1b7dcbd189edbe1371249c7d9999c35c476322f89a3c7e6d5","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-02-04T20:31:44Z","title_canon_sha256":"159ccb1b426429bf0f76f2646bd6605942ddbc8de5e45a93d23ebb0f615c9fdd"},"schema_version":"1.0","source":{"id":"1602.01818","kind":"arxiv","version":1}},"canonical_sha256":"932633651e82e5e0ab9cfd55201485eff20fbf4af8f0d1534a7d7b43f65690e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"932633651e82e5e0ab9cfd55201485eff20fbf4af8f0d1534a7d7b43f65690e4","first_computed_at":"2026-05-18T01:21:18.058753Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:18.058753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZVFNE5rKdsCHalqs0c0w19yTYkvudQaF1bchZ1os5yscmKWWLuXO4lzNAXzTN7A3FwD6OovCAYXUoJExobDsDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:18.059309Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.01818","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:035d9a7ca50242b92bdb5b077a5686f5dca173103f3dd4566a523596a87038c6","sha256:672022bf302a8b28c94d8bbffc8220c5363d0ec2753b3926f7e8e1defa5899d1"],"state_sha256":"e9da273c040d2d7c39d8b90787706107383a46f76ac66b0e1dc9c621322bd4db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2YYTvtfgAOgiaBBlSlvQ8Et3HnU/u8dzAw8y13c9eBhKmqwrh+PRDxk7Oi6rmAU8MmYgem3RgQFLkrLD7/VeAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:51:59.857468Z","bundle_sha256":"b76702f3006129605404e4d34ac7a44d18cacda8a12e8fcb126e3e1b1b9c69e9"}}