{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7EYBAGXQJG7MI6WVU3XC3DSADZ","short_pith_number":"pith:7EYBAGXQ","canonical_record":{"source":{"id":"1802.05981","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-15T09:49:38Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0e704ed7b988037990eecafd2b5c79697dbd4ac650b2fc0d56aa60540408b96f","abstract_canon_sha256":"53f9aaddd20509348983ae2391dadc36e17179a793a8376b1d821308e0aabf3c"},"schema_version":"1.0"},"canonical_sha256":"f930101af049bec47ad5a6ee2d8e401e40e0f407161805cc2137c2d50396cba9","source":{"kind":"arxiv","id":"1802.05981","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05981","created_at":"2026-05-17T23:54:54Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05981v1","created_at":"2026-05-17T23:54:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05981","created_at":"2026-05-17T23:54:54Z"},{"alias_kind":"pith_short_12","alias_value":"7EYBAGXQJG7M","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7EYBAGXQJG7MI6WV","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7EYBAGXQ","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7EYBAGXQJG7MI6WVU3XC3DSADZ","target":"record","payload":{"canonical_record":{"source":{"id":"1802.05981","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-15T09:49:38Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0e704ed7b988037990eecafd2b5c79697dbd4ac650b2fc0d56aa60540408b96f","abstract_canon_sha256":"53f9aaddd20509348983ae2391dadc36e17179a793a8376b1d821308e0aabf3c"},"schema_version":"1.0"},"canonical_sha256":"f930101af049bec47ad5a6ee2d8e401e40e0f407161805cc2137c2d50396cba9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:54.565853Z","signature_b64":"sBltMtux4SZ5tmzHerK6phITIcTijrhYD0mCFKQOEpIh4Z1z+uyzzriG7XbrntOQ7rIGy52pZ70KZIM+6od7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f930101af049bec47ad5a6ee2d8e401e40e0f407161805cc2137c2d50396cba9","last_reissued_at":"2026-05-17T23:54:54.565378Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:54.565378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.05981","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:54:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"REE2gW1ua0514tXWq9syVMAc+yfQuvYaNbukBsPgX8oLpu+Bx9n80UKNOV+JJiNpWtexPwKuEtKDGWD1IuT1Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:19:40.559645Z"},"content_sha256":"3bab0914416a10c82716b16a71f7aabf4b348c4b0997515cb53d99a535ea2721","schema_version":"1.0","event_id":"sha256:3bab0914416a10c82716b16a71f7aabf4b348c4b0997515cb53d99a535ea2721"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7EYBAGXQJG7MI6WVU3XC3DSADZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tensor-based Nonlinear Classifier for High-Order Data Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Anastasios Doulamis, Antonis Nikitakis, Athanasios Voulodimos, Konstantinos Makantasis, Nikolaos Doulamis","submitted_at":"2018-02-15T09:49:38Z","abstract_excerpt":"In this paper we propose a tensor-based nonlinear model for high-order data classification. The advantages of the proposed scheme are that (i) it significantly reduces the number of weight parameters, and hence of required training samples, and (ii) it retains the spatial structure of the input samples. The proposed model, called \\textit{Rank}-1 FNN, is based on a modification of a feedforward neural network (FNN), such that its weights satisfy the {\\it rank}-1 canonical decomposition. We also introduce a new learning algorithm to train the model, and we evaluate the \\textit{Rank}-1 FNN on thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05981","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:54:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hxlFZMRMwOk8vN2Aa6vailhck/eTWbHEw/ku4xJKFzlp3nr082XO/2qcN+a3JDNGNR6H6iNWQHjxt9j/8Qv5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:19:40.559993Z"},"content_sha256":"f9883e6b4f8143936e53b7cc5b1653edf2a87e8aeaf921e881bff08f7c05153d","schema_version":"1.0","event_id":"sha256:f9883e6b4f8143936e53b7cc5b1653edf2a87e8aeaf921e881bff08f7c05153d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7EYBAGXQJG7MI6WVU3XC3DSADZ/bundle.json","state_url":"https://pith.science/pith/7EYBAGXQJG7MI6WVU3XC3DSADZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7EYBAGXQJG7MI6WVU3XC3DSADZ/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-11T09:19:40Z","links":{"resolver":"https://pith.science/pith/7EYBAGXQJG7MI6WVU3XC3DSADZ","bundle":"https://pith.science/pith/7EYBAGXQJG7MI6WVU3XC3DSADZ/bundle.json","state":"https://pith.science/pith/7EYBAGXQJG7MI6WVU3XC3DSADZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7EYBAGXQJG7MI6WVU3XC3DSADZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7EYBAGXQJG7MI6WVU3XC3DSADZ","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":"53f9aaddd20509348983ae2391dadc36e17179a793a8376b1d821308e0aabf3c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-15T09:49:38Z","title_canon_sha256":"0e704ed7b988037990eecafd2b5c79697dbd4ac650b2fc0d56aa60540408b96f"},"schema_version":"1.0","source":{"id":"1802.05981","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05981","created_at":"2026-05-17T23:54:54Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05981v1","created_at":"2026-05-17T23:54:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05981","created_at":"2026-05-17T23:54:54Z"},{"alias_kind":"pith_short_12","alias_value":"7EYBAGXQJG7M","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7EYBAGXQJG7MI6WV","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7EYBAGXQ","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:f9883e6b4f8143936e53b7cc5b1653edf2a87e8aeaf921e881bff08f7c05153d","target":"graph","created_at":"2026-05-17T23:54:54Z","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 this paper we propose a tensor-based nonlinear model for high-order data classification. The advantages of the proposed scheme are that (i) it significantly reduces the number of weight parameters, and hence of required training samples, and (ii) it retains the spatial structure of the input samples. The proposed model, called \\textit{Rank}-1 FNN, is based on a modification of a feedforward neural network (FNN), such that its weights satisfy the {\\it rank}-1 canonical decomposition. We also introduce a new learning algorithm to train the model, and we evaluate the \\textit{Rank}-1 FNN on thi","authors_text":"Anastasios Doulamis, Antonis Nikitakis, Athanasios Voulodimos, Konstantinos Makantasis, Nikolaos Doulamis","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-15T09:49:38Z","title":"Tensor-based Nonlinear Classifier for High-Order Data Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05981","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:3bab0914416a10c82716b16a71f7aabf4b348c4b0997515cb53d99a535ea2721","target":"record","created_at":"2026-05-17T23:54:54Z","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":"53f9aaddd20509348983ae2391dadc36e17179a793a8376b1d821308e0aabf3c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-15T09:49:38Z","title_canon_sha256":"0e704ed7b988037990eecafd2b5c79697dbd4ac650b2fc0d56aa60540408b96f"},"schema_version":"1.0","source":{"id":"1802.05981","kind":"arxiv","version":1}},"canonical_sha256":"f930101af049bec47ad5a6ee2d8e401e40e0f407161805cc2137c2d50396cba9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f930101af049bec47ad5a6ee2d8e401e40e0f407161805cc2137c2d50396cba9","first_computed_at":"2026-05-17T23:54:54.565378Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:54.565378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sBltMtux4SZ5tmzHerK6phITIcTijrhYD0mCFKQOEpIh4Z1z+uyzzriG7XbrntOQ7rIGy52pZ70KZIM+6od7BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:54.565853Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.05981","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bab0914416a10c82716b16a71f7aabf4b348c4b0997515cb53d99a535ea2721","sha256:f9883e6b4f8143936e53b7cc5b1653edf2a87e8aeaf921e881bff08f7c05153d"],"state_sha256":"3bcea92405eac970f039c5506f1471ba6b23b6b231377684fedbb410589c79bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vkWFdcWo+Ptwu4bls4Wok29QxbOWZcuNJzUiAJk7N/oAXasMuBYrr+BlAAoCpjhT1vBUCzj6KV8+IjIWE69eCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T09:19:40.561933Z","bundle_sha256":"7eeba100fba57e938f088404168aa36381626620a68cdf57191a0a4204505dd4"}}