{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XSNYVDIRZHGVM4QBWDJWNXPW4E","short_pith_number":"pith:XSNYVDIR","canonical_record":{"source":{"id":"1806.00739","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-03T05:33:52Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"5fd2d7fb8fff1c268ae62ce98de04f2e07b864a629e1131a777e350544803e6f","abstract_canon_sha256":"9d09b22e72e2fc3f7d8c0d5e9cf9d3fa648582b244bcbd349661a84b241c7e9c"},"schema_version":"1.0"},"canonical_sha256":"bc9b8a8d11c9cd567201b0d366ddf6e112ced53876b0b3a9e8de45c76051dccd","source":{"kind":"arxiv","id":"1806.00739","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00739","created_at":"2026-05-17T23:58:59Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00739v3","created_at":"2026-05-17T23:58:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00739","created_at":"2026-05-17T23:58:59Z"},{"alias_kind":"pith_short_12","alias_value":"XSNYVDIRZHGV","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XSNYVDIRZHGVM4QB","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XSNYVDIR","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XSNYVDIRZHGVM4QBWDJWNXPW4E","target":"record","payload":{"canonical_record":{"source":{"id":"1806.00739","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-03T05:33:52Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"5fd2d7fb8fff1c268ae62ce98de04f2e07b864a629e1131a777e350544803e6f","abstract_canon_sha256":"9d09b22e72e2fc3f7d8c0d5e9cf9d3fa648582b244bcbd349661a84b241c7e9c"},"schema_version":"1.0"},"canonical_sha256":"bc9b8a8d11c9cd567201b0d366ddf6e112ced53876b0b3a9e8de45c76051dccd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:59.171378Z","signature_b64":"onCIFNMdbqNKolxHHAPLK2fwCnYrQMKh+Jo9yMkier2qoB3nXz4wY7IXt7pxm2l/nB3mhTKECqowjlVAv1tcCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc9b8a8d11c9cd567201b0d366ddf6e112ced53876b0b3a9e8de45c76051dccd","last_reissued_at":"2026-05-17T23:58:59.170764Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:59.170764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.00739","source_version":3,"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-17T23:58:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bwry0EulaNm7EwUTwuaWBW6NLIiy5Ckfm8NjHqlviA8e/ntAs6lqYA6BkJ/72Hzy/a5jzzOV1ntpgMfM95IpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:09:34.744305Z"},"content_sha256":"51a60e5866a9bc14fe72d1df369db7f4bce788ba669a629ec6cbe93ef5d6615c","schema_version":"1.0","event_id":"sha256:51a60e5866a9bc14fe72d1df369db7f4bce788ba669a629ec6cbe93ef5d6615c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XSNYVDIRZHGVM4QBWDJWNXPW4E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Second-Order Asymptotically Optimal Statistical Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Lin Zhou, Mehul Motani, Vincent Y. F. Tan","submitted_at":"2018-06-03T05:33:52Z","abstract_excerpt":"Motivated by real-world machine learning applications, we analyze approximations to the non-asymptotic fundamental limits of statistical classification. In the binary version of this problem, given two training sequences generated according to two {\\em unknown} distributions $P_1$ and $P_2$, one is tasked to classify a test sequence which is known to be generated according to either $P_1$ or $P_2$. This problem can be thought of as an analogue of the binary hypothesis testing problem but in the present setting, the generating distributions are unknown. Due to finite sample considerations, we c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00739","kind":"arxiv","version":3},"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-17T23:58:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"76veGgDfrWIsxwfnh11N9EakHh9FLflGije/2oUYCPeuLYlfOg5iVxNedNhDzlNJfW9iJ5GnloyIERgS6kvqAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:09:34.744997Z"},"content_sha256":"652ecb19466b9deae6dae9c541d25dce762584f9828a7a4f4531db407ae8df9c","schema_version":"1.0","event_id":"sha256:652ecb19466b9deae6dae9c541d25dce762584f9828a7a4f4531db407ae8df9c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XSNYVDIRZHGVM4QBWDJWNXPW4E/bundle.json","state_url":"https://pith.science/pith/XSNYVDIRZHGVM4QBWDJWNXPW4E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XSNYVDIRZHGVM4QBWDJWNXPW4E/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-31T06:09:34Z","links":{"resolver":"https://pith.science/pith/XSNYVDIRZHGVM4QBWDJWNXPW4E","bundle":"https://pith.science/pith/XSNYVDIRZHGVM4QBWDJWNXPW4E/bundle.json","state":"https://pith.science/pith/XSNYVDIRZHGVM4QBWDJWNXPW4E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XSNYVDIRZHGVM4QBWDJWNXPW4E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XSNYVDIRZHGVM4QBWDJWNXPW4E","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":"9d09b22e72e2fc3f7d8c0d5e9cf9d3fa648582b244bcbd349661a84b241c7e9c","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-03T05:33:52Z","title_canon_sha256":"5fd2d7fb8fff1c268ae62ce98de04f2e07b864a629e1131a777e350544803e6f"},"schema_version":"1.0","source":{"id":"1806.00739","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00739","created_at":"2026-05-17T23:58:59Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00739v3","created_at":"2026-05-17T23:58:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00739","created_at":"2026-05-17T23:58:59Z"},{"alias_kind":"pith_short_12","alias_value":"XSNYVDIRZHGV","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XSNYVDIRZHGVM4QB","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XSNYVDIR","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:652ecb19466b9deae6dae9c541d25dce762584f9828a7a4f4531db407ae8df9c","target":"graph","created_at":"2026-05-17T23:58:59Z","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":"Motivated by real-world machine learning applications, we analyze approximations to the non-asymptotic fundamental limits of statistical classification. In the binary version of this problem, given two training sequences generated according to two {\\em unknown} distributions $P_1$ and $P_2$, one is tasked to classify a test sequence which is known to be generated according to either $P_1$ or $P_2$. This problem can be thought of as an analogue of the binary hypothesis testing problem but in the present setting, the generating distributions are unknown. Due to finite sample considerations, we c","authors_text":"Lin Zhou, Mehul Motani, Vincent Y. F. Tan","cross_cats":["cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-03T05:33:52Z","title":"Second-Order Asymptotically Optimal Statistical Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00739","kind":"arxiv","version":3},"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:51a60e5866a9bc14fe72d1df369db7f4bce788ba669a629ec6cbe93ef5d6615c","target":"record","created_at":"2026-05-17T23:58:59Z","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":"9d09b22e72e2fc3f7d8c0d5e9cf9d3fa648582b244bcbd349661a84b241c7e9c","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-06-03T05:33:52Z","title_canon_sha256":"5fd2d7fb8fff1c268ae62ce98de04f2e07b864a629e1131a777e350544803e6f"},"schema_version":"1.0","source":{"id":"1806.00739","kind":"arxiv","version":3}},"canonical_sha256":"bc9b8a8d11c9cd567201b0d366ddf6e112ced53876b0b3a9e8de45c76051dccd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc9b8a8d11c9cd567201b0d366ddf6e112ced53876b0b3a9e8de45c76051dccd","first_computed_at":"2026-05-17T23:58:59.170764Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:59.170764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"onCIFNMdbqNKolxHHAPLK2fwCnYrQMKh+Jo9yMkier2qoB3nXz4wY7IXt7pxm2l/nB3mhTKECqowjlVAv1tcCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:59.171378Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.00739","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51a60e5866a9bc14fe72d1df369db7f4bce788ba669a629ec6cbe93ef5d6615c","sha256:652ecb19466b9deae6dae9c541d25dce762584f9828a7a4f4531db407ae8df9c"],"state_sha256":"8ae37a196ae69e6c49b5a5f59e428b8c9f7162cf9c6de7db8116fea706d4fb95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jYyqDGI17i4KjQDY3UnmSjgyGP6bq5Je2a2/EHSwwUp7G6a0Zc7JN0+pJqEbn9BwS3U3STOz1EeF4CHXwlFiAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T06:09:34.748514Z","bundle_sha256":"f7e6ff2050856ad1c468eefdf4b4ae6ce05251c5f6f737e232239bde1173cf2d"}}