{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5NPM77HFIGFD4HYMLRSU6XFGTR","short_pith_number":"pith:5NPM77HF","schema_version":"1.0","canonical_sha256":"eb5ecffce5418a3e1f0c5c654f5ca69c4362f165bb22830918f1c4151d40c3a2","source":{"kind":"arxiv","id":"2607.28525","version":1},"attestation_state":"computed","paper":{"title":"Same Graph Cross-Task Transfer in GNNs: Protocols and Predictors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Baris Coskunuzer, Murat Kantarcioglu, Neelam Akula, Surbhi Kumar","submitted_at":"2026-07-30T17:01:20Z","abstract_excerpt":"Many real-world graphs support multiple predictive tasks over the same underlying structure, creating an opportunity to reuse supervision across node classification (NC) and link prediction (LP). However, existing evaluations often rely on incompatible splits, observed-graph assumptions, and negative sampling rules, making conclusions about same-graph cross-task transfer unreliable. We formalize same-graph NC-LP transfer and propose a leakage-free protocol that fixes node and edge splits, uses a shared message-passing graph that excludes evaluated edges, and employs fixed negatives for LP. Acr"},"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":"2607.28525","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-30T17:01:20Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"13c7fb8d3783cfe4060d06844abf4157a92a4c710d2c51407983eb8d01a20825","abstract_canon_sha256":"303f7d04584d576a2fd45d663cc3c52f1f9fea8cbdc7241c0163540d39949cd1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb5ecffce5418a3e1f0c5c654f5ca69c4362f165bb22830918f1c4151d40c3a2","last_reissued_at":"2026-07-31T01:38:27.513405Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:38:27.513405Z"},"graph_snapshot":{"paper":{"title":"Same Graph Cross-Task Transfer in GNNs: Protocols and Predictors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Baris Coskunuzer, Murat Kantarcioglu, Neelam Akula, Surbhi Kumar","submitted_at":"2026-07-30T17:01:20Z","abstract_excerpt":"Many real-world graphs support multiple predictive tasks over the same underlying structure, creating an opportunity to reuse supervision across node classification (NC) and link prediction (LP). However, existing evaluations often rely on incompatible splits, observed-graph assumptions, and negative sampling rules, making conclusions about same-graph cross-task transfer unreliable. We formalize same-graph NC-LP transfer and propose a leakage-free protocol that fixes node and edge splits, uses a shared message-passing graph that excludes evaluated edges, and employs fixed negatives for LP. Acr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28525","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/2607.28525/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":"2607.28525","created_at":"2026-07-31T01:38:27.516845+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.28525v1","created_at":"2026-07-31T01:38:27.516845+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28525","created_at":"2026-07-31T01:38:27.516845+00:00"},{"alias_kind":"pith_short_12","alias_value":"5NPM77HFIGFD","created_at":"2026-07-31T01:38:27.516845+00:00"},{"alias_kind":"pith_short_16","alias_value":"5NPM77HFIGFD4HYM","created_at":"2026-07-31T01:38:27.516845+00:00"},{"alias_kind":"pith_short_8","alias_value":"5NPM77HF","created_at":"2026-07-31T01:38:27.516845+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/5NPM77HFIGFD4HYMLRSU6XFGTR","json":"https://pith.science/pith/5NPM77HFIGFD4HYMLRSU6XFGTR.json","graph_json":"https://pith.science/api/pith-number/5NPM77HFIGFD4HYMLRSU6XFGTR/graph.json","events_json":"https://pith.science/api/pith-number/5NPM77HFIGFD4HYMLRSU6XFGTR/events.json","paper":"https://pith.science/paper/5NPM77HF"},"agent_actions":{"view_html":"https://pith.science/pith/5NPM77HFIGFD4HYMLRSU6XFGTR","download_json":"https://pith.science/pith/5NPM77HFIGFD4HYMLRSU6XFGTR.json","view_paper":"https://pith.science/paper/5NPM77HF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.28525&json=true","fetch_graph":"https://pith.science/api/pith-number/5NPM77HFIGFD4HYMLRSU6XFGTR/graph.json","fetch_events":"https://pith.science/api/pith-number/5NPM77HFIGFD4HYMLRSU6XFGTR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5NPM77HFIGFD4HYMLRSU6XFGTR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5NPM77HFIGFD4HYMLRSU6XFGTR/action/storage_attestation","attest_author":"https://pith.science/pith/5NPM77HFIGFD4HYMLRSU6XFGTR/action/author_attestation","sign_citation":"https://pith.science/pith/5NPM77HFIGFD4HYMLRSU6XFGTR/action/citation_signature","submit_replication":"https://pith.science/pith/5NPM77HFIGFD4HYMLRSU6XFGTR/action/replication_record"}},"created_at":"2026-07-31T01:38:27.516845+00:00","updated_at":"2026-07-31T01:38:27.516845+00:00"}