{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CJ2JU4HORKW3S5VZJBHJ75XSKJ","short_pith_number":"pith:CJ2JU4HO","schema_version":"1.0","canonical_sha256":"12749a70ee8aadb976b9484e9ff6f25256524f8c4439ae4590a4e9abe2a77526","source":{"kind":"arxiv","id":"1809.08198","version":1},"attestation_state":"computed","paper":{"title":"Low rank methods for multiple network alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Ananth Grama, David F. Gleich, Georgios Kollias, Huda Nassar","submitted_at":"2018-09-21T16:38:36Z","abstract_excerpt":"Multiple network alignment is the problem of identifying similar and related regions in a given set of networks. While there are a large number of effective techniques for pairwise problems with two networks that scale in terms of edges, these cannot be readily extended to align multiple networks as the computational complexity will tend to grow exponentially with the number of networks.In this paper we introduce a new multiple network alignment algorithm and framework that is effective at aligning thousands of networks with thousands of nodes. The key enabling technique of our algorithm is id"},"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":"1809.08198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-09-21T16:38:36Z","cross_cats_sorted":["cs.LG","physics.soc-ph"],"title_canon_sha256":"51c27ff5b7c20b38b29cfba13ace0d7ac2d6c9c24f66169994db6a4ecc2b8fc1","abstract_canon_sha256":"62636e8c5f22b52e366f472821b038f01dae4d7660093690d866fce0db8652ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:10.136111Z","signature_b64":"VKDGhPVt4UzbQyyuGP0WpGz++in1Fwmp2Gpe3ajNSjAZFhuPlYc/XOfexM8Hn0zB8/5BAsQuT/u3RiTW0fMVCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12749a70ee8aadb976b9484e9ff6f25256524f8c4439ae4590a4e9abe2a77526","last_reissued_at":"2026-05-18T00:05:10.135422Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:10.135422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low rank methods for multiple network alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Ananth Grama, David F. Gleich, Georgios Kollias, Huda Nassar","submitted_at":"2018-09-21T16:38:36Z","abstract_excerpt":"Multiple network alignment is the problem of identifying similar and related regions in a given set of networks. While there are a large number of effective techniques for pairwise problems with two networks that scale in terms of edges, these cannot be readily extended to align multiple networks as the computational complexity will tend to grow exponentially with the number of networks.In this paper we introduce a new multiple network alignment algorithm and framework that is effective at aligning thousands of networks with thousands of nodes. The key enabling technique of our algorithm is id"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.08198","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":"1809.08198","created_at":"2026-05-18T00:05:10.135540+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.08198v1","created_at":"2026-05-18T00:05:10.135540+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.08198","created_at":"2026-05-18T00:05:10.135540+00:00"},{"alias_kind":"pith_short_12","alias_value":"CJ2JU4HORKW3","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"CJ2JU4HORKW3S5VZ","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"CJ2JU4HO","created_at":"2026-05-18T12:32:16.446611+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/CJ2JU4HORKW3S5VZJBHJ75XSKJ","json":"https://pith.science/pith/CJ2JU4HORKW3S5VZJBHJ75XSKJ.json","graph_json":"https://pith.science/api/pith-number/CJ2JU4HORKW3S5VZJBHJ75XSKJ/graph.json","events_json":"https://pith.science/api/pith-number/CJ2JU4HORKW3S5VZJBHJ75XSKJ/events.json","paper":"https://pith.science/paper/CJ2JU4HO"},"agent_actions":{"view_html":"https://pith.science/pith/CJ2JU4HORKW3S5VZJBHJ75XSKJ","download_json":"https://pith.science/pith/CJ2JU4HORKW3S5VZJBHJ75XSKJ.json","view_paper":"https://pith.science/paper/CJ2JU4HO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.08198&json=true","fetch_graph":"https://pith.science/api/pith-number/CJ2JU4HORKW3S5VZJBHJ75XSKJ/graph.json","fetch_events":"https://pith.science/api/pith-number/CJ2JU4HORKW3S5VZJBHJ75XSKJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CJ2JU4HORKW3S5VZJBHJ75XSKJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CJ2JU4HORKW3S5VZJBHJ75XSKJ/action/storage_attestation","attest_author":"https://pith.science/pith/CJ2JU4HORKW3S5VZJBHJ75XSKJ/action/author_attestation","sign_citation":"https://pith.science/pith/CJ2JU4HORKW3S5VZJBHJ75XSKJ/action/citation_signature","submit_replication":"https://pith.science/pith/CJ2JU4HORKW3S5VZJBHJ75XSKJ/action/replication_record"}},"created_at":"2026-05-18T00:05:10.135540+00:00","updated_at":"2026-05-18T00:05:10.135540+00:00"}