{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:BW422QXWJYKGYT2MHPYA7ISVBE","short_pith_number":"pith:BW422QXW","schema_version":"1.0","canonical_sha256":"0db9ad42f64e146c4f4c3bf00fa255090febee0bcede918f59e74989e853052f","source":{"kind":"arxiv","id":"2111.11165","version":2},"attestation_state":"computed","paper":{"title":"Graph-Based Similarity of Neural Network Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jinxuan Hu, Qi Xuan, Wen Yang, Xiaoniu Yang, Yao Lu, Zhen Wang, Zuohui Chen","submitted_at":"2021-11-22T13:04:19Z","abstract_excerpt":"Understanding the black-box representations in Deep Neural Networks (DNN) is an essential problem in deep learning. In this work, we propose Graph-Based Similarity (GBS) to measure the similarity of layer features. Contrary to previous works that compute the similarity directly on the feature maps, GBS measures the correlation based on the graph constructed with hidden layer outputs. By treating each input sample as a node and the corresponding layer output similarity as edges, we construct the graph of DNN representations for each layer. The similarity between graphs of layers identifies the "},"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":"2111.11165","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-11-22T13:04:19Z","cross_cats_sorted":[],"title_canon_sha256":"6a6f27dedd7ad03909ec808c982aee35ca14d4888afb8fe33bb40f7b44aa30c8","abstract_canon_sha256":"d600455dd434dcf911e7b4181cd7b4125b6b70cee0c94bdae124acfedeb3b760"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:26:21.036365Z","signature_b64":"LEOm/wVnMXmOHYaHlJBBHNyI4dbAAwvCECdeymvru6ZY+oGHpvn3PMWZGVcdmJpHQmFD+Q0XoNssRwJh8aGZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0db9ad42f64e146c4f4c3bf00fa255090febee0bcede918f59e74989e853052f","last_reissued_at":"2026-07-05T04:26:21.035933Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:26:21.035933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph-Based Similarity of Neural Network Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jinxuan Hu, Qi Xuan, Wen Yang, Xiaoniu Yang, Yao Lu, Zhen Wang, Zuohui Chen","submitted_at":"2021-11-22T13:04:19Z","abstract_excerpt":"Understanding the black-box representations in Deep Neural Networks (DNN) is an essential problem in deep learning. In this work, we propose Graph-Based Similarity (GBS) to measure the similarity of layer features. Contrary to previous works that compute the similarity directly on the feature maps, GBS measures the correlation based on the graph constructed with hidden layer outputs. By treating each input sample as a node and the corresponding layer output similarity as edges, we construct the graph of DNN representations for each layer. The similarity between graphs of layers identifies the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.11165","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/2111.11165/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":"2111.11165","created_at":"2026-07-05T04:26:21.035986+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.11165v2","created_at":"2026-07-05T04:26:21.035986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.11165","created_at":"2026-07-05T04:26:21.035986+00:00"},{"alias_kind":"pith_short_12","alias_value":"BW422QXWJYKG","created_at":"2026-07-05T04:26:21.035986+00:00"},{"alias_kind":"pith_short_16","alias_value":"BW422QXWJYKGYT2M","created_at":"2026-07-05T04:26:21.035986+00:00"},{"alias_kind":"pith_short_8","alias_value":"BW422QXW","created_at":"2026-07-05T04:26:21.035986+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.01161","citing_title":"Multi-Modal Machine Learning Framework for Predicting Early Recurrence of Brain Tumors Using MRI and Clinical Biomarkers","ref_index":58,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BW422QXWJYKGYT2MHPYA7ISVBE","json":"https://pith.science/pith/BW422QXWJYKGYT2MHPYA7ISVBE.json","graph_json":"https://pith.science/api/pith-number/BW422QXWJYKGYT2MHPYA7ISVBE/graph.json","events_json":"https://pith.science/api/pith-number/BW422QXWJYKGYT2MHPYA7ISVBE/events.json","paper":"https://pith.science/paper/BW422QXW"},"agent_actions":{"view_html":"https://pith.science/pith/BW422QXWJYKGYT2MHPYA7ISVBE","download_json":"https://pith.science/pith/BW422QXWJYKGYT2MHPYA7ISVBE.json","view_paper":"https://pith.science/paper/BW422QXW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.11165&json=true","fetch_graph":"https://pith.science/api/pith-number/BW422QXWJYKGYT2MHPYA7ISVBE/graph.json","fetch_events":"https://pith.science/api/pith-number/BW422QXWJYKGYT2MHPYA7ISVBE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BW422QXWJYKGYT2MHPYA7ISVBE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BW422QXWJYKGYT2MHPYA7ISVBE/action/storage_attestation","attest_author":"https://pith.science/pith/BW422QXWJYKGYT2MHPYA7ISVBE/action/author_attestation","sign_citation":"https://pith.science/pith/BW422QXWJYKGYT2MHPYA7ISVBE/action/citation_signature","submit_replication":"https://pith.science/pith/BW422QXWJYKGYT2MHPYA7ISVBE/action/replication_record"}},"created_at":"2026-07-05T04:26:21.035986+00:00","updated_at":"2026-07-05T04:26:21.035986+00:00"}