{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:K5NIXSK73RKWYRDUCEAOWG3G4F","short_pith_number":"pith:K5NIXSK7","canonical_record":{"source":{"id":"1612.06505","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-20T04:54:49Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"23887a3ef1e6dd45021b1a98f3c49212ce20dd5534980e914f57a57b9d0f3c96","abstract_canon_sha256":"0285a0ef1e9604833dabf315050038df8ddac22f4c87e3488a8cee014ed06510"},"schema_version":"1.0"},"canonical_sha256":"575a8bc95fdc556c44741100eb1b66e14a6fcd29138ec864076cf6b80175b56e","source":{"kind":"arxiv","id":"1612.06505","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.06505","created_at":"2026-05-18T00:31:22Z"},{"alias_kind":"arxiv_version","alias_value":"1612.06505v4","created_at":"2026-05-18T00:31:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.06505","created_at":"2026-05-18T00:31:22Z"},{"alias_kind":"pith_short_12","alias_value":"K5NIXSK73RKW","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"K5NIXSK73RKWYRDU","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"K5NIXSK7","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:K5NIXSK73RKWYRDUCEAOWG3G4F","target":"record","payload":{"canonical_record":{"source":{"id":"1612.06505","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-20T04:54:49Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"23887a3ef1e6dd45021b1a98f3c49212ce20dd5534980e914f57a57b9d0f3c96","abstract_canon_sha256":"0285a0ef1e9604833dabf315050038df8ddac22f4c87e3488a8cee014ed06510"},"schema_version":"1.0"},"canonical_sha256":"575a8bc95fdc556c44741100eb1b66e14a6fcd29138ec864076cf6b80175b56e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:22.263384Z","signature_b64":"Tj/JLVtqq2bmjALIN0s1qGrB/fUKqnTXZn8mJH9pZ0tCiTZC4DTEBRXB7EXg8pyQpcPkHB0YnUgHlgbdOAMrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"575a8bc95fdc556c44741100eb1b66e14a6fcd29138ec864076cf6b80175b56e","last_reissued_at":"2026-05-18T00:31:22.262925Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:22.262925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.06505","source_version":4,"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:31:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OU7YjM02rbjHBvzzd+dyAJCTsMC0ncXbGolPw2OezDEMOEQzGGTE/BjYkXdZiWTYaxNpPefgrDu0MiYUbwA/Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:19:39.683078Z"},"content_sha256":"7e4b225b4aa1827ac1a4e8ee8c62b139319ad36173657d300d15b2bd0909ad9c","schema_version":"1.0","event_id":"sha256:7e4b225b4aa1827ac1a4e8ee8c62b139319ad36173657d300d15b2bd0909ad9c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:K5NIXSK73RKWYRDUCEAOWG3G4F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallelized Tensor Train Learning of Polynomial Classifiers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Johan A.K. Suykens, Kim Batselier, Ngai Wong, Zhongming Chen","submitted_at":"2016-12-20T04:54:49Z","abstract_excerpt":"In pattern classification, polynomial classifiers are well-studied methods as they are capable of generating complex decision surfaces. Unfortunately, the use of multivariate polynomials is limited to kernels as in support vector machines, because polynomials quickly become impractical for high-dimensional problems. In this paper, we effectively overcome the curse of dimensionality by employing the tensor train format to represent a polynomial classifier. Based on the structure of tensor trains, two learning algorithms are proposed which involve solving different optimization problems of low c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.06505","kind":"arxiv","version":4},"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:31:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zRnYCxM0447dFHd5NuGr3WFEFu3QQtMGd+MrDlFXsyiaR6EZcX38nbjqkYww4J/fb3c9oZ6r0haaRKZoCuqGBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:19:39.683446Z"},"content_sha256":"d3cfa895112bdc88f81ff2855c1c138809280237c73584cb2ed483e14c464116","schema_version":"1.0","event_id":"sha256:d3cfa895112bdc88f81ff2855c1c138809280237c73584cb2ed483e14c464116"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K5NIXSK73RKWYRDUCEAOWG3G4F/bundle.json","state_url":"https://pith.science/pith/K5NIXSK73RKWYRDUCEAOWG3G4F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K5NIXSK73RKWYRDUCEAOWG3G4F/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-28T08:19:39Z","links":{"resolver":"https://pith.science/pith/K5NIXSK73RKWYRDUCEAOWG3G4F","bundle":"https://pith.science/pith/K5NIXSK73RKWYRDUCEAOWG3G4F/bundle.json","state":"https://pith.science/pith/K5NIXSK73RKWYRDUCEAOWG3G4F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K5NIXSK73RKWYRDUCEAOWG3G4F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:K5NIXSK73RKWYRDUCEAOWG3G4F","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":"0285a0ef1e9604833dabf315050038df8ddac22f4c87e3488a8cee014ed06510","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-20T04:54:49Z","title_canon_sha256":"23887a3ef1e6dd45021b1a98f3c49212ce20dd5534980e914f57a57b9d0f3c96"},"schema_version":"1.0","source":{"id":"1612.06505","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.06505","created_at":"2026-05-18T00:31:22Z"},{"alias_kind":"arxiv_version","alias_value":"1612.06505v4","created_at":"2026-05-18T00:31:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.06505","created_at":"2026-05-18T00:31:22Z"},{"alias_kind":"pith_short_12","alias_value":"K5NIXSK73RKW","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"K5NIXSK73RKWYRDU","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"K5NIXSK7","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:d3cfa895112bdc88f81ff2855c1c138809280237c73584cb2ed483e14c464116","target":"graph","created_at":"2026-05-18T00:31:22Z","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":"In pattern classification, polynomial classifiers are well-studied methods as they are capable of generating complex decision surfaces. Unfortunately, the use of multivariate polynomials is limited to kernels as in support vector machines, because polynomials quickly become impractical for high-dimensional problems. In this paper, we effectively overcome the curse of dimensionality by employing the tensor train format to represent a polynomial classifier. Based on the structure of tensor trains, two learning algorithms are proposed which involve solving different optimization problems of low c","authors_text":"Johan A.K. Suykens, Kim Batselier, Ngai Wong, Zhongming Chen","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-20T04:54:49Z","title":"Parallelized Tensor Train Learning of Polynomial Classifiers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.06505","kind":"arxiv","version":4},"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:7e4b225b4aa1827ac1a4e8ee8c62b139319ad36173657d300d15b2bd0909ad9c","target":"record","created_at":"2026-05-18T00:31:22Z","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":"0285a0ef1e9604833dabf315050038df8ddac22f4c87e3488a8cee014ed06510","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-20T04:54:49Z","title_canon_sha256":"23887a3ef1e6dd45021b1a98f3c49212ce20dd5534980e914f57a57b9d0f3c96"},"schema_version":"1.0","source":{"id":"1612.06505","kind":"arxiv","version":4}},"canonical_sha256":"575a8bc95fdc556c44741100eb1b66e14a6fcd29138ec864076cf6b80175b56e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"575a8bc95fdc556c44741100eb1b66e14a6fcd29138ec864076cf6b80175b56e","first_computed_at":"2026-05-18T00:31:22.262925Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:22.262925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Tj/JLVtqq2bmjALIN0s1qGrB/fUKqnTXZn8mJH9pZ0tCiTZC4DTEBRXB7EXg8pyQpcPkHB0YnUgHlgbdOAMrAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:22.263384Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.06505","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e4b225b4aa1827ac1a4e8ee8c62b139319ad36173657d300d15b2bd0909ad9c","sha256:d3cfa895112bdc88f81ff2855c1c138809280237c73584cb2ed483e14c464116"],"state_sha256":"c249f00f97f5909e177447481b7164a3ba053a4cf8e37c95323ff502bbd32ebb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oJ1TYptQ1Wg1coKer87x1KiGKH0Q85da5DTP1/I5bN1m6qKLEND3abIU3PqVCr/9dUdiaXPapMTwFncgultdBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:19:39.685474Z","bundle_sha256":"6608543535fd366848e6092928586712870f383729a310cf6210433f8b7eb21c"}}