{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:PDEVOUJT5T2V666C4BMO4O6NHA","short_pith_number":"pith:PDEVOUJT","schema_version":"1.0","canonical_sha256":"78c9575133ecf55f7bc2e058ee3bcd383871939dcb668795b487958419316473","source":{"kind":"arxiv","id":"2310.11829","version":4},"attestation_state":"computed","paper":{"title":"Graph Foundation Models: Concepts, Opportunities and Challenges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Cheng Yang, Chuan Shi, Jiawei Liu, Junze Chen, Lichao Sun, Mengmei Zhang, Philip S. Yu, Ting Bai, Yibo Li, Yuan Fang, Zhiyuan Lu","submitted_at":"2023-10-18T09:31:21Z","abstract_excerpt":"Foundation models have emerged as critical components in a variety of artificial intelligence applications, and showcase significant success in natural language processing and several other domains. Meanwhile, the field of graph machine learning is witnessing a paradigm transition from shallow methods to more sophisticated deep learning approaches. The capabilities of foundation models in generalization and adaptation motivate graph machine learning researchers to discuss the potential of developing a new graph learning paradigm. This paradigm envisions models that are pre-trained on extensive"},"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.11829","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-18T09:31:21Z","cross_cats_sorted":[],"title_canon_sha256":"ab19864ba1f51c13b1fc58e39869049e203284359300385a06538bdb08b36583","abstract_canon_sha256":"ac083126388286f8bcb1623d3945dfe50017104a6d5a2cb75c206db1fdca64d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:27:05.660618Z","signature_b64":"sWYTu4PUcPxEBZQU7ZSDNSIHXGI1t0F1lXsLpcMLDUZN1fcp7tdSUUp9cXyJ4Y2nynV8dCJWaYWiAvVsg++mAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78c9575133ecf55f7bc2e058ee3bcd383871939dcb668795b487958419316473","last_reissued_at":"2026-07-05T10:27:05.659935Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:27:05.659935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Foundation Models: Concepts, Opportunities and Challenges","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Cheng Yang, Chuan Shi, Jiawei Liu, Junze Chen, Lichao Sun, Mengmei Zhang, Philip S. Yu, Ting Bai, Yibo Li, Yuan Fang, Zhiyuan Lu","submitted_at":"2023-10-18T09:31:21Z","abstract_excerpt":"Foundation models have emerged as critical components in a variety of artificial intelligence applications, and showcase significant success in natural language processing and several other domains. Meanwhile, the field of graph machine learning is witnessing a paradigm transition from shallow methods to more sophisticated deep learning approaches. The capabilities of foundation models in generalization and adaptation motivate graph machine learning researchers to discuss the potential of developing a new graph learning paradigm. This paradigm envisions models that are pre-trained on extensive"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.11829","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/2310.11829/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.11829","created_at":"2026-07-05T10:27:05.660014+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.11829v4","created_at":"2026-07-05T10:27:05.660014+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.11829","created_at":"2026-07-05T10:27:05.660014+00:00"},{"alias_kind":"pith_short_12","alias_value":"PDEVOUJT5T2V","created_at":"2026-07-05T10:27:05.660014+00:00"},{"alias_kind":"pith_short_16","alias_value":"PDEVOUJT5T2V666C","created_at":"2026-07-05T10:27:05.660014+00:00"},{"alias_kind":"pith_short_8","alias_value":"PDEVOUJT","created_at":"2026-07-05T10:27:05.660014+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":24,"is_internal_anchor":false},{"citing_arxiv_id":"2606.06285","citing_title":"TRACE: A Temporal Conditional Estimation for Multimodal Time Series Foundation Models","ref_index":13,"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":3,"is_internal_anchor":false},{"citing_arxiv_id":"2606.30009","citing_title":"Node-to-Neighborhood Semantic Consistency: Text-Topology Alignment for TAGs Anomaly Detection","ref_index":54,"is_internal_anchor":false},{"citing_arxiv_id":"2605.31031","citing_title":"GraphARC: A Comprehensive Benchmark for Graph-Based Abstract Reasoning","ref_index":18,"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":18,"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":18,"is_internal_anchor":false},{"citing_arxiv_id":"2501.00309","citing_title":"Retrieval-Augmented Generation with Graphs (GraphRAG)","ref_index":254,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12197","citing_title":"A Unified Graph Language Model for Multi-Domain Multi-Task Graph Alignment Instruction Tuning","ref_index":46,"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":7,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06522","citing_title":"Agentic AIs Are the Missing Paradigm for Out-of-Distribution Generalization in Foundation Models","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00731","citing_title":"Empowering Heterogeneous Graph Foundation Models via Decoupled Relation Alignment","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19793","citing_title":"SkillGraph: Graph Foundation Priors for LLM Agent Tool Sequence Recommendation","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PDEVOUJT5T2V666C4BMO4O6NHA","json":"https://pith.science/pith/PDEVOUJT5T2V666C4BMO4O6NHA.json","graph_json":"https://pith.science/api/pith-number/PDEVOUJT5T2V666C4BMO4O6NHA/graph.json","events_json":"https://pith.science/api/pith-number/PDEVOUJT5T2V666C4BMO4O6NHA/events.json","paper":"https://pith.science/paper/PDEVOUJT"},"agent_actions":{"view_html":"https://pith.science/pith/PDEVOUJT5T2V666C4BMO4O6NHA","download_json":"https://pith.science/pith/PDEVOUJT5T2V666C4BMO4O6NHA.json","view_paper":"https://pith.science/paper/PDEVOUJT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.11829&json=true","fetch_graph":"https://pith.science/api/pith-number/PDEVOUJT5T2V666C4BMO4O6NHA/graph.json","fetch_events":"https://pith.science/api/pith-number/PDEVOUJT5T2V666C4BMO4O6NHA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PDEVOUJT5T2V666C4BMO4O6NHA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PDEVOUJT5T2V666C4BMO4O6NHA/action/storage_attestation","attest_author":"https://pith.science/pith/PDEVOUJT5T2V666C4BMO4O6NHA/action/author_attestation","sign_citation":"https://pith.science/pith/PDEVOUJT5T2V666C4BMO4O6NHA/action/citation_signature","submit_replication":"https://pith.science/pith/PDEVOUJT5T2V666C4BMO4O6NHA/action/replication_record"}},"created_at":"2026-07-05T10:27:05.660014+00:00","updated_at":"2026-07-05T10:27:05.660014+00:00"}