{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QFTRXLWTX7LCTN6FBLEPIZDVU4","short_pith_number":"pith:QFTRXLWT","canonical_record":{"source":{"id":"1911.05486","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-10-29T15:32:13Z","cross_cats_sorted":[],"title_canon_sha256":"2697d4d16be4cc4ee9c30b8c2c02813d94c0b3050837a036fcc05df5a1ff27e3","abstract_canon_sha256":"bae5483048459673c760e6f102e936dda7f553953e509bcc40de578a98abf5e5"},"schema_version":"1.0"},"canonical_sha256":"81671baed3bfd629b7c50ac8f46475a73f269ca5b57342587d98c5616ba7d6a6","source":{"kind":"arxiv","id":"1911.05486","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.05486","created_at":"2026-07-05T03:29:12Z"},{"alias_kind":"arxiv_version","alias_value":"1911.05486v4","created_at":"2026-07-05T03:29:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.05486","created_at":"2026-07-05T03:29:12Z"},{"alias_kind":"pith_short_12","alias_value":"QFTRXLWTX7LC","created_at":"2026-07-05T03:29:12Z"},{"alias_kind":"pith_short_16","alias_value":"QFTRXLWTX7LCTN6F","created_at":"2026-07-05T03:29:12Z"},{"alias_kind":"pith_short_8","alias_value":"QFTRXLWT","created_at":"2026-07-05T03:29:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QFTRXLWTX7LCTN6FBLEPIZDVU4","target":"record","payload":{"canonical_record":{"source":{"id":"1911.05486","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-10-29T15:32:13Z","cross_cats_sorted":[],"title_canon_sha256":"2697d4d16be4cc4ee9c30b8c2c02813d94c0b3050837a036fcc05df5a1ff27e3","abstract_canon_sha256":"bae5483048459673c760e6f102e936dda7f553953e509bcc40de578a98abf5e5"},"schema_version":"1.0"},"canonical_sha256":"81671baed3bfd629b7c50ac8f46475a73f269ca5b57342587d98c5616ba7d6a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:29:12.926511Z","signature_b64":"EcvRqjIzd2fIhedCvKp/xIAAATggqNqzuFgJlhAu9+zcmBTi6U0wT+XuvCTe7QpnAjmbACB6YmN8WpjNiQOmAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81671baed3bfd629b7c50ac8f46475a73f269ca5b57342587d98c5616ba7d6a6","last_reissued_at":"2026-07-05T03:29:12.926081Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:29:12.926081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1911.05486","source_version":4,"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-05T03:29:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dlBY9/ojftSFbWXRzKOJJg1oM/oNp7Tp9u8zdeFRZj4xzR+EuEXyjW9JGCl9MPRLfsaXt2T5Ek2I86aRH9DcBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T13:49:34.399365Z"},"content_sha256":"6a892d8ea0a66557272a8ec8553289ca409494eebe34ebaf67e4fc3d4cf81070","schema_version":"1.0","event_id":"sha256:6a892d8ea0a66557272a8ec8553289ca409494eebe34ebaf67e4fc3d4cf81070"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QFTRXLWTX7LCTN6FBLEPIZDVU4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ELRUNA: Elimination Rule-based Network Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Christopher S. Henry, Ilya Safro, Ruslan Shaydulin, Xiaoyuan Liu, Yuri Alexeev, Zirou Qiu","submitted_at":"2019-10-29T15:32:13Z","abstract_excerpt":"Networks model a variety of complex phenomena across different domains. In many applications, one of the most essential tasks is to align two or more networks to infer the similarities between cross-network vertices and discover potential node-level correspondence. In this paper, we propose ELRUNA (Elimination rule-based network alignment), a novel network alignment algorithm that relies exclusively on the underlying graph structure. Under the guidance of the elimination rules that we defined, ELRUNA computes the similarity between a pair of cross-network vertices iteratively by accumulating t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.05486","kind":"arxiv","version":4},"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/1911.05486/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-05T03:29:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I/vfXtSIrQ06caavfV7Xf69LNGm7RyEQtxbrdv79dZVLeKIvQHzFjLrTlTQ5onuwpvt/N5QXbTupoUuz22aIAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T13:49:34.399748Z"},"content_sha256":"4051d5c0a7335e3dab6b4cba500c80ac66ab0dad223267686d2cf57dff2da401","schema_version":"1.0","event_id":"sha256:4051d5c0a7335e3dab6b4cba500c80ac66ab0dad223267686d2cf57dff2da401"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QFTRXLWTX7LCTN6FBLEPIZDVU4/bundle.json","state_url":"https://pith.science/pith/QFTRXLWTX7LCTN6FBLEPIZDVU4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QFTRXLWTX7LCTN6FBLEPIZDVU4/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-06T13:49:34Z","links":{"resolver":"https://pith.science/pith/QFTRXLWTX7LCTN6FBLEPIZDVU4","bundle":"https://pith.science/pith/QFTRXLWTX7LCTN6FBLEPIZDVU4/bundle.json","state":"https://pith.science/pith/QFTRXLWTX7LCTN6FBLEPIZDVU4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QFTRXLWTX7LCTN6FBLEPIZDVU4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QFTRXLWTX7LCTN6FBLEPIZDVU4","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":"bae5483048459673c760e6f102e936dda7f553953e509bcc40de578a98abf5e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-10-29T15:32:13Z","title_canon_sha256":"2697d4d16be4cc4ee9c30b8c2c02813d94c0b3050837a036fcc05df5a1ff27e3"},"schema_version":"1.0","source":{"id":"1911.05486","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.05486","created_at":"2026-07-05T03:29:12Z"},{"alias_kind":"arxiv_version","alias_value":"1911.05486v4","created_at":"2026-07-05T03:29:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.05486","created_at":"2026-07-05T03:29:12Z"},{"alias_kind":"pith_short_12","alias_value":"QFTRXLWTX7LC","created_at":"2026-07-05T03:29:12Z"},{"alias_kind":"pith_short_16","alias_value":"QFTRXLWTX7LCTN6F","created_at":"2026-07-05T03:29:12Z"},{"alias_kind":"pith_short_8","alias_value":"QFTRXLWT","created_at":"2026-07-05T03:29:12Z"}],"graph_snapshots":[{"event_id":"sha256:4051d5c0a7335e3dab6b4cba500c80ac66ab0dad223267686d2cf57dff2da401","target":"graph","created_at":"2026-07-05T03:29:12Z","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/1911.05486/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Networks model a variety of complex phenomena across different domains. In many applications, one of the most essential tasks is to align two or more networks to infer the similarities between cross-network vertices and discover potential node-level correspondence. In this paper, we propose ELRUNA (Elimination rule-based network alignment), a novel network alignment algorithm that relies exclusively on the underlying graph structure. Under the guidance of the elimination rules that we defined, ELRUNA computes the similarity between a pair of cross-network vertices iteratively by accumulating t","authors_text":"Christopher S. Henry, Ilya Safro, Ruslan Shaydulin, Xiaoyuan Liu, Yuri Alexeev, Zirou Qiu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-10-29T15:32:13Z","title":"ELRUNA: Elimination Rule-based Network Alignment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.05486","kind":"arxiv","version":4},"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:6a892d8ea0a66557272a8ec8553289ca409494eebe34ebaf67e4fc3d4cf81070","target":"record","created_at":"2026-07-05T03:29:12Z","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":"bae5483048459673c760e6f102e936dda7f553953e509bcc40de578a98abf5e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-10-29T15:32:13Z","title_canon_sha256":"2697d4d16be4cc4ee9c30b8c2c02813d94c0b3050837a036fcc05df5a1ff27e3"},"schema_version":"1.0","source":{"id":"1911.05486","kind":"arxiv","version":4}},"canonical_sha256":"81671baed3bfd629b7c50ac8f46475a73f269ca5b57342587d98c5616ba7d6a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81671baed3bfd629b7c50ac8f46475a73f269ca5b57342587d98c5616ba7d6a6","first_computed_at":"2026-07-05T03:29:12.926081Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:29:12.926081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EcvRqjIzd2fIhedCvKp/xIAAATggqNqzuFgJlhAu9+zcmBTi6U0wT+XuvCTe7QpnAjmbACB6YmN8WpjNiQOmAg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:29:12.926511Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.05486","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a892d8ea0a66557272a8ec8553289ca409494eebe34ebaf67e4fc3d4cf81070","sha256:4051d5c0a7335e3dab6b4cba500c80ac66ab0dad223267686d2cf57dff2da401"],"state_sha256":"6f5544920d7f5da45e496ba5cc8bb47762f5c9c430c876636a3d0303bd2d6dfa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z5wkgSrNvBrWGxQ6fbLCc6imYhW+vTUiNzJbJRRaK7oikKIaf3S7PlMbj/0XrnH95IJZQbA0/dgFkym2fS3wCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T13:49:34.401970Z","bundle_sha256":"477adb0395ab4dc14f05665d6a7689f2b3c3b31d27c7968685408d0d67d47511"}}