{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:UN6763CBXNTAF45XJ7NUSNKKS6","short_pith_number":"pith:UN6763CB","schema_version":"1.0","canonical_sha256":"a37dff6c41bb6602f3b74fdb49354a97844a24d40ffa74d7fd075107beb3e016","source":{"kind":"arxiv","id":"2402.13630","version":3},"attestation_state":"computed","paper":{"title":"UniGraph: Learning a Unified Cross-Domain Foundation Model for Text-Attributed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bryan Hooi, Xiaoxin He, Yuan Sui, Yufei He","submitted_at":"2024-02-21T09:06:31Z","abstract_excerpt":"Foundation models like ChatGPT and GPT-4 have revolutionized artificial intelligence, exhibiting remarkable abilities to generalize across a wide array of tasks and applications beyond their initial training objectives. However, graph learning has predominantly focused on single-graph models, tailored to specific tasks or datasets, lacking the ability to transfer learned knowledge to different domains. This limitation stems from the inherent complexity and diversity of graph structures, along with the different feature and label spaces specific to graph data. In this paper, we recognize text a"},"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.13630","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-21T09:06:31Z","cross_cats_sorted":[],"title_canon_sha256":"ac8a36218325e340386a73e082101ea6a67ffe91be931e0bce0d65c1ea85b4c9","abstract_canon_sha256":"d721cdcb403a077a0d6f21e5d6d758678780150f4c589c10bc60d5429a5b59a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:02:43.859467Z","signature_b64":"Gh3UuG5KAblUh9pdt/xwpA09EvDLJ6g9HFnynhlNRfyLxoT6FB5eqeQmoNsAlFERIYlrk6/TNNLTmO7e4LiLAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a37dff6c41bb6602f3b74fdb49354a97844a24d40ffa74d7fd075107beb3e016","last_reissued_at":"2026-07-05T10:02:43.858972Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:02:43.858972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"UniGraph: Learning a Unified Cross-Domain Foundation Model for Text-Attributed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bryan Hooi, Xiaoxin He, Yuan Sui, Yufei He","submitted_at":"2024-02-21T09:06:31Z","abstract_excerpt":"Foundation models like ChatGPT and GPT-4 have revolutionized artificial intelligence, exhibiting remarkable abilities to generalize across a wide array of tasks and applications beyond their initial training objectives. However, graph learning has predominantly focused on single-graph models, tailored to specific tasks or datasets, lacking the ability to transfer learned knowledge to different domains. This limitation stems from the inherent complexity and diversity of graph structures, along with the different feature and label spaces specific to graph data. In this paper, we recognize text a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.13630","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/2402.13630/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.13630","created_at":"2026-07-05T10:02:43.859029+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.13630v3","created_at":"2026-07-05T10:02:43.859029+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.13630","created_at":"2026-07-05T10:02:43.859029+00:00"},{"alias_kind":"pith_short_12","alias_value":"UN6763CBXNTA","created_at":"2026-07-05T10:02:43.859029+00:00"},{"alias_kind":"pith_short_16","alias_value":"UN6763CBXNTAF45X","created_at":"2026-07-05T10:02:43.859029+00:00"},{"alias_kind":"pith_short_8","alias_value":"UN6763CB","created_at":"2026-07-05T10:02:43.859029+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2504.20472","citing_title":"Robustness via Referencing: Defending against Prompt Injection Attacks by Referencing the Executed Instruction","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04834","citing_title":"Bridging Input Feature Spaces Towards Graph Foundation Models","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UN6763CBXNTAF45XJ7NUSNKKS6","json":"https://pith.science/pith/UN6763CBXNTAF45XJ7NUSNKKS6.json","graph_json":"https://pith.science/api/pith-number/UN6763CBXNTAF45XJ7NUSNKKS6/graph.json","events_json":"https://pith.science/api/pith-number/UN6763CBXNTAF45XJ7NUSNKKS6/events.json","paper":"https://pith.science/paper/UN6763CB"},"agent_actions":{"view_html":"https://pith.science/pith/UN6763CBXNTAF45XJ7NUSNKKS6","download_json":"https://pith.science/pith/UN6763CBXNTAF45XJ7NUSNKKS6.json","view_paper":"https://pith.science/paper/UN6763CB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.13630&json=true","fetch_graph":"https://pith.science/api/pith-number/UN6763CBXNTAF45XJ7NUSNKKS6/graph.json","fetch_events":"https://pith.science/api/pith-number/UN6763CBXNTAF45XJ7NUSNKKS6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UN6763CBXNTAF45XJ7NUSNKKS6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UN6763CBXNTAF45XJ7NUSNKKS6/action/storage_attestation","attest_author":"https://pith.science/pith/UN6763CBXNTAF45XJ7NUSNKKS6/action/author_attestation","sign_citation":"https://pith.science/pith/UN6763CBXNTAF45XJ7NUSNKKS6/action/citation_signature","submit_replication":"https://pith.science/pith/UN6763CBXNTAF45XJ7NUSNKKS6/action/replication_record"}},"created_at":"2026-07-05T10:02:43.859029+00:00","updated_at":"2026-07-05T10:02:43.859029+00:00"}