{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GCNMDPQ32OSNQTNQWDGY7RXVJY","short_pith_number":"pith:GCNMDPQ3","canonical_record":{"source":{"id":"1503.08471","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-29T18:21:22Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"23f93a241c4ac804f7ffb54eca6030f4d44083d928fbeb019c759c66e4d3f325","abstract_canon_sha256":"1fb241dd251e00d4ae59ddf4bee68f8d7b0f5e0c1f6101cdf8436b90a1037bf5"},"schema_version":"1.0"},"canonical_sha256":"309ac1be1bd3a4d84db0b0cd8fc6f54e3c1fdc9ca46f10049d8793a1e9c1f75f","source":{"kind":"arxiv","id":"1503.08471","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08471","created_at":"2026-05-18T01:24:25Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08471v3","created_at":"2026-05-18T01:24:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08471","created_at":"2026-05-18T01:24:25Z"},{"alias_kind":"pith_short_12","alias_value":"GCNMDPQ32OSN","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GCNMDPQ32OSNQTNQ","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GCNMDPQ3","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GCNMDPQ32OSNQTNQWDGY7RXVJY","target":"record","payload":{"canonical_record":{"source":{"id":"1503.08471","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-29T18:21:22Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"23f93a241c4ac804f7ffb54eca6030f4d44083d928fbeb019c759c66e4d3f325","abstract_canon_sha256":"1fb241dd251e00d4ae59ddf4bee68f8d7b0f5e0c1f6101cdf8436b90a1037bf5"},"schema_version":"1.0"},"canonical_sha256":"309ac1be1bd3a4d84db0b0cd8fc6f54e3c1fdc9ca46f10049d8793a1e9c1f75f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:25.025139Z","signature_b64":"J4dTRrUfA0q3913xsrnrIreirDUqb3loMSDzXGLE7qn13P/nAcZb4ctYJI/fKnQBcixQvuXKGyaPK0RQ4gHdDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"309ac1be1bd3a4d84db0b0cd8fc6f54e3c1fdc9ca46f10049d8793a1e9c1f75f","last_reissued_at":"2026-05-18T01:24:25.024477Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:25.024477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.08471","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-05-18T01:24:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VNXkWhtcRxtBoOM95QJT0VVRHVU4wPGqS9KePH9Pkbfm/9SJLwtcJbBiCpEGw0bF5l0xirw2e1OLCWzwICkwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:00:06.319558Z"},"content_sha256":"1dceb93705f3864d8b07c67949e87beb20b902a256eaa7357ec3b3662d0fdb9f","schema_version":"1.0","event_id":"sha256:1dceb93705f3864d8b07c67949e87beb20b902a256eaa7357ec3b3662d0fdb9f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GCNMDPQ32OSNQTNQWDGY7RXVJY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cross-validation of matching correlation analysis by resampling matching weights","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Hidetoshi Shimodaira","submitted_at":"2015-03-29T18:21:22Z","abstract_excerpt":"The strength of association between a pair of data vectors is represented by a nonnegative real number, called matching weight. For dimensionality reduction, we consider a linear transformation of data vectors, and define a matching error as the weighted sum of squared distances between transformed vectors with respect to the matching weights. Given data vectors and matching weights, the optimal linear transformation minimizing the matching error is solved by the spectral graph embedding of Yan et al. (2007). This method is a generalization of the canonical correlation analysis, and will be ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08471","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":""},"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-18T01:24:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U90W1qsTJ6bS6drgfQLz+DV+fWuaD56NLM3TwHoj4zP9mDVf78Hargay/eK+tdKaxMV2V3vKE3AORagJ4lS7Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:00:06.320304Z"},"content_sha256":"f632b37514f62171d53770b9e794cb2781499ce496f73a2a56bc2becd7faae5a","schema_version":"1.0","event_id":"sha256:f632b37514f62171d53770b9e794cb2781499ce496f73a2a56bc2becd7faae5a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GCNMDPQ32OSNQTNQWDGY7RXVJY/bundle.json","state_url":"https://pith.science/pith/GCNMDPQ32OSNQTNQWDGY7RXVJY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GCNMDPQ32OSNQTNQWDGY7RXVJY/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-10T01:00:06Z","links":{"resolver":"https://pith.science/pith/GCNMDPQ32OSNQTNQWDGY7RXVJY","bundle":"https://pith.science/pith/GCNMDPQ32OSNQTNQWDGY7RXVJY/bundle.json","state":"https://pith.science/pith/GCNMDPQ32OSNQTNQWDGY7RXVJY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GCNMDPQ32OSNQTNQWDGY7RXVJY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GCNMDPQ32OSNQTNQWDGY7RXVJY","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":"1fb241dd251e00d4ae59ddf4bee68f8d7b0f5e0c1f6101cdf8436b90a1037bf5","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-29T18:21:22Z","title_canon_sha256":"23f93a241c4ac804f7ffb54eca6030f4d44083d928fbeb019c759c66e4d3f325"},"schema_version":"1.0","source":{"id":"1503.08471","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.08471","created_at":"2026-05-18T01:24:25Z"},{"alias_kind":"arxiv_version","alias_value":"1503.08471v3","created_at":"2026-05-18T01:24:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.08471","created_at":"2026-05-18T01:24:25Z"},{"alias_kind":"pith_short_12","alias_value":"GCNMDPQ32OSN","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GCNMDPQ32OSNQTNQ","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GCNMDPQ3","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:f632b37514f62171d53770b9e794cb2781499ce496f73a2a56bc2becd7faae5a","target":"graph","created_at":"2026-05-18T01:24:25Z","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":"The strength of association between a pair of data vectors is represented by a nonnegative real number, called matching weight. For dimensionality reduction, we consider a linear transformation of data vectors, and define a matching error as the weighted sum of squared distances between transformed vectors with respect to the matching weights. Given data vectors and matching weights, the optimal linear transformation minimizing the matching error is solved by the spectral graph embedding of Yan et al. (2007). This method is a generalization of the canonical correlation analysis, and will be ca","authors_text":"Hidetoshi Shimodaira","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-29T18:21:22Z","title":"Cross-validation of matching correlation analysis by resampling matching weights"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.08471","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:1dceb93705f3864d8b07c67949e87beb20b902a256eaa7357ec3b3662d0fdb9f","target":"record","created_at":"2026-05-18T01:24:25Z","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":"1fb241dd251e00d4ae59ddf4bee68f8d7b0f5e0c1f6101cdf8436b90a1037bf5","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-03-29T18:21:22Z","title_canon_sha256":"23f93a241c4ac804f7ffb54eca6030f4d44083d928fbeb019c759c66e4d3f325"},"schema_version":"1.0","source":{"id":"1503.08471","kind":"arxiv","version":3}},"canonical_sha256":"309ac1be1bd3a4d84db0b0cd8fc6f54e3c1fdc9ca46f10049d8793a1e9c1f75f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"309ac1be1bd3a4d84db0b0cd8fc6f54e3c1fdc9ca46f10049d8793a1e9c1f75f","first_computed_at":"2026-05-18T01:24:25.024477Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:25.024477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J4dTRrUfA0q3913xsrnrIreirDUqb3loMSDzXGLE7qn13P/nAcZb4ctYJI/fKnQBcixQvuXKGyaPK0RQ4gHdDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:25.025139Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.08471","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1dceb93705f3864d8b07c67949e87beb20b902a256eaa7357ec3b3662d0fdb9f","sha256:f632b37514f62171d53770b9e794cb2781499ce496f73a2a56bc2becd7faae5a"],"state_sha256":"9681061ea19ee0ef244eac2f65890156a46526b013324cec9bded6ec90a32d40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D7aJ3xCKkHqsC4FRCgX28mmbEGt4L2RBb/fUhnTmSuPLLQrZMlYJNj1t5aNJjMFaUgutu0HlLbX9h6TChnuoBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T01:00:06.324382Z","bundle_sha256":"9b4f1f09707b9b1e732edbbbee3311ca1841032bfc47ab55c41feb89ae90f2d9"}}