{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:5QPLIIY7LIASHBADDTUQWWGL7O","short_pith_number":"pith:5QPLIIY7","canonical_record":{"source":{"id":"1102.3176","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-15T20:49:37Z","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"title_canon_sha256":"1280173f4d9160d56d97f8ff165ebf10437e195a7ab25eff7778de7b322b2339","abstract_canon_sha256":"134b76934b6ed1c9c8638f90cc5dcf70998b58f8ad1aa9b23fd729b9a9e3b734"},"schema_version":"1.0"},"canonical_sha256":"ec1eb4231f5a012384031ce90b58cbfbb14b41b45e9488e238abf0d5bf82e77c","source":{"kind":"arxiv","id":"1102.3176","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3176","created_at":"2026-05-18T03:37:09Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3176v3","created_at":"2026-05-18T03:37:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3176","created_at":"2026-05-18T03:37:09Z"},{"alias_kind":"pith_short_12","alias_value":"5QPLIIY7LIAS","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5QPLIIY7LIASHBAD","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5QPLIIY7","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:5QPLIIY7LIASHBADDTUQWWGL7O","target":"record","payload":{"canonical_record":{"source":{"id":"1102.3176","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-15T20:49:37Z","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"title_canon_sha256":"1280173f4d9160d56d97f8ff165ebf10437e195a7ab25eff7778de7b322b2339","abstract_canon_sha256":"134b76934b6ed1c9c8638f90cc5dcf70998b58f8ad1aa9b23fd729b9a9e3b734"},"schema_version":"1.0"},"canonical_sha256":"ec1eb4231f5a012384031ce90b58cbfbb14b41b45e9488e238abf0d5bf82e77c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:09.235725Z","signature_b64":"IWWby4OFhA97ebrVHtc5JPM4fyi+YW0PneoJ8zWJHp0DMAn5EBAoUwWM+D7tCZFo4zFO8ODBMLY9bd927xdTBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec1eb4231f5a012384031ce90b58cbfbb14b41b45e9488e238abf0d5bf82e77c","last_reissued_at":"2026-05-18T03:37:09.235188Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:09.235188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.3176","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-18T03:37:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i4gyZ9ToLsZ7Cd51s/nbnnrR+IBnqONIM6C33o5aQ4r7sNaQ5h785+eG6IZ951JtqS+de9n50wwmCDi94+bRBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:06:44.014248Z"},"content_sha256":"946047a20a2844369fc48bae9fa571e2a1230bc8528bc47d915f3e2116a88a0d","schema_version":"1.0","event_id":"sha256:946047a20a2844369fc48bae9fa571e2a1230bc8528bc47d915f3e2116a88a0d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:5QPLIIY7LIASHBADDTUQWWGL7O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Selecting the rank of truncated SVD by Maximum Approximation Capacity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Joachim M. Buhmann, Mario Frank","submitted_at":"2011-02-15T20:49:37Z","abstract_excerpt":"Truncated Singular Value Decomposition (SVD) calculates the closest rank-$k$ approximation of a given input matrix. Selecting the appropriate rank $k$ defines a critical model order choice in most applications of SVD. To obtain a principled cut-off criterion for the spectrum, we convert the underlying optimization problem into a noisy channel coding problem. The optimal approximation capacity of this channel controls the appropriate strength of regularization to suppress noise. In simulation experiments, this information theoretic method to determine the optimal rank competes with state-of-the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3176","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-18T03:37:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2gZtoSxkDXvs+WhZNtVDBDytcxMIJPGtcRvlwzMzg8j9vBqpBo/JTXqLvtrdelV2RMto9onU2KRWkuUB9gJeBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:06:44.014612Z"},"content_sha256":"b4cff2ffc545ec1c3c3f4344667ed58d091e5dae360dfeb0d2c0339c5a8dfe08","schema_version":"1.0","event_id":"sha256:b4cff2ffc545ec1c3c3f4344667ed58d091e5dae360dfeb0d2c0339c5a8dfe08"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5QPLIIY7LIASHBADDTUQWWGL7O/bundle.json","state_url":"https://pith.science/pith/5QPLIIY7LIASHBADDTUQWWGL7O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5QPLIIY7LIASHBADDTUQWWGL7O/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-20T06:06:44Z","links":{"resolver":"https://pith.science/pith/5QPLIIY7LIASHBADDTUQWWGL7O","bundle":"https://pith.science/pith/5QPLIIY7LIASHBADDTUQWWGL7O/bundle.json","state":"https://pith.science/pith/5QPLIIY7LIASHBADDTUQWWGL7O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5QPLIIY7LIASHBADDTUQWWGL7O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:5QPLIIY7LIASHBADDTUQWWGL7O","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":"134b76934b6ed1c9c8638f90cc5dcf70998b58f8ad1aa9b23fd729b9a9e3b734","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-15T20:49:37Z","title_canon_sha256":"1280173f4d9160d56d97f8ff165ebf10437e195a7ab25eff7778de7b322b2339"},"schema_version":"1.0","source":{"id":"1102.3176","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3176","created_at":"2026-05-18T03:37:09Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3176v3","created_at":"2026-05-18T03:37:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3176","created_at":"2026-05-18T03:37:09Z"},{"alias_kind":"pith_short_12","alias_value":"5QPLIIY7LIAS","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5QPLIIY7LIASHBAD","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5QPLIIY7","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:b4cff2ffc545ec1c3c3f4344667ed58d091e5dae360dfeb0d2c0339c5a8dfe08","target":"graph","created_at":"2026-05-18T03:37:09Z","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":"Truncated Singular Value Decomposition (SVD) calculates the closest rank-$k$ approximation of a given input matrix. Selecting the appropriate rank $k$ defines a critical model order choice in most applications of SVD. To obtain a principled cut-off criterion for the spectrum, we convert the underlying optimization problem into a noisy channel coding problem. The optimal approximation capacity of this channel controls the appropriate strength of regularization to suppress noise. In simulation experiments, this information theoretic method to determine the optimal rank competes with state-of-the","authors_text":"Joachim M. Buhmann, Mario Frank","cross_cats":["cs.LG","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-15T20:49:37Z","title":"Selecting the rank of truncated SVD by Maximum Approximation Capacity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3176","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:946047a20a2844369fc48bae9fa571e2a1230bc8528bc47d915f3e2116a88a0d","target":"record","created_at":"2026-05-18T03:37:09Z","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":"134b76934b6ed1c9c8638f90cc5dcf70998b58f8ad1aa9b23fd729b9a9e3b734","cross_cats_sorted":["cs.LG","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-15T20:49:37Z","title_canon_sha256":"1280173f4d9160d56d97f8ff165ebf10437e195a7ab25eff7778de7b322b2339"},"schema_version":"1.0","source":{"id":"1102.3176","kind":"arxiv","version":3}},"canonical_sha256":"ec1eb4231f5a012384031ce90b58cbfbb14b41b45e9488e238abf0d5bf82e77c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec1eb4231f5a012384031ce90b58cbfbb14b41b45e9488e238abf0d5bf82e77c","first_computed_at":"2026-05-18T03:37:09.235188Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:09.235188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IWWby4OFhA97ebrVHtc5JPM4fyi+YW0PneoJ8zWJHp0DMAn5EBAoUwWM+D7tCZFo4zFO8ODBMLY9bd927xdTBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:09.235725Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.3176","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:946047a20a2844369fc48bae9fa571e2a1230bc8528bc47d915f3e2116a88a0d","sha256:b4cff2ffc545ec1c3c3f4344667ed58d091e5dae360dfeb0d2c0339c5a8dfe08"],"state_sha256":"32281ca641c0e2d68ef0d81b4b34c95772f080810f508521b8f26a609ce0b632"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1B0Ej4kFDkxcQKkUCeU2Hbqf5E9eoocrWs1wDBco8QdIGzsZdgJraThknnqYHfwH5TjMXFZGegjNPqUPq0VQDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T06:06:44.016602Z","bundle_sha256":"df465a2c3be5090757892f6def5d3caaa0c57cb1272334d7996d6713cad1fc72"}}