{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KOPKTLMGK37J26YEQR7LFJEPHK","short_pith_number":"pith:KOPKTLMG","canonical_record":{"source":{"id":"1802.06257","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2018-02-17T16:20:36Z","cross_cats_sorted":[],"title_canon_sha256":"c137336c1363ffdb99067394571852b0d024a31e63f57bbd7329f64bfefcd9f1","abstract_canon_sha256":"06e3c80340926a8fc3af0cef69487b3a74748db7ba51f8b13f12205d13edc80f"},"schema_version":"1.0"},"canonical_sha256":"539ea9ad8656fe9d7b04847eb2a48f3aaaf89c7ebd4cf95d783b4598e4796878","source":{"kind":"arxiv","id":"1802.06257","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06257","created_at":"2026-05-18T00:07:17Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06257v3","created_at":"2026-05-18T00:07:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06257","created_at":"2026-05-18T00:07:17Z"},{"alias_kind":"pith_short_12","alias_value":"KOPKTLMGK37J","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KOPKTLMGK37J26YE","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KOPKTLMG","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KOPKTLMGK37J26YEQR7LFJEPHK","target":"record","payload":{"canonical_record":{"source":{"id":"1802.06257","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2018-02-17T16:20:36Z","cross_cats_sorted":[],"title_canon_sha256":"c137336c1363ffdb99067394571852b0d024a31e63f57bbd7329f64bfefcd9f1","abstract_canon_sha256":"06e3c80340926a8fc3af0cef69487b3a74748db7ba51f8b13f12205d13edc80f"},"schema_version":"1.0"},"canonical_sha256":"539ea9ad8656fe9d7b04847eb2a48f3aaaf89c7ebd4cf95d783b4598e4796878","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:17.975745Z","signature_b64":"5f6LZowesBbY9+4A3HBf+dsEbRoBReNYHA3PvKaNHGKX2Dokv5sNgVHOd6iGHYSm5EUXQnD72RoIICMat0wlCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"539ea9ad8656fe9d7b04847eb2a48f3aaaf89c7ebd4cf95d783b4598e4796878","last_reissued_at":"2026-05-18T00:07:17.975137Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:17.975137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.06257","source_version":3,"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:07:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rTZlQB/EPR3mrDBt7vO7zXFW6DEjR9j8Vw2TWBPoewCS/lMehwVdLquiK1yl+YKDv2FAjSHF55Nl2gdDN2MHAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:48:51.933959Z"},"content_sha256":"c10059ffbfabd49811099f4780c7628bd7cd5260b144efaed8b43968635b2844","schema_version":"1.0","event_id":"sha256:c10059ffbfabd49811099f4780c7628bd7cd5260b144efaed8b43968635b2844"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KOPKTLMGK37J26YEQR7LFJEPHK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"REGAL: Representation Learning-based Graph Alignment","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Danai Koutra, Haoming Shen, Mark Heimann, Tara Safavi","submitted_at":"2018-02-17T16:20:36Z","abstract_excerpt":"Problems involving multiple networks are prevalent in many scientific and other domains. In particular, network alignment, or the task of identifying corresponding nodes in different networks, has applications across the social and natural sciences. Motivated by recent advancements in node representation learning for single-graph tasks, we propose REGAL (REpresentation learning-based Graph ALignment), a framework that leverages the power of automatically-learned node representations to match nodes across different graphs. Within REGAL we devise xNetMF, an elegant and principled node embedding "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06257","kind":"arxiv","version":3},"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:07:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V+afdZV+0H+RrfOt/LSORovmpY59y8/8k696/xsupmOWjoMtoTEWC80elizuQmS8x8uxOQ/vNQyPGwOgvCzSCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:48:51.934296Z"},"content_sha256":"455ebd00ef0e5773075caa0dd5546a4001714a602dbc458df86b3cca650bd3c2","schema_version":"1.0","event_id":"sha256:455ebd00ef0e5773075caa0dd5546a4001714a602dbc458df86b3cca650bd3c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KOPKTLMGK37J26YEQR7LFJEPHK/bundle.json","state_url":"https://pith.science/pith/KOPKTLMGK37J26YEQR7LFJEPHK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KOPKTLMGK37J26YEQR7LFJEPHK/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-06-05T16:48:51Z","links":{"resolver":"https://pith.science/pith/KOPKTLMGK37J26YEQR7LFJEPHK","bundle":"https://pith.science/pith/KOPKTLMGK37J26YEQR7LFJEPHK/bundle.json","state":"https://pith.science/pith/KOPKTLMGK37J26YEQR7LFJEPHK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KOPKTLMGK37J26YEQR7LFJEPHK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KOPKTLMGK37J26YEQR7LFJEPHK","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":"06e3c80340926a8fc3af0cef69487b3a74748db7ba51f8b13f12205d13edc80f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2018-02-17T16:20:36Z","title_canon_sha256":"c137336c1363ffdb99067394571852b0d024a31e63f57bbd7329f64bfefcd9f1"},"schema_version":"1.0","source":{"id":"1802.06257","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06257","created_at":"2026-05-18T00:07:17Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06257v3","created_at":"2026-05-18T00:07:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06257","created_at":"2026-05-18T00:07:17Z"},{"alias_kind":"pith_short_12","alias_value":"KOPKTLMGK37J","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KOPKTLMGK37J26YE","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KOPKTLMG","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:455ebd00ef0e5773075caa0dd5546a4001714a602dbc458df86b3cca650bd3c2","target":"graph","created_at":"2026-05-18T00:07:17Z","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":"Problems involving multiple networks are prevalent in many scientific and other domains. In particular, network alignment, or the task of identifying corresponding nodes in different networks, has applications across the social and natural sciences. Motivated by recent advancements in node representation learning for single-graph tasks, we propose REGAL (REpresentation learning-based Graph ALignment), a framework that leverages the power of automatically-learned node representations to match nodes across different graphs. Within REGAL we devise xNetMF, an elegant and principled node embedding ","authors_text":"Danai Koutra, Haoming Shen, Mark Heimann, Tara Safavi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2018-02-17T16:20:36Z","title":"REGAL: Representation Learning-based Graph Alignment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06257","kind":"arxiv","version":3},"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:c10059ffbfabd49811099f4780c7628bd7cd5260b144efaed8b43968635b2844","target":"record","created_at":"2026-05-18T00:07:17Z","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":"06e3c80340926a8fc3af0cef69487b3a74748db7ba51f8b13f12205d13edc80f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2018-02-17T16:20:36Z","title_canon_sha256":"c137336c1363ffdb99067394571852b0d024a31e63f57bbd7329f64bfefcd9f1"},"schema_version":"1.0","source":{"id":"1802.06257","kind":"arxiv","version":3}},"canonical_sha256":"539ea9ad8656fe9d7b04847eb2a48f3aaaf89c7ebd4cf95d783b4598e4796878","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"539ea9ad8656fe9d7b04847eb2a48f3aaaf89c7ebd4cf95d783b4598e4796878","first_computed_at":"2026-05-18T00:07:17.975137Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:17.975137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5f6LZowesBbY9+4A3HBf+dsEbRoBReNYHA3PvKaNHGKX2Dokv5sNgVHOd6iGHYSm5EUXQnD72RoIICMat0wlCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:17.975745Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06257","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c10059ffbfabd49811099f4780c7628bd7cd5260b144efaed8b43968635b2844","sha256:455ebd00ef0e5773075caa0dd5546a4001714a602dbc458df86b3cca650bd3c2"],"state_sha256":"26039c864b4f4a1b302ed24ad09ee68dc09612a416c71474d9a148fc57e80e6d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bpW3EhLA5N3Pb6d3WkKUPAdd7s2hqMspCej5umUXqXf4700Wj2xdfirGnP4IBb4Vw7V72DYAVxJuNONf+FAnAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T16:48:51.936245Z","bundle_sha256":"605db37c4bccb28976b6b4c1731a10ff76998fe65c5d4bfbe509b3d3077ab91c"}}