{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NR4TFNJUDAKSJIKLXQHRN47VJ3","short_pith_number":"pith:NR4TFNJU","canonical_record":{"source":{"id":"1505.07766","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-28T17:36:51Z","cross_cats_sorted":["cs.IT","math.IT","math.NA"],"title_canon_sha256":"f032f2ec8544b3eba3bd300884cd9e52b1a4f3e10cc0ce52cdbaa4f16d04ba34","abstract_canon_sha256":"d8daf5f4e272e11c941e5ccfd16bace57d6e6dae7f163f3d22b36975df72ab6c"},"schema_version":"1.0"},"canonical_sha256":"6c7932b534181524a14bbc0f16f3f54edd670c2fc01f2e576596beb57d6e134d","source":{"kind":"arxiv","id":"1505.07766","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.07766","created_at":"2026-05-18T01:55:31Z"},{"alias_kind":"arxiv_version","alias_value":"1505.07766v2","created_at":"2026-05-18T01:55:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07766","created_at":"2026-05-18T01:55:31Z"},{"alias_kind":"pith_short_12","alias_value":"NR4TFNJUDAKS","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NR4TFNJUDAKSJIKL","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NR4TFNJU","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NR4TFNJUDAKSJIKLXQHRN47VJ3","target":"record","payload":{"canonical_record":{"source":{"id":"1505.07766","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-28T17:36:51Z","cross_cats_sorted":["cs.IT","math.IT","math.NA"],"title_canon_sha256":"f032f2ec8544b3eba3bd300884cd9e52b1a4f3e10cc0ce52cdbaa4f16d04ba34","abstract_canon_sha256":"d8daf5f4e272e11c941e5ccfd16bace57d6e6dae7f163f3d22b36975df72ab6c"},"schema_version":"1.0"},"canonical_sha256":"6c7932b534181524a14bbc0f16f3f54edd670c2fc01f2e576596beb57d6e134d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:31.694790Z","signature_b64":"wApUUYNKlR0rnQhquzGpsyQxfFAZg/oopLuqfvyF1wh3OVNeuwS5YwBVeRwqjhULOUXchWWmGlI9gGyPdRiNCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c7932b534181524a14bbc0f16f3f54edd670c2fc01f2e576596beb57d6e134d","last_reissued_at":"2026-05-18T01:55:31.694182Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:31.694182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.07766","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-18T01:55:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A7HsslkUxSQum98iRXVUJ3ORzxK84mwSiwwd5ucnT11fHeaPFW1rExUu3ODovfu4sshTaP0NAMoZsZVGe4s2Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:10:46.919843Z"},"content_sha256":"e3ff3c12235e717d86768c7ebd8ea1feaa5dc0d710f64425b67bed43cb48e480","schema_version":"1.0","event_id":"sha256:e3ff3c12235e717d86768c7ebd8ea1feaa5dc0d710f64425b67bed43cb48e480"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NR4TFNJUDAKSJIKLXQHRN47VJ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quasi-Hankel low-rank matrix completion: a convex relaxation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.NA"],"primary_cat":"math.OC","authors_text":"Konstantin Usevich, Pierre Comon","submitted_at":"2015-05-28T17:36:51Z","abstract_excerpt":"The completion of matrices with missing values under the rank constraint is a non-convex optimization problem. A popular convex relaxation is based on minimization of the nuclear norm (sum of singular values) of the matrix. For this relaxation, an important question is whether the two optimization problems lead to the same solution. This question was addressed in the literature mostly in the case of random positions of missing elements and random known elements. In this contribution, we analyze the case of structured matrices with fixed pattern of missing values, in particular, the case of Han"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07766","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-18T01:55:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zkQa7kPnC4CIyQxQDp1BILEZSEulCQq12mClpNPi9Llh6lH4tjWu92CWXXtknLEeDmR890dfnqaC7avscetYDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:10:46.920193Z"},"content_sha256":"161656e4fc5fc8138701cc86afbbe88779187c2383d516aeafb8615edeb81eac","schema_version":"1.0","event_id":"sha256:161656e4fc5fc8138701cc86afbbe88779187c2383d516aeafb8615edeb81eac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NR4TFNJUDAKSJIKLXQHRN47VJ3/bundle.json","state_url":"https://pith.science/pith/NR4TFNJUDAKSJIKLXQHRN47VJ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NR4TFNJUDAKSJIKLXQHRN47VJ3/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-01T14:10:46Z","links":{"resolver":"https://pith.science/pith/NR4TFNJUDAKSJIKLXQHRN47VJ3","bundle":"https://pith.science/pith/NR4TFNJUDAKSJIKLXQHRN47VJ3/bundle.json","state":"https://pith.science/pith/NR4TFNJUDAKSJIKLXQHRN47VJ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NR4TFNJUDAKSJIKLXQHRN47VJ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NR4TFNJUDAKSJIKLXQHRN47VJ3","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":"d8daf5f4e272e11c941e5ccfd16bace57d6e6dae7f163f3d22b36975df72ab6c","cross_cats_sorted":["cs.IT","math.IT","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-28T17:36:51Z","title_canon_sha256":"f032f2ec8544b3eba3bd300884cd9e52b1a4f3e10cc0ce52cdbaa4f16d04ba34"},"schema_version":"1.0","source":{"id":"1505.07766","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.07766","created_at":"2026-05-18T01:55:31Z"},{"alias_kind":"arxiv_version","alias_value":"1505.07766v2","created_at":"2026-05-18T01:55:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07766","created_at":"2026-05-18T01:55:31Z"},{"alias_kind":"pith_short_12","alias_value":"NR4TFNJUDAKS","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NR4TFNJUDAKSJIKL","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NR4TFNJU","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:161656e4fc5fc8138701cc86afbbe88779187c2383d516aeafb8615edeb81eac","target":"graph","created_at":"2026-05-18T01:55:31Z","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 completion of matrices with missing values under the rank constraint is a non-convex optimization problem. A popular convex relaxation is based on minimization of the nuclear norm (sum of singular values) of the matrix. For this relaxation, an important question is whether the two optimization problems lead to the same solution. This question was addressed in the literature mostly in the case of random positions of missing elements and random known elements. In this contribution, we analyze the case of structured matrices with fixed pattern of missing values, in particular, the case of Han","authors_text":"Konstantin Usevich, Pierre Comon","cross_cats":["cs.IT","math.IT","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-28T17:36:51Z","title":"Quasi-Hankel low-rank matrix completion: a convex relaxation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07766","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:e3ff3c12235e717d86768c7ebd8ea1feaa5dc0d710f64425b67bed43cb48e480","target":"record","created_at":"2026-05-18T01:55:31Z","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":"d8daf5f4e272e11c941e5ccfd16bace57d6e6dae7f163f3d22b36975df72ab6c","cross_cats_sorted":["cs.IT","math.IT","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-28T17:36:51Z","title_canon_sha256":"f032f2ec8544b3eba3bd300884cd9e52b1a4f3e10cc0ce52cdbaa4f16d04ba34"},"schema_version":"1.0","source":{"id":"1505.07766","kind":"arxiv","version":2}},"canonical_sha256":"6c7932b534181524a14bbc0f16f3f54edd670c2fc01f2e576596beb57d6e134d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c7932b534181524a14bbc0f16f3f54edd670c2fc01f2e576596beb57d6e134d","first_computed_at":"2026-05-18T01:55:31.694182Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:31.694182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wApUUYNKlR0rnQhquzGpsyQxfFAZg/oopLuqfvyF1wh3OVNeuwS5YwBVeRwqjhULOUXchWWmGlI9gGyPdRiNCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:31.694790Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.07766","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3ff3c12235e717d86768c7ebd8ea1feaa5dc0d710f64425b67bed43cb48e480","sha256:161656e4fc5fc8138701cc86afbbe88779187c2383d516aeafb8615edeb81eac"],"state_sha256":"cae4b5c025f46587fe878e87110f88627420f074ea654b1df4150f228933d607"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O0dX5iT3PiKEhE1s2c6C1eo+QH7onSKcTGOma8gjclZFsPR1PODiIjKApYBZoB1IJ648P4kZTqYqwMGO6KdbDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:10:46.922206Z","bundle_sha256":"978b2de6add8d8a346e95d1e97965ae5513668080feea4ec1d665549b4e6e096"}}