{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:DISOHVOBHNOCP7ZVZKR5AOCGGU","short_pith_number":"pith:DISOHVOB","canonical_record":{"source":{"id":"2402.11682","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-18T19:12:18Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"239e2cc0fa936a64b75cec320f6d3079a69a7ff2cafe2eb13fb8c9f05bff7cf7","abstract_canon_sha256":"8eaaaa29415db610c8a7388b45b68389fb8791b28496e0ec23fec759f8ceb91c"},"schema_version":"1.0"},"canonical_sha256":"1a24e3d5c13b5c27ff35caa3d03846351e66609aa314c6da6caed19b42b16704","source":{"kind":"arxiv","id":"2402.11682","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.11682","created_at":"2026-07-05T07:46:43Z"},{"alias_kind":"arxiv_version","alias_value":"2402.11682v1","created_at":"2026-07-05T07:46:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.11682","created_at":"2026-07-05T07:46:43Z"},{"alias_kind":"pith_short_12","alias_value":"DISOHVOBHNOC","created_at":"2026-07-05T07:46:43Z"},{"alias_kind":"pith_short_16","alias_value":"DISOHVOBHNOCP7ZV","created_at":"2026-07-05T07:46:43Z"},{"alias_kind":"pith_short_8","alias_value":"DISOHVOB","created_at":"2026-07-05T07:46:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:DISOHVOBHNOCP7ZVZKR5AOCGGU","target":"record","payload":{"canonical_record":{"source":{"id":"2402.11682","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-18T19:12:18Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"239e2cc0fa936a64b75cec320f6d3079a69a7ff2cafe2eb13fb8c9f05bff7cf7","abstract_canon_sha256":"8eaaaa29415db610c8a7388b45b68389fb8791b28496e0ec23fec759f8ceb91c"},"schema_version":"1.0"},"canonical_sha256":"1a24e3d5c13b5c27ff35caa3d03846351e66609aa314c6da6caed19b42b16704","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:46:43.033095Z","signature_b64":"cwv9Ss8Nk72Dvqx4pqJdlLriExWGy6anBlnVRnaSTusEsVngPDW3IzMkLFygi6+VZT/EKJfRVDVc4nUtE1OkDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a24e3d5c13b5c27ff35caa3d03846351e66609aa314c6da6caed19b42b16704","last_reissued_at":"2026-07-05T07:46:43.032716Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:46:43.032716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.11682","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-07-05T07:46:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GeLlaXligWcE7tb06P0Q4YZ8pKLTTkiV0nvQZ+ND5hTtm1BsCREOiFK83RvZQA+Et/UqU3QTq9+ZilEVMC5nAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T19:59:48.115750Z"},"content_sha256":"efe50a9d7ecaa51176f253e3eb6786adbd0db248d1a10c42f61314ae152ce86a","schema_version":"1.0","event_id":"sha256:efe50a9d7ecaa51176f253e3eb6786adbd0db248d1a10c42f61314ae152ce86a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:DISOHVOBHNOCP7ZVZKR5AOCGGU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Conditional Invariances through Non-Commutativity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Abhra Chaudhuri, Anjan Dutta, Serban Georgescu","submitted_at":"2024-02-18T19:12:18Z","abstract_excerpt":"Invariance learning algorithms that conditionally filter out domain-specific random variables as distractors, do so based only on the data semantics, and not the target domain under evaluation. We show that a provably optimal and sample-efficient way of learning conditional invariances is by relaxing the invariance criterion to be non-commutatively directed towards the target domain. Under domain asymmetry, i.e., when the target domain contains semantically relevant information absent in the source, the risk of the encoder $\\varphi^*$ that is optimal on average across domains is strictly lower"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.11682","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/2402.11682/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-07-05T07:46:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WlVKRgGBFasjedKqMuEpQxQWRUj8bgFl0fULYyBAQR1NJftkrjNj/SLIXJbr1cubpmg5pN0CqQ+DU2pkiI0TBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T19:59:48.116595Z"},"content_sha256":"8a35a70593d9b63200e641cc6c40d83f69b6a4fdba623e800ac63fa3dc46a4ae","schema_version":"1.0","event_id":"sha256:8a35a70593d9b63200e641cc6c40d83f69b6a4fdba623e800ac63fa3dc46a4ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DISOHVOBHNOCP7ZVZKR5AOCGGU/bundle.json","state_url":"https://pith.science/pith/DISOHVOBHNOCP7ZVZKR5AOCGGU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DISOHVOBHNOCP7ZVZKR5AOCGGU/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-11T19:59:48Z","links":{"resolver":"https://pith.science/pith/DISOHVOBHNOCP7ZVZKR5AOCGGU","bundle":"https://pith.science/pith/DISOHVOBHNOCP7ZVZKR5AOCGGU/bundle.json","state":"https://pith.science/pith/DISOHVOBHNOCP7ZVZKR5AOCGGU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DISOHVOBHNOCP7ZVZKR5AOCGGU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:DISOHVOBHNOCP7ZVZKR5AOCGGU","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":"8eaaaa29415db610c8a7388b45b68389fb8791b28496e0ec23fec759f8ceb91c","cross_cats_sorted":["cs.CV"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-18T19:12:18Z","title_canon_sha256":"239e2cc0fa936a64b75cec320f6d3079a69a7ff2cafe2eb13fb8c9f05bff7cf7"},"schema_version":"1.0","source":{"id":"2402.11682","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.11682","created_at":"2026-07-05T07:46:43Z"},{"alias_kind":"arxiv_version","alias_value":"2402.11682v1","created_at":"2026-07-05T07:46:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.11682","created_at":"2026-07-05T07:46:43Z"},{"alias_kind":"pith_short_12","alias_value":"DISOHVOBHNOC","created_at":"2026-07-05T07:46:43Z"},{"alias_kind":"pith_short_16","alias_value":"DISOHVOBHNOCP7ZV","created_at":"2026-07-05T07:46:43Z"},{"alias_kind":"pith_short_8","alias_value":"DISOHVOB","created_at":"2026-07-05T07:46:43Z"}],"graph_snapshots":[{"event_id":"sha256:8a35a70593d9b63200e641cc6c40d83f69b6a4fdba623e800ac63fa3dc46a4ae","target":"graph","created_at":"2026-07-05T07:46: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2402.11682/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Invariance learning algorithms that conditionally filter out domain-specific random variables as distractors, do so based only on the data semantics, and not the target domain under evaluation. We show that a provably optimal and sample-efficient way of learning conditional invariances is by relaxing the invariance criterion to be non-commutatively directed towards the target domain. Under domain asymmetry, i.e., when the target domain contains semantically relevant information absent in the source, the risk of the encoder $\\varphi^*$ that is optimal on average across domains is strictly lower","authors_text":"Abhra Chaudhuri, Anjan Dutta, Serban Georgescu","cross_cats":["cs.CV"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-18T19:12:18Z","title":"Learning Conditional Invariances through Non-Commutativity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.11682","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:efe50a9d7ecaa51176f253e3eb6786adbd0db248d1a10c42f61314ae152ce86a","target":"record","created_at":"2026-07-05T07:46: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":"8eaaaa29415db610c8a7388b45b68389fb8791b28496e0ec23fec759f8ceb91c","cross_cats_sorted":["cs.CV"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-18T19:12:18Z","title_canon_sha256":"239e2cc0fa936a64b75cec320f6d3079a69a7ff2cafe2eb13fb8c9f05bff7cf7"},"schema_version":"1.0","source":{"id":"2402.11682","kind":"arxiv","version":1}},"canonical_sha256":"1a24e3d5c13b5c27ff35caa3d03846351e66609aa314c6da6caed19b42b16704","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a24e3d5c13b5c27ff35caa3d03846351e66609aa314c6da6caed19b42b16704","first_computed_at":"2026-07-05T07:46:43.032716Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:46:43.032716Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cwv9Ss8Nk72Dvqx4pqJdlLriExWGy6anBlnVRnaSTusEsVngPDW3IzMkLFygi6+VZT/EKJfRVDVc4nUtE1OkDg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:46:43.033095Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.11682","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:efe50a9d7ecaa51176f253e3eb6786adbd0db248d1a10c42f61314ae152ce86a","sha256:8a35a70593d9b63200e641cc6c40d83f69b6a4fdba623e800ac63fa3dc46a4ae"],"state_sha256":"1890c442c67f84a827531052b4097b69d00923bde861685740b6cf193279695c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mp8cUtVpiPZXhU862uibbpCWP1WgYT+rrhS0Ckge40S+6thy/V7f8loGECqeiWtZJps7DIVb6ZOpD++hGUk0Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T19:59:48.140601Z","bundle_sha256":"f7b8583b397d3c8cac4b4fcb9c3b060f004f984ab9cd4ed333c8c4fd11c14813"}}