{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XEON45RKMSY5CVOSGRSZWBOPKC","short_pith_number":"pith:XEON45RK","schema_version":"1.0","canonical_sha256":"b91cde762a64b1d155d234659b05cf50ad13d2957ba585988573753960ee0ef5","source":{"kind":"arxiv","id":"2407.01635","version":7},"attestation_state":"computed","paper":{"title":"Commute Graph Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Guang Tan, Han Yu, Wei Zhuo, Xiaoxiao Li","submitted_at":"2024-06-30T10:53:40Z","abstract_excerpt":"Graph Neural Networks (GNNs) have shown remarkable success in learning from graph-structured data. However, their application to directed graphs (digraphs) presents unique challenges, primarily due to the inherent asymmetry in node relationships. Traditional GNNs are adept at capturing unidirectional relations but fall short in encoding the mutual path dependencies between nodes, such as asymmetrical shortest paths typically found in digraphs. Recognizing this gap, we introduce Commute Graph Neural Networks (CGNN), an approach that seamlessly integrates node-wise commute time into the message "},"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":"2407.01635","kind":"arxiv","version":7},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2024-06-30T10:53:40Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"84538db68f19b50cc70e642086a81544e1cd873ecc92d2cef4e49eb36b752d20","abstract_canon_sha256":"6d1c688a5be91da749dda33e6b53809e81b9d14207f7635c0a0ab8f979cc9753"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:03:15.431755Z","signature_b64":"EJBcwtObLOTKwMpXS2eoNV2q/niQSmua1rrwSX5iAXkfraSGcJhdVspNfvIoIJ1r5okHM4/DOPzM6aHy3eSsDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b91cde762a64b1d155d234659b05cf50ad13d2957ba585988573753960ee0ef5","last_reissued_at":"2026-07-05T11:03:15.431308Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:03:15.431308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Commute Graph Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Guang Tan, Han Yu, Wei Zhuo, Xiaoxiao Li","submitted_at":"2024-06-30T10:53:40Z","abstract_excerpt":"Graph Neural Networks (GNNs) have shown remarkable success in learning from graph-structured data. However, their application to directed graphs (digraphs) presents unique challenges, primarily due to the inherent asymmetry in node relationships. Traditional GNNs are adept at capturing unidirectional relations but fall short in encoding the mutual path dependencies between nodes, such as asymmetrical shortest paths typically found in digraphs. Recognizing this gap, we introduce Commute Graph Neural Networks (CGNN), an approach that seamlessly integrates node-wise commute time into the message "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.01635","kind":"arxiv","version":7},"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/2407.01635/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":"2407.01635","created_at":"2026-07-05T11:03:15.431379+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.01635v7","created_at":"2026-07-05T11:03:15.431379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.01635","created_at":"2026-07-05T11:03:15.431379+00:00"},{"alias_kind":"pith_short_12","alias_value":"XEON45RKMSY5","created_at":"2026-07-05T11:03:15.431379+00:00"},{"alias_kind":"pith_short_16","alias_value":"XEON45RKMSY5CVOS","created_at":"2026-07-05T11:03:15.431379+00:00"},{"alias_kind":"pith_short_8","alias_value":"XEON45RK","created_at":"2026-07-05T11:03:15.431379+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.08758","citing_title":"ScaleNet: Scale Invariance Learning in Directed Graphs","ref_index":42,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XEON45RKMSY5CVOSGRSZWBOPKC","json":"https://pith.science/pith/XEON45RKMSY5CVOSGRSZWBOPKC.json","graph_json":"https://pith.science/api/pith-number/XEON45RKMSY5CVOSGRSZWBOPKC/graph.json","events_json":"https://pith.science/api/pith-number/XEON45RKMSY5CVOSGRSZWBOPKC/events.json","paper":"https://pith.science/paper/XEON45RK"},"agent_actions":{"view_html":"https://pith.science/pith/XEON45RKMSY5CVOSGRSZWBOPKC","download_json":"https://pith.science/pith/XEON45RKMSY5CVOSGRSZWBOPKC.json","view_paper":"https://pith.science/paper/XEON45RK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.01635&json=true","fetch_graph":"https://pith.science/api/pith-number/XEON45RKMSY5CVOSGRSZWBOPKC/graph.json","fetch_events":"https://pith.science/api/pith-number/XEON45RKMSY5CVOSGRSZWBOPKC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XEON45RKMSY5CVOSGRSZWBOPKC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XEON45RKMSY5CVOSGRSZWBOPKC/action/storage_attestation","attest_author":"https://pith.science/pith/XEON45RKMSY5CVOSGRSZWBOPKC/action/author_attestation","sign_citation":"https://pith.science/pith/XEON45RKMSY5CVOSGRSZWBOPKC/action/citation_signature","submit_replication":"https://pith.science/pith/XEON45RKMSY5CVOSGRSZWBOPKC/action/replication_record"}},"created_at":"2026-07-05T11:03:15.431379+00:00","updated_at":"2026-07-05T11:03:15.431379+00:00"}