{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:ZNKK5PXDQUB5FGCQXXACUWMNWE","short_pith_number":"pith:ZNKK5PXD","canonical_record":{"source":{"id":"2001.10109","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-01-27T22:38:40Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7eefe4a3c62e437781a445da70c11660d85867965238cad679ace0b1775077f2","abstract_canon_sha256":"311ed83a175ff50e83c84af59c66fa01072e84b623844b9b19257f88f74f287a"},"schema_version":"1.0"},"canonical_sha256":"cb54aebee38503d29850bdc02a598db10080d06765680ca215832803de8cec8a","source":{"kind":"arxiv","id":"2001.10109","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.10109","created_at":"2026-07-05T02:27:18Z"},{"alias_kind":"arxiv_version","alias_value":"2001.10109v3","created_at":"2026-07-05T02:27:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.10109","created_at":"2026-07-05T02:27:18Z"},{"alias_kind":"pith_short_12","alias_value":"ZNKK5PXDQUB5","created_at":"2026-07-05T02:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"ZNKK5PXDQUB5FGCQ","created_at":"2026-07-05T02:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"ZNKK5PXD","created_at":"2026-07-05T02:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:ZNKK5PXDQUB5FGCQXXACUWMNWE","target":"record","payload":{"canonical_record":{"source":{"id":"2001.10109","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-01-27T22:38:40Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7eefe4a3c62e437781a445da70c11660d85867965238cad679ace0b1775077f2","abstract_canon_sha256":"311ed83a175ff50e83c84af59c66fa01072e84b623844b9b19257f88f74f287a"},"schema_version":"1.0"},"canonical_sha256":"cb54aebee38503d29850bdc02a598db10080d06765680ca215832803de8cec8a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:27:18.942286Z","signature_b64":"nz009lUnU4gfnTu+81ZhF8S9bOg4Jft0AwhrkeDIOtjtpm0CdADOTsDOsTJLXw1tD2aZB5hlevuwdkEjOD/vDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb54aebee38503d29850bdc02a598db10080d06765680ca215832803de8cec8a","last_reissued_at":"2026-07-05T02:27:18.941835Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:27:18.941835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2001.10109","source_version":3,"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-07-05T02:27:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TRObflNfK//4X0xCvLHghHygMQvK6YFkjeCIgIEZVF2P1erHTkNvOMlQH/z/zAV61+8mdz0f+NO3qxbgFG8lDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:38:06.864542Z"},"content_sha256":"a7f5cbf809fa03262cb82cc84cc2b43baff5714b7d7415439e3025f2d293553e","schema_version":"1.0","event_id":"sha256:a7f5cbf809fa03262cb82cc84cc2b43baff5714b7d7415439e3025f2d293553e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:ZNKK5PXDQUB5FGCQXXACUWMNWE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Supervised Learning for Non-Sequential Data: A Canonical Polyadic Decomposition Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexandros Haliassos, Danilo P. Mandic, Kriton Konstantinidis","submitted_at":"2020-01-27T22:38:40Z","abstract_excerpt":"Efficient modelling of feature interactions underpins supervised learning for non-sequential tasks, characterized by a lack of inherent ordering of features (variables). The brute force approach of learning a parameter for each interaction of every order comes at an exponential computational and memory cost (Curse of Dimensionality). To alleviate this issue, it has been proposed to implicitly represent the model parameters as a tensor, the order of which is equal to the number of features; for efficiency, it can be further factorized into a compact Tensor Train (TT) format. However, both TT an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.10109","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2001.10109/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:27:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FBjudxVRk3B7o4CyPHLUWh1vMiPeUswhDS1wSaVASCLk6E/QYdNT2lNpGPnG4CjNTSdK9UQytA5YUDWQyaUsCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:38:06.864930Z"},"content_sha256":"69496d755d3482007e1a678ae62b6bf4cc46b05c3bf6ab4c0f35a38f1b20d12b","schema_version":"1.0","event_id":"sha256:69496d755d3482007e1a678ae62b6bf4cc46b05c3bf6ab4c0f35a38f1b20d12b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZNKK5PXDQUB5FGCQXXACUWMNWE/bundle.json","state_url":"https://pith.science/pith/ZNKK5PXDQUB5FGCQXXACUWMNWE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZNKK5PXDQUB5FGCQXXACUWMNWE/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-07-07T11:38:06Z","links":{"resolver":"https://pith.science/pith/ZNKK5PXDQUB5FGCQXXACUWMNWE","bundle":"https://pith.science/pith/ZNKK5PXDQUB5FGCQXXACUWMNWE/bundle.json","state":"https://pith.science/pith/ZNKK5PXDQUB5FGCQXXACUWMNWE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZNKK5PXDQUB5FGCQXXACUWMNWE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:ZNKK5PXDQUB5FGCQXXACUWMNWE","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":"311ed83a175ff50e83c84af59c66fa01072e84b623844b9b19257f88f74f287a","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-01-27T22:38:40Z","title_canon_sha256":"7eefe4a3c62e437781a445da70c11660d85867965238cad679ace0b1775077f2"},"schema_version":"1.0","source":{"id":"2001.10109","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2001.10109","created_at":"2026-07-05T02:27:18Z"},{"alias_kind":"arxiv_version","alias_value":"2001.10109v3","created_at":"2026-07-05T02:27:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.10109","created_at":"2026-07-05T02:27:18Z"},{"alias_kind":"pith_short_12","alias_value":"ZNKK5PXDQUB5","created_at":"2026-07-05T02:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"ZNKK5PXDQUB5FGCQ","created_at":"2026-07-05T02:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"ZNKK5PXD","created_at":"2026-07-05T02:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:69496d755d3482007e1a678ae62b6bf4cc46b05c3bf6ab4c0f35a38f1b20d12b","target":"graph","created_at":"2026-07-05T02:27: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2001.10109/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Efficient modelling of feature interactions underpins supervised learning for non-sequential tasks, characterized by a lack of inherent ordering of features (variables). The brute force approach of learning a parameter for each interaction of every order comes at an exponential computational and memory cost (Curse of Dimensionality). To alleviate this issue, it has been proposed to implicitly represent the model parameters as a tensor, the order of which is equal to the number of features; for efficiency, it can be further factorized into a compact Tensor Train (TT) format. However, both TT an","authors_text":"Alexandros Haliassos, Danilo P. Mandic, Kriton Konstantinidis","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-01-27T22:38:40Z","title":"Supervised Learning for Non-Sequential Data: A Canonical Polyadic Decomposition Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.10109","kind":"arxiv","version":3},"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:a7f5cbf809fa03262cb82cc84cc2b43baff5714b7d7415439e3025f2d293553e","target":"record","created_at":"2026-07-05T02:27: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":"311ed83a175ff50e83c84af59c66fa01072e84b623844b9b19257f88f74f287a","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-01-27T22:38:40Z","title_canon_sha256":"7eefe4a3c62e437781a445da70c11660d85867965238cad679ace0b1775077f2"},"schema_version":"1.0","source":{"id":"2001.10109","kind":"arxiv","version":3}},"canonical_sha256":"cb54aebee38503d29850bdc02a598db10080d06765680ca215832803de8cec8a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb54aebee38503d29850bdc02a598db10080d06765680ca215832803de8cec8a","first_computed_at":"2026-07-05T02:27:18.941835Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:27:18.941835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nz009lUnU4gfnTu+81ZhF8S9bOg4Jft0AwhrkeDIOtjtpm0CdADOTsDOsTJLXw1tD2aZB5hlevuwdkEjOD/vDg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:27:18.942286Z","signed_message":"canonical_sha256_bytes"},"source_id":"2001.10109","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7f5cbf809fa03262cb82cc84cc2b43baff5714b7d7415439e3025f2d293553e","sha256:69496d755d3482007e1a678ae62b6bf4cc46b05c3bf6ab4c0f35a38f1b20d12b"],"state_sha256":"df1a7da1fa198e780ea410844c318a9c80e562bc389ba774d3a53ec36051ab86"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2JRpeIayGTNgoVoO6oErKIKm6kTNEqmOLopB4jwWFtqf3t6ViD6jSXgHgX2KqwCsTWKdYB5dz2xyaOOvRa/ADw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T11:38:06.866844Z","bundle_sha256":"9cd819f609530e01d42600bd8711865ebc671dbbba3fe7d88644fb3ce009df9d"}}