{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GKPAZGXUS7O3T3YI6NJIC75A4N","short_pith_number":"pith:GKPAZGXU","canonical_record":{"source":{"id":"1710.05213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-14T17:12:42Z","cross_cats_sorted":[],"title_canon_sha256":"b5870c21f12049b2ef53970709023781054caddc0fd26739309fba41f32268b6","abstract_canon_sha256":"123de5263cf4678ac88a5075b2f6587810a8aa025882b207788d1c9ab0081b34"},"schema_version":"1.0"},"canonical_sha256":"329e0c9af497ddb9ef08f352817fa0e37419bc03834905b651a208206b2a12cd","source":{"kind":"arxiv","id":"1710.05213","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.05213","created_at":"2026-07-05T00:35:17Z"},{"alias_kind":"arxiv_version","alias_value":"1710.05213v1","created_at":"2026-07-05T00:35:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05213","created_at":"2026-07-05T00:35:17Z"},{"alias_kind":"pith_short_12","alias_value":"GKPAZGXUS7O3","created_at":"2026-07-05T00:35:17Z"},{"alias_kind":"pith_short_16","alias_value":"GKPAZGXUS7O3T3YI","created_at":"2026-07-05T00:35:17Z"},{"alias_kind":"pith_short_8","alias_value":"GKPAZGXU","created_at":"2026-07-05T00:35:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GKPAZGXUS7O3T3YI6NJIC75A4N","target":"record","payload":{"canonical_record":{"source":{"id":"1710.05213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-14T17:12:42Z","cross_cats_sorted":[],"title_canon_sha256":"b5870c21f12049b2ef53970709023781054caddc0fd26739309fba41f32268b6","abstract_canon_sha256":"123de5263cf4678ac88a5075b2f6587810a8aa025882b207788d1c9ab0081b34"},"schema_version":"1.0"},"canonical_sha256":"329e0c9af497ddb9ef08f352817fa0e37419bc03834905b651a208206b2a12cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:35:17.917607Z","signature_b64":"CXzWNApW4tw/wWCsTF5qxPBHKQdXjmlybYBJanChYY9J4CQhWEsy+blh7IWIbYK6RRIEyGEmTbJDfT5cM2RtAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"329e0c9af497ddb9ef08f352817fa0e37419bc03834905b651a208206b2a12cd","last_reissued_at":"2026-07-05T00:35:17.917131Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:35:17.917131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.05213","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-07-05T00:35:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZBxT1MDXjMrsSo/x8AgTc6DyJZhXAOkLG2GHpy7u3k0IuU4+45XjAlYOJENaeefDmX87XHbBQIPK+6rjGau7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:59:24.969237Z"},"content_sha256":"55bda4aa8c41a18f3a48650bceab43a7998d64c2560df54c4a77c5320845278c","schema_version":"1.0","event_id":"sha256:55bda4aa8c41a18f3a48650bceab43a7998d64c2560df54c4a77c5320845278c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GKPAZGXUS7O3T3YI6NJIC75A4N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simultaneous Matrix Diagonalization for Structural Brain Networks Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Boris A. Gutman, Joshua I. Faskowitz, Maxim Panov, Neda Jahanshad, Nikita Mokrov, Paul M. Thompson","submitted_at":"2017-10-14T17:12:42Z","abstract_excerpt":"This paper considers the problem of brain disease classification based on connectome data. A connectome is a network representation of a human brain. The typical connectome classification problem is very challenging because of the small sample size and high dimensionality of the data. We propose to use simultaneous approximate diagonalization of adjacency matrices in order to compute their eigenstructures in more stable way. The obtained approximate eigenvalues are further used as features for classification. The proposed approach is demonstrated to be efficient for detection of Alzheimer's di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05213","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1710.05213/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-05T00:35:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3xxSdnXUt+dTSoIixoa5lndmuu+69Rt5xIlxQPB90uN+7fxODYrmwniTF0UVnzDS6qJcUjnzATpzmuqTzPXODQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:59:24.969619Z"},"content_sha256":"3e131fa0b53af21f6e6f0778072000d4121f0422a57fe6248dc3096410fe8a87","schema_version":"1.0","event_id":"sha256:3e131fa0b53af21f6e6f0778072000d4121f0422a57fe6248dc3096410fe8a87"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GKPAZGXUS7O3T3YI6NJIC75A4N/bundle.json","state_url":"https://pith.science/pith/GKPAZGXUS7O3T3YI6NJIC75A4N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GKPAZGXUS7O3T3YI6NJIC75A4N/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-07T15:59:24Z","links":{"resolver":"https://pith.science/pith/GKPAZGXUS7O3T3YI6NJIC75A4N","bundle":"https://pith.science/pith/GKPAZGXUS7O3T3YI6NJIC75A4N/bundle.json","state":"https://pith.science/pith/GKPAZGXUS7O3T3YI6NJIC75A4N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GKPAZGXUS7O3T3YI6NJIC75A4N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GKPAZGXUS7O3T3YI6NJIC75A4N","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":"123de5263cf4678ac88a5075b2f6587810a8aa025882b207788d1c9ab0081b34","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-14T17:12:42Z","title_canon_sha256":"b5870c21f12049b2ef53970709023781054caddc0fd26739309fba41f32268b6"},"schema_version":"1.0","source":{"id":"1710.05213","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.05213","created_at":"2026-07-05T00:35:17Z"},{"alias_kind":"arxiv_version","alias_value":"1710.05213v1","created_at":"2026-07-05T00:35:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.05213","created_at":"2026-07-05T00:35:17Z"},{"alias_kind":"pith_short_12","alias_value":"GKPAZGXUS7O3","created_at":"2026-07-05T00:35:17Z"},{"alias_kind":"pith_short_16","alias_value":"GKPAZGXUS7O3T3YI","created_at":"2026-07-05T00:35:17Z"},{"alias_kind":"pith_short_8","alias_value":"GKPAZGXU","created_at":"2026-07-05T00:35:17Z"}],"graph_snapshots":[{"event_id":"sha256:3e131fa0b53af21f6e6f0778072000d4121f0422a57fe6248dc3096410fe8a87","target":"graph","created_at":"2026-07-05T00:35:17Z","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/1710.05213/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper considers the problem of brain disease classification based on connectome data. A connectome is a network representation of a human brain. The typical connectome classification problem is very challenging because of the small sample size and high dimensionality of the data. We propose to use simultaneous approximate diagonalization of adjacency matrices in order to compute their eigenstructures in more stable way. The obtained approximate eigenvalues are further used as features for classification. The proposed approach is demonstrated to be efficient for detection of Alzheimer's di","authors_text":"Boris A. Gutman, Joshua I. Faskowitz, Maxim Panov, Neda Jahanshad, Nikita Mokrov, Paul M. Thompson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-14T17:12:42Z","title":"Simultaneous Matrix Diagonalization for Structural Brain Networks Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.05213","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:55bda4aa8c41a18f3a48650bceab43a7998d64c2560df54c4a77c5320845278c","target":"record","created_at":"2026-07-05T00:35:17Z","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":"123de5263cf4678ac88a5075b2f6587810a8aa025882b207788d1c9ab0081b34","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-10-14T17:12:42Z","title_canon_sha256":"b5870c21f12049b2ef53970709023781054caddc0fd26739309fba41f32268b6"},"schema_version":"1.0","source":{"id":"1710.05213","kind":"arxiv","version":1}},"canonical_sha256":"329e0c9af497ddb9ef08f352817fa0e37419bc03834905b651a208206b2a12cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"329e0c9af497ddb9ef08f352817fa0e37419bc03834905b651a208206b2a12cd","first_computed_at":"2026-07-05T00:35:17.917131Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:35:17.917131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CXzWNApW4tw/wWCsTF5qxPBHKQdXjmlybYBJanChYY9J4CQhWEsy+blh7IWIbYK6RRIEyGEmTbJDfT5cM2RtAw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:35:17.917607Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.05213","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55bda4aa8c41a18f3a48650bceab43a7998d64c2560df54c4a77c5320845278c","sha256:3e131fa0b53af21f6e6f0778072000d4121f0422a57fe6248dc3096410fe8a87"],"state_sha256":"3001362bbdf48ddfbd7146a2925968e0899eb0485cc5588ce2b62d200f1c1c51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6t74zmOaGX1upJ6mejur9MdjydFMhWJpCZ1rISxLMinCDZhgGYWgfkGQmbT0f1NZc/R3Q/m3RhTr9ZOkRJXvCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T15:59:24.971515Z","bundle_sha256":"e89ab845f4b2d94c2c7cb73b6be1798cf64e4ca76e528e85dd74b27d16ccd66d"}}