{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:DPM73FH6Z7IANOB6CWOLABEHT6","short_pith_number":"pith:DPM73FH6","canonical_record":{"source":{"id":"1001.3090","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-18T17:07:03Z","cross_cats_sorted":["cs.LG","math.IT","math.ST","stat.TH"],"title_canon_sha256":"397f7754bc8bcecc938b906f6ba48554cb3ef590998291f8437bb5320dc80340","abstract_canon_sha256":"d38b67f1894a570208a968f14b2ee9b6962d5efcb43c569419e2193d17e4cedb"},"schema_version":"1.0"},"canonical_sha256":"1bd9fd94fecfd006b83e159cb004879f888fde65e52f79ecc4426b07e22574d4","source":{"kind":"arxiv","id":"1001.3090","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.3090","created_at":"2026-05-18T01:17:05Z"},{"alias_kind":"arxiv_version","alias_value":"1001.3090v2","created_at":"2026-05-18T01:17:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.3090","created_at":"2026-05-18T01:17:05Z"},{"alias_kind":"pith_short_12","alias_value":"DPM73FH6Z7IA","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"DPM73FH6Z7IANOB6","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"DPM73FH6","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:DPM73FH6Z7IANOB6CWOLABEHT6","target":"record","payload":{"canonical_record":{"source":{"id":"1001.3090","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-18T17:07:03Z","cross_cats_sorted":["cs.LG","math.IT","math.ST","stat.TH"],"title_canon_sha256":"397f7754bc8bcecc938b906f6ba48554cb3ef590998291f8437bb5320dc80340","abstract_canon_sha256":"d38b67f1894a570208a968f14b2ee9b6962d5efcb43c569419e2193d17e4cedb"},"schema_version":"1.0"},"canonical_sha256":"1bd9fd94fecfd006b83e159cb004879f888fde65e52f79ecc4426b07e22574d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:05.962229Z","signature_b64":"aApsUwZ56NqOt6F2+EaZ4Z83Kkr/bcZiOW+E0K3DfEH/dBgG2uB2iCn+wqEcRWXQEAqskqSzmb+aGoPyj8puAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bd9fd94fecfd006b83e159cb004879f888fde65e52f79ecc4426b07e22574d4","last_reissued_at":"2026-05-18T01:17:05.961496Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:05.961496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1001.3090","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:17:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sVgsFqahOrtOuvlcXJU8UZ98Ee+tJUTlhpWxxtJmc4Uh5mf0EmfRMBaCaCrr2uZ2YwMrAWeKul2tHhBR9FVWCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T10:53:26.495224Z"},"content_sha256":"c92ade7ea99f0d4af0709ab64fc279d2eb605339d9b6e13c0bdf3d9ff127a2e7","schema_version":"1.0","event_id":"sha256:c92ade7ea99f0d4af0709ab64fc279d2eb605339d9b6e13c0bdf3d9ff127a2e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:DPM73FH6Z7IANOB6CWOLABEHT6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Feature Extraction for Universal Hypothesis Testing via Rank-constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT","math.ST","stat.TH"],"primary_cat":"cs.IT","authors_text":"Dayu Huang, Sean Meyn","submitted_at":"2010-01-18T17:07:03Z","abstract_excerpt":"This paper concerns the construction of tests for universal hypothesis testing problems, in which the alternate hypothesis is poorly modeled and the observation space is large. The mismatched universal test is a feature-based technique for this purpose. In prior work it is shown that its finite-observation performance can be much better than the (optimal) Hoeffding test, and good performance depends crucially on the choice of features. The contributions of this paper include: 1) We obtain bounds on the number of \\epsilon distinguishable distributions in an exponential family. 2) This motivates"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.3090","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:17:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"egqZefhHiWStxIahjsuDgLCY59EsSgrAhsnHzTlFwLnREWeImwZRX2KsgdAQIhmEwbkxPCxlWkcnpc88bGbQAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T10:53:26.495581Z"},"content_sha256":"4368cbc1bf857a04a5e9f2aca357fa5513a10d223b767b0ff4931f07ab0d343c","schema_version":"1.0","event_id":"sha256:4368cbc1bf857a04a5e9f2aca357fa5513a10d223b767b0ff4931f07ab0d343c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DPM73FH6Z7IANOB6CWOLABEHT6/bundle.json","state_url":"https://pith.science/pith/DPM73FH6Z7IANOB6CWOLABEHT6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DPM73FH6Z7IANOB6CWOLABEHT6/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-27T10:53:26Z","links":{"resolver":"https://pith.science/pith/DPM73FH6Z7IANOB6CWOLABEHT6","bundle":"https://pith.science/pith/DPM73FH6Z7IANOB6CWOLABEHT6/bundle.json","state":"https://pith.science/pith/DPM73FH6Z7IANOB6CWOLABEHT6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DPM73FH6Z7IANOB6CWOLABEHT6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:DPM73FH6Z7IANOB6CWOLABEHT6","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":"d38b67f1894a570208a968f14b2ee9b6962d5efcb43c569419e2193d17e4cedb","cross_cats_sorted":["cs.LG","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-18T17:07:03Z","title_canon_sha256":"397f7754bc8bcecc938b906f6ba48554cb3ef590998291f8437bb5320dc80340"},"schema_version":"1.0","source":{"id":"1001.3090","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.3090","created_at":"2026-05-18T01:17:05Z"},{"alias_kind":"arxiv_version","alias_value":"1001.3090v2","created_at":"2026-05-18T01:17:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.3090","created_at":"2026-05-18T01:17:05Z"},{"alias_kind":"pith_short_12","alias_value":"DPM73FH6Z7IA","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"DPM73FH6Z7IANOB6","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"DPM73FH6","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:4368cbc1bf857a04a5e9f2aca357fa5513a10d223b767b0ff4931f07ab0d343c","target":"graph","created_at":"2026-05-18T01:17:05Z","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 concerns the construction of tests for universal hypothesis testing problems, in which the alternate hypothesis is poorly modeled and the observation space is large. The mismatched universal test is a feature-based technique for this purpose. In prior work it is shown that its finite-observation performance can be much better than the (optimal) Hoeffding test, and good performance depends crucially on the choice of features. The contributions of this paper include: 1) We obtain bounds on the number of \\epsilon distinguishable distributions in an exponential family. 2) This motivates","authors_text":"Dayu Huang, Sean Meyn","cross_cats":["cs.LG","math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-18T17:07:03Z","title":"Feature Extraction for Universal Hypothesis Testing via Rank-constrained Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.3090","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:c92ade7ea99f0d4af0709ab64fc279d2eb605339d9b6e13c0bdf3d9ff127a2e7","target":"record","created_at":"2026-05-18T01:17:05Z","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":"d38b67f1894a570208a968f14b2ee9b6962d5efcb43c569419e2193d17e4cedb","cross_cats_sorted":["cs.LG","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-18T17:07:03Z","title_canon_sha256":"397f7754bc8bcecc938b906f6ba48554cb3ef590998291f8437bb5320dc80340"},"schema_version":"1.0","source":{"id":"1001.3090","kind":"arxiv","version":2}},"canonical_sha256":"1bd9fd94fecfd006b83e159cb004879f888fde65e52f79ecc4426b07e22574d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1bd9fd94fecfd006b83e159cb004879f888fde65e52f79ecc4426b07e22574d4","first_computed_at":"2026-05-18T01:17:05.961496Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:05.961496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aApsUwZ56NqOt6F2+EaZ4Z83Kkr/bcZiOW+E0K3DfEH/dBgG2uB2iCn+wqEcRWXQEAqskqSzmb+aGoPyj8puAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:05.962229Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.3090","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c92ade7ea99f0d4af0709ab64fc279d2eb605339d9b6e13c0bdf3d9ff127a2e7","sha256:4368cbc1bf857a04a5e9f2aca357fa5513a10d223b767b0ff4931f07ab0d343c"],"state_sha256":"449beaed39ea0300b00dd9202a3efbe6f7d99f244420b3ab51cecc5c5dcae99b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yDvHMJO9gRImArmCws2fdtdbjJtdLuPp8mWdD0HH18ZuVJ0YFvNRiAuBMGaSJqOxfqgupgEuyXOkUmtvyYpkCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T10:53:26.497562Z","bundle_sha256":"bea0da1c1c16446df8d0363e7d8547f6fd15023b7bf65c74c1572003e9d1655d"}}