{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CJDOAQRFDGDRWJFGIAKQ5UIEII","short_pith_number":"pith:CJDOAQRF","canonical_record":{"source":{"id":"1703.10511","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-03-30T15:08:06Z","cross_cats_sorted":[],"title_canon_sha256":"e40c186d8ca5ea9c11610d28d8981c20376f2f6c345c008cabb49e9b6fb6d2fa","abstract_canon_sha256":"e4b73ae72ad40d832e36dc66149014021a7990990d50b2794bbb640ef41116e6"},"schema_version":"1.0"},"canonical_sha256":"1246e0422519871b24a640150ed10442027f1df158c64e5fc55f9bab6d2c9f3f","source":{"kind":"arxiv","id":"1703.10511","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.10511","created_at":"2026-05-18T00:47:34Z"},{"alias_kind":"arxiv_version","alias_value":"1703.10511v1","created_at":"2026-05-18T00:47:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10511","created_at":"2026-05-18T00:47:34Z"},{"alias_kind":"pith_short_12","alias_value":"CJDOAQRFDGDR","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CJDOAQRFDGDRWJFG","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CJDOAQRF","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CJDOAQRFDGDRWJFGIAKQ5UIEII","target":"record","payload":{"canonical_record":{"source":{"id":"1703.10511","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-03-30T15:08:06Z","cross_cats_sorted":[],"title_canon_sha256":"e40c186d8ca5ea9c11610d28d8981c20376f2f6c345c008cabb49e9b6fb6d2fa","abstract_canon_sha256":"e4b73ae72ad40d832e36dc66149014021a7990990d50b2794bbb640ef41116e6"},"schema_version":"1.0"},"canonical_sha256":"1246e0422519871b24a640150ed10442027f1df158c64e5fc55f9bab6d2c9f3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:34.513734Z","signature_b64":"l0ew7+rSM5b02xLCYsHH+lO3rigyQ7ADrsVQMFThLqYK9mWG/rjWdzCm7VLRex4cKh0y2PKrstPTFFoVhNUmDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1246e0422519871b24a640150ed10442027f1df158c64e5fc55f9bab6d2c9f3f","last_reissued_at":"2026-05-18T00:47:34.513093Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:34.513093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.10511","source_version":1,"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-05-18T00:47:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2P5CMdiqCrD13OOfThQ7j+f/+7S79Hb35HvAa51+d7CJt1lmotP8IAFJZzslnVZfCqKB4iSj/xlwLUaY9GoTBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T21:00:13.299216Z"},"content_sha256":"dcfa707cd132087ec28bf593fde06db95c1d70bf94cce3ff2d680deea15aa40f","schema_version":"1.0","event_id":"sha256:dcfa707cd132087ec28bf593fde06db95c1d70bf94cce3ff2d680deea15aa40f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CJDOAQRFDGDRWJFGIAKQ5UIEII","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multimodal Network Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"David F. Gleich, Huda Nassar","submitted_at":"2017-03-30T15:08:06Z","abstract_excerpt":"A multimodal network encodes relationships between the same set of nodes in multiple settings, and network alignment is a powerful tool for transferring information and insight between a pair of networks. We propose a method for multimodal network alignment that computes a matrix which indicates the alignment, but produces the result as a low-rank factorization directly. We then propose new methods to compute approximate maximum weight matchings of low-rank matrices to produce an alignment. We evaluate our approach by applying it on synthetic networks and use it to de-anonymize a multimodal tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10511","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":""},"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-05-18T00:47:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u2TzlIlE5fA16Xqp2cXO58Ke9A7LkTu33gvT2AgUiFHJzkXjrH6rwXOOo5mhiNAjoEYcxTu/bbSshjip20SBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T21:00:13.299567Z"},"content_sha256":"45602c2a10df18657f45c7f3514d6fcf7a03712503483aaeaff03228940691d9","schema_version":"1.0","event_id":"sha256:45602c2a10df18657f45c7f3514d6fcf7a03712503483aaeaff03228940691d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CJDOAQRFDGDRWJFGIAKQ5UIEII/bundle.json","state_url":"https://pith.science/pith/CJDOAQRFDGDRWJFGIAKQ5UIEII/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CJDOAQRFDGDRWJFGIAKQ5UIEII/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-04T21:00:13Z","links":{"resolver":"https://pith.science/pith/CJDOAQRFDGDRWJFGIAKQ5UIEII","bundle":"https://pith.science/pith/CJDOAQRFDGDRWJFGIAKQ5UIEII/bundle.json","state":"https://pith.science/pith/CJDOAQRFDGDRWJFGIAKQ5UIEII/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CJDOAQRFDGDRWJFGIAKQ5UIEII/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CJDOAQRFDGDRWJFGIAKQ5UIEII","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":"e4b73ae72ad40d832e36dc66149014021a7990990d50b2794bbb640ef41116e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-03-30T15:08:06Z","title_canon_sha256":"e40c186d8ca5ea9c11610d28d8981c20376f2f6c345c008cabb49e9b6fb6d2fa"},"schema_version":"1.0","source":{"id":"1703.10511","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.10511","created_at":"2026-05-18T00:47:34Z"},{"alias_kind":"arxiv_version","alias_value":"1703.10511v1","created_at":"2026-05-18T00:47:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10511","created_at":"2026-05-18T00:47:34Z"},{"alias_kind":"pith_short_12","alias_value":"CJDOAQRFDGDR","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CJDOAQRFDGDRWJFG","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CJDOAQRF","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:45602c2a10df18657f45c7f3514d6fcf7a03712503483aaeaff03228940691d9","target":"graph","created_at":"2026-05-18T00:47:34Z","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"},"paper":{"abstract_excerpt":"A multimodal network encodes relationships between the same set of nodes in multiple settings, and network alignment is a powerful tool for transferring information and insight between a pair of networks. We propose a method for multimodal network alignment that computes a matrix which indicates the alignment, but produces the result as a low-rank factorization directly. We then propose new methods to compute approximate maximum weight matchings of low-rank matrices to produce an alignment. We evaluate our approach by applying it on synthetic networks and use it to de-anonymize a multimodal tr","authors_text":"David F. Gleich, Huda Nassar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-03-30T15:08:06Z","title":"Multimodal Network Alignment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.10511","kind":"arxiv","version":1},"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:dcfa707cd132087ec28bf593fde06db95c1d70bf94cce3ff2d680deea15aa40f","target":"record","created_at":"2026-05-18T00:47:34Z","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":"e4b73ae72ad40d832e36dc66149014021a7990990d50b2794bbb640ef41116e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-03-30T15:08:06Z","title_canon_sha256":"e40c186d8ca5ea9c11610d28d8981c20376f2f6c345c008cabb49e9b6fb6d2fa"},"schema_version":"1.0","source":{"id":"1703.10511","kind":"arxiv","version":1}},"canonical_sha256":"1246e0422519871b24a640150ed10442027f1df158c64e5fc55f9bab6d2c9f3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1246e0422519871b24a640150ed10442027f1df158c64e5fc55f9bab6d2c9f3f","first_computed_at":"2026-05-18T00:47:34.513093Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:34.513093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l0ew7+rSM5b02xLCYsHH+lO3rigyQ7ADrsVQMFThLqYK9mWG/rjWdzCm7VLRex4cKh0y2PKrstPTFFoVhNUmDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:34.513734Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.10511","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dcfa707cd132087ec28bf593fde06db95c1d70bf94cce3ff2d680deea15aa40f","sha256:45602c2a10df18657f45c7f3514d6fcf7a03712503483aaeaff03228940691d9"],"state_sha256":"d20d1dc96d7de25dc4f003661e4d47c6998c0611be9a059f4bb723643270a582"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4tPPA15NAveU8+Sw1dQD0z3EJb9Q+Bwst5m6OUGYyF/GkT/KadHof39HWBYQUdgXUj5WzLs3wTfDLgcgzyy+Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T21:00:13.301626Z","bundle_sha256":"611190fb4462230a1fc97d636e3769ba13403df34a5f566dd5fcd9724151cb25"}}