{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:AEST2CKST3VA66KWGM7ITZK74Y","short_pith_number":"pith:AEST2CKS","schema_version":"1.0","canonical_sha256":"01253d09529eea0f7956333e89e55fe62d3802d5bbbc18df394868471aeb3b51","source":{"kind":"arxiv","id":"2310.00149","version":3},"attestation_state":"computed","paper":{"title":"One for All: Towards Training One Graph Model for All Classification Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dacheng Tao, Hao Liu, Jiarui Feng, Lecheng Kong, Muhan Zhang, Ningyue Liang, Yixin Chen","submitted_at":"2023-09-29T21:15:26Z","abstract_excerpt":"Designing a single model to address multiple tasks has been a long-standing objective in artificial intelligence. Recently, large language models have demonstrated exceptional capability in solving different tasks within the language domain. However, a unified model for various graph tasks remains underexplored, primarily due to the challenges unique to the graph learning domain. First, graph data from different areas carry distinct attributes and follow different distributions. Such discrepancy makes it hard to represent graphs in a single representation space. Second, tasks on graphs diversi"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2310.00149","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-09-29T21:15:26Z","cross_cats_sorted":[],"title_canon_sha256":"d129c6c8c39ad3926dfa8d62615240ae3a5e836e22b13b49b2f1f17360de1901","abstract_canon_sha256":"0a0f5814451ba4e72352a5b153aa6905aadacee67efc0f44e35f3182e4b46af9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:43:23.551917Z","signature_b64":"sF/+94GMe3AJCqp8vP3WsJWQUa5ApNfq6oZNPoWDwNg7mE6YsQ8U0UOKEwpEEID0VBDbatuujCCW4IzYso5zCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01253d09529eea0f7956333e89e55fe62d3802d5bbbc18df394868471aeb3b51","last_reissued_at":"2026-07-05T08:43:23.551468Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:43:23.551468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"One for All: Towards Training One Graph Model for All Classification Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Dacheng Tao, Hao Liu, Jiarui Feng, Lecheng Kong, Muhan Zhang, Ningyue Liang, Yixin Chen","submitted_at":"2023-09-29T21:15:26Z","abstract_excerpt":"Designing a single model to address multiple tasks has been a long-standing objective in artificial intelligence. Recently, large language models have demonstrated exceptional capability in solving different tasks within the language domain. However, a unified model for various graph tasks remains underexplored, primarily due to the challenges unique to the graph learning domain. First, graph data from different areas carry distinct attributes and follow different distributions. Such discrepancy makes it hard to represent graphs in a single representation space. Second, tasks on graphs diversi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.00149","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2310.00149/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2310.00149","created_at":"2026-07-05T08:43:23.551521+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.00149v3","created_at":"2026-07-05T08:43:23.551521+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.00149","created_at":"2026-07-05T08:43:23.551521+00:00"},{"alias_kind":"pith_short_12","alias_value":"AEST2CKST3VA","created_at":"2026-07-05T08:43:23.551521+00:00"},{"alias_kind":"pith_short_16","alias_value":"AEST2CKST3VA66KW","created_at":"2026-07-05T08:43:23.551521+00:00"},{"alias_kind":"pith_short_8","alias_value":"AEST2CKS","created_at":"2026-07-05T08:43:23.551521+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":13,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.17667","citing_title":"Handling Feature Heterogeneity with Learnable Graph Patches","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2606.11583","citing_title":"Beyond the Golden Teacher: Enhancing Graph Learning through LLM-GNN Co-teaching","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2606.11562","citing_title":"GraphInfer-Bench: Benchmarking LLM's Inference Capability on Graphs","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2606.03307","citing_title":"Generalizing Graph Foundation Models via Hyperbolic Retrieval-Augmented Generation","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2606.03315","citing_title":"A Graph Foundation Model with Spectral Parsing and Prototype-Guided Spatial Propagation","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2606.01873","citing_title":"G2LoRA: Gradient Orthogonal Low-Rank Adaptation Framework for Graph Continual Learning on Text-Attributed Graphs","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2606.30291","citing_title":"PromptGNN-sim: Deep Fusion and Alignment of GNN and LLMs for Text-Attributed Graph Learning","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2606.29773","citing_title":"GLIP: Graph and LLM Joint Pretraining for Graph-Level Tasks","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2603.02938","citing_title":"Beyond One-Size-Fits-All: Adaptive Subgraph Denoising for Zero-Shot Graph Learning with Large Language Models","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18579","citing_title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2605.18579","citing_title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2602.04244","citing_title":"GraphVec: Cross-Domain Graph Vectorization for Graph-Level Representation Learning","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12061","citing_title":"SAGE: A Self-Evolving Agentic Graph-Memory Engine for Structure-Aware Associative Memory","ref_index":122,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AEST2CKST3VA66KWGM7ITZK74Y","json":"https://pith.science/pith/AEST2CKST3VA66KWGM7ITZK74Y.json","graph_json":"https://pith.science/api/pith-number/AEST2CKST3VA66KWGM7ITZK74Y/graph.json","events_json":"https://pith.science/api/pith-number/AEST2CKST3VA66KWGM7ITZK74Y/events.json","paper":"https://pith.science/paper/AEST2CKS"},"agent_actions":{"view_html":"https://pith.science/pith/AEST2CKST3VA66KWGM7ITZK74Y","download_json":"https://pith.science/pith/AEST2CKST3VA66KWGM7ITZK74Y.json","view_paper":"https://pith.science/paper/AEST2CKS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.00149&json=true","fetch_graph":"https://pith.science/api/pith-number/AEST2CKST3VA66KWGM7ITZK74Y/graph.json","fetch_events":"https://pith.science/api/pith-number/AEST2CKST3VA66KWGM7ITZK74Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AEST2CKST3VA66KWGM7ITZK74Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AEST2CKST3VA66KWGM7ITZK74Y/action/storage_attestation","attest_author":"https://pith.science/pith/AEST2CKST3VA66KWGM7ITZK74Y/action/author_attestation","sign_citation":"https://pith.science/pith/AEST2CKST3VA66KWGM7ITZK74Y/action/citation_signature","submit_replication":"https://pith.science/pith/AEST2CKST3VA66KWGM7ITZK74Y/action/replication_record"}},"created_at":"2026-07-05T08:43:23.551521+00:00","updated_at":"2026-07-05T08:43:23.551521+00:00"}