{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:JKQMA2A4I4AEU3O6ONCNUFEYQY","short_pith_number":"pith:JKQMA2A4","schema_version":"1.0","canonical_sha256":"4aa0c0681c47004a6dde7344da149886070f64edc68cfd5dfe2bf49467e90239","source":{"kind":"arxiv","id":"2606.01092","version":1},"attestation_state":"computed","paper":{"title":"A Fiber Criterion for Representation Identifiability in Supervised Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Vasileios Sevetlidis","submitted_at":"2026-05-31T08:25:07Z","abstract_excerpt":"Supervised learning evaluates predictors through their input-output behavior. When a predictor is implemented as a composition $f=c\\circ h$, supervised evidence constrains the composite map $f$ but need not determine the representation-head factorization $(h,c)$. This paper formalizes the resulting representation-level identifiability problem: for a class of admissible representation-head pairs, a representation property is identifiable from the induced predictor exactly when it is constant on the fibers of the projection $(h,c)\\mapsto c\\circ h$, equivalently when it descends to a well-defined"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2606.01092","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-31T08:25:07Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c7d1daa8924b2fba50683851fea3e276f7ffa7bb3ebc3efdc4554c23bf240381","abstract_canon_sha256":"4d9b36192ee8cb981018adf5a60588fc1efb158f51e1bca1ec652ba014900ec5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:04:20.991200Z","signature_b64":"HO+d12j42p9ucHMVvU7w8RT1RSDUu38YZhkuS6RND0eDoZ3NCDnI6mNAljkOj6vT8ty549yTgzFsTiu2cA40Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4aa0c0681c47004a6dde7344da149886070f64edc68cfd5dfe2bf49467e90239","last_reissued_at":"2026-06-02T01:04:20.990793Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:04:20.990793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fiber Criterion for Representation Identifiability in Supervised Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Vasileios Sevetlidis","submitted_at":"2026-05-31T08:25:07Z","abstract_excerpt":"Supervised learning evaluates predictors through their input-output behavior. When a predictor is implemented as a composition $f=c\\circ h$, supervised evidence constrains the composite map $f$ but need not determine the representation-head factorization $(h,c)$. This paper formalizes the resulting representation-level identifiability problem: for a class of admissible representation-head pairs, a representation property is identifiable from the induced predictor exactly when it is constant on the fibers of the projection $(h,c)\\mapsto c\\circ h$, equivalently when it descends to a well-defined"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01092","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.01092/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.01092","created_at":"2026-06-02T01:04:20.990852+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.01092v1","created_at":"2026-06-02T01:04:20.990852+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01092","created_at":"2026-06-02T01:04:20.990852+00:00"},{"alias_kind":"pith_short_12","alias_value":"JKQMA2A4I4AE","created_at":"2026-06-02T01:04:20.990852+00:00"},{"alias_kind":"pith_short_16","alias_value":"JKQMA2A4I4AEU3O6","created_at":"2026-06-02T01:04:20.990852+00:00"},{"alias_kind":"pith_short_8","alias_value":"JKQMA2A4","created_at":"2026-06-02T01:04:20.990852+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JKQMA2A4I4AEU3O6ONCNUFEYQY","json":"https://pith.science/pith/JKQMA2A4I4AEU3O6ONCNUFEYQY.json","graph_json":"https://pith.science/api/pith-number/JKQMA2A4I4AEU3O6ONCNUFEYQY/graph.json","events_json":"https://pith.science/api/pith-number/JKQMA2A4I4AEU3O6ONCNUFEYQY/events.json","paper":"https://pith.science/paper/JKQMA2A4"},"agent_actions":{"view_html":"https://pith.science/pith/JKQMA2A4I4AEU3O6ONCNUFEYQY","download_json":"https://pith.science/pith/JKQMA2A4I4AEU3O6ONCNUFEYQY.json","view_paper":"https://pith.science/paper/JKQMA2A4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.01092&json=true","fetch_graph":"https://pith.science/api/pith-number/JKQMA2A4I4AEU3O6ONCNUFEYQY/graph.json","fetch_events":"https://pith.science/api/pith-number/JKQMA2A4I4AEU3O6ONCNUFEYQY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JKQMA2A4I4AEU3O6ONCNUFEYQY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JKQMA2A4I4AEU3O6ONCNUFEYQY/action/storage_attestation","attest_author":"https://pith.science/pith/JKQMA2A4I4AEU3O6ONCNUFEYQY/action/author_attestation","sign_citation":"https://pith.science/pith/JKQMA2A4I4AEU3O6ONCNUFEYQY/action/citation_signature","submit_replication":"https://pith.science/pith/JKQMA2A4I4AEU3O6ONCNUFEYQY/action/replication_record"}},"created_at":"2026-06-02T01:04:20.990852+00:00","updated_at":"2026-06-02T01:04:20.990852+00:00"}