{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LHPO7JWZB6XIIFRXHCRDOK6NLQ","short_pith_number":"pith:LHPO7JWZ","canonical_record":{"source":{"id":"1706.05855","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-19T09:57:16Z","cross_cats_sorted":[],"title_canon_sha256":"7cc069e2336f646fcd631a4e79d94887a4b92738ab709ee7dd14b631fa87f533","abstract_canon_sha256":"7e1e13c7deb00db9ebcb8399fa760ee2ad28d8f3f2c7157967d3422c3eda39c8"},"schema_version":"1.0"},"canonical_sha256":"59deefa6d90fae84163738a2372bcd5c2e16c12ba28ed464d96916a3806b37b2","source":{"kind":"arxiv","id":"1706.05855","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05855","created_at":"2026-05-18T00:30:54Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05855v2","created_at":"2026-05-18T00:30:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05855","created_at":"2026-05-18T00:30:54Z"},{"alias_kind":"pith_short_12","alias_value":"LHPO7JWZB6XI","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LHPO7JWZB6XIIFRX","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LHPO7JWZ","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LHPO7JWZB6XIIFRXHCRDOK6NLQ","target":"record","payload":{"canonical_record":{"source":{"id":"1706.05855","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-19T09:57:16Z","cross_cats_sorted":[],"title_canon_sha256":"7cc069e2336f646fcd631a4e79d94887a4b92738ab709ee7dd14b631fa87f533","abstract_canon_sha256":"7e1e13c7deb00db9ebcb8399fa760ee2ad28d8f3f2c7157967d3422c3eda39c8"},"schema_version":"1.0"},"canonical_sha256":"59deefa6d90fae84163738a2372bcd5c2e16c12ba28ed464d96916a3806b37b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:54.779832Z","signature_b64":"V4rX1um/dcjZpA0OkEbtJ+UUaOrV4w70+5DRldkmbSCJBtddYA5E/1eDyrQy+7L2R8vxCblBaTBRYnQrOfdhDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59deefa6d90fae84163738a2372bcd5c2e16c12ba28ed464d96916a3806b37b2","last_reissued_at":"2026-05-18T00:30:54.779112Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:54.779112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.05855","source_version":2,"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:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tr1X7q7R775iPgnzjyk6wZHe2GDKLac9b0vGkcOgkivmgl2cc47zFFmUmQXAsKr9HxT8R6cEWDG48kM+BfnzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T23:19:57.783143Z"},"content_sha256":"d56b1a56ae7d566b4c487baa59aa5058946086863b81f66d35b214ac394370dc","schema_version":"1.0","event_id":"sha256:d56b1a56ae7d566b4c487baa59aa5058946086863b81f66d35b214ac394370dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LHPO7JWZB6XIIFRXHCRDOK6NLQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Non-Convex Relaxation for Fixed-Rank Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Carl Olsson, Erik Bylow, Marcus Carlsson","submitted_at":"2017-06-19T09:57:16Z","abstract_excerpt":"This paper considers the problem of finding a low rank matrix from observations of linear combinations of its elements. It is well known that if the problem fulfills a restricted isometry property (RIP), convex relaxations using the nuclear norm typically work well and come with theoretical performance guarantees. On the other hand these formulations suffer from a shrinking bias that can severely degrade the solution in the presence of noise.\n  In this theoretical paper we study an alternative non-convex relaxation that in contrast to the nuclear norm does not penalize the leading singular val"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05855","kind":"arxiv","version":2},"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:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"34Ouj8UbJtKyf8hm8fUOgS5uN460sUNhEnoXDMADELMRcEJNzqIKYNZqtmAMXfBOoF9NDAZWiONp+xyTap6nBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T23:19:57.783877Z"},"content_sha256":"8d8620d0d5ace6ae8b15e3e3e9a3525a96bb36b064edd1f8bb03d45ad24c0d13","schema_version":"1.0","event_id":"sha256:8d8620d0d5ace6ae8b15e3e3e9a3525a96bb36b064edd1f8bb03d45ad24c0d13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LHPO7JWZB6XIIFRXHCRDOK6NLQ/bundle.json","state_url":"https://pith.science/pith/LHPO7JWZB6XIIFRXHCRDOK6NLQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LHPO7JWZB6XIIFRXHCRDOK6NLQ/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-06T23:19:57Z","links":{"resolver":"https://pith.science/pith/LHPO7JWZB6XIIFRXHCRDOK6NLQ","bundle":"https://pith.science/pith/LHPO7JWZB6XIIFRXHCRDOK6NLQ/bundle.json","state":"https://pith.science/pith/LHPO7JWZB6XIIFRXHCRDOK6NLQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LHPO7JWZB6XIIFRXHCRDOK6NLQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LHPO7JWZB6XIIFRXHCRDOK6NLQ","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":"7e1e13c7deb00db9ebcb8399fa760ee2ad28d8f3f2c7157967d3422c3eda39c8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-19T09:57:16Z","title_canon_sha256":"7cc069e2336f646fcd631a4e79d94887a4b92738ab709ee7dd14b631fa87f533"},"schema_version":"1.0","source":{"id":"1706.05855","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.05855","created_at":"2026-05-18T00:30:54Z"},{"alias_kind":"arxiv_version","alias_value":"1706.05855v2","created_at":"2026-05-18T00:30:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05855","created_at":"2026-05-18T00:30:54Z"},{"alias_kind":"pith_short_12","alias_value":"LHPO7JWZB6XI","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LHPO7JWZB6XIIFRX","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LHPO7JWZ","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:8d8620d0d5ace6ae8b15e3e3e9a3525a96bb36b064edd1f8bb03d45ad24c0d13","target":"graph","created_at":"2026-05-18T00:30:54Z","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":"This paper considers the problem of finding a low rank matrix from observations of linear combinations of its elements. It is well known that if the problem fulfills a restricted isometry property (RIP), convex relaxations using the nuclear norm typically work well and come with theoretical performance guarantees. On the other hand these formulations suffer from a shrinking bias that can severely degrade the solution in the presence of noise.\n  In this theoretical paper we study an alternative non-convex relaxation that in contrast to the nuclear norm does not penalize the leading singular val","authors_text":"Carl Olsson, Erik Bylow, Marcus Carlsson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-19T09:57:16Z","title":"A Non-Convex Relaxation for Fixed-Rank Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05855","kind":"arxiv","version":2},"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:d56b1a56ae7d566b4c487baa59aa5058946086863b81f66d35b214ac394370dc","target":"record","created_at":"2026-05-18T00:30:54Z","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":"7e1e13c7deb00db9ebcb8399fa760ee2ad28d8f3f2c7157967d3422c3eda39c8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-19T09:57:16Z","title_canon_sha256":"7cc069e2336f646fcd631a4e79d94887a4b92738ab709ee7dd14b631fa87f533"},"schema_version":"1.0","source":{"id":"1706.05855","kind":"arxiv","version":2}},"canonical_sha256":"59deefa6d90fae84163738a2372bcd5c2e16c12ba28ed464d96916a3806b37b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59deefa6d90fae84163738a2372bcd5c2e16c12ba28ed464d96916a3806b37b2","first_computed_at":"2026-05-18T00:30:54.779112Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:54.779112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V4rX1um/dcjZpA0OkEbtJ+UUaOrV4w70+5DRldkmbSCJBtddYA5E/1eDyrQy+7L2R8vxCblBaTBRYnQrOfdhDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:54.779832Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.05855","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d56b1a56ae7d566b4c487baa59aa5058946086863b81f66d35b214ac394370dc","sha256:8d8620d0d5ace6ae8b15e3e3e9a3525a96bb36b064edd1f8bb03d45ad24c0d13"],"state_sha256":"2f03dde1b4c254c3ff5b9712583a6f39ff6fc34189881bed02469008852f2eb5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PZMHNdPHfU9AVhQ6Bfs7U++KBnNigoK3yjl+FfsoHsifEt2V6o6sbC9mf0WhT+Ovoe37a/AXUCJlDTw7zla+DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T23:19:57.788134Z","bundle_sha256":"1ab4768b9e7a4c4f9a8a9ba2f552a72318e9274d3c420f2c3e22ed92a1f4e3ba"}}