{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:INDVL6OHBEGMZK55PH3OQGOV2N","short_pith_number":"pith:INDVL6OH","canonical_record":{"source":{"id":"2310.13397","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-10-20T10:12:06Z","cross_cats_sorted":[],"title_canon_sha256":"dd866ee93da6b99033977418a1b8fa1760edd059b606b5f7dbea4b6aa9d88334","abstract_canon_sha256":"c9452cc31578017b78a07f1c8ea2b6b3d7a278472b7cb15ae6e05e72803c2702"},"schema_version":"1.0"},"canonical_sha256":"434755f9c7090cccabbd79f6e819d5d37d7cd1ed0d01c2a5f138a057ac706d2b","source":{"kind":"arxiv","id":"2310.13397","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.13397","created_at":"2026-07-05T09:33:26Z"},{"alias_kind":"arxiv_version","alias_value":"2310.13397v4","created_at":"2026-07-05T09:33:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.13397","created_at":"2026-07-05T09:33:26Z"},{"alias_kind":"pith_short_12","alias_value":"INDVL6OHBEGM","created_at":"2026-07-05T09:33:26Z"},{"alias_kind":"pith_short_16","alias_value":"INDVL6OHBEGMZK55","created_at":"2026-07-05T09:33:26Z"},{"alias_kind":"pith_short_8","alias_value":"INDVL6OH","created_at":"2026-07-05T09:33:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:INDVL6OHBEGMZK55PH3OQGOV2N","target":"record","payload":{"canonical_record":{"source":{"id":"2310.13397","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-10-20T10:12:06Z","cross_cats_sorted":[],"title_canon_sha256":"dd866ee93da6b99033977418a1b8fa1760edd059b606b5f7dbea4b6aa9d88334","abstract_canon_sha256":"c9452cc31578017b78a07f1c8ea2b6b3d7a278472b7cb15ae6e05e72803c2702"},"schema_version":"1.0"},"canonical_sha256":"434755f9c7090cccabbd79f6e819d5d37d7cd1ed0d01c2a5f138a057ac706d2b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:33:26.390736Z","signature_b64":"yceBvLNhImQtCygVNs6ZvO8QbAcZjlGuQ1B6zXfuLUMy/dfDViYTbnVPxLO26VaTEf6oHEUepuR/Ax09tX2LAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"434755f9c7090cccabbd79f6e819d5d37d7cd1ed0d01c2a5f138a057ac706d2b","last_reissued_at":"2026-07-05T09:33:26.390245Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:33:26.390245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2310.13397","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:33:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VHdm96mVGobomqqhu+i8fSTmh+ulhqm1E5mIc0Rl3/A0l12c1iCRUKzKlsIWmduRujA0HxwEp1jHUJtb4NvHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T08:05:33.617382Z"},"content_sha256":"a5df045f886d8dbbec28fad83af2781f4a50d67e4dc3644d01cd46616826ee6d","schema_version":"1.0","event_id":"sha256:a5df045f886d8dbbec28fad83af2781f4a50d67e4dc3644d01cd46616826ee6d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:INDVL6OHBEGMZK55PH3OQGOV2N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Equivariant Deep Weight Space Alignment","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aviv Navon, Aviv Shamsian, Ethan Fetaya, Gal Chechik, Haggai Maron, Nadav Dym","submitted_at":"2023-10-20T10:12:06Z","abstract_excerpt":"Permutation symmetries of deep networks make basic operations like model merging and similarity estimation challenging. In many cases, aligning the weights of the networks, i.e., finding optimal permutations between their weights, is necessary. Unfortunately, weight alignment is an NP-hard problem. Prior research has mainly focused on solving relaxed versions of the alignment problem, leading to either time-consuming methods or sub-optimal solutions. To accelerate the alignment process and improve its quality, we propose a novel framework aimed at learning to solve the weight alignment problem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.13397","kind":"arxiv","version":4},"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/2310.13397/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:33:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oe6ay6dtzEu5aImGKJRHe3LORTwx2BO2Sc5/adQg9rQtevnYH+l0Pq5ACewcVLjwlDl+z3Ay/pLuawUc109CDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T08:05:33.618041Z"},"content_sha256":"df3459c652a2b8e00d2904f4851df5da19fe410112eabd7b30cf8e45e6c8c145","schema_version":"1.0","event_id":"sha256:df3459c652a2b8e00d2904f4851df5da19fe410112eabd7b30cf8e45e6c8c145"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/INDVL6OHBEGMZK55PH3OQGOV2N/bundle.json","state_url":"https://pith.science/pith/INDVL6OHBEGMZK55PH3OQGOV2N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/INDVL6OHBEGMZK55PH3OQGOV2N/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-01T08:05:33Z","links":{"resolver":"https://pith.science/pith/INDVL6OHBEGMZK55PH3OQGOV2N","bundle":"https://pith.science/pith/INDVL6OHBEGMZK55PH3OQGOV2N/bundle.json","state":"https://pith.science/pith/INDVL6OHBEGMZK55PH3OQGOV2N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/INDVL6OHBEGMZK55PH3OQGOV2N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:INDVL6OHBEGMZK55PH3OQGOV2N","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c9452cc31578017b78a07f1c8ea2b6b3d7a278472b7cb15ae6e05e72803c2702","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-10-20T10:12:06Z","title_canon_sha256":"dd866ee93da6b99033977418a1b8fa1760edd059b606b5f7dbea4b6aa9d88334"},"schema_version":"1.0","source":{"id":"2310.13397","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.13397","created_at":"2026-07-05T09:33:26Z"},{"alias_kind":"arxiv_version","alias_value":"2310.13397v4","created_at":"2026-07-05T09:33:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.13397","created_at":"2026-07-05T09:33:26Z"},{"alias_kind":"pith_short_12","alias_value":"INDVL6OHBEGM","created_at":"2026-07-05T09:33:26Z"},{"alias_kind":"pith_short_16","alias_value":"INDVL6OHBEGMZK55","created_at":"2026-07-05T09:33:26Z"},{"alias_kind":"pith_short_8","alias_value":"INDVL6OH","created_at":"2026-07-05T09:33:26Z"}],"graph_snapshots":[{"event_id":"sha256:df3459c652a2b8e00d2904f4851df5da19fe410112eabd7b30cf8e45e6c8c145","target":"graph","created_at":"2026-07-05T09:33:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2310.13397/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Permutation symmetries of deep networks make basic operations like model merging and similarity estimation challenging. In many cases, aligning the weights of the networks, i.e., finding optimal permutations between their weights, is necessary. Unfortunately, weight alignment is an NP-hard problem. Prior research has mainly focused on solving relaxed versions of the alignment problem, leading to either time-consuming methods or sub-optimal solutions. To accelerate the alignment process and improve its quality, we propose a novel framework aimed at learning to solve the weight alignment problem","authors_text":"Aviv Navon, Aviv Shamsian, Ethan Fetaya, Gal Chechik, Haggai Maron, Nadav Dym","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-10-20T10:12:06Z","title":"Equivariant Deep Weight Space Alignment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.13397","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a5df045f886d8dbbec28fad83af2781f4a50d67e4dc3644d01cd46616826ee6d","target":"record","created_at":"2026-07-05T09:33:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c9452cc31578017b78a07f1c8ea2b6b3d7a278472b7cb15ae6e05e72803c2702","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-10-20T10:12:06Z","title_canon_sha256":"dd866ee93da6b99033977418a1b8fa1760edd059b606b5f7dbea4b6aa9d88334"},"schema_version":"1.0","source":{"id":"2310.13397","kind":"arxiv","version":4}},"canonical_sha256":"434755f9c7090cccabbd79f6e819d5d37d7cd1ed0d01c2a5f138a057ac706d2b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"434755f9c7090cccabbd79f6e819d5d37d7cd1ed0d01c2a5f138a057ac706d2b","first_computed_at":"2026-07-05T09:33:26.390245Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:33:26.390245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yceBvLNhImQtCygVNs6ZvO8QbAcZjlGuQ1B6zXfuLUMy/dfDViYTbnVPxLO26VaTEf6oHEUepuR/Ax09tX2LAA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:33:26.390736Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.13397","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5df045f886d8dbbec28fad83af2781f4a50d67e4dc3644d01cd46616826ee6d","sha256:df3459c652a2b8e00d2904f4851df5da19fe410112eabd7b30cf8e45e6c8c145"],"state_sha256":"60d8c9cf2b43f21c18784ad9041b6ce9adf1d86d74665a4bd5e9bd9aff83d376"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xmTx9hcCz0NauaiKdfn0nKRgDh4uYSsbnTPM0WtcnHBpopuAgbzdCjNy4HDvfOHCc0nyysy0+P2c8T9NbV80DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T08:05:33.623376Z","bundle_sha256":"f47a8127198027b8543d48d0139c5889e21c361c10da07bc692938347ac692af"}}