{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:TWBJZER4CZOODHMLAA3VSSPLJH","short_pith_number":"pith:TWBJZER4","canonical_record":{"source":{"id":"1311.4158","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-11-17T13:22:44Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8ea07fd7ef863b0fb9cb81d3a006e8c67980289c3388b14f3de23a913e2fdd4c","abstract_canon_sha256":"c3e56d200f53a95eaa12c6f9f4bd38145f3d4b9efa570022e219cbe288f5ce59"},"schema_version":"1.0"},"canonical_sha256":"9d829c923c165ce19d8b00375949eb49fa4b744230abdfc197ce83f031732b6b","source":{"kind":"arxiv","id":"1311.4158","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4158","created_at":"2026-05-18T02:56:43Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4158v5","created_at":"2026-05-18T02:56:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4158","created_at":"2026-05-18T02:56:43Z"},{"alias_kind":"pith_short_12","alias_value":"TWBJZER4CZOO","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TWBJZER4CZOODHML","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TWBJZER4","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:TWBJZER4CZOODHMLAA3VSSPLJH","target":"record","payload":{"canonical_record":{"source":{"id":"1311.4158","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-11-17T13:22:44Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8ea07fd7ef863b0fb9cb81d3a006e8c67980289c3388b14f3de23a913e2fdd4c","abstract_canon_sha256":"c3e56d200f53a95eaa12c6f9f4bd38145f3d4b9efa570022e219cbe288f5ce59"},"schema_version":"1.0"},"canonical_sha256":"9d829c923c165ce19d8b00375949eb49fa4b744230abdfc197ce83f031732b6b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:43.752467Z","signature_b64":"MhH3sxlzPSHbeoBiBZ+yDOwwzvfDmfx76/Z8o+9WTlDFbWfjXfIaarcGu3ct/eN42iTaHCxEg9DfxE40FJTjDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d829c923c165ce19d8b00375949eb49fa4b744230abdfc197ce83f031732b6b","last_reissued_at":"2026-05-18T02:56:43.751972Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:43.751972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.4158","source_version":5,"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-18T02:56:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XePlRizespOTBKPyavcrzPZDhOjRUO5BQ6Dl2pHZvoL8PT2rTUqVYb5jJO4O/tmEB5SfPgAcDn8eTCoW+R1zDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:08:23.612902Z"},"content_sha256":"7cc712b62b9b2206dda8c8ea211e08b8915f08f066ba4be58cfbe755840f10b3","schema_version":"1.0","event_id":"sha256:7cc712b62b9b2206dda8c8ea211e08b8915f08f066ba4be58cfbe755840f10b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:TWBJZER4CZOODHMLAA3VSSPLJH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unsupervised Learning of Invariant Representations in Hierarchical Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Andrea Tacchetti, Fabio Anselmi, Jim Mutch, Joel Z. Leibo, Lorenzo Rosasco, Tomaso Poggio","submitted_at":"2013-11-17T13:22:44Z","abstract_excerpt":"The present phase of Machine Learning is characterized by supervised learning algorithms relying on large sets of labeled examples ($n \\to \\infty$). The next phase is likely to focus on algorithms capable of learning from very few labeled examples ($n \\to 1$), like humans seem able to do. We propose an approach to this problem and describe the underlying theory, based on the unsupervised, automatic learning of a ``good'' representation for supervised learning, characterized by small sample complexity ($n$). We consider the case of visual object recognition though the theory applies to other do"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4158","kind":"arxiv","version":5},"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-18T02:56:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y+1/pfS5BUbTsJhuJ8Px4lbxt8nO8y61ch7syLpDDknghq/FRcbRnolJlaeYHl6jK9rCgg7REreYnsMQDueZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:08:23.613454Z"},"content_sha256":"0813d5a947e0ce6a70a63b570e75e51ee90d8f55ce5566685b14cd9f8e78e275","schema_version":"1.0","event_id":"sha256:0813d5a947e0ce6a70a63b570e75e51ee90d8f55ce5566685b14cd9f8e78e275"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TWBJZER4CZOODHMLAA3VSSPLJH/bundle.json","state_url":"https://pith.science/pith/TWBJZER4CZOODHMLAA3VSSPLJH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TWBJZER4CZOODHMLAA3VSSPLJH/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-28T20:08:23Z","links":{"resolver":"https://pith.science/pith/TWBJZER4CZOODHMLAA3VSSPLJH","bundle":"https://pith.science/pith/TWBJZER4CZOODHMLAA3VSSPLJH/bundle.json","state":"https://pith.science/pith/TWBJZER4CZOODHMLAA3VSSPLJH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TWBJZER4CZOODHMLAA3VSSPLJH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TWBJZER4CZOODHMLAA3VSSPLJH","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":"c3e56d200f53a95eaa12c6f9f4bd38145f3d4b9efa570022e219cbe288f5ce59","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-11-17T13:22:44Z","title_canon_sha256":"8ea07fd7ef863b0fb9cb81d3a006e8c67980289c3388b14f3de23a913e2fdd4c"},"schema_version":"1.0","source":{"id":"1311.4158","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4158","created_at":"2026-05-18T02:56:43Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4158v5","created_at":"2026-05-18T02:56:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4158","created_at":"2026-05-18T02:56:43Z"},{"alias_kind":"pith_short_12","alias_value":"TWBJZER4CZOO","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TWBJZER4CZOODHML","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TWBJZER4","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:0813d5a947e0ce6a70a63b570e75e51ee90d8f55ce5566685b14cd9f8e78e275","target":"graph","created_at":"2026-05-18T02:56:43Z","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":"The present phase of Machine Learning is characterized by supervised learning algorithms relying on large sets of labeled examples ($n \\to \\infty$). The next phase is likely to focus on algorithms capable of learning from very few labeled examples ($n \\to 1$), like humans seem able to do. We propose an approach to this problem and describe the underlying theory, based on the unsupervised, automatic learning of a ``good'' representation for supervised learning, characterized by small sample complexity ($n$). We consider the case of visual object recognition though the theory applies to other do","authors_text":"Andrea Tacchetti, Fabio Anselmi, Jim Mutch, Joel Z. Leibo, Lorenzo Rosasco, Tomaso Poggio","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-11-17T13:22:44Z","title":"Unsupervised Learning of Invariant Representations in Hierarchical Architectures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4158","kind":"arxiv","version":5},"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:7cc712b62b9b2206dda8c8ea211e08b8915f08f066ba4be58cfbe755840f10b3","target":"record","created_at":"2026-05-18T02:56:43Z","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":"c3e56d200f53a95eaa12c6f9f4bd38145f3d4b9efa570022e219cbe288f5ce59","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-11-17T13:22:44Z","title_canon_sha256":"8ea07fd7ef863b0fb9cb81d3a006e8c67980289c3388b14f3de23a913e2fdd4c"},"schema_version":"1.0","source":{"id":"1311.4158","kind":"arxiv","version":5}},"canonical_sha256":"9d829c923c165ce19d8b00375949eb49fa4b744230abdfc197ce83f031732b6b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d829c923c165ce19d8b00375949eb49fa4b744230abdfc197ce83f031732b6b","first_computed_at":"2026-05-18T02:56:43.751972Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:43.751972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MhH3sxlzPSHbeoBiBZ+yDOwwzvfDmfx76/Z8o+9WTlDFbWfjXfIaarcGu3ct/eN42iTaHCxEg9DfxE40FJTjDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:43.752467Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.4158","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7cc712b62b9b2206dda8c8ea211e08b8915f08f066ba4be58cfbe755840f10b3","sha256:0813d5a947e0ce6a70a63b570e75e51ee90d8f55ce5566685b14cd9f8e78e275"],"state_sha256":"d2d9a1f4a5c149fabb6e216ec10ab0ed6da3b20b50a84973f47d2b5ca041ff85"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k/p8Ox5YMMmBwXgMgcNKb7bAQO+Csm5UMwBYfze5CP0iDb3D9xeg1LURZ3yRZeE/k7qVxHvOmaLGU1lu/DxEBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:08:23.617267Z","bundle_sha256":"ac4f13e9d8506869f8728edbdc63eb88e45ea8becdf580d90388b1b9ee476d76"}}