{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:FBRAVISZ2BYXS35NCVVMRKH7KH","short_pith_number":"pith:FBRAVISZ","canonical_record":{"source":{"id":"2606.23609","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-22T17:09:35Z","cross_cats_sorted":["cs.AI","cs.CV"],"title_canon_sha256":"a1e81ef0bbc2012c0a6ea1c8909864625d5e91736f7ebfa1ba031689c4032319","abstract_canon_sha256":"e66ff753057c67c558fe8202e0b974f09be4553c49b06eb3cd90060ba853ca97"},"schema_version":"1.0"},"canonical_sha256":"28620aa259d071796fad156ac8a8ff51ce731475e72b829578c7f315d9461dad","source":{"kind":"arxiv","id":"2606.23609","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.23609","created_at":"2026-06-23T03:14:32Z"},{"alias_kind":"arxiv_version","alias_value":"2606.23609v1","created_at":"2026-06-23T03:14:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.23609","created_at":"2026-06-23T03:14:32Z"},{"alias_kind":"pith_short_12","alias_value":"FBRAVISZ2BYX","created_at":"2026-06-23T03:14:32Z"},{"alias_kind":"pith_short_16","alias_value":"FBRAVISZ2BYXS35N","created_at":"2026-06-23T03:14:32Z"},{"alias_kind":"pith_short_8","alias_value":"FBRAVISZ","created_at":"2026-06-23T03:14:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:FBRAVISZ2BYXS35NCVVMRKH7KH","target":"record","payload":{"canonical_record":{"source":{"id":"2606.23609","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-22T17:09:35Z","cross_cats_sorted":["cs.AI","cs.CV"],"title_canon_sha256":"a1e81ef0bbc2012c0a6ea1c8909864625d5e91736f7ebfa1ba031689c4032319","abstract_canon_sha256":"e66ff753057c67c558fe8202e0b974f09be4553c49b06eb3cd90060ba853ca97"},"schema_version":"1.0"},"canonical_sha256":"28620aa259d071796fad156ac8a8ff51ce731475e72b829578c7f315d9461dad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T03:14:32.164640Z","signature_b64":"tsCEnfIKhpgYAPpzzGyAEgoNFFN7ENtuK2s4fgDJlTilRo3GalzO5ouXQcsyeEjzdgjeSNQvjUUeruUJCpvqBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28620aa259d071796fad156ac8a8ff51ce731475e72b829578c7f315d9461dad","last_reissued_at":"2026-06-23T03:14:32.164225Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T03:14:32.164225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.23609","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-06-23T03:14:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M38Ul2x3Ye1+X+Z19uXNy0Ga4kcEH43yMtlJslgV+jWJbnYgS80hneF7NFRjmP5o+U9tv08F2/7qUzHRXU1oAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T21:23:55.690124Z"},"content_sha256":"cb26bd6f4402a6139948ff86e462329e60751d2673aed960d1f30e64fb48ffad","schema_version":"1.0","event_id":"sha256:cb26bd6f4402a6139948ff86e462329e60751d2673aed960d1f30e64fb48ffad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:FBRAVISZ2BYXS35NCVVMRKH7KH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Discovering Latent Groups for Robust Classification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.LG","authors_text":"Ankur Garg, Samira Ebrahimi Kahou, Ulrich A\\\"ivodji, Vincent Michalski","submitted_at":"2026-06-22T17:09:35Z","abstract_excerpt":"Machine learning models exploit spurious correlations, achieving high average accuracy but failing disproportionately on underrepresented subgroups. Existing methods address this by adjusting network parameters, guided either by subgroup annotations or inferred pseudo-group labels. Yet at inference, these methods produce only a class prediction, with no insight into a sample's latent subgroup. We propose neural classification trees (NCT), a framework that achieves robustness by encoding subgroup structure in its tree-shaped architecture. By routing each sample to an \"easy\" or \"hard\" node of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.23609","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.23609/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"},"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-06-23T03:14:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VG5WG1PRIbtQE9MWrxgbQPx7Xb5sjllQh7dRdOngSW++8UaEaiBXppUadi98zlNkxAn5LD0A+96UrvuWF8+uBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T21:23:55.690515Z"},"content_sha256":"3fb9a54e562bbd2f103c7c92239fd81d948e561bdaac238eb15e200189cca2b6","schema_version":"1.0","event_id":"sha256:3fb9a54e562bbd2f103c7c92239fd81d948e561bdaac238eb15e200189cca2b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FBRAVISZ2BYXS35NCVVMRKH7KH/bundle.json","state_url":"https://pith.science/pith/FBRAVISZ2BYXS35NCVVMRKH7KH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FBRAVISZ2BYXS35NCVVMRKH7KH/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-06-29T21:23:55Z","links":{"resolver":"https://pith.science/pith/FBRAVISZ2BYXS35NCVVMRKH7KH","bundle":"https://pith.science/pith/FBRAVISZ2BYXS35NCVVMRKH7KH/bundle.json","state":"https://pith.science/pith/FBRAVISZ2BYXS35NCVVMRKH7KH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FBRAVISZ2BYXS35NCVVMRKH7KH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:FBRAVISZ2BYXS35NCVVMRKH7KH","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":"e66ff753057c67c558fe8202e0b974f09be4553c49b06eb3cd90060ba853ca97","cross_cats_sorted":["cs.AI","cs.CV"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-22T17:09:35Z","title_canon_sha256":"a1e81ef0bbc2012c0a6ea1c8909864625d5e91736f7ebfa1ba031689c4032319"},"schema_version":"1.0","source":{"id":"2606.23609","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.23609","created_at":"2026-06-23T03:14:32Z"},{"alias_kind":"arxiv_version","alias_value":"2606.23609v1","created_at":"2026-06-23T03:14:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.23609","created_at":"2026-06-23T03:14:32Z"},{"alias_kind":"pith_short_12","alias_value":"FBRAVISZ2BYX","created_at":"2026-06-23T03:14:32Z"},{"alias_kind":"pith_short_16","alias_value":"FBRAVISZ2BYXS35N","created_at":"2026-06-23T03:14:32Z"},{"alias_kind":"pith_short_8","alias_value":"FBRAVISZ","created_at":"2026-06-23T03:14:32Z"}],"graph_snapshots":[{"event_id":"sha256:3fb9a54e562bbd2f103c7c92239fd81d948e561bdaac238eb15e200189cca2b6","target":"graph","created_at":"2026-06-23T03:14:32Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.23609/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Machine learning models exploit spurious correlations, achieving high average accuracy but failing disproportionately on underrepresented subgroups. Existing methods address this by adjusting network parameters, guided either by subgroup annotations or inferred pseudo-group labels. Yet at inference, these methods produce only a class prediction, with no insight into a sample's latent subgroup. We propose neural classification trees (NCT), a framework that achieves robustness by encoding subgroup structure in its tree-shaped architecture. By routing each sample to an \"easy\" or \"hard\" node of th","authors_text":"Ankur Garg, Samira Ebrahimi Kahou, Ulrich A\\\"ivodji, Vincent Michalski","cross_cats":["cs.AI","cs.CV"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-22T17:09:35Z","title":"Discovering Latent Groups for Robust Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.23609","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:cb26bd6f4402a6139948ff86e462329e60751d2673aed960d1f30e64fb48ffad","target":"record","created_at":"2026-06-23T03:14:32Z","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":"e66ff753057c67c558fe8202e0b974f09be4553c49b06eb3cd90060ba853ca97","cross_cats_sorted":["cs.AI","cs.CV"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-22T17:09:35Z","title_canon_sha256":"a1e81ef0bbc2012c0a6ea1c8909864625d5e91736f7ebfa1ba031689c4032319"},"schema_version":"1.0","source":{"id":"2606.23609","kind":"arxiv","version":1}},"canonical_sha256":"28620aa259d071796fad156ac8a8ff51ce731475e72b829578c7f315d9461dad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"28620aa259d071796fad156ac8a8ff51ce731475e72b829578c7f315d9461dad","first_computed_at":"2026-06-23T03:14:32.164225Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T03:14:32.164225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tsCEnfIKhpgYAPpzzGyAEgoNFFN7ENtuK2s4fgDJlTilRo3GalzO5ouXQcsyeEjzdgjeSNQvjUUeruUJCpvqBw==","signature_status":"signed_v1","signed_at":"2026-06-23T03:14:32.164640Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.23609","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb26bd6f4402a6139948ff86e462329e60751d2673aed960d1f30e64fb48ffad","sha256:3fb9a54e562bbd2f103c7c92239fd81d948e561bdaac238eb15e200189cca2b6"],"state_sha256":"cc3404fec4001d6bd21a8517baa8508bfc8b15edf85c93fc9d13e913c6e18c71"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tnOV0PO4NDUxmmZdawManc6zfbJElxEF9tryJoOVP3Y2oUbSOH2HHhFWMitMAg2AGnRhlAvw6o7JJbU8OIxFCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T21:23:55.692512Z","bundle_sha256":"a9538627d7404c1568fe9f7c4b73cd3ed021576e4f27e065b0c644e722e56fb1"}}