{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4NOMYFP6V4W5UPSX3QS3C2UTU6","short_pith_number":"pith:4NOMYFP6","canonical_record":{"source":{"id":"1811.01054","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-02T19:00:27Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"dfa071b7767c112d20348e19a0359051cdf8fb26f1f29599ed20b2273d15f885","abstract_canon_sha256":"15cefe6d62adfee5e6ef3434fb485c7321c29eb724c68a628312d5b3cd652c4a"},"schema_version":"1.0"},"canonical_sha256":"e35ccc15feaf2dda3e57dc25b16a93a787287cdbc4bc625740386c64ac98ea70","source":{"kind":"arxiv","id":"1811.01054","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01054","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01054v1","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01054","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"pith_short_12","alias_value":"4NOMYFP6V4W5","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4NOMYFP6V4W5UPSX","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4NOMYFP6","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4NOMYFP6V4W5UPSX3QS3C2UTU6","target":"record","payload":{"canonical_record":{"source":{"id":"1811.01054","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-02T19:00:27Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"dfa071b7767c112d20348e19a0359051cdf8fb26f1f29599ed20b2273d15f885","abstract_canon_sha256":"15cefe6d62adfee5e6ef3434fb485c7321c29eb724c68a628312d5b3cd652c4a"},"schema_version":"1.0"},"canonical_sha256":"e35ccc15feaf2dda3e57dc25b16a93a787287cdbc4bc625740386c64ac98ea70","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:37.176816Z","signature_b64":"af/456Dby6TITVBg7VlsHEFIXU/tQ1DDsAAz6zpHnrwHdORvKQ62/TRvOb8iyZr60/FjbyBOgHXEXf+wS0nkCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e35ccc15feaf2dda3e57dc25b16a93a787287cdbc4bc625740386c64ac98ea70","last_reissued_at":"2026-05-18T00:01:37.176243Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:37.176243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.01054","source_version":1,"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:01:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tF69I6tt1IW2dRXsSep0xvw0kn+/TKiN6UC7TQFmmSmOE1rRJI8p8YpNi64iz1zx1sqdT4z6Nss63kXC9hD/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T23:50:16.390579Z"},"content_sha256":"00746450cba5f18d0866b1beea2f81a487ee2e2cf24c1a79d7157ceb54f54bc6","schema_version":"1.0","event_id":"sha256:00746450cba5f18d0866b1beea2f81a487ee2e2cf24c1a79d7157ceb54f54bc6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4NOMYFP6V4W5UPSX3QS3C2UTU6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimax Estimation of Neural Net Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Kaiyi Ji, Yingbin Liang","submitted_at":"2018-11-02T19:00:27Z","abstract_excerpt":"An important class of distance metrics proposed for training generative adversarial networks (GANs) is the integral probability metric (IPM), in which the neural net distance captures the practical GAN training via two neural networks. This paper investigates the minimax estimation problem of the neural net distance based on samples drawn from the distributions. We develop the first known minimax lower bound on the estimation error of the neural net distance, and an upper bound tighter than an existing bound on the estimator error for the empirical neural net distance. Our lower and upper boun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01054","kind":"arxiv","version":1},"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:01:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8SbYRGd8OPAYEJrKkUWJ+GsoRHteHkEPFMwLlcU4yzVnZATPByBB2bzh6fl7oBeslUsGY0ha0Ze/AN+jxN56Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T23:50:16.391240Z"},"content_sha256":"eb8210dcddd74f6d9e2a982a6e5a7037d41219f42b6a721acfd23bacdae21244","schema_version":"1.0","event_id":"sha256:eb8210dcddd74f6d9e2a982a6e5a7037d41219f42b6a721acfd23bacdae21244"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4NOMYFP6V4W5UPSX3QS3C2UTU6/bundle.json","state_url":"https://pith.science/pith/4NOMYFP6V4W5UPSX3QS3C2UTU6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4NOMYFP6V4W5UPSX3QS3C2UTU6/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-21T23:50:16Z","links":{"resolver":"https://pith.science/pith/4NOMYFP6V4W5UPSX3QS3C2UTU6","bundle":"https://pith.science/pith/4NOMYFP6V4W5UPSX3QS3C2UTU6/bundle.json","state":"https://pith.science/pith/4NOMYFP6V4W5UPSX3QS3C2UTU6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4NOMYFP6V4W5UPSX3QS3C2UTU6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4NOMYFP6V4W5UPSX3QS3C2UTU6","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":"15cefe6d62adfee5e6ef3434fb485c7321c29eb724c68a628312d5b3cd652c4a","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-02T19:00:27Z","title_canon_sha256":"dfa071b7767c112d20348e19a0359051cdf8fb26f1f29599ed20b2273d15f885"},"schema_version":"1.0","source":{"id":"1811.01054","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01054","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01054v1","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01054","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"pith_short_12","alias_value":"4NOMYFP6V4W5","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4NOMYFP6V4W5UPSX","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4NOMYFP6","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:eb8210dcddd74f6d9e2a982a6e5a7037d41219f42b6a721acfd23bacdae21244","target":"graph","created_at":"2026-05-18T00:01:37Z","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":"An important class of distance metrics proposed for training generative adversarial networks (GANs) is the integral probability metric (IPM), in which the neural net distance captures the practical GAN training via two neural networks. This paper investigates the minimax estimation problem of the neural net distance based on samples drawn from the distributions. We develop the first known minimax lower bound on the estimation error of the neural net distance, and an upper bound tighter than an existing bound on the estimator error for the empirical neural net distance. Our lower and upper boun","authors_text":"Kaiyi Ji, Yingbin Liang","cross_cats":["cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-02T19:00:27Z","title":"Minimax Estimation of Neural Net Distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01054","kind":"arxiv","version":1},"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:00746450cba5f18d0866b1beea2f81a487ee2e2cf24c1a79d7157ceb54f54bc6","target":"record","created_at":"2026-05-18T00:01:37Z","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":"15cefe6d62adfee5e6ef3434fb485c7321c29eb724c68a628312d5b3cd652c4a","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-02T19:00:27Z","title_canon_sha256":"dfa071b7767c112d20348e19a0359051cdf8fb26f1f29599ed20b2273d15f885"},"schema_version":"1.0","source":{"id":"1811.01054","kind":"arxiv","version":1}},"canonical_sha256":"e35ccc15feaf2dda3e57dc25b16a93a787287cdbc4bc625740386c64ac98ea70","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e35ccc15feaf2dda3e57dc25b16a93a787287cdbc4bc625740386c64ac98ea70","first_computed_at":"2026-05-18T00:01:37.176243Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:37.176243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"af/456Dby6TITVBg7VlsHEFIXU/tQ1DDsAAz6zpHnrwHdORvKQ62/TRvOb8iyZr60/FjbyBOgHXEXf+wS0nkCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:37.176816Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.01054","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:00746450cba5f18d0866b1beea2f81a487ee2e2cf24c1a79d7157ceb54f54bc6","sha256:eb8210dcddd74f6d9e2a982a6e5a7037d41219f42b6a721acfd23bacdae21244"],"state_sha256":"6b7b50cb34e32503d70ce609bfb5cb83df26054fcb685d10cfe5e81ad126a8b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4GMINSI/kBj/0At7qDwV+s6O1wElUuzBNMgFTAJAF1eADNqFaXD6KGaotJ5M98RjPkt4+610AX3DZfncv6o+Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T23:50:16.398609Z","bundle_sha256":"a64923ccda648d80fb35eca6df98694bb7c31e8047c830e35fee1017cbd457d3"}}