{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BKJZD6TPYMEMCGRURTGSBMEWP2","short_pith_number":"pith:BKJZD6TP","canonical_record":{"source":{"id":"1602.03027","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-09T15:17:24Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9fd9c032f6cc15e8dd55d7a3f40c6e162dc16d96f7024ae0efd4a737879c63da","abstract_canon_sha256":"cc07e4860b274c88ce7cb05c90160e6beb361403e8925fed259b2c4d31118b6e"},"schema_version":"1.0"},"canonical_sha256":"0a9391fa6fc308c11a348ccd20b0967eb02d74b8627e22f920be80958f4dadb3","source":{"kind":"arxiv","id":"1602.03027","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.03027","created_at":"2026-05-18T01:21:03Z"},{"alias_kind":"arxiv_version","alias_value":"1602.03027v1","created_at":"2026-05-18T01:21:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03027","created_at":"2026-05-18T01:21:03Z"},{"alias_kind":"pith_short_12","alias_value":"BKJZD6TPYMEM","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BKJZD6TPYMEMCGRU","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BKJZD6TP","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BKJZD6TPYMEMCGRURTGSBMEWP2","target":"record","payload":{"canonical_record":{"source":{"id":"1602.03027","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-09T15:17:24Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9fd9c032f6cc15e8dd55d7a3f40c6e162dc16d96f7024ae0efd4a737879c63da","abstract_canon_sha256":"cc07e4860b274c88ce7cb05c90160e6beb361403e8925fed259b2c4d31118b6e"},"schema_version":"1.0"},"canonical_sha256":"0a9391fa6fc308c11a348ccd20b0967eb02d74b8627e22f920be80958f4dadb3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:03.617619Z","signature_b64":"y+lJMfVnhysZn5g25feLqImfmO4A33fUQ0ZN0a7xGwBCeWDvzbz6NWxYJmS5k33HUFYvgLB2Cc6lPrHiRIRaAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a9391fa6fc308c11a348ccd20b0967eb02d74b8627e22f920be80958f4dadb3","last_reissued_at":"2026-05-18T01:21:03.616906Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:03.616906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.03027","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-18T01:21:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gzObdmsgmkdQCOGnUSs0ZsiTDXnCqu98Fzep0UL2DNLlFsF6hYo35Grk2CDnpewhSW5yl1rR/i6h7lgzRc5hBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T00:01:50.791854Z"},"content_sha256":"0dd159f69a7bfd0a9817e7f075b29df6cecca639ba22b5f5796b58a19a58a194","schema_version":"1.0","event_id":"sha256:0dd159f69a7bfd0a9817e7f075b29df6cecca639ba22b5f5796b58a19a58a194"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BKJZD6TPYMEMCGRURTGSBMEWP2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimax Lower Bounds for Realizable Transductive Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"David Lopez-Paz, Ilya Tolstikhin","submitted_at":"2016-02-09T15:17:24Z","abstract_excerpt":"Transductive learning considers a training set of $m$ labeled samples and a test set of $u$ unlabeled samples, with the goal of best labeling that particular test set. Conversely, inductive learning considers a training set of $m$ labeled samples drawn iid from $P(X,Y)$, with the goal of best labeling any future samples drawn iid from $P(X)$. This comparison suggests that transduction is a much easier type of inference than induction, but is this really the case? This paper provides a negative answer to this question, by proving the first known minimax lower bounds for transductive, realizable"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03027","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-18T01:21:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9GkmKDx4KVRnda8FjA37NM3rn3bx5CoTPA42xQjRGW0JJSpRDCTPVrlTFeChbUJVB688F1gcXjZUqodLzFi3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T00:01:50.792319Z"},"content_sha256":"963db857564401d858e693d17ead113eca967d50f308748c0e61d7a68ffe9519","schema_version":"1.0","event_id":"sha256:963db857564401d858e693d17ead113eca967d50f308748c0e61d7a68ffe9519"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BKJZD6TPYMEMCGRURTGSBMEWP2/bundle.json","state_url":"https://pith.science/pith/BKJZD6TPYMEMCGRURTGSBMEWP2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BKJZD6TPYMEMCGRURTGSBMEWP2/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-08-22T00:01:50Z","links":{"resolver":"https://pith.science/pith/BKJZD6TPYMEMCGRURTGSBMEWP2","bundle":"https://pith.science/pith/BKJZD6TPYMEMCGRURTGSBMEWP2/bundle.json","state":"https://pith.science/pith/BKJZD6TPYMEMCGRURTGSBMEWP2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BKJZD6TPYMEMCGRURTGSBMEWP2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BKJZD6TPYMEMCGRURTGSBMEWP2","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":"cc07e4860b274c88ce7cb05c90160e6beb361403e8925fed259b2c4d31118b6e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-09T15:17:24Z","title_canon_sha256":"9fd9c032f6cc15e8dd55d7a3f40c6e162dc16d96f7024ae0efd4a737879c63da"},"schema_version":"1.0","source":{"id":"1602.03027","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.03027","created_at":"2026-05-18T01:21:03Z"},{"alias_kind":"arxiv_version","alias_value":"1602.03027v1","created_at":"2026-05-18T01:21:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03027","created_at":"2026-05-18T01:21:03Z"},{"alias_kind":"pith_short_12","alias_value":"BKJZD6TPYMEM","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BKJZD6TPYMEMCGRU","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BKJZD6TP","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:963db857564401d858e693d17ead113eca967d50f308748c0e61d7a68ffe9519","target":"graph","created_at":"2026-05-18T01:21:03Z","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":"Transductive learning considers a training set of $m$ labeled samples and a test set of $u$ unlabeled samples, with the goal of best labeling that particular test set. Conversely, inductive learning considers a training set of $m$ labeled samples drawn iid from $P(X,Y)$, with the goal of best labeling any future samples drawn iid from $P(X)$. This comparison suggests that transduction is a much easier type of inference than induction, but is this really the case? This paper provides a negative answer to this question, by proving the first known minimax lower bounds for transductive, realizable","authors_text":"David Lopez-Paz, Ilya Tolstikhin","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-09T15:17:24Z","title":"Minimax Lower Bounds for Realizable Transductive Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03027","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:0dd159f69a7bfd0a9817e7f075b29df6cecca639ba22b5f5796b58a19a58a194","target":"record","created_at":"2026-05-18T01:21:03Z","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":"cc07e4860b274c88ce7cb05c90160e6beb361403e8925fed259b2c4d31118b6e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-09T15:17:24Z","title_canon_sha256":"9fd9c032f6cc15e8dd55d7a3f40c6e162dc16d96f7024ae0efd4a737879c63da"},"schema_version":"1.0","source":{"id":"1602.03027","kind":"arxiv","version":1}},"canonical_sha256":"0a9391fa6fc308c11a348ccd20b0967eb02d74b8627e22f920be80958f4dadb3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a9391fa6fc308c11a348ccd20b0967eb02d74b8627e22f920be80958f4dadb3","first_computed_at":"2026-05-18T01:21:03.616906Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:03.616906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y+lJMfVnhysZn5g25feLqImfmO4A33fUQ0ZN0a7xGwBCeWDvzbz6NWxYJmS5k33HUFYvgLB2Cc6lPrHiRIRaAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:03.617619Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.03027","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0dd159f69a7bfd0a9817e7f075b29df6cecca639ba22b5f5796b58a19a58a194","sha256:963db857564401d858e693d17ead113eca967d50f308748c0e61d7a68ffe9519"],"state_sha256":"9602ff9322a35cadf6857894b5f286bd84562420e84981c406abf49a687cea25"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D2ois5onoSX0fyO6zfnCqGRPkV7zUS8SuJ122jNx0luLlJ0xxyRrdGaq4TR7G15igisVXy2k8pYHUeqEpDHECA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T00:01:50.796006Z","bundle_sha256":"6a5c5485abea4730ad807e63a7da1285e8c8e908aeb7a4d92a8a3a44e6015544"}}