{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UKXOJ2DB5QD4QIP5JKDRU4UOTU","short_pith_number":"pith:UKXOJ2DB","canonical_record":{"source":{"id":"1507.03829","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-07-14T12:49:28Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"010e7d012f53b4a77349ab8981ad98daf3eb65999501bb9b17869c3f278c5e1a","abstract_canon_sha256":"5cb7f406141a9edefb6821709efda0110595b21cd7657074262acc212a7c8d4d"},"schema_version":"1.0"},"canonical_sha256":"a2aee4e861ec07c821fd4a871a728e9d1c28f84b87f97ca813b72526feaa17be","source":{"kind":"arxiv","id":"1507.03829","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.03829","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"arxiv_version","alias_value":"1507.03829v2","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03829","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"pith_short_12","alias_value":"UKXOJ2DB5QD4","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UKXOJ2DB5QD4QIP5","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UKXOJ2DB","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UKXOJ2DB5QD4QIP5JKDRU4UOTU","target":"record","payload":{"canonical_record":{"source":{"id":"1507.03829","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-07-14T12:49:28Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"010e7d012f53b4a77349ab8981ad98daf3eb65999501bb9b17869c3f278c5e1a","abstract_canon_sha256":"5cb7f406141a9edefb6821709efda0110595b21cd7657074262acc212a7c8d4d"},"schema_version":"1.0"},"canonical_sha256":"a2aee4e861ec07c821fd4a871a728e9d1c28f84b87f97ca813b72526feaa17be","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:31.428088Z","signature_b64":"IlB3HAHscxvIpSwLcP5m1A4qsH40FRFSyY4dp8lERewCiQXRo27K7hqot2B1KoGZEkW87hfCdt/1LVCuUX1ZBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2aee4e861ec07c821fd4a871a728e9d1c28f84b87f97ca813b72526feaa17be","last_reissued_at":"2026-05-18T01:27:31.427697Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:31.427697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.03829","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:27:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t3Hz4vMuVg3cki3Q8LnBI2sHQxrmnpuk1qD6Zvn/sHloIVmjyva0cxDkjP2YiQ8FFJHzvNT1UVqc/KBStPPWCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:22:06.669986Z"},"content_sha256":"570b1674ae93a2577a1bcf9dd9985d7b1acbd260ab803b2d7ad730b425e80ab2","schema_version":"1.0","event_id":"sha256:570b1674ae93a2577a1bcf9dd9985d7b1acbd260ab803b2d7ad730b425e80ab2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UKXOJ2DB5QD4QIP5JKDRU4UOTU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On signal detection and confidence sets for low rank inference problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Alexandra Carpentier, Richard Nickl","submitted_at":"2015-07-14T12:49:28Z","abstract_excerpt":"We consider the signal detection problem in the Gaussian design trace regression model with low rank alternative hypotheses. We derive the precise (Ingster-type) detection boundary for the Frobenius and the nuclear norm. We then apply these results to show that honest confidence sets for the unknown matrix parameter that adapt to all low rank sub-models in nuclear norm do not exist. This shows that recently obtained positive results in (Carpentier, Eisert, Gross and Nickl, 2015) for confidence sets in low rank recovery problems are essentially optimal."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03829","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:27:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q/x/Yi/jPTVshkJpebNTIJ2kkeDPHaGFFqSBfgiLTl6lwY42MWJtZ51pqJyDOaf7zSbxhC8QrOaXp2CXCSjjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:22:06.670641Z"},"content_sha256":"d4b0e98d84eb537da499c48ccd4c2a830349601ef62e49a286833a606dc35f2d","schema_version":"1.0","event_id":"sha256:d4b0e98d84eb537da499c48ccd4c2a830349601ef62e49a286833a606dc35f2d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UKXOJ2DB5QD4QIP5JKDRU4UOTU/bundle.json","state_url":"https://pith.science/pith/UKXOJ2DB5QD4QIP5JKDRU4UOTU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UKXOJ2DB5QD4QIP5JKDRU4UOTU/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-05-31T12:22:06Z","links":{"resolver":"https://pith.science/pith/UKXOJ2DB5QD4QIP5JKDRU4UOTU","bundle":"https://pith.science/pith/UKXOJ2DB5QD4QIP5JKDRU4UOTU/bundle.json","state":"https://pith.science/pith/UKXOJ2DB5QD4QIP5JKDRU4UOTU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UKXOJ2DB5QD4QIP5JKDRU4UOTU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UKXOJ2DB5QD4QIP5JKDRU4UOTU","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":"5cb7f406141a9edefb6821709efda0110595b21cd7657074262acc212a7c8d4d","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-07-14T12:49:28Z","title_canon_sha256":"010e7d012f53b4a77349ab8981ad98daf3eb65999501bb9b17869c3f278c5e1a"},"schema_version":"1.0","source":{"id":"1507.03829","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.03829","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"arxiv_version","alias_value":"1507.03829v2","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03829","created_at":"2026-05-18T01:27:31Z"},{"alias_kind":"pith_short_12","alias_value":"UKXOJ2DB5QD4","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UKXOJ2DB5QD4QIP5","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UKXOJ2DB","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:d4b0e98d84eb537da499c48ccd4c2a830349601ef62e49a286833a606dc35f2d","target":"graph","created_at":"2026-05-18T01:27: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":"We consider the signal detection problem in the Gaussian design trace regression model with low rank alternative hypotheses. We derive the precise (Ingster-type) detection boundary for the Frobenius and the nuclear norm. We then apply these results to show that honest confidence sets for the unknown matrix parameter that adapt to all low rank sub-models in nuclear norm do not exist. This shows that recently obtained positive results in (Carpentier, Eisert, Gross and Nickl, 2015) for confidence sets in low rank recovery problems are essentially optimal.","authors_text":"Alexandra Carpentier, Richard Nickl","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-07-14T12:49:28Z","title":"On signal detection and confidence sets for low rank inference problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03829","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:570b1674ae93a2577a1bcf9dd9985d7b1acbd260ab803b2d7ad730b425e80ab2","target":"record","created_at":"2026-05-18T01:27: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":"5cb7f406141a9edefb6821709efda0110595b21cd7657074262acc212a7c8d4d","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-07-14T12:49:28Z","title_canon_sha256":"010e7d012f53b4a77349ab8981ad98daf3eb65999501bb9b17869c3f278c5e1a"},"schema_version":"1.0","source":{"id":"1507.03829","kind":"arxiv","version":2}},"canonical_sha256":"a2aee4e861ec07c821fd4a871a728e9d1c28f84b87f97ca813b72526feaa17be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2aee4e861ec07c821fd4a871a728e9d1c28f84b87f97ca813b72526feaa17be","first_computed_at":"2026-05-18T01:27:31.427697Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:31.427697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IlB3HAHscxvIpSwLcP5m1A4qsH40FRFSyY4dp8lERewCiQXRo27K7hqot2B1KoGZEkW87hfCdt/1LVCuUX1ZBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:31.428088Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.03829","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:570b1674ae93a2577a1bcf9dd9985d7b1acbd260ab803b2d7ad730b425e80ab2","sha256:d4b0e98d84eb537da499c48ccd4c2a830349601ef62e49a286833a606dc35f2d"],"state_sha256":"be59772d11d5a947eb52944f72d072c8e50128db0d443841d767dcf14c3d87b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZUU702S4N5lo+FPMi9cnHY9bLX79O7gCuGADwMM7VmHJ4EkRraECZ17FgMEpjvauYIJwMP1I9W+acOB7DvuvDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:22:06.674054Z","bundle_sha256":"2aa4607c59f44c1065ea5e575f663967b2286ede8a253a9be7d7ab767372071b"}}