{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CJDOAQRFDGDRWJFGIAKQ5UIEII","short_pith_number":"pith:CJDOAQRF","schema_version":"1.0","canonical_sha256":"1246e0422519871b24a640150ed10442027f1df158c64e5fc55f9bab6d2c9f3f","source":{"kind":"arxiv","id":"1703.10511","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.10511","created_at":"2026-05-18T00:47:34.513165+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.10511v1","created_at":"2026-05-18T00:47:34.513165+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.10511","created_at":"2026-05-18T00:47:34.513165+00:00"},{"alias_kind":"pith_short_12","alias_value":"CJDOAQRFDGDR","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CJDOAQRFDGDRWJFG","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CJDOAQRF","created_at":"2026-05-18T12:31:10.602751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CJDOAQRFDGDRWJFGIAKQ5UIEII","json":"https://pith.science/pith/CJDOAQRFDGDRWJFGIAKQ5UIEII.json","graph_json":"https://pith.science/api/pith-number/CJDOAQRFDGDRWJFGIAKQ5UIEII/graph.json","events_json":"https://pith.science/api/pith-number/CJDOAQRFDGDRWJFGIAKQ5UIEII/events.json","paper":"https://pith.science/paper/CJDOAQRF"},"agent_actions":{"view_html":"https://pith.science/pith/CJDOAQRFDGDRWJFGIAKQ5UIEII","download_json":"https://pith.science/pith/CJDOAQRFDGDRWJFGIAKQ5UIEII.json","view_paper":"https://pith.science/paper/CJDOAQRF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.10511&json=true","fetch_graph":"https://pith.science/api/pith-number/CJDOAQRFDGDRWJFGIAKQ5UIEII/graph.json","fetch_events":"https://pith.science/api/pith-number/CJDOAQRFDGDRWJFGIAKQ5UIEII/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CJDOAQRFDGDRWJFGIAKQ5UIEII/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CJDOAQRFDGDRWJFGIAKQ5UIEII/action/storage_attestation","attest_author":"https://pith.science/pith/CJDOAQRFDGDRWJFGIAKQ5UIEII/action/author_attestation","sign_citation":"https://pith.science/pith/CJDOAQRFDGDRWJFGIAKQ5UIEII/action/citation_signature","submit_replication":"https://pith.science/pith/CJDOAQRFDGDRWJFGIAKQ5UIEII/action/replication_record"}},"created_at":"2026-05-18T00:47:34.513165+00:00","updated_at":"2026-05-18T00:47:34.513165+00:00"}