{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SY4RBDIO22U2TUPPSYRE4PX3SB","short_pith_number":"pith:SY4RBDIO","schema_version":"1.0","canonical_sha256":"9639108d0ed6a9a9d1ef96224e3efb9056781c722d39bd84b4f25ac2ca017356","source":{"kind":"arxiv","id":"2408.10700","version":1},"attestation_state":"computed","paper":{"title":"AnyGraph: Graph Foundation Model in the Wild","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chao Huang, Lianghao Xia","submitted_at":"2024-08-20T09:57:13Z","abstract_excerpt":"The growing ubiquity of relational data structured as graphs has underscored the need for graph learning models with exceptional generalization capabilities. However, current approaches often struggle to effectively extract generalizable insights, frequently requiring extensive fine-tuning and limiting their versatility. Graph foundation models offer a transformative solution, with the potential to learn robust, generalizable representations from graph data. This enables more effective and adaptable applications across a wide spectrum of tasks and domains. In this work, we investigate a unifie"},"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":"2408.10700","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-08-20T09:57:13Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"07cd7e13cf55a4099b818f3d58454b98dd111cd0b26e7e421a82a795713d9779","abstract_canon_sha256":"b276dad193cb77a256122ceee089585e90be00987262292c6c9adf2437656a9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:57:16.120886Z","signature_b64":"GNhOGbrx0yt+drKKyrM+PwGFXVgAy0gIvqeg6Rzqg3K/z3xSE0nDqqhZtocu1gLxvpv7avTRvfnIxtdk9u7uCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9639108d0ed6a9a9d1ef96224e3efb9056781c722d39bd84b4f25ac2ca017356","last_reissued_at":"2026-07-05T08:57:16.120470Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:57:16.120470Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AnyGraph: Graph Foundation Model in the Wild","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chao Huang, Lianghao Xia","submitted_at":"2024-08-20T09:57:13Z","abstract_excerpt":"The growing ubiquity of relational data structured as graphs has underscored the need for graph learning models with exceptional generalization capabilities. However, current approaches often struggle to effectively extract generalizable insights, frequently requiring extensive fine-tuning and limiting their versatility. Graph foundation models offer a transformative solution, with the potential to learn robust, generalizable representations from graph data. This enables more effective and adaptable applications across a wide spectrum of tasks and domains. In this work, we investigate a unifie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.10700","kind":"arxiv","version":1},"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/2408.10700/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":"2408.10700","created_at":"2026-07-05T08:57:16.120524+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.10700v1","created_at":"2026-07-05T08:57:16.120524+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.10700","created_at":"2026-07-05T08:57:16.120524+00:00"},{"alias_kind":"pith_short_12","alias_value":"SY4RBDIO22U2","created_at":"2026-07-05T08:57:16.120524+00:00"},{"alias_kind":"pith_short_16","alias_value":"SY4RBDIO22U2TUPP","created_at":"2026-07-05T08:57:16.120524+00:00"},{"alias_kind":"pith_short_8","alias_value":"SY4RBDIO","created_at":"2026-07-05T08:57:16.120524+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24509","citing_title":"A Fair Evaluation of Graph Foundation Models for Node Property Prediction","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2606.32016","citing_title":"FedLAB: Traceable Semantic Codebooks for Federated Multimodal Graph Foundation Learning","ref_index":232,"is_internal_anchor":false},{"citing_arxiv_id":"2605.29828","citing_title":"When Do Graph Foundation Models Transfer? A Data-Centric Theory","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08291","citing_title":"Graph Computation Meets Circuit Algebra: A Task-Aligned Analysis of Graph Neural Networks for Electronic Design Automation","ref_index":78,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06576","citing_title":"On the Safety of Graph Representation Learning","ref_index":60,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04834","citing_title":"Bridging Input Feature Spaces Towards Graph Foundation Models","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SY4RBDIO22U2TUPPSYRE4PX3SB","json":"https://pith.science/pith/SY4RBDIO22U2TUPPSYRE4PX3SB.json","graph_json":"https://pith.science/api/pith-number/SY4RBDIO22U2TUPPSYRE4PX3SB/graph.json","events_json":"https://pith.science/api/pith-number/SY4RBDIO22U2TUPPSYRE4PX3SB/events.json","paper":"https://pith.science/paper/SY4RBDIO"},"agent_actions":{"view_html":"https://pith.science/pith/SY4RBDIO22U2TUPPSYRE4PX3SB","download_json":"https://pith.science/pith/SY4RBDIO22U2TUPPSYRE4PX3SB.json","view_paper":"https://pith.science/paper/SY4RBDIO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.10700&json=true","fetch_graph":"https://pith.science/api/pith-number/SY4RBDIO22U2TUPPSYRE4PX3SB/graph.json","fetch_events":"https://pith.science/api/pith-number/SY4RBDIO22U2TUPPSYRE4PX3SB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SY4RBDIO22U2TUPPSYRE4PX3SB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SY4RBDIO22U2TUPPSYRE4PX3SB/action/storage_attestation","attest_author":"https://pith.science/pith/SY4RBDIO22U2TUPPSYRE4PX3SB/action/author_attestation","sign_citation":"https://pith.science/pith/SY4RBDIO22U2TUPPSYRE4PX3SB/action/citation_signature","submit_replication":"https://pith.science/pith/SY4RBDIO22U2TUPPSYRE4PX3SB/action/replication_record"}},"created_at":"2026-07-05T08:57:16.120524+00:00","updated_at":"2026-07-05T08:57:16.120524+00:00"}