{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:IOOI5TTQ4ECKJDYJV2RXD3VPU3","short_pith_number":"pith:IOOI5TTQ","schema_version":"1.0","canonical_sha256":"439c8ece70e104a48f09aea371eeafa6e806364058d160de50e517fbf24d762f","source":{"kind":"arxiv","id":"2001.05310","version":2},"attestation_state":"computed","paper":{"title":"DisCo Fever: Robust Networks Through Distance Correlation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["hep-ex","physics.data-an"],"primary_cat":"hep-ph","authors_text":"David Shih, Gregor Kasieczka","submitted_at":"2020-01-13T19:00:05Z","abstract_excerpt":"While deep learning has proven to be extremely successful at supervised classification tasks at the LHC and beyond, for practical applications, raw classification accuracy is often not the only consideration. One crucial issue is the stability of network predictions, either versus changes of individual features of the input data, or against systematic perturbations. We present a new method based on a novel application of \"distance correlation\" (DisCo), a measure quantifying non-linear correlations, that achieves equal performance to state-of-the-art adversarial decorrelation networks but is mu"},"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":"2001.05310","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"hep-ph","submitted_at":"2020-01-13T19:00:05Z","cross_cats_sorted":["hep-ex","physics.data-an"],"title_canon_sha256":"0f6e2c64959d7cb0c50257eab65401ce42460609de18c356fe9d2a7512b5f76e","abstract_canon_sha256":"932a0ec31a130454dd21f53214d2a3dc5e6480ff68408b3e55f0b511091075ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:39:25.508984Z","signature_b64":"/pqzPFDetM2euzUS6UZUJGHx/7fSGTlsdrt/rRtUm997QLGO3i8SH+X51gIedNDV67xBXmUbyu8tmfCPjlYWAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"439c8ece70e104a48f09aea371eeafa6e806364058d160de50e517fbf24d762f","last_reissued_at":"2026-07-05T01:39:25.508503Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:39:25.508503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DisCo Fever: Robust Networks Through Distance Correlation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["hep-ex","physics.data-an"],"primary_cat":"hep-ph","authors_text":"David Shih, Gregor Kasieczka","submitted_at":"2020-01-13T19:00:05Z","abstract_excerpt":"While deep learning has proven to be extremely successful at supervised classification tasks at the LHC and beyond, for practical applications, raw classification accuracy is often not the only consideration. One crucial issue is the stability of network predictions, either versus changes of individual features of the input data, or against systematic perturbations. We present a new method based on a novel application of \"distance correlation\" (DisCo), a measure quantifying non-linear correlations, that achieves equal performance to state-of-the-art adversarial decorrelation networks but is mu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.05310","kind":"arxiv","version":2},"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/2001.05310/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":"2001.05310","created_at":"2026-07-05T01:39:25.508561+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.05310v2","created_at":"2026-07-05T01:39:25.508561+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.05310","created_at":"2026-07-05T01:39:25.508561+00:00"},{"alias_kind":"pith_short_12","alias_value":"IOOI5TTQ4ECK","created_at":"2026-07-05T01:39:25.508561+00:00"},{"alias_kind":"pith_short_16","alias_value":"IOOI5TTQ4ECKJDYJ","created_at":"2026-07-05T01:39:25.508561+00:00"},{"alias_kind":"pith_short_8","alias_value":"IOOI5TTQ","created_at":"2026-07-05T01:39:25.508561+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.18861","citing_title":"Enhanced Ionization Charge Identification in the Short-Baseline Neutrino Program Neutrino Detectors with Deep Neural Networks","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18861","citing_title":"Enhanced Ionization Charge Identification in the Short-Baseline Neutrino Program Neutrino Detectors with Deep Neural Networks","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IOOI5TTQ4ECKJDYJV2RXD3VPU3","json":"https://pith.science/pith/IOOI5TTQ4ECKJDYJV2RXD3VPU3.json","graph_json":"https://pith.science/api/pith-number/IOOI5TTQ4ECKJDYJV2RXD3VPU3/graph.json","events_json":"https://pith.science/api/pith-number/IOOI5TTQ4ECKJDYJV2RXD3VPU3/events.json","paper":"https://pith.science/paper/IOOI5TTQ"},"agent_actions":{"view_html":"https://pith.science/pith/IOOI5TTQ4ECKJDYJV2RXD3VPU3","download_json":"https://pith.science/pith/IOOI5TTQ4ECKJDYJV2RXD3VPU3.json","view_paper":"https://pith.science/paper/IOOI5TTQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.05310&json=true","fetch_graph":"https://pith.science/api/pith-number/IOOI5TTQ4ECKJDYJV2RXD3VPU3/graph.json","fetch_events":"https://pith.science/api/pith-number/IOOI5TTQ4ECKJDYJV2RXD3VPU3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IOOI5TTQ4ECKJDYJV2RXD3VPU3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IOOI5TTQ4ECKJDYJV2RXD3VPU3/action/storage_attestation","attest_author":"https://pith.science/pith/IOOI5TTQ4ECKJDYJV2RXD3VPU3/action/author_attestation","sign_citation":"https://pith.science/pith/IOOI5TTQ4ECKJDYJV2RXD3VPU3/action/citation_signature","submit_replication":"https://pith.science/pith/IOOI5TTQ4ECKJDYJV2RXD3VPU3/action/replication_record"}},"created_at":"2026-07-05T01:39:25.508561+00:00","updated_at":"2026-07-05T01:39:25.508561+00:00"}