{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:YLW5LXNOGM7EXZ4CAGWVFIHOIG","short_pith_number":"pith:YLW5LXNO","canonical_record":{"source":{"id":"1103.4998","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-03-25T15:35:16Z","cross_cats_sorted":[],"title_canon_sha256":"d5bd7bc9e09b497dbe849762eb14dfd0ac83149c1f730bb9c090a93cec183ca7","abstract_canon_sha256":"ff06e3913d809b5d28f7c68816eccff4798cde0b609c37822dec715a94ae5f79"},"schema_version":"1.0"},"canonical_sha256":"c2edd5ddae333e4be78201ad52a0ee41875fd090a5ccf602eb2841fb808072b0","source":{"kind":"arxiv","id":"1103.4998","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.4998","created_at":"2026-05-18T04:25:48Z"},{"alias_kind":"arxiv_version","alias_value":"1103.4998v1","created_at":"2026-05-18T04:25:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.4998","created_at":"2026-05-18T04:25:48Z"},{"alias_kind":"pith_short_12","alias_value":"YLW5LXNOGM7E","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YLW5LXNOGM7EXZ4C","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YLW5LXNO","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:YLW5LXNOGM7EXZ4CAGWVFIHOIG","target":"record","payload":{"canonical_record":{"source":{"id":"1103.4998","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-03-25T15:35:16Z","cross_cats_sorted":[],"title_canon_sha256":"d5bd7bc9e09b497dbe849762eb14dfd0ac83149c1f730bb9c090a93cec183ca7","abstract_canon_sha256":"ff06e3913d809b5d28f7c68816eccff4798cde0b609c37822dec715a94ae5f79"},"schema_version":"1.0"},"canonical_sha256":"c2edd5ddae333e4be78201ad52a0ee41875fd090a5ccf602eb2841fb808072b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:48.241963Z","signature_b64":"5O9DRX6vhaib9LwdOfqV8KiFM8zE8oqaZXgKfU+RX1Uf/8mq5n1SUHIMQYitXt882OMl0LqaOnekRhZB/R68AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2edd5ddae333e4be78201ad52a0ee41875fd090a5ccf602eb2841fb808072b0","last_reissued_at":"2026-05-18T04:25:48.241440Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:48.241440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.4998","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-18T04:25:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QYthUkbKd1EmoGdDp89temvI1MIfJeU3no1ID3YUeWjNMuD2ain5+JeTQMWXd7ndGbU71Sw91dCsmfi/zDjdAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T07:01:22.060430Z"},"content_sha256":"08c8ed9a26b9a131a3c9b36ecd5d49a518ed8933e6ac1f5a280fbd523b30af6b","schema_version":"1.0","event_id":"sha256:08c8ed9a26b9a131a3c9b36ecd5d49a518ed8933e6ac1f5a280fbd523b30af6b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:YLW5LXNOGM7EXZ4CAGWVFIHOIG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sufficient Component Analysis for Supervised Dimension Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Gang Niu, Jun Takagi, Makoto Yamada, Masashi Sugiyama","submitted_at":"2011-03-25T15:35:16Z","abstract_excerpt":"The purpose of sufficient dimension reduction (SDR) is to find the low-dimensional subspace of input features that is sufficient for predicting output values. In this paper, we propose a novel distribution-free SDR method called sufficient component analysis (SCA), which is computationally more efficient than existing methods. In our method, a solution is computed by iteratively performing dependence estimation and maximization: Dependence estimation is analytically carried out by recently-proposed least-squares mutual information (LSMI), and dependence maximization is also analytically carrie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.4998","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-18T04:25:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BNwf8kDD/EeqtaWilZS+/AhwB8G7mkaEEg9YB9pKDR/bBd+2hQ67UNtnlnqsIel+iMkSprpYiF0i8guJTgPsDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T07:01:22.060908Z"},"content_sha256":"79d08f3de469c72bf453291cf516258aaffc467e1f0fa238bc85597d99965d25","schema_version":"1.0","event_id":"sha256:79d08f3de469c72bf453291cf516258aaffc467e1f0fa238bc85597d99965d25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YLW5LXNOGM7EXZ4CAGWVFIHOIG/bundle.json","state_url":"https://pith.science/pith/YLW5LXNOGM7EXZ4CAGWVFIHOIG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YLW5LXNOGM7EXZ4CAGWVFIHOIG/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-10T07:01:22Z","links":{"resolver":"https://pith.science/pith/YLW5LXNOGM7EXZ4CAGWVFIHOIG","bundle":"https://pith.science/pith/YLW5LXNOGM7EXZ4CAGWVFIHOIG/bundle.json","state":"https://pith.science/pith/YLW5LXNOGM7EXZ4CAGWVFIHOIG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YLW5LXNOGM7EXZ4CAGWVFIHOIG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:YLW5LXNOGM7EXZ4CAGWVFIHOIG","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":"ff06e3913d809b5d28f7c68816eccff4798cde0b609c37822dec715a94ae5f79","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-03-25T15:35:16Z","title_canon_sha256":"d5bd7bc9e09b497dbe849762eb14dfd0ac83149c1f730bb9c090a93cec183ca7"},"schema_version":"1.0","source":{"id":"1103.4998","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.4998","created_at":"2026-05-18T04:25:48Z"},{"alias_kind":"arxiv_version","alias_value":"1103.4998v1","created_at":"2026-05-18T04:25:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.4998","created_at":"2026-05-18T04:25:48Z"},{"alias_kind":"pith_short_12","alias_value":"YLW5LXNOGM7E","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YLW5LXNOGM7EXZ4C","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YLW5LXNO","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:79d08f3de469c72bf453291cf516258aaffc467e1f0fa238bc85597d99965d25","target":"graph","created_at":"2026-05-18T04:25:48Z","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 purpose of sufficient dimension reduction (SDR) is to find the low-dimensional subspace of input features that is sufficient for predicting output values. In this paper, we propose a novel distribution-free SDR method called sufficient component analysis (SCA), which is computationally more efficient than existing methods. In our method, a solution is computed by iteratively performing dependence estimation and maximization: Dependence estimation is analytically carried out by recently-proposed least-squares mutual information (LSMI), and dependence maximization is also analytically carrie","authors_text":"Gang Niu, Jun Takagi, Makoto Yamada, Masashi Sugiyama","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-03-25T15:35:16Z","title":"Sufficient Component Analysis for Supervised Dimension Reduction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.4998","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:08c8ed9a26b9a131a3c9b36ecd5d49a518ed8933e6ac1f5a280fbd523b30af6b","target":"record","created_at":"2026-05-18T04:25:48Z","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":"ff06e3913d809b5d28f7c68816eccff4798cde0b609c37822dec715a94ae5f79","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2011-03-25T15:35:16Z","title_canon_sha256":"d5bd7bc9e09b497dbe849762eb14dfd0ac83149c1f730bb9c090a93cec183ca7"},"schema_version":"1.0","source":{"id":"1103.4998","kind":"arxiv","version":1}},"canonical_sha256":"c2edd5ddae333e4be78201ad52a0ee41875fd090a5ccf602eb2841fb808072b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2edd5ddae333e4be78201ad52a0ee41875fd090a5ccf602eb2841fb808072b0","first_computed_at":"2026-05-18T04:25:48.241440Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:25:48.241440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5O9DRX6vhaib9LwdOfqV8KiFM8zE8oqaZXgKfU+RX1Uf/8mq5n1SUHIMQYitXt882OMl0LqaOnekRhZB/R68AA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:25:48.241963Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.4998","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08c8ed9a26b9a131a3c9b36ecd5d49a518ed8933e6ac1f5a280fbd523b30af6b","sha256:79d08f3de469c72bf453291cf516258aaffc467e1f0fa238bc85597d99965d25"],"state_sha256":"5c044dc0e4bbc152f18dda67479213efb243c179487721e51ed4c055a6a2ad75"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4FrOB/P7f9tsysV6SExySctXiZigg/7b50YPh/GQyLL+cVHgtmupQexECiMN9iIphEkNk7/zPu33vR1ap1LNAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T07:01:22.064648Z","bundle_sha256":"59129a86d4002c9ba00ff18ec70fc50175a3045d352341edb4424edfdfc6e5d2"}}