{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:YKJTGZA4GLFFJIG2SVL2ZZKPIS","short_pith_number":"pith:YKJTGZA4","canonical_record":{"source":{"id":"2212.08966","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-12-17T22:05:07Z","cross_cats_sorted":[],"title_canon_sha256":"8cb4e2862becbc4afe84fe669d1af3befece70e67be5f7535ce1a8f53905cec1","abstract_canon_sha256":"efaae5cdb30db3716416834375c3c5f3682c7390a8a1e7743efbb8aa225b4a5c"},"schema_version":"1.0"},"canonical_sha256":"c29333641c32ca54a0da9557ace54f449e34de66be92d02cebbc2b7edb62c546","source":{"kind":"arxiv","id":"2212.08966","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.08966","created_at":"2026-07-05T09:09:50Z"},{"alias_kind":"arxiv_version","alias_value":"2212.08966v5","created_at":"2026-07-05T09:09:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.08966","created_at":"2026-07-05T09:09:50Z"},{"alias_kind":"pith_short_12","alias_value":"YKJTGZA4GLFF","created_at":"2026-07-05T09:09:50Z"},{"alias_kind":"pith_short_16","alias_value":"YKJTGZA4GLFFJIG2","created_at":"2026-07-05T09:09:50Z"},{"alias_kind":"pith_short_8","alias_value":"YKJTGZA4","created_at":"2026-07-05T09:09:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:YKJTGZA4GLFFJIG2SVL2ZZKPIS","target":"record","payload":{"canonical_record":{"source":{"id":"2212.08966","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-12-17T22:05:07Z","cross_cats_sorted":[],"title_canon_sha256":"8cb4e2862becbc4afe84fe669d1af3befece70e67be5f7535ce1a8f53905cec1","abstract_canon_sha256":"efaae5cdb30db3716416834375c3c5f3682c7390a8a1e7743efbb8aa225b4a5c"},"schema_version":"1.0"},"canonical_sha256":"c29333641c32ca54a0da9557ace54f449e34de66be92d02cebbc2b7edb62c546","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:09:50.262470Z","signature_b64":"i6DYv/nSw/taBBIDCdevQMcoxmIxOBXJwX3MaTZrSSL9uBYwvMfguumXnJhXe6fa9zDsjzWn1WWwHUq3ls6sDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c29333641c32ca54a0da9557ace54f449e34de66be92d02cebbc2b7edb62c546","last_reissued_at":"2026-07-05T09:09:50.261979Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:09:50.261979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2212.08966","source_version":5,"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-05T09:09:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EKugib78omZ1jC9KzeDGYlCPmlsS+YNsfJyjhlOQKf9QuUse5drUM4cLWKSq+wSCgpXepGmEUpYcWu7Vry8iDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:59:56.890158Z"},"content_sha256":"a99e141bb6850ce4f411e35791e2b1ebdd57ec48537946300fe3532feaee594b","schema_version":"1.0","event_id":"sha256:a99e141bb6850ce4f411e35791e2b1ebdd57ec48537946300fe3532feaee594b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:YKJTGZA4GLFFJIG2SVL2ZZKPIS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Learning and Its Advancements on Large Language Models: A Holistic Survey","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Fuji Ren, Fuzhen Zhuang, Gang Kou, Ji Liu, Jun Wang, Qing Li, Shaopeng Wei, Xingyan Chen, Yu Zhao","submitted_at":"2022-12-17T22:05:07Z","abstract_excerpt":"Graph learning is a prevalent domain that endeavors to learn the intricate relationships among nodes and the topological structure of graphs. Over the years, graph learning has transcended from graph theory to graph data mining. With the advent of representation learning, it has attained remarkable performance in diverse scenarios. Owing to its extensive application prospects, graph learning attracts copious attention. While some researchers have accomplished impressive surveys on graph learning, they failed to connect related objectives, methods, and applications in a more coherent way. As a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.08966","kind":"arxiv","version":5},"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/2212.08966/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-05T09:09:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kl8nfkdY2mqEExMqe0M/SoYhuz+0/VV/Cb3gEvrHwN/h+pMWP+bVc7RtVU9ktbG6hLOV1N0gKEqVG8KdQRjcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:59:56.890539Z"},"content_sha256":"3f99b24b4b6c5c5c2fc6d141682c28bf2370b143daaf95e9c82e1ad10a1ebd22","schema_version":"1.0","event_id":"sha256:3f99b24b4b6c5c5c2fc6d141682c28bf2370b143daaf95e9c82e1ad10a1ebd22"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YKJTGZA4GLFFJIG2SVL2ZZKPIS/bundle.json","state_url":"https://pith.science/pith/YKJTGZA4GLFFJIG2SVL2ZZKPIS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YKJTGZA4GLFFJIG2SVL2ZZKPIS/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-06T20:59:56Z","links":{"resolver":"https://pith.science/pith/YKJTGZA4GLFFJIG2SVL2ZZKPIS","bundle":"https://pith.science/pith/YKJTGZA4GLFFJIG2SVL2ZZKPIS/bundle.json","state":"https://pith.science/pith/YKJTGZA4GLFFJIG2SVL2ZZKPIS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YKJTGZA4GLFFJIG2SVL2ZZKPIS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:YKJTGZA4GLFFJIG2SVL2ZZKPIS","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":"efaae5cdb30db3716416834375c3c5f3682c7390a8a1e7743efbb8aa225b4a5c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-12-17T22:05:07Z","title_canon_sha256":"8cb4e2862becbc4afe84fe669d1af3befece70e67be5f7535ce1a8f53905cec1"},"schema_version":"1.0","source":{"id":"2212.08966","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.08966","created_at":"2026-07-05T09:09:50Z"},{"alias_kind":"arxiv_version","alias_value":"2212.08966v5","created_at":"2026-07-05T09:09:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.08966","created_at":"2026-07-05T09:09:50Z"},{"alias_kind":"pith_short_12","alias_value":"YKJTGZA4GLFF","created_at":"2026-07-05T09:09:50Z"},{"alias_kind":"pith_short_16","alias_value":"YKJTGZA4GLFFJIG2","created_at":"2026-07-05T09:09:50Z"},{"alias_kind":"pith_short_8","alias_value":"YKJTGZA4","created_at":"2026-07-05T09:09:50Z"}],"graph_snapshots":[{"event_id":"sha256:3f99b24b4b6c5c5c2fc6d141682c28bf2370b143daaf95e9c82e1ad10a1ebd22","target":"graph","created_at":"2026-07-05T09:09:50Z","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/2212.08966/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph learning is a prevalent domain that endeavors to learn the intricate relationships among nodes and the topological structure of graphs. Over the years, graph learning has transcended from graph theory to graph data mining. With the advent of representation learning, it has attained remarkable performance in diverse scenarios. Owing to its extensive application prospects, graph learning attracts copious attention. While some researchers have accomplished impressive surveys on graph learning, they failed to connect related objectives, methods, and applications in a more coherent way. As a ","authors_text":"Fuji Ren, Fuzhen Zhuang, Gang Kou, Ji Liu, Jun Wang, Qing Li, Shaopeng Wei, Xingyan Chen, Yu Zhao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-12-17T22:05:07Z","title":"Graph Learning and Its Advancements on Large Language Models: A Holistic Survey"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.08966","kind":"arxiv","version":5},"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:a99e141bb6850ce4f411e35791e2b1ebdd57ec48537946300fe3532feaee594b","target":"record","created_at":"2026-07-05T09:09:50Z","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":"efaae5cdb30db3716416834375c3c5f3682c7390a8a1e7743efbb8aa225b4a5c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2022-12-17T22:05:07Z","title_canon_sha256":"8cb4e2862becbc4afe84fe669d1af3befece70e67be5f7535ce1a8f53905cec1"},"schema_version":"1.0","source":{"id":"2212.08966","kind":"arxiv","version":5}},"canonical_sha256":"c29333641c32ca54a0da9557ace54f449e34de66be92d02cebbc2b7edb62c546","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c29333641c32ca54a0da9557ace54f449e34de66be92d02cebbc2b7edb62c546","first_computed_at":"2026-07-05T09:09:50.261979Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:09:50.261979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i6DYv/nSw/taBBIDCdevQMcoxmIxOBXJwX3MaTZrSSL9uBYwvMfguumXnJhXe6fa9zDsjzWn1WWwHUq3ls6sDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:09:50.262470Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.08966","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a99e141bb6850ce4f411e35791e2b1ebdd57ec48537946300fe3532feaee594b","sha256:3f99b24b4b6c5c5c2fc6d141682c28bf2370b143daaf95e9c82e1ad10a1ebd22"],"state_sha256":"2e696172f53b9abf50d38c7dd06a87d048e61cb3d01a5271294ec5bc062957e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VygWTVdAkzxbMbLXUMFaKO/BaFgNX9Vh+tisAfxSsVXxKCnQh87dmN+sLvtoeT3m9rDVtGOgCXoUJFx3JogxBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T20:59:56.892449Z","bundle_sha256":"eb4954d4d80bb62bdab2f90a774226abe81080fe1b4349659dceabf1376e6211"}}