{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KUKP4J6SJJJGKOYIZ3NIZKLLQD","short_pith_number":"pith:KUKP4J6S","canonical_record":{"source":{"id":"1907.11094","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-07-24T03:24:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"cbdd51ea2647c8cb29d312a123ae8c345d7641ec32c159ff5ffc69bd42762bae","abstract_canon_sha256":"4fcc13908f3759ed84a8249d7a41c17902c76b0753f632e29ed3b10f6f1fc338"},"schema_version":"1.0"},"canonical_sha256":"5514fe27d24a52653b08ceda8ca96b80df943fdce275445f7915e7090a54138d","source":{"kind":"arxiv","id":"1907.11094","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.11094","created_at":"2026-05-17T23:39:33Z"},{"alias_kind":"arxiv_version","alias_value":"1907.11094v1","created_at":"2026-05-17T23:39:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11094","created_at":"2026-05-17T23:39:33Z"},{"alias_kind":"pith_short_12","alias_value":"KUKP4J6SJJJG","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KUKP4J6SJJJGKOYI","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KUKP4J6S","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KUKP4J6SJJJGKOYIZ3NIZKLLQD","target":"record","payload":{"canonical_record":{"source":{"id":"1907.11094","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-07-24T03:24:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"cbdd51ea2647c8cb29d312a123ae8c345d7641ec32c159ff5ffc69bd42762bae","abstract_canon_sha256":"4fcc13908f3759ed84a8249d7a41c17902c76b0753f632e29ed3b10f6f1fc338"},"schema_version":"1.0"},"canonical_sha256":"5514fe27d24a52653b08ceda8ca96b80df943fdce275445f7915e7090a54138d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:33.511010Z","signature_b64":"N+CEN/AYY/pfNU4q0ztPgqID2EFGTun8zuhwRA5T60P9yBCA6twz79buc1gka9znMNimV4R8t0+dk9JA1wuNBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5514fe27d24a52653b08ceda8ca96b80df943fdce275445f7915e7090a54138d","last_reissued_at":"2026-05-17T23:39:33.510305Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:33.510305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.11094","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:39:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GJPtFfV68/ZKuDz1J08xgwr7fQQKgksgOAtvP/kYTb5VPzjodstcctgzQXt5GapuIKxYxXuboSW8fm8m0Ya1CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T07:04:13.914301Z"},"content_sha256":"d122d9851ee79f05765c54f556bfe4b64ee50a49d911a17b65faf7733da3e7f9","schema_version":"1.0","event_id":"sha256:d122d9851ee79f05765c54f556bfe4b64ee50a49d911a17b65faf7733da3e7f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KUKP4J6SJJJGKOYIZ3NIZKLLQD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving the Accuracy of Principal Component Analysis by the Maximum Entropy Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Crystal Maung, Guihong Wan, Haim Schweitzer","submitted_at":"2019-07-24T03:24:33Z","abstract_excerpt":"Classical Principal Component Analysis (PCA) approximates data in terms of projections on a small number of orthogonal vectors. There are simple procedures to efficiently compute various functions of the data from the PCA approximation. The most important function is arguably the Euclidean distance between data items, This can be used, for example, to solve the approximate nearest neighbor problem. We use random variables to model the inherent uncertainty in such approximations, and apply the Maximum Entropy Method to infer the underlying probability distribution. We propose using the expected"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11094","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:39:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gvacqjbGgskFbLPIcfZlkDrOarsqnhFUkjGg/FSgiSejQPJS30jMyIGm+BaRdwXG2Vuwv3v5rAc6gEHW5kCrDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T07:04:13.914752Z"},"content_sha256":"73bab32d208b376f6e130e5b6fee14b7dc8ed75f16f5b1dbbf4a44689eeebda0","schema_version":"1.0","event_id":"sha256:73bab32d208b376f6e130e5b6fee14b7dc8ed75f16f5b1dbbf4a44689eeebda0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KUKP4J6SJJJGKOYIZ3NIZKLLQD/bundle.json","state_url":"https://pith.science/pith/KUKP4J6SJJJGKOYIZ3NIZKLLQD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KUKP4J6SJJJGKOYIZ3NIZKLLQD/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-08-10T07:04:13Z","links":{"resolver":"https://pith.science/pith/KUKP4J6SJJJGKOYIZ3NIZKLLQD","bundle":"https://pith.science/pith/KUKP4J6SJJJGKOYIZ3NIZKLLQD/bundle.json","state":"https://pith.science/pith/KUKP4J6SJJJGKOYIZ3NIZKLLQD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KUKP4J6SJJJGKOYIZ3NIZKLLQD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KUKP4J6SJJJGKOYIZ3NIZKLLQD","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":"4fcc13908f3759ed84a8249d7a41c17902c76b0753f632e29ed3b10f6f1fc338","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-07-24T03:24:33Z","title_canon_sha256":"cbdd51ea2647c8cb29d312a123ae8c345d7641ec32c159ff5ffc69bd42762bae"},"schema_version":"1.0","source":{"id":"1907.11094","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.11094","created_at":"2026-05-17T23:39:33Z"},{"alias_kind":"arxiv_version","alias_value":"1907.11094v1","created_at":"2026-05-17T23:39:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11094","created_at":"2026-05-17T23:39:33Z"},{"alias_kind":"pith_short_12","alias_value":"KUKP4J6SJJJG","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KUKP4J6SJJJGKOYI","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KUKP4J6S","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:73bab32d208b376f6e130e5b6fee14b7dc8ed75f16f5b1dbbf4a44689eeebda0","target":"graph","created_at":"2026-05-17T23:39:33Z","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":"Classical Principal Component Analysis (PCA) approximates data in terms of projections on a small number of orthogonal vectors. There are simple procedures to efficiently compute various functions of the data from the PCA approximation. The most important function is arguably the Euclidean distance between data items, This can be used, for example, to solve the approximate nearest neighbor problem. We use random variables to model the inherent uncertainty in such approximations, and apply the Maximum Entropy Method to infer the underlying probability distribution. We propose using the expected","authors_text":"Crystal Maung, Guihong Wan, Haim Schweitzer","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-07-24T03:24:33Z","title":"Improving the Accuracy of Principal Component Analysis by the Maximum Entropy Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11094","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:d122d9851ee79f05765c54f556bfe4b64ee50a49d911a17b65faf7733da3e7f9","target":"record","created_at":"2026-05-17T23:39:33Z","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":"4fcc13908f3759ed84a8249d7a41c17902c76b0753f632e29ed3b10f6f1fc338","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-07-24T03:24:33Z","title_canon_sha256":"cbdd51ea2647c8cb29d312a123ae8c345d7641ec32c159ff5ffc69bd42762bae"},"schema_version":"1.0","source":{"id":"1907.11094","kind":"arxiv","version":1}},"canonical_sha256":"5514fe27d24a52653b08ceda8ca96b80df943fdce275445f7915e7090a54138d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5514fe27d24a52653b08ceda8ca96b80df943fdce275445f7915e7090a54138d","first_computed_at":"2026-05-17T23:39:33.510305Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:33.510305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N+CEN/AYY/pfNU4q0ztPgqID2EFGTun8zuhwRA5T60P9yBCA6twz79buc1gka9znMNimV4R8t0+dk9JA1wuNBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:33.511010Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.11094","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d122d9851ee79f05765c54f556bfe4b64ee50a49d911a17b65faf7733da3e7f9","sha256:73bab32d208b376f6e130e5b6fee14b7dc8ed75f16f5b1dbbf4a44689eeebda0"],"state_sha256":"ffe5b93c57073348454fa1d009ac53610af112e53f2344ed0b49cecd844f9b8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UGnXtiiBJceAvQrOqlemJfZ/duidJSCaJSrAyz1lrOJezNhWlWTxnKGOh9rWmpJahDiu5VuhLThAGuzxP8EkBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T07:04:13.918341Z","bundle_sha256":"24a06def78b4cff1a468c96d4ab04bcffb647d620fc439fe7431923062f8b130"}}