{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:DTIMRK62XTRVNTJHWOPBZ2KAMP","short_pith_number":"pith:DTIMRK62","schema_version":"1.0","canonical_sha256":"1cd0c8abdabce356cd27b39e1ce94063ed715dab8f0c18585333852eb7a0e7da","source":{"kind":"arxiv","id":"2502.01684","version":4},"attestation_state":"computed","paper":{"title":"Predict, Cluster, Refine: A Joint Embedding Predictive Self-Supervised Framework for Graph Representation Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.SI"],"primary_cat":"cs.LG","authors_text":"Omkumar CU, Srinitish Srinivasan","submitted_at":"2025-02-02T07:42:45Z","abstract_excerpt":"Graph representation learning has emerged as a cornerstone for tasks like node classification and link prediction, yet prevailing self-supervised learning (SSL) methods face challenges such as computational inefficiency, reliance on contrastive objectives, and representation collapse. Existing approaches often depend on feature reconstruction, negative sampling, or complex decoders, which introduce training overhead and hinder generalization. Further, current techniques which address such limitations fail to account for the contribution of node embeddings to a certain prediction in the absence"},"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":"2502.01684","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-02T07:42:45Z","cross_cats_sorted":["cs.AI","cs.SI"],"title_canon_sha256":"04c744c415277ee5bdeb7a5917f6ffcf9291b85080c1b424a0a7db1e4cb0f31f","abstract_canon_sha256":"d20fca0931213b28ca06e506baca3ad49a43a39641744ba764fa6bf1dfdffab9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:03:45.379535Z","signature_b64":"DDfbmpGt7j5Cb/McVCPfPUJEcg+fKaigB4cgO4lGh2htncNGuxVTny0QQOhVnAjgE6XNZADazm+VoAh3vlujBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cd0c8abdabce356cd27b39e1ce94063ed715dab8f0c18585333852eb7a0e7da","last_reissued_at":"2026-07-05T12:03:45.379047Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:03:45.379047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Predict, Cluster, Refine: A Joint Embedding Predictive Self-Supervised Framework for Graph Representation Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.SI"],"primary_cat":"cs.LG","authors_text":"Omkumar CU, Srinitish Srinivasan","submitted_at":"2025-02-02T07:42:45Z","abstract_excerpt":"Graph representation learning has emerged as a cornerstone for tasks like node classification and link prediction, yet prevailing self-supervised learning (SSL) methods face challenges such as computational inefficiency, reliance on contrastive objectives, and representation collapse. Existing approaches often depend on feature reconstruction, negative sampling, or complex decoders, which introduce training overhead and hinder generalization. Further, current techniques which address such limitations fail to account for the contribution of node embeddings to a certain prediction in the absence"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.01684","kind":"arxiv","version":4},"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/2502.01684/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":"2502.01684","created_at":"2026-07-05T12:03:45.379106+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.01684v4","created_at":"2026-07-05T12:03:45.379106+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.01684","created_at":"2026-07-05T12:03:45.379106+00:00"},{"alias_kind":"pith_short_12","alias_value":"DTIMRK62XTRV","created_at":"2026-07-05T12:03:45.379106+00:00"},{"alias_kind":"pith_short_16","alias_value":"DTIMRK62XTRVNTJH","created_at":"2026-07-05T12:03:45.379106+00:00"},{"alias_kind":"pith_short_8","alias_value":"DTIMRK62","created_at":"2026-07-05T12:03:45.379106+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DTIMRK62XTRVNTJHWOPBZ2KAMP","json":"https://pith.science/pith/DTIMRK62XTRVNTJHWOPBZ2KAMP.json","graph_json":"https://pith.science/api/pith-number/DTIMRK62XTRVNTJHWOPBZ2KAMP/graph.json","events_json":"https://pith.science/api/pith-number/DTIMRK62XTRVNTJHWOPBZ2KAMP/events.json","paper":"https://pith.science/paper/DTIMRK62"},"agent_actions":{"view_html":"https://pith.science/pith/DTIMRK62XTRVNTJHWOPBZ2KAMP","download_json":"https://pith.science/pith/DTIMRK62XTRVNTJHWOPBZ2KAMP.json","view_paper":"https://pith.science/paper/DTIMRK62","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.01684&json=true","fetch_graph":"https://pith.science/api/pith-number/DTIMRK62XTRVNTJHWOPBZ2KAMP/graph.json","fetch_events":"https://pith.science/api/pith-number/DTIMRK62XTRVNTJHWOPBZ2KAMP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DTIMRK62XTRVNTJHWOPBZ2KAMP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DTIMRK62XTRVNTJHWOPBZ2KAMP/action/storage_attestation","attest_author":"https://pith.science/pith/DTIMRK62XTRVNTJHWOPBZ2KAMP/action/author_attestation","sign_citation":"https://pith.science/pith/DTIMRK62XTRVNTJHWOPBZ2KAMP/action/citation_signature","submit_replication":"https://pith.science/pith/DTIMRK62XTRVNTJHWOPBZ2KAMP/action/replication_record"}},"created_at":"2026-07-05T12:03:45.379106+00:00","updated_at":"2026-07-05T12:03:45.379106+00:00"}