{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:66MVUZH7MDNCIIPMAX5CV5HDR7","short_pith_number":"pith:66MVUZH7","canonical_record":{"source":{"id":"2302.02926","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2023-02-06T16:59:25Z","cross_cats_sorted":[],"title_canon_sha256":"f0d59fd9cf3bc3af5977be800b222b5e0cdd4b40c5869f5283ac7615ed6f9e41","abstract_canon_sha256":"8e91208dbb9b1f86f95b431a2e50b8c1ae1d70682aa8dde9c42d006f2fb83481"},"schema_version":"1.0"},"canonical_sha256":"f7995a64ff60da2421ec05fa2af4e38fe7b12a108949ae5745b2ba5cd839a6a3","source":{"kind":"arxiv","id":"2302.02926","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.02926","created_at":"2026-07-05T07:55:19Z"},{"alias_kind":"arxiv_version","alias_value":"2302.02926v2","created_at":"2026-07-05T07:55:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.02926","created_at":"2026-07-05T07:55:19Z"},{"alias_kind":"pith_short_12","alias_value":"66MVUZH7MDNC","created_at":"2026-07-05T07:55:19Z"},{"alias_kind":"pith_short_16","alias_value":"66MVUZH7MDNCIIPM","created_at":"2026-07-05T07:55:19Z"},{"alias_kind":"pith_short_8","alias_value":"66MVUZH7","created_at":"2026-07-05T07:55:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:66MVUZH7MDNCIIPMAX5CV5HDR7","target":"record","payload":{"canonical_record":{"source":{"id":"2302.02926","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2023-02-06T16:59:25Z","cross_cats_sorted":[],"title_canon_sha256":"f0d59fd9cf3bc3af5977be800b222b5e0cdd4b40c5869f5283ac7615ed6f9e41","abstract_canon_sha256":"8e91208dbb9b1f86f95b431a2e50b8c1ae1d70682aa8dde9c42d006f2fb83481"},"schema_version":"1.0"},"canonical_sha256":"f7995a64ff60da2421ec05fa2af4e38fe7b12a108949ae5745b2ba5cd839a6a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:55:19.908290Z","signature_b64":"OAgEAuU/EkH6TDC8ZaDzDMtUTfPhV7ixDLvY1vyFeCJMfvXjjzObZ+7PDlSYbcAuZ5/sMB4cNjk4PsMvuZWIBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7995a64ff60da2421ec05fa2af4e38fe7b12a108949ae5745b2ba5cd839a6a3","last_reissued_at":"2026-07-05T07:55:19.907706Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:55:19.907706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.02926","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-05T07:55:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6cgc0BD5QB9h2bo9DzxeFtt0knaorzpa7Sp5YnLSJcrZV6Rsic+pkngnbGM6zKFXTLziBHI+Sf9326fXX1gUDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T16:59:34.317309Z"},"content_sha256":"64b27e8c9739515d730e72a1b621284dc514f477266c109bb64eb1e70635a6ec","schema_version":"1.0","event_id":"sha256:64b27e8c9739515d730e72a1b621284dc514f477266c109bb64eb1e70635a6ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:66MVUZH7MDNCIIPMAX5CV5HDR7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Curriculum Graph Machine Learning: A Survey","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Haoyang Li, Wenwu Zhu, Xin Wang","submitted_at":"2023-02-06T16:59:25Z","abstract_excerpt":"Graph machine learning has been extensively studied in both academia and industry. However, in the literature, most existing graph machine learning models are designed to conduct training with data samples in a random order, which may suffer from suboptimal performance due to ignoring the importance of different graph data samples and their training orders for the model optimization status. To tackle this critical problem, curriculum graph machine learning (Graph CL), which integrates the strength of graph machine learning and curriculum learning, arises and attracts an increasing amount of at"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.02926","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/2302.02926/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-05T07:55:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CY5Krx2X5szdPdmqb9stmynJOLYnquhdesNhnVUwNP5dOUICOIskF9HCbqlLuiaIpNr4yba2QuZFP1ZPbotACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T16:59:34.317843Z"},"content_sha256":"1bf597576cbdba9e8254ffa2033c260487810d6f551cb346d7b154161aa64339","schema_version":"1.0","event_id":"sha256:1bf597576cbdba9e8254ffa2033c260487810d6f551cb346d7b154161aa64339"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/66MVUZH7MDNCIIPMAX5CV5HDR7/bundle.json","state_url":"https://pith.science/pith/66MVUZH7MDNCIIPMAX5CV5HDR7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/66MVUZH7MDNCIIPMAX5CV5HDR7/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-08T16:59:34Z","links":{"resolver":"https://pith.science/pith/66MVUZH7MDNCIIPMAX5CV5HDR7","bundle":"https://pith.science/pith/66MVUZH7MDNCIIPMAX5CV5HDR7/bundle.json","state":"https://pith.science/pith/66MVUZH7MDNCIIPMAX5CV5HDR7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/66MVUZH7MDNCIIPMAX5CV5HDR7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:66MVUZH7MDNCIIPMAX5CV5HDR7","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":"8e91208dbb9b1f86f95b431a2e50b8c1ae1d70682aa8dde9c42d006f2fb83481","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2023-02-06T16:59:25Z","title_canon_sha256":"f0d59fd9cf3bc3af5977be800b222b5e0cdd4b40c5869f5283ac7615ed6f9e41"},"schema_version":"1.0","source":{"id":"2302.02926","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.02926","created_at":"2026-07-05T07:55:19Z"},{"alias_kind":"arxiv_version","alias_value":"2302.02926v2","created_at":"2026-07-05T07:55:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.02926","created_at":"2026-07-05T07:55:19Z"},{"alias_kind":"pith_short_12","alias_value":"66MVUZH7MDNC","created_at":"2026-07-05T07:55:19Z"},{"alias_kind":"pith_short_16","alias_value":"66MVUZH7MDNCIIPM","created_at":"2026-07-05T07:55:19Z"},{"alias_kind":"pith_short_8","alias_value":"66MVUZH7","created_at":"2026-07-05T07:55:19Z"}],"graph_snapshots":[{"event_id":"sha256:1bf597576cbdba9e8254ffa2033c260487810d6f551cb346d7b154161aa64339","target":"graph","created_at":"2026-07-05T07:55: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/2302.02926/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph machine learning has been extensively studied in both academia and industry. However, in the literature, most existing graph machine learning models are designed to conduct training with data samples in a random order, which may suffer from suboptimal performance due to ignoring the importance of different graph data samples and their training orders for the model optimization status. To tackle this critical problem, curriculum graph machine learning (Graph CL), which integrates the strength of graph machine learning and curriculum learning, arises and attracts an increasing amount of at","authors_text":"Haoyang Li, Wenwu Zhu, Xin Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2023-02-06T16:59:25Z","title":"Curriculum Graph Machine Learning: A Survey"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.02926","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:64b27e8c9739515d730e72a1b621284dc514f477266c109bb64eb1e70635a6ec","target":"record","created_at":"2026-07-05T07:55: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":"8e91208dbb9b1f86f95b431a2e50b8c1ae1d70682aa8dde9c42d006f2fb83481","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2023-02-06T16:59:25Z","title_canon_sha256":"f0d59fd9cf3bc3af5977be800b222b5e0cdd4b40c5869f5283ac7615ed6f9e41"},"schema_version":"1.0","source":{"id":"2302.02926","kind":"arxiv","version":2}},"canonical_sha256":"f7995a64ff60da2421ec05fa2af4e38fe7b12a108949ae5745b2ba5cd839a6a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7995a64ff60da2421ec05fa2af4e38fe7b12a108949ae5745b2ba5cd839a6a3","first_computed_at":"2026-07-05T07:55:19.907706Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:55:19.907706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OAgEAuU/EkH6TDC8ZaDzDMtUTfPhV7ixDLvY1vyFeCJMfvXjjzObZ+7PDlSYbcAuZ5/sMB4cNjk4PsMvuZWIBA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:55:19.908290Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.02926","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64b27e8c9739515d730e72a1b621284dc514f477266c109bb64eb1e70635a6ec","sha256:1bf597576cbdba9e8254ffa2033c260487810d6f551cb346d7b154161aa64339"],"state_sha256":"e10f3bcd231fbf4421447070cba4a887e267825127a34acdfb0520e83c10cb07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5xU6JnTn+Z9OSywZZ2CRbTwMYDgpmaEVlXGQwA7TZLOlwKyuIA206tp5NQj8rJ7fFIZ5/YkyeX2Kbh6ic9AZBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T16:59:34.324132Z","bundle_sha256":"d103af6a6f789b7ee32491d35a24f8cfddd83aad06970824b23a8f5e08139ad3"}}