{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:B2P72FDSRVC4EKGQDNIEAKURBE","short_pith_number":"pith:B2P72FDS","canonical_record":{"source":{"id":"1907.09916","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-07-23T14:40:53Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3cf11fde62e6439964d585d23c166b8ac61baab769ed87325dc9106b7ef9a39b","abstract_canon_sha256":"f64a7d95add96bd22a6b50706c220d451b36c938280de4b32599ddf0927cf49c"},"schema_version":"1.0"},"canonical_sha256":"0e9ffd14728d45c228d01b50402a9109040a84440635a5bf70423905f52577f5","source":{"kind":"arxiv","id":"1907.09916","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09916","created_at":"2026-05-17T23:39:49Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09916v1","created_at":"2026-05-17T23:39:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09916","created_at":"2026-05-17T23:39:49Z"},{"alias_kind":"pith_short_12","alias_value":"B2P72FDSRVC4","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"B2P72FDSRVC4EKGQ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"B2P72FDS","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:B2P72FDSRVC4EKGQDNIEAKURBE","target":"record","payload":{"canonical_record":{"source":{"id":"1907.09916","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-07-23T14:40:53Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3cf11fde62e6439964d585d23c166b8ac61baab769ed87325dc9106b7ef9a39b","abstract_canon_sha256":"f64a7d95add96bd22a6b50706c220d451b36c938280de4b32599ddf0927cf49c"},"schema_version":"1.0"},"canonical_sha256":"0e9ffd14728d45c228d01b50402a9109040a84440635a5bf70423905f52577f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:49.712235Z","signature_b64":"u7aLDZ+xKjMTiE6D5GxJPFlLBrn78R6cIrPOyLiY/edspAhzheT3p2hRGxhUSLMiZCWFzWwtXZ447XEx6erSCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e9ffd14728d45c228d01b50402a9109040a84440635a5bf70423905f52577f5","last_reissued_at":"2026-05-17T23:39:49.711541Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:49.711541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.09916","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-17T23:39:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uzNyYYkSiNFfGy4XFpQZl3ggfpr1+Yd3Yo97Oj3l0XGqTgDRYI/oIzSMwQnMbgjKz+T0lGTX+TrpwfXPZFESDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T10:23:15.496267Z"},"content_sha256":"4c90e270be5659142113a8cb927ca94395d559acc1f6ddfbd859bac95c6605e1","schema_version":"1.0","event_id":"sha256:4c90e270be5659142113a8cb927ca94395d559acc1f6ddfbd859bac95c6605e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:B2P72FDSRVC4EKGQDNIEAKURBE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Hardware-Efficient ADMM-Based SVM Training Algorithm for Edge Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"eess.SP","authors_text":"Chia-Hsiang Yang, Shuo-An Huang","submitted_at":"2019-07-23T14:40:53Z","abstract_excerpt":"This work demonstrates a hardware-efficient support vector machine (SVM) training algorithm via the alternative direction method of multipliers (ADMM) optimizer. Low-rank approximation is exploited to reduce the dimension of the kernel matrix by employing the Nystr\\\"{o}m method. Verified in four datasets, the proposed ADMM-based training algorithm with rank approximation reduces 32$\\times$ of matrix dimension with only 2% drop in inference accuracy. Compared to the conventional sequential minimal optimization (SMO) algorithm, the ADMM-based training algorithm is able to achieve a 9.8$\\times$10"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09916","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-17T23:39:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xy/LC15gCPqNRZI2+u/5P15X7tE716dLRBrmDbspBzDnb4F13wYwgtGyFO43aevKGAaDbTu5/hRXYHTLzJY1Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T10:23:15.496636Z"},"content_sha256":"337e86785658421505d49d55700115df02ea30a6c7a3bba8202a8b1b042db7fe","schema_version":"1.0","event_id":"sha256:337e86785658421505d49d55700115df02ea30a6c7a3bba8202a8b1b042db7fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B2P72FDSRVC4EKGQDNIEAKURBE/bundle.json","state_url":"https://pith.science/pith/B2P72FDSRVC4EKGQDNIEAKURBE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B2P72FDSRVC4EKGQDNIEAKURBE/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-21T10:23:15Z","links":{"resolver":"https://pith.science/pith/B2P72FDSRVC4EKGQDNIEAKURBE","bundle":"https://pith.science/pith/B2P72FDSRVC4EKGQDNIEAKURBE/bundle.json","state":"https://pith.science/pith/B2P72FDSRVC4EKGQDNIEAKURBE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B2P72FDSRVC4EKGQDNIEAKURBE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:B2P72FDSRVC4EKGQDNIEAKURBE","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":"f64a7d95add96bd22a6b50706c220d451b36c938280de4b32599ddf0927cf49c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-07-23T14:40:53Z","title_canon_sha256":"3cf11fde62e6439964d585d23c166b8ac61baab769ed87325dc9106b7ef9a39b"},"schema_version":"1.0","source":{"id":"1907.09916","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09916","created_at":"2026-05-17T23:39:49Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09916v1","created_at":"2026-05-17T23:39:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09916","created_at":"2026-05-17T23:39:49Z"},{"alias_kind":"pith_short_12","alias_value":"B2P72FDSRVC4","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"B2P72FDSRVC4EKGQ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"B2P72FDS","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:337e86785658421505d49d55700115df02ea30a6c7a3bba8202a8b1b042db7fe","target":"graph","created_at":"2026-05-17T23:39: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":"This work demonstrates a hardware-efficient support vector machine (SVM) training algorithm via the alternative direction method of multipliers (ADMM) optimizer. Low-rank approximation is exploited to reduce the dimension of the kernel matrix by employing the Nystr\\\"{o}m method. Verified in four datasets, the proposed ADMM-based training algorithm with rank approximation reduces 32$\\times$ of matrix dimension with only 2% drop in inference accuracy. Compared to the conventional sequential minimal optimization (SMO) algorithm, the ADMM-based training algorithm is able to achieve a 9.8$\\times$10","authors_text":"Chia-Hsiang Yang, Shuo-An Huang","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-07-23T14:40:53Z","title":"A Hardware-Efficient ADMM-Based SVM Training Algorithm for Edge Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09916","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:4c90e270be5659142113a8cb927ca94395d559acc1f6ddfbd859bac95c6605e1","target":"record","created_at":"2026-05-17T23:39: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":"f64a7d95add96bd22a6b50706c220d451b36c938280de4b32599ddf0927cf49c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-07-23T14:40:53Z","title_canon_sha256":"3cf11fde62e6439964d585d23c166b8ac61baab769ed87325dc9106b7ef9a39b"},"schema_version":"1.0","source":{"id":"1907.09916","kind":"arxiv","version":1}},"canonical_sha256":"0e9ffd14728d45c228d01b50402a9109040a84440635a5bf70423905f52577f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e9ffd14728d45c228d01b50402a9109040a84440635a5bf70423905f52577f5","first_computed_at":"2026-05-17T23:39:49.711541Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:49.711541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u7aLDZ+xKjMTiE6D5GxJPFlLBrn78R6cIrPOyLiY/edspAhzheT3p2hRGxhUSLMiZCWFzWwtXZ447XEx6erSCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:49.712235Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.09916","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c90e270be5659142113a8cb927ca94395d559acc1f6ddfbd859bac95c6605e1","sha256:337e86785658421505d49d55700115df02ea30a6c7a3bba8202a8b1b042db7fe"],"state_sha256":"e22dc3118b6607c83e7ed05a5ef04288ffe7e703bcb5021fb32f0b6ef808fb54"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mwBX3U+G9wheIygYA6t+qnNrwmA+oGIAiWmOE14pOuhHzYYQaVa90aEWiBb77KfUH11TBApxkdwpqKA9Tu+YAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T10:23:15.498731Z","bundle_sha256":"51c16b765a90bc316abebb997eae61daea9675d5c4fe09f662092d5bfdc62254"}}