{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:U6EKBLR5WAJ4CT36HHP5MCCWAE","short_pith_number":"pith:U6EKBLR5","canonical_record":{"source":{"id":"2402.09603","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-14T22:23:35Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"e8fe3dceb16d5deeb5651dd42084647c3593ad00d0f9b379eb8d3e65285dec53","abstract_canon_sha256":"5c352c675ddea1d0e0e708b6aae28cefb53a6b1c30a875677817826d4f2c1fac"},"schema_version":"1.0"},"canonical_sha256":"a788a0ae3db013c14f7e39dfd6085601305e55d704b60c183dffe5c5b9286303","source":{"kind":"arxiv","id":"2402.09603","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.09603","created_at":"2026-07-05T07:45:19Z"},{"alias_kind":"arxiv_version","alias_value":"2402.09603v1","created_at":"2026-07-05T07:45:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.09603","created_at":"2026-07-05T07:45:19Z"},{"alias_kind":"pith_short_12","alias_value":"U6EKBLR5WAJ4","created_at":"2026-07-05T07:45:19Z"},{"alias_kind":"pith_short_16","alias_value":"U6EKBLR5WAJ4CT36","created_at":"2026-07-05T07:45:19Z"},{"alias_kind":"pith_short_8","alias_value":"U6EKBLR5","created_at":"2026-07-05T07:45:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:U6EKBLR5WAJ4CT36HHP5MCCWAE","target":"record","payload":{"canonical_record":{"source":{"id":"2402.09603","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-14T22:23:35Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"e8fe3dceb16d5deeb5651dd42084647c3593ad00d0f9b379eb8d3e65285dec53","abstract_canon_sha256":"5c352c675ddea1d0e0e708b6aae28cefb53a6b1c30a875677817826d4f2c1fac"},"schema_version":"1.0"},"canonical_sha256":"a788a0ae3db013c14f7e39dfd6085601305e55d704b60c183dffe5c5b9286303","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:45:19.042350Z","signature_b64":"HOLgMm0440n8jSbouy3k7CSJZKk3IJ8KOeHUb4xvbfq4YjwoBduBW1wDNFNLRncOUa2T75Pd115jNkYBav2xCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a788a0ae3db013c14f7e39dfd6085601305e55d704b60c183dffe5c5b9286303","last_reissued_at":"2026-07-05T07:45:19.041977Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:45:19.041977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.09603","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-05T07:45:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UyyZ1IkAq1XZrzvSgKaRaaBgbGbtjIon8ckGZWR0Zuy4u6Upr8GLcEHjrzgagcVR84JAjfybnnh7bEDjJ0YBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T05:09:39.000001Z"},"content_sha256":"35d44204c226f8fb78e1aca016d510dc32981adab8eaf1ce9fb1a9de46bce906","schema_version":"1.0","event_id":"sha256:35d44204c226f8fb78e1aca016d510dc32981adab8eaf1ce9fb1a9de46bce906"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:U6EKBLR5WAJ4CT36HHP5MCCWAE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Graph Self-Supervised Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Ali Ghodsi, Ali Saheb Pasand, Mahdi Biparva, Raika Karimi, Reza Moravej","submitted_at":"2024-02-14T22:23:35Z","abstract_excerpt":"In regularization Self-Supervised Learning (SSL) methods for graphs, computational complexity increases with the number of nodes in graphs and embedding dimensions. To mitigate the scalability of non-contrastive graph SSL, we propose a novel approach to reduce the cost of computing the covariance matrix for the pre-training loss function with volume-maximization terms. Our work focuses on reducing the cost associated with the loss computation via graph node or dimension sampling. We provide theoretical insight into why dimension sampling would result in accurate loss computations and support i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.09603","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/2402.09603/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:45:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E+zCIaynqeGpKa1HCZlQdHq1oR/ZLBejaafcruAB5hNQ/v7x4GuT3KLSzyjYKjs/JLq2k81g6kvrGg6xXe9qDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T05:09:39.000392Z"},"content_sha256":"9567fa562a2bd34da2afb3fa3658110038c480d87fa72616ef6d3e8c88ae66b8","schema_version":"1.0","event_id":"sha256:9567fa562a2bd34da2afb3fa3658110038c480d87fa72616ef6d3e8c88ae66b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U6EKBLR5WAJ4CT36HHP5MCCWAE/bundle.json","state_url":"https://pith.science/pith/U6EKBLR5WAJ4CT36HHP5MCCWAE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U6EKBLR5WAJ4CT36HHP5MCCWAE/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-18T05:09:39Z","links":{"resolver":"https://pith.science/pith/U6EKBLR5WAJ4CT36HHP5MCCWAE","bundle":"https://pith.science/pith/U6EKBLR5WAJ4CT36HHP5MCCWAE/bundle.json","state":"https://pith.science/pith/U6EKBLR5WAJ4CT36HHP5MCCWAE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U6EKBLR5WAJ4CT36HHP5MCCWAE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:U6EKBLR5WAJ4CT36HHP5MCCWAE","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":"5c352c675ddea1d0e0e708b6aae28cefb53a6b1c30a875677817826d4f2c1fac","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-14T22:23:35Z","title_canon_sha256":"e8fe3dceb16d5deeb5651dd42084647c3593ad00d0f9b379eb8d3e65285dec53"},"schema_version":"1.0","source":{"id":"2402.09603","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.09603","created_at":"2026-07-05T07:45:19Z"},{"alias_kind":"arxiv_version","alias_value":"2402.09603v1","created_at":"2026-07-05T07:45:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.09603","created_at":"2026-07-05T07:45:19Z"},{"alias_kind":"pith_short_12","alias_value":"U6EKBLR5WAJ4","created_at":"2026-07-05T07:45:19Z"},{"alias_kind":"pith_short_16","alias_value":"U6EKBLR5WAJ4CT36","created_at":"2026-07-05T07:45:19Z"},{"alias_kind":"pith_short_8","alias_value":"U6EKBLR5","created_at":"2026-07-05T07:45:19Z"}],"graph_snapshots":[{"event_id":"sha256:9567fa562a2bd34da2afb3fa3658110038c480d87fa72616ef6d3e8c88ae66b8","target":"graph","created_at":"2026-07-05T07:45: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/2402.09603/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In regularization Self-Supervised Learning (SSL) methods for graphs, computational complexity increases with the number of nodes in graphs and embedding dimensions. To mitigate the scalability of non-contrastive graph SSL, we propose a novel approach to reduce the cost of computing the covariance matrix for the pre-training loss function with volume-maximization terms. Our work focuses on reducing the cost associated with the loss computation via graph node or dimension sampling. We provide theoretical insight into why dimension sampling would result in accurate loss computations and support i","authors_text":"Ali Ghodsi, Ali Saheb Pasand, Mahdi Biparva, Raika Karimi, Reza Moravej","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-14T22:23:35Z","title":"Scalable Graph Self-Supervised Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.09603","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:35d44204c226f8fb78e1aca016d510dc32981adab8eaf1ce9fb1a9de46bce906","target":"record","created_at":"2026-07-05T07:45: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":"5c352c675ddea1d0e0e708b6aae28cefb53a6b1c30a875677817826d4f2c1fac","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-02-14T22:23:35Z","title_canon_sha256":"e8fe3dceb16d5deeb5651dd42084647c3593ad00d0f9b379eb8d3e65285dec53"},"schema_version":"1.0","source":{"id":"2402.09603","kind":"arxiv","version":1}},"canonical_sha256":"a788a0ae3db013c14f7e39dfd6085601305e55d704b60c183dffe5c5b9286303","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a788a0ae3db013c14f7e39dfd6085601305e55d704b60c183dffe5c5b9286303","first_computed_at":"2026-07-05T07:45:19.041977Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:45:19.041977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HOLgMm0440n8jSbouy3k7CSJZKk3IJ8KOeHUb4xvbfq4YjwoBduBW1wDNFNLRncOUa2T75Pd115jNkYBav2xCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:45:19.042350Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.09603","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35d44204c226f8fb78e1aca016d510dc32981adab8eaf1ce9fb1a9de46bce906","sha256:9567fa562a2bd34da2afb3fa3658110038c480d87fa72616ef6d3e8c88ae66b8"],"state_sha256":"4cdab49a482d8048febd291462ea01b22825863a8298d88fe274ddc1cf45209e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GXh6TZJA0IPqd69zhaTBuhz1g4fLFN83wdjegSIQxUXBY0BjRa4ojdbCTE4FZGtXIfchbe6u5qX1keEmx/RkBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T05:09:39.004084Z","bundle_sha256":"8bb956dc8bcf7b945a6801322f5c6ab1848a69647f1e429efd0acc46eccc875b"}}