{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WARDRC33GUJJDFNP66DK34TO56","short_pith_number":"pith:WARDRC33","schema_version":"1.0","canonical_sha256":"b022388b7b35129195aff786adf26eef8dd9f35c54e257ee1ba54b5480866a3e","source":{"kind":"arxiv","id":"2305.01808","version":2},"attestation_state":"computed","paper":{"title":"Hamming Similarity and Graph Laplacians for Class Partitioning and Adversarial Image Detection","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.CV","authors_text":"Christina M. Cole, Christopher Peterson, Huma Jamil, Michael Kirby, Nathaniel Blanchard, Turgay Caglar, Yajing Liu","submitted_at":"2023-05-02T22:16:15Z","abstract_excerpt":"Researchers typically investigate neural network representations by examining activation outputs for one or more layers of a network. Here, we investigate the potential for ReLU activation patterns (encoded as bit vectors) to aid in understanding and interpreting the behavior of neural networks. We utilize Representational Dissimilarity Matrices (RDMs) to investigate the coherence of data within the embedding spaces of a deep neural network. From each layer of a network, we extract and utilize bit vectors to construct similarity scores between images. From these similarity scores, we build a s"},"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":"2305.01808","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CV","submitted_at":"2023-05-02T22:16:15Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"db580fc9beab0984b8e5e67d7278074ab2f41b0d56fcbfee77744871effa8f62","abstract_canon_sha256":"c73fc2c8084ad21847db1d8a7e1ce2b9b18ef43366d51166fcd82ba51e828216"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:07:39.526865Z","signature_b64":"OqazCwTdQ8xVswAOou2pmMbFuqvhbrCPMbkUMu1b5AEUa7Rs1xMMcFvXAXMiBGSPkPQfDTBNcmmVhBPeGMr0DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b022388b7b35129195aff786adf26eef8dd9f35c54e257ee1ba54b5480866a3e","last_reissued_at":"2026-07-05T06:07:39.526225Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:07:39.526225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hamming Similarity and Graph Laplacians for Class Partitioning and Adversarial Image Detection","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.CV","authors_text":"Christina M. Cole, Christopher Peterson, Huma Jamil, Michael Kirby, Nathaniel Blanchard, Turgay Caglar, Yajing Liu","submitted_at":"2023-05-02T22:16:15Z","abstract_excerpt":"Researchers typically investigate neural network representations by examining activation outputs for one or more layers of a network. Here, we investigate the potential for ReLU activation patterns (encoded as bit vectors) to aid in understanding and interpreting the behavior of neural networks. We utilize Representational Dissimilarity Matrices (RDMs) to investigate the coherence of data within the embedding spaces of a deep neural network. From each layer of a network, we extract and utilize bit vectors to construct similarity scores between images. From these similarity scores, we build a s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.01808","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/2305.01808/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":"2305.01808","created_at":"2026-07-05T06:07:39.526292+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.01808v2","created_at":"2026-07-05T06:07:39.526292+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.01808","created_at":"2026-07-05T06:07:39.526292+00:00"},{"alias_kind":"pith_short_12","alias_value":"WARDRC33GUJJ","created_at":"2026-07-05T06:07:39.526292+00:00"},{"alias_kind":"pith_short_16","alias_value":"WARDRC33GUJJDFNP","created_at":"2026-07-05T06:07:39.526292+00:00"},{"alias_kind":"pith_short_8","alias_value":"WARDRC33","created_at":"2026-07-05T06:07:39.526292+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/WARDRC33GUJJDFNP66DK34TO56","json":"https://pith.science/pith/WARDRC33GUJJDFNP66DK34TO56.json","graph_json":"https://pith.science/api/pith-number/WARDRC33GUJJDFNP66DK34TO56/graph.json","events_json":"https://pith.science/api/pith-number/WARDRC33GUJJDFNP66DK34TO56/events.json","paper":"https://pith.science/paper/WARDRC33"},"agent_actions":{"view_html":"https://pith.science/pith/WARDRC33GUJJDFNP66DK34TO56","download_json":"https://pith.science/pith/WARDRC33GUJJDFNP66DK34TO56.json","view_paper":"https://pith.science/paper/WARDRC33","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.01808&json=true","fetch_graph":"https://pith.science/api/pith-number/WARDRC33GUJJDFNP66DK34TO56/graph.json","fetch_events":"https://pith.science/api/pith-number/WARDRC33GUJJDFNP66DK34TO56/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WARDRC33GUJJDFNP66DK34TO56/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WARDRC33GUJJDFNP66DK34TO56/action/storage_attestation","attest_author":"https://pith.science/pith/WARDRC33GUJJDFNP66DK34TO56/action/author_attestation","sign_citation":"https://pith.science/pith/WARDRC33GUJJDFNP66DK34TO56/action/citation_signature","submit_replication":"https://pith.science/pith/WARDRC33GUJJDFNP66DK34TO56/action/replication_record"}},"created_at":"2026-07-05T06:07:39.526292+00:00","updated_at":"2026-07-05T06:07:39.526292+00:00"}