{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:UFZWTRFCNG76X6U5WRD5R7FAMC","short_pith_number":"pith:UFZWTRFC","canonical_record":{"source":{"id":"2210.14709","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-10-26T13:40:57Z","cross_cats_sorted":[],"title_canon_sha256":"d01d823316d25ba0f318aeb49cc9e7c17c731b8f945e5075ead7248da61a9207","abstract_canon_sha256":"7f0bbfab7b2d8f1232850f1c253c4c077cdddbe0c175d31d6a75eceadb44129b"},"schema_version":"1.0"},"canonical_sha256":"a17369c4a269bfebfa9db447d8fca0609e19059f20e40d9c32821b4bb9cc7e84","source":{"kind":"arxiv","id":"2210.14709","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.14709","created_at":"2026-07-05T05:47:04Z"},{"alias_kind":"arxiv_version","alias_value":"2210.14709v2","created_at":"2026-07-05T05:47:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.14709","created_at":"2026-07-05T05:47:04Z"},{"alias_kind":"pith_short_12","alias_value":"UFZWTRFCNG76","created_at":"2026-07-05T05:47:04Z"},{"alias_kind":"pith_short_16","alias_value":"UFZWTRFCNG76X6U5","created_at":"2026-07-05T05:47:04Z"},{"alias_kind":"pith_short_8","alias_value":"UFZWTRFC","created_at":"2026-07-05T05:47:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:UFZWTRFCNG76X6U5WRD5R7FAMC","target":"record","payload":{"canonical_record":{"source":{"id":"2210.14709","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-10-26T13:40:57Z","cross_cats_sorted":[],"title_canon_sha256":"d01d823316d25ba0f318aeb49cc9e7c17c731b8f945e5075ead7248da61a9207","abstract_canon_sha256":"7f0bbfab7b2d8f1232850f1c253c4c077cdddbe0c175d31d6a75eceadb44129b"},"schema_version":"1.0"},"canonical_sha256":"a17369c4a269bfebfa9db447d8fca0609e19059f20e40d9c32821b4bb9cc7e84","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:47:04.557775Z","signature_b64":"VdkxN2zW/A67KSwu+SLiABA20lywgMQ3+wljyyzy+1xC8x4qr0aYY41vM0nYpkAtRB/noxr/xGk2/5rrBHgkCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a17369c4a269bfebfa9db447d8fca0609e19059f20e40d9c32821b4bb9cc7e84","last_reissued_at":"2026-07-05T05:47:04.557273Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:47:04.557273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2210.14709","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-05T05:47:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DQBQ5TTnD1DCWi7iAmES6PmBEhWl3LmfR4HItf+vAw7NHFlH4EtYztoe+6Rk96ylMtm0UkuMD19LZQjUsdvIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:36:40.814759Z"},"content_sha256":"fe3cf608f8bd78425576c337ce89eaf0f55f17a738924be3dd461b02f8768cac","schema_version":"1.0","event_id":"sha256:fe3cf608f8bd78425576c337ce89eaf0f55f17a738924be3dd461b02f8768cac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:UFZWTRFCNG76X6U5WRD5R7FAMC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning on Large-scale Text-attributed Graphs via Variational Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chaozhuo Li, Hao Yan, Jianan Zhao, Jian Tang, Meng Qu, Qian Liu, Rui Li, Xing Xie","submitted_at":"2022-10-26T13:40:57Z","abstract_excerpt":"This paper studies learning on text-attributed graphs (TAGs), where each node is associated with a text description. An ideal solution for such a problem would be integrating both the text and graph structure information with large language models and graph neural networks (GNNs). However, the problem becomes very challenging when graphs are large due to the high computational complexity brought by training large language models and GNNs together. In this paper, we propose an efficient and effective solution to learning on large text-attributed graphs by fusing graph structure and language lea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.14709","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/2210.14709/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-05T05:47:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AS7SYIi+46g+NfxN5dGpV3/6JQjG+UFtYZqeGykvgw4Z8sOACLO5+zqvB2kTGHXp+s3mJfO0MDGB9D7mQLE+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:36:40.815325Z"},"content_sha256":"3f22b6bace6607540d4b693ffeded528ba804c95b831f0e09aa70d12d0d9050d","schema_version":"1.0","event_id":"sha256:3f22b6bace6607540d4b693ffeded528ba804c95b831f0e09aa70d12d0d9050d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UFZWTRFCNG76X6U5WRD5R7FAMC/bundle.json","state_url":"https://pith.science/pith/UFZWTRFCNG76X6U5WRD5R7FAMC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UFZWTRFCNG76X6U5WRD5R7FAMC/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-08-03T16:36:40Z","links":{"resolver":"https://pith.science/pith/UFZWTRFCNG76X6U5WRD5R7FAMC","bundle":"https://pith.science/pith/UFZWTRFCNG76X6U5WRD5R7FAMC/bundle.json","state":"https://pith.science/pith/UFZWTRFCNG76X6U5WRD5R7FAMC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UFZWTRFCNG76X6U5WRD5R7FAMC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:UFZWTRFCNG76X6U5WRD5R7FAMC","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":"7f0bbfab7b2d8f1232850f1c253c4c077cdddbe0c175d31d6a75eceadb44129b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-10-26T13:40:57Z","title_canon_sha256":"d01d823316d25ba0f318aeb49cc9e7c17c731b8f945e5075ead7248da61a9207"},"schema_version":"1.0","source":{"id":"2210.14709","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2210.14709","created_at":"2026-07-05T05:47:04Z"},{"alias_kind":"arxiv_version","alias_value":"2210.14709v2","created_at":"2026-07-05T05:47:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.14709","created_at":"2026-07-05T05:47:04Z"},{"alias_kind":"pith_short_12","alias_value":"UFZWTRFCNG76","created_at":"2026-07-05T05:47:04Z"},{"alias_kind":"pith_short_16","alias_value":"UFZWTRFCNG76X6U5","created_at":"2026-07-05T05:47:04Z"},{"alias_kind":"pith_short_8","alias_value":"UFZWTRFC","created_at":"2026-07-05T05:47:04Z"}],"graph_snapshots":[{"event_id":"sha256:3f22b6bace6607540d4b693ffeded528ba804c95b831f0e09aa70d12d0d9050d","target":"graph","created_at":"2026-07-05T05:47:04Z","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/2210.14709/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper studies learning on text-attributed graphs (TAGs), where each node is associated with a text description. An ideal solution for such a problem would be integrating both the text and graph structure information with large language models and graph neural networks (GNNs). However, the problem becomes very challenging when graphs are large due to the high computational complexity brought by training large language models and GNNs together. In this paper, we propose an efficient and effective solution to learning on large text-attributed graphs by fusing graph structure and language lea","authors_text":"Chaozhuo Li, Hao Yan, Jianan Zhao, Jian Tang, Meng Qu, Qian Liu, Rui Li, Xing Xie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-10-26T13:40:57Z","title":"Learning on Large-scale Text-attributed Graphs via Variational Inference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.14709","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:fe3cf608f8bd78425576c337ce89eaf0f55f17a738924be3dd461b02f8768cac","target":"record","created_at":"2026-07-05T05:47:04Z","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":"7f0bbfab7b2d8f1232850f1c253c4c077cdddbe0c175d31d6a75eceadb44129b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-10-26T13:40:57Z","title_canon_sha256":"d01d823316d25ba0f318aeb49cc9e7c17c731b8f945e5075ead7248da61a9207"},"schema_version":"1.0","source":{"id":"2210.14709","kind":"arxiv","version":2}},"canonical_sha256":"a17369c4a269bfebfa9db447d8fca0609e19059f20e40d9c32821b4bb9cc7e84","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a17369c4a269bfebfa9db447d8fca0609e19059f20e40d9c32821b4bb9cc7e84","first_computed_at":"2026-07-05T05:47:04.557273Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:47:04.557273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VdkxN2zW/A67KSwu+SLiABA20lywgMQ3+wljyyzy+1xC8x4qr0aYY41vM0nYpkAtRB/noxr/xGk2/5rrBHgkCw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:47:04.557775Z","signed_message":"canonical_sha256_bytes"},"source_id":"2210.14709","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe3cf608f8bd78425576c337ce89eaf0f55f17a738924be3dd461b02f8768cac","sha256:3f22b6bace6607540d4b693ffeded528ba804c95b831f0e09aa70d12d0d9050d"],"state_sha256":"d689f76a9b6bc816c3441ca33c58ee4905a3c54342556f03062f5d2afe80fd94"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"clWRwCrhEHqvWj/8dFf9Lkf5HtzeCELgCY6NXnk5F1CfqYHmG2aCDsqX2yI4AY2fa6ZEnM7l8iI1yIjHvcoZAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T16:36:40.819913Z","bundle_sha256":"6a464953ef083c146d649b056b2e19c73681f6e74f193ebfaa196b0c56b1b8d2"}}