{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:EFHBPCQMMNHFDG6QA67N4TRUGS","short_pith_number":"pith:EFHBPCQM","schema_version":"1.0","canonical_sha256":"214e178a0c634e519bd007bede4e3434b5241672678c25b9bfcc9aee1f04f0a5","source":{"kind":"arxiv","id":"2110.14633","version":1},"attestation_state":"computed","paper":{"title":"Similarity and Matching of Neural Network Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Adri\\'an Csisz\\'arik, \\'Akos K. Matszangosz, D\\'aniel Varga, Gergely Papp, P\\'eter K\\H{o}r\\\"osi-Szab\\'o","submitted_at":"2021-10-27T17:59:46Z","abstract_excerpt":"We employ a toolset -- dubbed Dr. Frankenstein -- to analyse the similarity of representations in deep neural networks. With this toolset, we aim to match the activations on given layers of two trained neural networks by joining them with a stitching layer. We demonstrate that the inner representations emerging in deep convolutional neural networks with the same architecture but different initializations can be matched with a surprisingly high degree of accuracy even with a single, affine stitching layer. We choose the stitching layer from several possible classes of linear transformations and"},"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":"2110.14633","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-10-27T17:59:46Z","cross_cats_sorted":[],"title_canon_sha256":"54a82fdb9a13a19195ec7d243eda793748967112b0eae5dca1d0e6579cf795aa","abstract_canon_sha256":"deb4787ad6a4327a4d0372a0522e294b6d0cd05b95eedf97cc4621b0e13ee4b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:26:35.322242Z","signature_b64":"WXZnIXxqRwiZFejnbwhs+qaUuDp2pbMnxbmz09282XEnr3CIFvRNANnqOFrcv4rbM8Iw0vKi7Ky/61De6U4vAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"214e178a0c634e519bd007bede4e3434b5241672678c25b9bfcc9aee1f04f0a5","last_reissued_at":"2026-07-05T03:26:35.321711Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:26:35.321711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Similarity and Matching of Neural Network Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Adri\\'an Csisz\\'arik, \\'Akos K. Matszangosz, D\\'aniel Varga, Gergely Papp, P\\'eter K\\H{o}r\\\"osi-Szab\\'o","submitted_at":"2021-10-27T17:59:46Z","abstract_excerpt":"We employ a toolset -- dubbed Dr. Frankenstein -- to analyse the similarity of representations in deep neural networks. With this toolset, we aim to match the activations on given layers of two trained neural networks by joining them with a stitching layer. We demonstrate that the inner representations emerging in deep convolutional neural networks with the same architecture but different initializations can be matched with a surprisingly high degree of accuracy even with a single, affine stitching layer. We choose the stitching layer from several possible classes of linear transformations and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.14633","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/2110.14633/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":"2110.14633","created_at":"2026-07-05T03:26:35.321793+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.14633v1","created_at":"2026-07-05T03:26:35.321793+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.14633","created_at":"2026-07-05T03:26:35.321793+00:00"},{"alias_kind":"pith_short_12","alias_value":"EFHBPCQMMNHF","created_at":"2026-07-05T03:26:35.321793+00:00"},{"alias_kind":"pith_short_16","alias_value":"EFHBPCQMMNHFDG6Q","created_at":"2026-07-05T03:26:35.321793+00:00"},{"alias_kind":"pith_short_8","alias_value":"EFHBPCQM","created_at":"2026-07-05T03:26:35.321793+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.08474","citing_title":"Robust Learning Meets Quasar-Convex Optimization: Inexact High-Order Proximal-Point Methods","ref_index":52,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EFHBPCQMMNHFDG6QA67N4TRUGS","json":"https://pith.science/pith/EFHBPCQMMNHFDG6QA67N4TRUGS.json","graph_json":"https://pith.science/api/pith-number/EFHBPCQMMNHFDG6QA67N4TRUGS/graph.json","events_json":"https://pith.science/api/pith-number/EFHBPCQMMNHFDG6QA67N4TRUGS/events.json","paper":"https://pith.science/paper/EFHBPCQM"},"agent_actions":{"view_html":"https://pith.science/pith/EFHBPCQMMNHFDG6QA67N4TRUGS","download_json":"https://pith.science/pith/EFHBPCQMMNHFDG6QA67N4TRUGS.json","view_paper":"https://pith.science/paper/EFHBPCQM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.14633&json=true","fetch_graph":"https://pith.science/api/pith-number/EFHBPCQMMNHFDG6QA67N4TRUGS/graph.json","fetch_events":"https://pith.science/api/pith-number/EFHBPCQMMNHFDG6QA67N4TRUGS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EFHBPCQMMNHFDG6QA67N4TRUGS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EFHBPCQMMNHFDG6QA67N4TRUGS/action/storage_attestation","attest_author":"https://pith.science/pith/EFHBPCQMMNHFDG6QA67N4TRUGS/action/author_attestation","sign_citation":"https://pith.science/pith/EFHBPCQMMNHFDG6QA67N4TRUGS/action/citation_signature","submit_replication":"https://pith.science/pith/EFHBPCQMMNHFDG6QA67N4TRUGS/action/replication_record"}},"created_at":"2026-07-05T03:26:35.321793+00:00","updated_at":"2026-07-05T03:26:35.321793+00:00"}