{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:7SGMG7ZA6EHD4KDUV5CALKPPH3","short_pith_number":"pith:7SGMG7ZA","canonical_record":{"source":{"id":"2504.16748","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-04-23T14:17:28Z","cross_cats_sorted":[],"title_canon_sha256":"f531121567a9e177ee4af08e9ca548bf7566816336a34445209a6f06c49e2e3d","abstract_canon_sha256":"ea47fec015fbbf9c2656c93ae00a5250b46fa3c76cb34bc54f26d74c41af6a88"},"schema_version":"1.0"},"canonical_sha256":"fc8cc37f20f10e3e2874af4405a9ef3ecfa44dc26140b83bb9c6d862dd088916","source":{"kind":"arxiv","id":"2504.16748","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.16748","created_at":"2026-07-05T10:53:19Z"},{"alias_kind":"arxiv_version","alias_value":"2504.16748v2","created_at":"2026-07-05T10:53:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.16748","created_at":"2026-07-05T10:53:19Z"},{"alias_kind":"pith_short_12","alias_value":"7SGMG7ZA6EHD","created_at":"2026-07-05T10:53:19Z"},{"alias_kind":"pith_short_16","alias_value":"7SGMG7ZA6EHD4KDU","created_at":"2026-07-05T10:53:19Z"},{"alias_kind":"pith_short_8","alias_value":"7SGMG7ZA","created_at":"2026-07-05T10:53:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:7SGMG7ZA6EHD4KDUV5CALKPPH3","target":"record","payload":{"canonical_record":{"source":{"id":"2504.16748","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-04-23T14:17:28Z","cross_cats_sorted":[],"title_canon_sha256":"f531121567a9e177ee4af08e9ca548bf7566816336a34445209a6f06c49e2e3d","abstract_canon_sha256":"ea47fec015fbbf9c2656c93ae00a5250b46fa3c76cb34bc54f26d74c41af6a88"},"schema_version":"1.0"},"canonical_sha256":"fc8cc37f20f10e3e2874af4405a9ef3ecfa44dc26140b83bb9c6d862dd088916","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:53:19.036280Z","signature_b64":"8pFoLmUPVYea+hQkjLMZDufk1DPYDnMloqNf7hbY86dWCpsep7HNZz/paSzgvi6q8vdHjlvif5geMcM4GEGiDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc8cc37f20f10e3e2874af4405a9ef3ecfa44dc26140b83bb9c6d862dd088916","last_reissued_at":"2026-07-05T10:53:19.035769Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:53:19.035769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.16748","source_version":2,"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-05T10:53:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i++woK12HUaPpimfOF4PtvICcZ0YU2gA5Gb09yn8aTVGZHhR5igQ6uyM4d59bScfFU3INiXxnjTL3R1wRq8BCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T01:59:14.889884Z"},"content_sha256":"f6485dff7328d066bd1899e283dbe5181bb65c304ef4f32a6b5153513a6f47f6","schema_version":"1.0","event_id":"sha256:f6485dff7328d066bd1899e283dbe5181bb65c304ef4f32a6b5153513a6f47f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:7SGMG7ZA6EHD4KDUV5CALKPPH3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simple Graph Contrastive Learning via Fractional-order Neural Diffusion Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Feng Ji, Kai Zhao, Qiyu Kang, Wee Peng Tay, Wenfei Liang, Xingchao Jian, Xuhao Li, Yahya Alkhatib, Yanan Zhao","submitted_at":"2025-04-23T14:17:28Z","abstract_excerpt":"Graph Contrastive Learning (GCL) has recently made progress as an unsupervised graph representation learning paradigm. GCL approaches can be categorized into augmentation-based and augmentation-free methods. The former relies on complex data augmentations, while the latter depends on encoders that can generate distinct views of the same input. Both approaches may require negative samples for training. In this paper, we introduce a novel augmentation-free GCL framework based on graph neural diffusion models. Specifically, we utilize learnable encoders governed by Fractional Differential Equatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.16748","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/2504.16748/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-05T10:53:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2P0wH4kSt3s6c5AafGBOFllSmO1K19a1sCENUlUeGrgez7FM3nGOTdJEnGIfGZNZUTpzm8qCUwc7azZYnkr7Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T01:59:14.890510Z"},"content_sha256":"0b2d277d95dfdc456fe9026cdc779e84c898ae4a8e5b187d695adc586220bc35","schema_version":"1.0","event_id":"sha256:0b2d277d95dfdc456fe9026cdc779e84c898ae4a8e5b187d695adc586220bc35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7SGMG7ZA6EHD4KDUV5CALKPPH3/bundle.json","state_url":"https://pith.science/pith/7SGMG7ZA6EHD4KDUV5CALKPPH3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7SGMG7ZA6EHD4KDUV5CALKPPH3/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-19T01:59:14Z","links":{"resolver":"https://pith.science/pith/7SGMG7ZA6EHD4KDUV5CALKPPH3","bundle":"https://pith.science/pith/7SGMG7ZA6EHD4KDUV5CALKPPH3/bundle.json","state":"https://pith.science/pith/7SGMG7ZA6EHD4KDUV5CALKPPH3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7SGMG7ZA6EHD4KDUV5CALKPPH3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:7SGMG7ZA6EHD4KDUV5CALKPPH3","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":"ea47fec015fbbf9c2656c93ae00a5250b46fa3c76cb34bc54f26d74c41af6a88","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-04-23T14:17:28Z","title_canon_sha256":"f531121567a9e177ee4af08e9ca548bf7566816336a34445209a6f06c49e2e3d"},"schema_version":"1.0","source":{"id":"2504.16748","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.16748","created_at":"2026-07-05T10:53:19Z"},{"alias_kind":"arxiv_version","alias_value":"2504.16748v2","created_at":"2026-07-05T10:53:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.16748","created_at":"2026-07-05T10:53:19Z"},{"alias_kind":"pith_short_12","alias_value":"7SGMG7ZA6EHD","created_at":"2026-07-05T10:53:19Z"},{"alias_kind":"pith_short_16","alias_value":"7SGMG7ZA6EHD4KDU","created_at":"2026-07-05T10:53:19Z"},{"alias_kind":"pith_short_8","alias_value":"7SGMG7ZA","created_at":"2026-07-05T10:53:19Z"}],"graph_snapshots":[{"event_id":"sha256:0b2d277d95dfdc456fe9026cdc779e84c898ae4a8e5b187d695adc586220bc35","target":"graph","created_at":"2026-07-05T10:53:19Z","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/2504.16748/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph Contrastive Learning (GCL) has recently made progress as an unsupervised graph representation learning paradigm. GCL approaches can be categorized into augmentation-based and augmentation-free methods. The former relies on complex data augmentations, while the latter depends on encoders that can generate distinct views of the same input. Both approaches may require negative samples for training. In this paper, we introduce a novel augmentation-free GCL framework based on graph neural diffusion models. Specifically, we utilize learnable encoders governed by Fractional Differential Equatio","authors_text":"Feng Ji, Kai Zhao, Qiyu Kang, Wee Peng Tay, Wenfei Liang, Xingchao Jian, Xuhao Li, Yahya Alkhatib, Yanan Zhao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-04-23T14:17:28Z","title":"Simple Graph Contrastive Learning via Fractional-order Neural Diffusion Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.16748","kind":"arxiv","version":2},"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:f6485dff7328d066bd1899e283dbe5181bb65c304ef4f32a6b5153513a6f47f6","target":"record","created_at":"2026-07-05T10:53:19Z","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":"ea47fec015fbbf9c2656c93ae00a5250b46fa3c76cb34bc54f26d74c41af6a88","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-04-23T14:17:28Z","title_canon_sha256":"f531121567a9e177ee4af08e9ca548bf7566816336a34445209a6f06c49e2e3d"},"schema_version":"1.0","source":{"id":"2504.16748","kind":"arxiv","version":2}},"canonical_sha256":"fc8cc37f20f10e3e2874af4405a9ef3ecfa44dc26140b83bb9c6d862dd088916","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc8cc37f20f10e3e2874af4405a9ef3ecfa44dc26140b83bb9c6d862dd088916","first_computed_at":"2026-07-05T10:53:19.035769Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:53:19.035769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8pFoLmUPVYea+hQkjLMZDufk1DPYDnMloqNf7hbY86dWCpsep7HNZz/paSzgvi6q8vdHjlvif5geMcM4GEGiDg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:53:19.036280Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.16748","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6485dff7328d066bd1899e283dbe5181bb65c304ef4f32a6b5153513a6f47f6","sha256:0b2d277d95dfdc456fe9026cdc779e84c898ae4a8e5b187d695adc586220bc35"],"state_sha256":"8b5fe66ce7f9f3fab0398f7ced6892cf38f1969021d54f0a3f59bdf069e36574"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/K61N25my7d1+uM2BLN8DHptuWe1bol8t1IsC61ZGKqOwoySj5pypHOaalQli8jL8et8g/IpXCMCktXDCC+GBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T01:59:14.895590Z","bundle_sha256":"940c3c91246f761f6835ec9ee52b9e97c720be56d511fdc850121030453a6e3d"}}