{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:3C2X3HJWBGLTKDW43XDVOG5Q2I","short_pith_number":"pith:3C2X3HJW","canonical_record":{"source":{"id":"2310.04470","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-06T02:35:35Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ede9a64ffdade31c7b8774dde16403162634242ac382e3e82ec2dc77df8a5537","abstract_canon_sha256":"f8bfa5251c1f624e349bb54f5ef99438058d4dc3bf4823330d2518916490e34c"},"schema_version":"1.0"},"canonical_sha256":"d8b57d9d360997350edcddc7571bb0d228e02b37262dfad48efb4916907af02d","source":{"kind":"arxiv","id":"2310.04470","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.04470","created_at":"2026-07-05T07:43:33Z"},{"alias_kind":"arxiv_version","alias_value":"2310.04470v2","created_at":"2026-07-05T07:43:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.04470","created_at":"2026-07-05T07:43:33Z"},{"alias_kind":"pith_short_12","alias_value":"3C2X3HJWBGLT","created_at":"2026-07-05T07:43:33Z"},{"alias_kind":"pith_short_16","alias_value":"3C2X3HJWBGLTKDW4","created_at":"2026-07-05T07:43:33Z"},{"alias_kind":"pith_short_8","alias_value":"3C2X3HJW","created_at":"2026-07-05T07:43:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:3C2X3HJWBGLTKDW43XDVOG5Q2I","target":"record","payload":{"canonical_record":{"source":{"id":"2310.04470","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-06T02:35:35Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ede9a64ffdade31c7b8774dde16403162634242ac382e3e82ec2dc77df8a5537","abstract_canon_sha256":"f8bfa5251c1f624e349bb54f5ef99438058d4dc3bf4823330d2518916490e34c"},"schema_version":"1.0"},"canonical_sha256":"d8b57d9d360997350edcddc7571bb0d228e02b37262dfad48efb4916907af02d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:43:33.421406Z","signature_b64":"UGaa34X3Kgz/Arma5aarmtiCaCJWjOrWu1dxv2DY2PDF8DMHSwY6jKYVBY12ohVcaxnI4IY2G7mUu64LYMEbAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8b57d9d360997350edcddc7571bb0d228e02b37262dfad48efb4916907af02d","last_reissued_at":"2026-07-05T07:43:33.420883Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:43:33.420883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2310.04470","source_version":2,"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-05T07:43:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EvBHPORBQ2PVcAEVgtiBNJgOpLb/6Bt+8+yu25LrpJto5mh9zElvedqOOfcDEfdahSMrNKJxvIpE57WEcOOABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-21T03:31:30.760295Z"},"content_sha256":"a12ac1b2ca192d90b0ce250763c97d61bd75808149873569349131f460d47519","schema_version":"1.0","event_id":"sha256:a12ac1b2ca192d90b0ce250763c97d61bd75808149873569349131f460d47519"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:3C2X3HJWBGLTKDW43XDVOG5Q2I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hierarchical Multi-Marginal Optimal Transport for Network Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Boxin Du, Hanghang Tong, Si Zhang, Yinglong Xia, Zhichen Zeng, Zhining Liu","submitted_at":"2023-10-06T02:35:35Z","abstract_excerpt":"Finding node correspondence across networks, namely multi-network alignment, is an essential prerequisite for joint learning on multiple networks. Despite great success in aligning networks in pairs, the literature on multi-network alignment is sparse due to the exponentially growing solution space and lack of high-order discrepancy measures. To fill this gap, we propose a hierarchical multi-marginal optimal transport framework named HOT for multi-network alignment. To handle the large solution space, multiple networks are decomposed into smaller aligned clusters via the fused Gromov-Wasserste"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.04470","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/2310.04470/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-05T07:43:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vYjF5IwbYaR+rXj/SGXLqDqg1vyzP0COaRg2wcfGi9a48S0oYcdzH88dVwEKzoBPvEqPhR7yy3TxHSRxNh/6AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-21T03:31:30.760679Z"},"content_sha256":"681a5869eaa2e788ceed4a23f76a214759e481c9736573eed83feab237fab5b5","schema_version":"1.0","event_id":"sha256:681a5869eaa2e788ceed4a23f76a214759e481c9736573eed83feab237fab5b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3C2X3HJWBGLTKDW43XDVOG5Q2I/bundle.json","state_url":"https://pith.science/pith/3C2X3HJWBGLTKDW43XDVOG5Q2I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3C2X3HJWBGLTKDW43XDVOG5Q2I/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-07-21T03:31:30Z","links":{"resolver":"https://pith.science/pith/3C2X3HJWBGLTKDW43XDVOG5Q2I","bundle":"https://pith.science/pith/3C2X3HJWBGLTKDW43XDVOG5Q2I/bundle.json","state":"https://pith.science/pith/3C2X3HJWBGLTKDW43XDVOG5Q2I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3C2X3HJWBGLTKDW43XDVOG5Q2I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:3C2X3HJWBGLTKDW43XDVOG5Q2I","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":"f8bfa5251c1f624e349bb54f5ef99438058d4dc3bf4823330d2518916490e34c","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-06T02:35:35Z","title_canon_sha256":"ede9a64ffdade31c7b8774dde16403162634242ac382e3e82ec2dc77df8a5537"},"schema_version":"1.0","source":{"id":"2310.04470","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.04470","created_at":"2026-07-05T07:43:33Z"},{"alias_kind":"arxiv_version","alias_value":"2310.04470v2","created_at":"2026-07-05T07:43:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.04470","created_at":"2026-07-05T07:43:33Z"},{"alias_kind":"pith_short_12","alias_value":"3C2X3HJWBGLT","created_at":"2026-07-05T07:43:33Z"},{"alias_kind":"pith_short_16","alias_value":"3C2X3HJWBGLTKDW4","created_at":"2026-07-05T07:43:33Z"},{"alias_kind":"pith_short_8","alias_value":"3C2X3HJW","created_at":"2026-07-05T07:43:33Z"}],"graph_snapshots":[{"event_id":"sha256:681a5869eaa2e788ceed4a23f76a214759e481c9736573eed83feab237fab5b5","target":"graph","created_at":"2026-07-05T07:43:33Z","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.04470/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Finding node correspondence across networks, namely multi-network alignment, is an essential prerequisite for joint learning on multiple networks. Despite great success in aligning networks in pairs, the literature on multi-network alignment is sparse due to the exponentially growing solution space and lack of high-order discrepancy measures. To fill this gap, we propose a hierarchical multi-marginal optimal transport framework named HOT for multi-network alignment. To handle the large solution space, multiple networks are decomposed into smaller aligned clusters via the fused Gromov-Wasserste","authors_text":"Boxin Du, Hanghang Tong, Si Zhang, Yinglong Xia, Zhichen Zeng, Zhining Liu","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-06T02:35:35Z","title":"Hierarchical Multi-Marginal Optimal Transport for Network Alignment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.04470","kind":"arxiv","version":2},"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:a12ac1b2ca192d90b0ce250763c97d61bd75808149873569349131f460d47519","target":"record","created_at":"2026-07-05T07:43:33Z","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":"f8bfa5251c1f624e349bb54f5ef99438058d4dc3bf4823330d2518916490e34c","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-06T02:35:35Z","title_canon_sha256":"ede9a64ffdade31c7b8774dde16403162634242ac382e3e82ec2dc77df8a5537"},"schema_version":"1.0","source":{"id":"2310.04470","kind":"arxiv","version":2}},"canonical_sha256":"d8b57d9d360997350edcddc7571bb0d228e02b37262dfad48efb4916907af02d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8b57d9d360997350edcddc7571bb0d228e02b37262dfad48efb4916907af02d","first_computed_at":"2026-07-05T07:43:33.420883Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:43:33.420883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UGaa34X3Kgz/Arma5aarmtiCaCJWjOrWu1dxv2DY2PDF8DMHSwY6jKYVBY12ohVcaxnI4IY2G7mUu64LYMEbAg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:43:33.421406Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.04470","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a12ac1b2ca192d90b0ce250763c97d61bd75808149873569349131f460d47519","sha256:681a5869eaa2e788ceed4a23f76a214759e481c9736573eed83feab237fab5b5"],"state_sha256":"98c2d3049e12e9dbf02359c535419964d6b03d59c9efe7ee18e2c90b8ef3ef91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fHsIIhQRzp1f/Ax6XoBGYyIB039eRzSk7rv/6cUaQYsmDyIrWyK1ioNgeWMr8rGaymXNYsL7J5bpksYQyxz2DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-21T03:31:30.763134Z","bundle_sha256":"d6a70c06e3d18a8137a05dc01420f7f709182e1a3eec0c96dfd33f9891e2142c"}}