{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ONX4DNPTATBEI5SXLZ2KCDTT7Y","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":"95f9fd4c9324971c0f1d5dea220a72399ff42b26d09afb1d5e39934462ce9185","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-12T20:34:53Z","title_canon_sha256":"db3632f546a5fe3ba79ec51bdce840dfc55303c299edf67c23bdc0674f34a7e6"},"schema_version":"1.0","source":{"id":"2605.12733","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12733","created_at":"2026-05-18T03:09:49Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12733v1","created_at":"2026-05-18T03:09:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12733","created_at":"2026-05-18T03:09:49Z"},{"alias_kind":"pith_short_12","alias_value":"ONX4DNPTATBE","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"ONX4DNPTATBEI5SX","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"ONX4DNPT","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:80b547cd92f9cdccfa28808e41fd7cdc260ec15df7a18ceb6a243043d81a85dd","target":"graph","created_at":"2026-05-18T03:09:49Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We first prove that the structure between time steps and tasks is identifiable in a fully unsupervised manner, even when sequences lack strict temporal dependence and may exhibit disconnections, and task assignments can follow arbitrarily complex and interleaving structures. We then prove that, within each time step, the task-relevant latent representation can be disentangled from the irrelevant part under a simple sparsity regularization, without any additional information or parametric constraints."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The setting is completely nonparametric without relying on interventions, parametric forms, or structural constraints, and that a simple sparsity regularization is sufficient to disentangle task-relevant from irrelevant latents within each time step."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Task structure is identifiable across time steps and task-relevant representations are identifiable within steps in a nonparametric setting under sparsity regularization."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Task structure and relevant latents are identifiable in nonparametric settings without supervision or constraints."}],"snapshot_sha256":"295b85ec5bc8891d422ace84aa6cd922d0a0714b8aea6f49c10995a4dc686087"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Given a generalist model, learning a task-relevant specialist representation is fundamental for downstream applications. Identifiability, the asymptotic guarantee of recovering the ground-truth representation, is critical because it sets the ultimate limit of any model, even with infinite data and computation. We study this problem in a completely nonparametric setting, without relying on interventions, parametric forms, or structural constraints. We first prove that the structure between time steps and tasks is identifiable in a fully unsupervised manner, even when sequences lack strict tempo","authors_text":"Fan Feng, Kevin Murphy, Kun Zhang, Shaoan Xie, Yujia Zheng, Yuke Li","cross_cats":["cs.AI","stat.ML"],"headline":"Task structure and relevant latents are identifiable in nonparametric settings without supervision or constraints.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-12T20:34:53Z","title":"From Generalist to Specialist Representation"},"references":{"count":16,"internal_anchors":2,"resolved_work":16,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Function classes for identifiable non- linear independent component analysis.arXiv preprint arXiv:2208.06406","work_id":"9322e44f-022c-4f71-b1c1-363be572d772","year":null},{"cited_arxiv_id":"1803.10122","doi":"","is_internal_anchor":true,"ref_index":2,"title":"World Models","work_id":"07227eee-8445-4c98-bce4-c6a6fd5ed907","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Jin, J. and Syrgkanis, V . Learning causal representations from general environments: Identifiability and intrinsic ambiguity.arXiv preprint arXiv:2311.12267,","work_id":"90c19529-fd99-45ca-a043-b557194d890c","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Condi- tional mutual information neural estimator","work_id":"52721cb3-9dbf-4680-94de-e6f924abf8f0","year":2020},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Nanda, N., Lee, A., and Wattenberg, M","work_id":"739b0d71-ed71-48bd-8264-450acad7aefa","year":null}],"snapshot_sha256":"56b2a0cbb80375fdfc223969d763e2d4ecdd47a46df5301974991749f8e9a4ab"},"source":{"id":"2605.12733","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T21:28:45.768241Z","id":"a9524d11-452f-4a23-acf1-1935b4ee0d71","model_set":{"reader":"grok-4.3"},"one_line_summary":"Task structure is identifiable across time steps and task-relevant representations are identifiable within steps in a nonparametric setting under sparsity regularization.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Task structure and relevant latents are identifiable in nonparametric settings without supervision or constraints.","strongest_claim":"We first prove that the structure between time steps and tasks is identifiable in a fully unsupervised manner, even when sequences lack strict temporal dependence and may exhibit disconnections, and task assignments can follow arbitrarily complex and interleaving structures. We then prove that, within each time step, the task-relevant latent representation can be disentangled from the irrelevant part under a simple sparsity regularization, without any additional information or parametric constraints.","weakest_assumption":"The setting is completely nonparametric without relying on interventions, parametric forms, or structural constraints, and that a simple sparsity regularization is sufficient to disentangle task-relevant from irrelevant latents within each time step."}},"verdict_id":"a9524d11-452f-4a23-acf1-1935b4ee0d71"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ba94adfc8310f0f6f15c9f452a36eba97d24b6d4a5b17230fcc0a2f0d19e2f02","target":"record","created_at":"2026-05-18T03:09:49Z","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":"95f9fd4c9324971c0f1d5dea220a72399ff42b26d09afb1d5e39934462ce9185","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-12T20:34:53Z","title_canon_sha256":"db3632f546a5fe3ba79ec51bdce840dfc55303c299edf67c23bdc0674f34a7e6"},"schema_version":"1.0","source":{"id":"2605.12733","kind":"arxiv","version":1}},"canonical_sha256":"736fc1b5f304c24476575e74a10e73fe2092659af4f351541292354c2ec04ad9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"736fc1b5f304c24476575e74a10e73fe2092659af4f351541292354c2ec04ad9","first_computed_at":"2026-05-18T03:09:49.216720Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:49.216720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rjpDDYt7zvg8tghNQ+DuW9AC16JhMvF7eJ3T7Na3r1RI37Tf2vScFcu1AWHFJaiz+vFd/nJBmBDGW6DCtxnZBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:49.217547Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.12733","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba94adfc8310f0f6f15c9f452a36eba97d24b6d4a5b17230fcc0a2f0d19e2f02","sha256:80b547cd92f9cdccfa28808e41fd7cdc260ec15df7a18ceb6a243043d81a85dd"],"state_sha256":"750fbd4a298a14bce27dcd7a7f00b37c18f3a09255a8ea4cd3eb71f743929ab5"}