{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:DRUGUYT5E6UBFCUTMEQ4MBYE3L","short_pith_number":"pith:DRUGUYT5","canonical_record":{"source":{"id":"2112.01165","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2021-12-02T12:27:49Z","cross_cats_sorted":[],"title_canon_sha256":"f8e8cfee934a7c57c86c80200d8b58efa18abf69f3f0353be420d92bf3cd74db","abstract_canon_sha256":"49ad45313981cb91e4669abadb93305fd933fe2c0cfce2040da9228bfce382e4"},"schema_version":"1.0"},"canonical_sha256":"1c686a627d27a8128a936121c60704dad735ea1259cbe7de8a6cf2988f7e5b63","source":{"kind":"arxiv","id":"2112.01165","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.01165","created_at":"2026-07-05T06:52:18Z"},{"alias_kind":"arxiv_version","alias_value":"2112.01165v2","created_at":"2026-07-05T06:52:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.01165","created_at":"2026-07-05T06:52:18Z"},{"alias_kind":"pith_short_12","alias_value":"DRUGUYT5E6UB","created_at":"2026-07-05T06:52:18Z"},{"alias_kind":"pith_short_16","alias_value":"DRUGUYT5E6UBFCUT","created_at":"2026-07-05T06:52:18Z"},{"alias_kind":"pith_short_8","alias_value":"DRUGUYT5","created_at":"2026-07-05T06:52:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:DRUGUYT5E6UBFCUTMEQ4MBYE3L","target":"record","payload":{"canonical_record":{"source":{"id":"2112.01165","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2021-12-02T12:27:49Z","cross_cats_sorted":[],"title_canon_sha256":"f8e8cfee934a7c57c86c80200d8b58efa18abf69f3f0353be420d92bf3cd74db","abstract_canon_sha256":"49ad45313981cb91e4669abadb93305fd933fe2c0cfce2040da9228bfce382e4"},"schema_version":"1.0"},"canonical_sha256":"1c686a627d27a8128a936121c60704dad735ea1259cbe7de8a6cf2988f7e5b63","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:52:18.996828Z","signature_b64":"MdQV02D3I3AbvLaBgoKLsflhTjUEtTnFWLYoFifSjD9yZiVjl8Cf7L8YDukI+/pATdvfOYHlH6kkCpEjRfEzCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c686a627d27a8128a936121c60704dad735ea1259cbe7de8a6cf2988f7e5b63","last_reissued_at":"2026-07-05T06:52:18.996298Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:52:18.996298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2112.01165","source_version":2,"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-05T06:52:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"374IqUj9IFUIXUeqSqIo3nJMV0k/tRsnlmRlN6+3k//oa+6fo6XmNiNXfKNWVg+DJMOvPvV+PLNNV2T3EZbZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T12:24:51.656246Z"},"content_sha256":"641771f6f9a391dd32093951fb640d8b3485c07473d61bb42832c68b7d73eba5","schema_version":"1.0","event_id":"sha256:641771f6f9a391dd32093951fb640d8b3485c07473d61bb42832c68b7d73eba5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:DRUGUYT5E6UBFCUTMEQ4MBYE3L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inductive Subgraph Embedding for Link Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Chenxuan Xie, Chunyu Miao, Jiajun Zhou, Lina Chen, Qi Xuan, Shanqing Yu","submitted_at":"2021-12-02T12:27:49Z","abstract_excerpt":"Graph representation learning (GRL) has emerged as a powerful technique for solving graph analytics tasks. It can effectively convert discrete graph data into a low-dimensional space where the graph structural information and graph properties are maximumly preserved. While there is rich literature on node and whole-graph representation learning, GRL for link is relatively less studied and less understood. One common practice in previous works is to generate link representations by directly aggregating the representations of their incident nodes, which is not capable of capturing effective link"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.01165","kind":"arxiv","version":2},"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/2112.01165/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-05T06:52:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+rNgJQO/qpr78PCWhswj0riSZg7qI4bqxl30TQSM5CadDUPiahA//4kx6WbBYZyMa8YvlopJd+v9+wGeMfpCAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T12:24:51.656644Z"},"content_sha256":"8b09b422f2ccc5bef84aa1c9507c9f59d6a20f41f3d8628f79a323b0cff32b92","schema_version":"1.0","event_id":"sha256:8b09b422f2ccc5bef84aa1c9507c9f59d6a20f41f3d8628f79a323b0cff32b92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DRUGUYT5E6UBFCUTMEQ4MBYE3L/bundle.json","state_url":"https://pith.science/pith/DRUGUYT5E6UBFCUTMEQ4MBYE3L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DRUGUYT5E6UBFCUTMEQ4MBYE3L/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-06T12:24:51Z","links":{"resolver":"https://pith.science/pith/DRUGUYT5E6UBFCUTMEQ4MBYE3L","bundle":"https://pith.science/pith/DRUGUYT5E6UBFCUTMEQ4MBYE3L/bundle.json","state":"https://pith.science/pith/DRUGUYT5E6UBFCUTMEQ4MBYE3L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DRUGUYT5E6UBFCUTMEQ4MBYE3L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:DRUGUYT5E6UBFCUTMEQ4MBYE3L","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":"49ad45313981cb91e4669abadb93305fd933fe2c0cfce2040da9228bfce382e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2021-12-02T12:27:49Z","title_canon_sha256":"f8e8cfee934a7c57c86c80200d8b58efa18abf69f3f0353be420d92bf3cd74db"},"schema_version":"1.0","source":{"id":"2112.01165","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.01165","created_at":"2026-07-05T06:52:18Z"},{"alias_kind":"arxiv_version","alias_value":"2112.01165v2","created_at":"2026-07-05T06:52:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.01165","created_at":"2026-07-05T06:52:18Z"},{"alias_kind":"pith_short_12","alias_value":"DRUGUYT5E6UB","created_at":"2026-07-05T06:52:18Z"},{"alias_kind":"pith_short_16","alias_value":"DRUGUYT5E6UBFCUT","created_at":"2026-07-05T06:52:18Z"},{"alias_kind":"pith_short_8","alias_value":"DRUGUYT5","created_at":"2026-07-05T06:52:18Z"}],"graph_snapshots":[{"event_id":"sha256:8b09b422f2ccc5bef84aa1c9507c9f59d6a20f41f3d8628f79a323b0cff32b92","target":"graph","created_at":"2026-07-05T06:52:18Z","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/2112.01165/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph representation learning (GRL) has emerged as a powerful technique for solving graph analytics tasks. It can effectively convert discrete graph data into a low-dimensional space where the graph structural information and graph properties are maximumly preserved. While there is rich literature on node and whole-graph representation learning, GRL for link is relatively less studied and less understood. One common practice in previous works is to generate link representations by directly aggregating the representations of their incident nodes, which is not capable of capturing effective link","authors_text":"Chenxuan Xie, Chunyu Miao, Jiajun Zhou, Lina Chen, Qi Xuan, Shanqing Yu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2021-12-02T12:27:49Z","title":"Inductive Subgraph Embedding for Link Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.01165","kind":"arxiv","version":2},"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:641771f6f9a391dd32093951fb640d8b3485c07473d61bb42832c68b7d73eba5","target":"record","created_at":"2026-07-05T06:52:18Z","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":"49ad45313981cb91e4669abadb93305fd933fe2c0cfce2040da9228bfce382e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2021-12-02T12:27:49Z","title_canon_sha256":"f8e8cfee934a7c57c86c80200d8b58efa18abf69f3f0353be420d92bf3cd74db"},"schema_version":"1.0","source":{"id":"2112.01165","kind":"arxiv","version":2}},"canonical_sha256":"1c686a627d27a8128a936121c60704dad735ea1259cbe7de8a6cf2988f7e5b63","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c686a627d27a8128a936121c60704dad735ea1259cbe7de8a6cf2988f7e5b63","first_computed_at":"2026-07-05T06:52:18.996298Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:52:18.996298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MdQV02D3I3AbvLaBgoKLsflhTjUEtTnFWLYoFifSjD9yZiVjl8Cf7L8YDukI+/pATdvfOYHlH6kkCpEjRfEzCg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:52:18.996828Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.01165","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:641771f6f9a391dd32093951fb640d8b3485c07473d61bb42832c68b7d73eba5","sha256:8b09b422f2ccc5bef84aa1c9507c9f59d6a20f41f3d8628f79a323b0cff32b92"],"state_sha256":"ba8d62ad73196d756e8596c5361dbe07a728aca9d0f00709352e71590b39983c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y+lTWPq0qhiETqmlR7KZlCRYzEjUw+MTOXvq0LZKCwSHmeaJB/pZGfPZ7tzOJ5ITovgH0qT9dJNtTjQ9f7gIDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T12:24:51.658643Z","bundle_sha256":"112f6756d6d3683fda94132304e6cc6fcee3c48cad1b963eccffe8dcc4dc89a9"}}