{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:IFFGY5BYQBSMK5I7T6AGQS3KRC","short_pith_number":"pith:IFFGY5BY","canonical_record":{"source":{"id":"2505.12027","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-17T14:34:41Z","cross_cats_sorted":[],"title_canon_sha256":"9cc71090118996e041fa38efe3730b26595975e721682733b585313405e99ad7","abstract_canon_sha256":"254f5b6bb863807c5173e7bdb17342cea3fd71eec423c4ab74dab6fd813508d9"},"schema_version":"1.0"},"canonical_sha256":"414a6c74388064c5751f9f80684b6a88aba64a38adadd0feb882cba1eeed3b9c","source":{"kind":"arxiv","id":"2505.12027","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.12027","created_at":"2026-07-05T11:04:56Z"},{"alias_kind":"arxiv_version","alias_value":"2505.12027v1","created_at":"2026-07-05T11:04:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.12027","created_at":"2026-07-05T11:04:56Z"},{"alias_kind":"pith_short_12","alias_value":"IFFGY5BYQBSM","created_at":"2026-07-05T11:04:56Z"},{"alias_kind":"pith_short_16","alias_value":"IFFGY5BYQBSMK5I7","created_at":"2026-07-05T11:04:56Z"},{"alias_kind":"pith_short_8","alias_value":"IFFGY5BY","created_at":"2026-07-05T11:04:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:IFFGY5BYQBSMK5I7T6AGQS3KRC","target":"record","payload":{"canonical_record":{"source":{"id":"2505.12027","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-17T14:34:41Z","cross_cats_sorted":[],"title_canon_sha256":"9cc71090118996e041fa38efe3730b26595975e721682733b585313405e99ad7","abstract_canon_sha256":"254f5b6bb863807c5173e7bdb17342cea3fd71eec423c4ab74dab6fd813508d9"},"schema_version":"1.0"},"canonical_sha256":"414a6c74388064c5751f9f80684b6a88aba64a38adadd0feb882cba1eeed3b9c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:04:56.552028Z","signature_b64":"0EkthdUjwe7E6GTFz69ItcaAd4mTMdokVXQC+RqkbZiE9p+hBgYsc9vBT1S5mPY+lkltKiyuzEjCBvTE6xTxDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"414a6c74388064c5751f9f80684b6a88aba64a38adadd0feb882cba1eeed3b9c","last_reissued_at":"2026-07-05T11:04:56.551548Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:04:56.551548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.12027","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:04:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s4u0nNnxbrZmbZbavt6ruzMoP7gkBEcp/V9x7pDcmBcxXpvB3RJnUjkrEvMTDKUpTxLjffoZhtv4xd5QOnmWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T10:56:13.851893Z"},"content_sha256":"60c820b29b5b260b736ced4bd0836caed019c05747806ccccbfebea03f8ed529","schema_version":"1.0","event_id":"sha256:60c820b29b5b260b736ced4bd0836caed019c05747806ccccbfebea03f8ed529"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:IFFGY5BYQBSMK5I7T6AGQS3KRC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relation-Aware Graph Foundation Model","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hao Qian, Jianxiang Yu, Jiapeng Zhu, Xiang Li, Zhiqiang Zhang, Ziqi Liu","submitted_at":"2025-05-17T14:34:41Z","abstract_excerpt":"In recent years, large language models (LLMs) have demonstrated remarkable generalization capabilities across various natural language processing (NLP) tasks. Similarly, graph foundation models (GFMs) have emerged as a promising direction in graph learning, aiming to generalize across diverse datasets through large-scale pre-training. However, unlike language models that rely on explicit token representations, graphs lack a well-defined unit for generalization, making it challenging to design effective pre-training strategies. In this work, we propose REEF, a novel framework that leverages rel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.12027","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/2505.12027/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:04:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XN+C2b5FJooNIDHxpmRlhd7omKfLZdKSxlFNoBaJNVeIhX1LfNmuWPv4SgE5u00dhsWmRoWKFIx+xBvnVfQ9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T10:56:13.852460Z"},"content_sha256":"1786f26f738ba6e0e34b18d4f520b886aa77e3da1771dac8e33130ca97566c32","schema_version":"1.0","event_id":"sha256:1786f26f738ba6e0e34b18d4f520b886aa77e3da1771dac8e33130ca97566c32"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IFFGY5BYQBSMK5I7T6AGQS3KRC/bundle.json","state_url":"https://pith.science/pith/IFFGY5BYQBSMK5I7T6AGQS3KRC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IFFGY5BYQBSMK5I7T6AGQS3KRC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-22T10:56:13Z","links":{"resolver":"https://pith.science/pith/IFFGY5BYQBSMK5I7T6AGQS3KRC","bundle":"https://pith.science/pith/IFFGY5BYQBSMK5I7T6AGQS3KRC/bundle.json","state":"https://pith.science/pith/IFFGY5BYQBSMK5I7T6AGQS3KRC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IFFGY5BYQBSMK5I7T6AGQS3KRC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:IFFGY5BYQBSMK5I7T6AGQS3KRC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"254f5b6bb863807c5173e7bdb17342cea3fd71eec423c4ab74dab6fd813508d9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-17T14:34:41Z","title_canon_sha256":"9cc71090118996e041fa38efe3730b26595975e721682733b585313405e99ad7"},"schema_version":"1.0","source":{"id":"2505.12027","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.12027","created_at":"2026-07-05T11:04:56Z"},{"alias_kind":"arxiv_version","alias_value":"2505.12027v1","created_at":"2026-07-05T11:04:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.12027","created_at":"2026-07-05T11:04:56Z"},{"alias_kind":"pith_short_12","alias_value":"IFFGY5BYQBSM","created_at":"2026-07-05T11:04:56Z"},{"alias_kind":"pith_short_16","alias_value":"IFFGY5BYQBSMK5I7","created_at":"2026-07-05T11:04:56Z"},{"alias_kind":"pith_short_8","alias_value":"IFFGY5BY","created_at":"2026-07-05T11:04:56Z"}],"graph_snapshots":[{"event_id":"sha256:1786f26f738ba6e0e34b18d4f520b886aa77e3da1771dac8e33130ca97566c32","target":"graph","created_at":"2026-07-05T11:04:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.12027/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In recent years, large language models (LLMs) have demonstrated remarkable generalization capabilities across various natural language processing (NLP) tasks. Similarly, graph foundation models (GFMs) have emerged as a promising direction in graph learning, aiming to generalize across diverse datasets through large-scale pre-training. However, unlike language models that rely on explicit token representations, graphs lack a well-defined unit for generalization, making it challenging to design effective pre-training strategies. In this work, we propose REEF, a novel framework that leverages rel","authors_text":"Hao Qian, Jianxiang Yu, Jiapeng Zhu, Xiang Li, Zhiqiang Zhang, Ziqi Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-17T14:34:41Z","title":"Relation-Aware Graph Foundation Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.12027","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:60c820b29b5b260b736ced4bd0836caed019c05747806ccccbfebea03f8ed529","target":"record","created_at":"2026-07-05T11:04:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"254f5b6bb863807c5173e7bdb17342cea3fd71eec423c4ab74dab6fd813508d9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-17T14:34:41Z","title_canon_sha256":"9cc71090118996e041fa38efe3730b26595975e721682733b585313405e99ad7"},"schema_version":"1.0","source":{"id":"2505.12027","kind":"arxiv","version":1}},"canonical_sha256":"414a6c74388064c5751f9f80684b6a88aba64a38adadd0feb882cba1eeed3b9c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"414a6c74388064c5751f9f80684b6a88aba64a38adadd0feb882cba1eeed3b9c","first_computed_at":"2026-07-05T11:04:56.551548Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:04:56.551548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0EkthdUjwe7E6GTFz69ItcaAd4mTMdokVXQC+RqkbZiE9p+hBgYsc9vBT1S5mPY+lkltKiyuzEjCBvTE6xTxDw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:04:56.552028Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.12027","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:60c820b29b5b260b736ced4bd0836caed019c05747806ccccbfebea03f8ed529","sha256:1786f26f738ba6e0e34b18d4f520b886aa77e3da1771dac8e33130ca97566c32"],"state_sha256":"c6ba80d0c6cecbe51fdaaffe9b1092bb409f9b584f5dde0c2268a3880b33cd3e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cDSeKdS0QZSTMT/Rn6GmDUJ52eHOoFDTzKq+lRi9AjJht7yQg2bODdS8iTY2tsWlEapocF/Ysowh7oOORulYBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T10:56:13.857428Z","bundle_sha256":"f436d58ec9f4db0e3161f765339b29875b26d378e597e994de43ee9d4ccc7293"}}