{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VQ64URGRIZACYOA74UNP2ZA4RU","short_pith_number":"pith:VQ64URGR","canonical_record":{"source":{"id":"1705.07112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-05-19T17:55:58Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"610d94263a1610fa3ac2337649e53b1d3f949f6d7cfa15fa3e4cfb86f63f4d21","abstract_canon_sha256":"fc908c98e5ea3522a8b72b8e6c04e676242311f9d75dd09bc8b1fc05a9b98372"},"schema_version":"1.0"},"canonical_sha256":"ac3dca44d146402c381fe51afd641c8d31bcf0f94f7b67f68c40f5744b92d4b0","source":{"kind":"arxiv","id":"1705.07112","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07112","created_at":"2026-05-18T00:30:04Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07112v1","created_at":"2026-05-18T00:30:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07112","created_at":"2026-05-18T00:30:04Z"},{"alias_kind":"pith_short_12","alias_value":"VQ64URGRIZAC","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VQ64URGRIZACYOA7","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VQ64URGR","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VQ64URGRIZACYOA74UNP2ZA4RU","target":"record","payload":{"canonical_record":{"source":{"id":"1705.07112","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-05-19T17:55:58Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"610d94263a1610fa3ac2337649e53b1d3f949f6d7cfa15fa3e4cfb86f63f4d21","abstract_canon_sha256":"fc908c98e5ea3522a8b72b8e6c04e676242311f9d75dd09bc8b1fc05a9b98372"},"schema_version":"1.0"},"canonical_sha256":"ac3dca44d146402c381fe51afd641c8d31bcf0f94f7b67f68c40f5744b92d4b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:04.285110Z","signature_b64":"esltAF19T5DaLr6VpHOMq+5hMLNJYx7oIQ4un5rFDRonf1kQv06wnqFfo1ysrxyUi2iHP5svq4kQq4RvhZL1Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac3dca44d146402c381fe51afd641c8d31bcf0f94f7b67f68c40f5744b92d4b0","last_reissued_at":"2026-05-18T00:30:04.284625Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:04.284625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.07112","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-18T00:30:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3oGZwbTAhoCx0JXIgPB/D4vqWaBU8GWnCiN3yGLIBfDOiGCtypODJFRztZIyasULaLnxDBoWo6o3Ir8lLBfECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:33:00.961565Z"},"content_sha256":"78dffeafe9672e465ed5da23092b3b8f949ccb7275b5efc2ec096390ffd26ad9","schema_version":"1.0","event_id":"sha256:78dffeafe9672e465ed5da23092b3b8f949ccb7275b5efc2ec096390ffd26ad9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VQ64URGRIZACYOA74UNP2ZA4RU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Singular Value Shrinkage with Chebyshev Polynomial Approximation Based on Signal Sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NA","authors_text":"Keiichiro Shirai, Masaki Onuki, Shunsuke Ono, Yuichi Tanaka","submitted_at":"2017-05-19T17:55:58Z","abstract_excerpt":"We propose an approximation method for thresholding of singular values using Chebyshev polynomial approximation (CPA). Many signal processing problems require iterative application of singular value decomposition (SVD) for minimizing the rank of a given data matrix with other cost functions and/or constraints, which is called matrix rank minimization. In matrix rank minimization, singular values of a matrix are shrunk by hard-thresholding, soft-thresholding, or weighted soft-thresholding. However, the computational cost of SVD is generally too expensive to handle high dimensional signals such "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07112","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-18T00:30:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qeDk1gd5gnqWeYtotZLJqRmc3Bps8JaM4uUlyBPV8Fg7bYPvtTWKh9etIkGAJuuA0/YyJsZJI7G/QIZgqUmtAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:33:00.961915Z"},"content_sha256":"c4208385f980a29f4c0d4b14232e022f5e13b98f65dbb48b1ba4e4b6df0c71b2","schema_version":"1.0","event_id":"sha256:c4208385f980a29f4c0d4b14232e022f5e13b98f65dbb48b1ba4e4b6df0c71b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VQ64URGRIZACYOA74UNP2ZA4RU/bundle.json","state_url":"https://pith.science/pith/VQ64URGRIZACYOA74UNP2ZA4RU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VQ64URGRIZACYOA74UNP2ZA4RU/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-11T10:33:00Z","links":{"resolver":"https://pith.science/pith/VQ64URGRIZACYOA74UNP2ZA4RU","bundle":"https://pith.science/pith/VQ64URGRIZACYOA74UNP2ZA4RU/bundle.json","state":"https://pith.science/pith/VQ64URGRIZACYOA74UNP2ZA4RU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VQ64URGRIZACYOA74UNP2ZA4RU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VQ64URGRIZACYOA74UNP2ZA4RU","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":"fc908c98e5ea3522a8b72b8e6c04e676242311f9d75dd09bc8b1fc05a9b98372","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-05-19T17:55:58Z","title_canon_sha256":"610d94263a1610fa3ac2337649e53b1d3f949f6d7cfa15fa3e4cfb86f63f4d21"},"schema_version":"1.0","source":{"id":"1705.07112","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07112","created_at":"2026-05-18T00:30:04Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07112v1","created_at":"2026-05-18T00:30:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07112","created_at":"2026-05-18T00:30:04Z"},{"alias_kind":"pith_short_12","alias_value":"VQ64URGRIZAC","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VQ64URGRIZACYOA7","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VQ64URGR","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:c4208385f980a29f4c0d4b14232e022f5e13b98f65dbb48b1ba4e4b6df0c71b2","target":"graph","created_at":"2026-05-18T00:30:04Z","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":"We propose an approximation method for thresholding of singular values using Chebyshev polynomial approximation (CPA). Many signal processing problems require iterative application of singular value decomposition (SVD) for minimizing the rank of a given data matrix with other cost functions and/or constraints, which is called matrix rank minimization. In matrix rank minimization, singular values of a matrix are shrunk by hard-thresholding, soft-thresholding, or weighted soft-thresholding. However, the computational cost of SVD is generally too expensive to handle high dimensional signals such ","authors_text":"Keiichiro Shirai, Masaki Onuki, Shunsuke Ono, Yuichi Tanaka","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-05-19T17:55:58Z","title":"Fast Singular Value Shrinkage with Chebyshev Polynomial Approximation Based on Signal Sparsity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07112","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:78dffeafe9672e465ed5da23092b3b8f949ccb7275b5efc2ec096390ffd26ad9","target":"record","created_at":"2026-05-18T00:30:04Z","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":"fc908c98e5ea3522a8b72b8e6c04e676242311f9d75dd09bc8b1fc05a9b98372","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NA","submitted_at":"2017-05-19T17:55:58Z","title_canon_sha256":"610d94263a1610fa3ac2337649e53b1d3f949f6d7cfa15fa3e4cfb86f63f4d21"},"schema_version":"1.0","source":{"id":"1705.07112","kind":"arxiv","version":1}},"canonical_sha256":"ac3dca44d146402c381fe51afd641c8d31bcf0f94f7b67f68c40f5744b92d4b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac3dca44d146402c381fe51afd641c8d31bcf0f94f7b67f68c40f5744b92d4b0","first_computed_at":"2026-05-18T00:30:04.284625Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:04.284625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"esltAF19T5DaLr6VpHOMq+5hMLNJYx7oIQ4un5rFDRonf1kQv06wnqFfo1ysrxyUi2iHP5svq4kQq4RvhZL1Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:04.285110Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.07112","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78dffeafe9672e465ed5da23092b3b8f949ccb7275b5efc2ec096390ffd26ad9","sha256:c4208385f980a29f4c0d4b14232e022f5e13b98f65dbb48b1ba4e4b6df0c71b2"],"state_sha256":"6459b9c238f79d12fb5eb4e00e12e56c5d17d2be0d506190d3abe79cb9eb656e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XhqNq4Vg/ls+HskIeaFQo2LYkL8wjQktC04acRvOp3BJXxDRNru3AJB2qCArTBKBzJZjlv06rQ8pN3BPYkXLDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T10:33:00.963848Z","bundle_sha256":"8680c3a45f756eb86d03e7b662d80a4935f16367e51bc82cd3bbdd694db1d577"}}