{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SWY75CFLMZUS464BJD2KIJQLRM","short_pith_number":"pith:SWY75CFL","schema_version":"1.0","canonical_sha256":"95b1fe88ab66692e7b8148f4a4260b8b3916397d5df184ddff4ced21e85745a6","source":{"kind":"arxiv","id":"2402.09834","version":2},"attestation_state":"computed","paper":{"title":"All in One and One for All: A Simple yet Effective Method towards Cross-domain Graph Pretraining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aochuan Chen, Haihong Zhao, Hong Cheng, Jia Li, Xiangguo Sun","submitted_at":"2024-02-15T09:55:39Z","abstract_excerpt":"Large Language Models (LLMs) have revolutionized the fields of computer vision (CV) and natural language processing (NLP). One of the most notable advancements of LLMs is that a single model is trained on vast and diverse datasets spanning multiple domains -- a paradigm we term `All in One'. This methodology empowers LLMs with super generalization capabilities, facilitating an encompassing comprehension of varied data distributions. Leveraging these capabilities, a single LLM demonstrates remarkable versatility across a variety of domains -- a paradigm we term `One for All'. However, applying "},"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":"2402.09834","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-15T09:55:39Z","cross_cats_sorted":[],"title_canon_sha256":"5c83a3c3730da2e096e4718c6fca3d8f5f1341167972495c866abed307bb0c9a","abstract_canon_sha256":"105bc29c22dc43c530a6e8b9e9cd9a5306cbec29c17347d6d66ffd50e9162a28"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:35:41.887690Z","signature_b64":"7tJkMoWtIxWHH9j+pkQvowXFGMucXQkghSbCvLw/HPdftYwUMpZ0slbPPukCL96DYkD8dn7VFwF0GZZNsKo7DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95b1fe88ab66692e7b8148f4a4260b8b3916397d5df184ddff4ced21e85745a6","last_reissued_at":"2026-07-05T08:35:41.887235Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:35:41.887235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"All in One and One for All: A Simple yet Effective Method towards Cross-domain Graph Pretraining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aochuan Chen, Haihong Zhao, Hong Cheng, Jia Li, Xiangguo Sun","submitted_at":"2024-02-15T09:55:39Z","abstract_excerpt":"Large Language Models (LLMs) have revolutionized the fields of computer vision (CV) and natural language processing (NLP). One of the most notable advancements of LLMs is that a single model is trained on vast and diverse datasets spanning multiple domains -- a paradigm we term `All in One'. This methodology empowers LLMs with super generalization capabilities, facilitating an encompassing comprehension of varied data distributions. Leveraging these capabilities, a single LLM demonstrates remarkable versatility across a variety of domains -- a paradigm we term `One for All'. However, applying "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.09834","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/2402.09834/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":"2402.09834","created_at":"2026-07-05T08:35:41.887297+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.09834v2","created_at":"2026-07-05T08:35:41.887297+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.09834","created_at":"2026-07-05T08:35:41.887297+00:00"},{"alias_kind":"pith_short_12","alias_value":"SWY75CFLMZUS","created_at":"2026-07-05T08:35:41.887297+00:00"},{"alias_kind":"pith_short_16","alias_value":"SWY75CFLMZUS464B","created_at":"2026-07-05T08:35:41.887297+00:00"},{"alias_kind":"pith_short_8","alias_value":"SWY75CFL","created_at":"2026-07-05T08:35:41.887297+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.17667","citing_title":"Handling Feature Heterogeneity with Learnable Graph Patches","ref_index":68,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SWY75CFLMZUS464BJD2KIJQLRM","json":"https://pith.science/pith/SWY75CFLMZUS464BJD2KIJQLRM.json","graph_json":"https://pith.science/api/pith-number/SWY75CFLMZUS464BJD2KIJQLRM/graph.json","events_json":"https://pith.science/api/pith-number/SWY75CFLMZUS464BJD2KIJQLRM/events.json","paper":"https://pith.science/paper/SWY75CFL"},"agent_actions":{"view_html":"https://pith.science/pith/SWY75CFLMZUS464BJD2KIJQLRM","download_json":"https://pith.science/pith/SWY75CFLMZUS464BJD2KIJQLRM.json","view_paper":"https://pith.science/paper/SWY75CFL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.09834&json=true","fetch_graph":"https://pith.science/api/pith-number/SWY75CFLMZUS464BJD2KIJQLRM/graph.json","fetch_events":"https://pith.science/api/pith-number/SWY75CFLMZUS464BJD2KIJQLRM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SWY75CFLMZUS464BJD2KIJQLRM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SWY75CFLMZUS464BJD2KIJQLRM/action/storage_attestation","attest_author":"https://pith.science/pith/SWY75CFLMZUS464BJD2KIJQLRM/action/author_attestation","sign_citation":"https://pith.science/pith/SWY75CFLMZUS464BJD2KIJQLRM/action/citation_signature","submit_replication":"https://pith.science/pith/SWY75CFLMZUS464BJD2KIJQLRM/action/replication_record"}},"created_at":"2026-07-05T08:35:41.887297+00:00","updated_at":"2026-07-05T08:35:41.887297+00:00"}