{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:IZG2CXAYQJFBOSLDZAG6RIJTIH","short_pith_number":"pith:IZG2CXAY","schema_version":"1.0","canonical_sha256":"464da15c18824a174963c80de8a13341dabf9e867ab2010127228b7b43631541","source":{"kind":"arxiv","id":"2211.13305","version":2},"attestation_state":"computed","paper":{"title":"Dual Graphs of Polyhedral Decompositions for the Detection of Adversarial Attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"cs.CV","authors_text":"Christina M. Cole, Christopher Peterson, Emily J. King, Huma Jamil, Michael Kirby, Nathaniel Blanchard, Yajing Liu","submitted_at":"2022-11-23T21:16:38Z","abstract_excerpt":"Previous work has shown that a neural network with the rectified linear unit (ReLU) activation function leads to a convex polyhedral decomposition of the input space. These decompositions can be represented by a dual graph with vertices corresponding to polyhedra and edges corresponding to polyhedra sharing a facet, which is a subgraph of a Hamming graph. This paper illustrates how one can utilize the dual graph to detect and analyze adversarial attacks in the context of digital images. When an image passes through a network containing ReLU nodes, the firing or non-firing at a node can be enco"},"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":"2211.13305","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2022-11-23T21:16:38Z","cross_cats_sorted":["cs.CR","cs.LG"],"title_canon_sha256":"0f98a4474815ecc98b2828df8b6ff554614b5a761c129960fe9970a8be3a2b52","abstract_canon_sha256":"e86ec7e14d834793e7c274d17972027262e7b10273954e6a2c7db1330b4e713b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:21:54.473631Z","signature_b64":"jaxrQzv9enFlbQyUNlDxG4xadHOuEWyVeDNlZpGuKKu+n/8/6PJ/WOTk0eUxtVChICTyBjx/ad+LWRawpQnkAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"464da15c18824a174963c80de8a13341dabf9e867ab2010127228b7b43631541","last_reissued_at":"2026-07-05T05:21:54.473275Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:21:54.473275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dual Graphs of Polyhedral Decompositions for the Detection of Adversarial Attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"cs.CV","authors_text":"Christina M. Cole, Christopher Peterson, Emily J. King, Huma Jamil, Michael Kirby, Nathaniel Blanchard, Yajing Liu","submitted_at":"2022-11-23T21:16:38Z","abstract_excerpt":"Previous work has shown that a neural network with the rectified linear unit (ReLU) activation function leads to a convex polyhedral decomposition of the input space. These decompositions can be represented by a dual graph with vertices corresponding to polyhedra and edges corresponding to polyhedra sharing a facet, which is a subgraph of a Hamming graph. This paper illustrates how one can utilize the dual graph to detect and analyze adversarial attacks in the context of digital images. When an image passes through a network containing ReLU nodes, the firing or non-firing at a node can be enco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.13305","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/2211.13305/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":"2211.13305","created_at":"2026-07-05T05:21:54.473341+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.13305v2","created_at":"2026-07-05T05:21:54.473341+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.13305","created_at":"2026-07-05T05:21:54.473341+00:00"},{"alias_kind":"pith_short_12","alias_value":"IZG2CXAYQJFB","created_at":"2026-07-05T05:21:54.473341+00:00"},{"alias_kind":"pith_short_16","alias_value":"IZG2CXAYQJFBOSLD","created_at":"2026-07-05T05:21:54.473341+00:00"},{"alias_kind":"pith_short_8","alias_value":"IZG2CXAY","created_at":"2026-07-05T05:21:54.473341+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/IZG2CXAYQJFBOSLDZAG6RIJTIH","json":"https://pith.science/pith/IZG2CXAYQJFBOSLDZAG6RIJTIH.json","graph_json":"https://pith.science/api/pith-number/IZG2CXAYQJFBOSLDZAG6RIJTIH/graph.json","events_json":"https://pith.science/api/pith-number/IZG2CXAYQJFBOSLDZAG6RIJTIH/events.json","paper":"https://pith.science/paper/IZG2CXAY"},"agent_actions":{"view_html":"https://pith.science/pith/IZG2CXAYQJFBOSLDZAG6RIJTIH","download_json":"https://pith.science/pith/IZG2CXAYQJFBOSLDZAG6RIJTIH.json","view_paper":"https://pith.science/paper/IZG2CXAY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.13305&json=true","fetch_graph":"https://pith.science/api/pith-number/IZG2CXAYQJFBOSLDZAG6RIJTIH/graph.json","fetch_events":"https://pith.science/api/pith-number/IZG2CXAYQJFBOSLDZAG6RIJTIH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IZG2CXAYQJFBOSLDZAG6RIJTIH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IZG2CXAYQJFBOSLDZAG6RIJTIH/action/storage_attestation","attest_author":"https://pith.science/pith/IZG2CXAYQJFBOSLDZAG6RIJTIH/action/author_attestation","sign_citation":"https://pith.science/pith/IZG2CXAYQJFBOSLDZAG6RIJTIH/action/citation_signature","submit_replication":"https://pith.science/pith/IZG2CXAYQJFBOSLDZAG6RIJTIH/action/replication_record"}},"created_at":"2026-07-05T05:21:54.473341+00:00","updated_at":"2026-07-05T05:21:54.473341+00:00"}