{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ACOIXPA7KF36NC2EYX4WRIJXAM","short_pith_number":"pith:ACOIXPA7","schema_version":"1.0","canonical_sha256":"009c8bbc1f5177e68b44c5f968a137031e2aee3a187a91bc6ae2b97610d831a0","source":{"kind":"arxiv","id":"2501.18739","version":2},"attestation_state":"computed","paper":{"title":"Beyond Message Passing: Neural Graph Pattern Machine","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.SI"],"primary_cat":"cs.LG","authors_text":"Chuxu Zhang, Nitesh V Chawla, Tianyi Ma, Yanfang Ye, Zehong Wang, Zheyuan Zhang","submitted_at":"2025-01-30T20:37:47Z","abstract_excerpt":"Graph learning tasks often hinge on identifying key substructure patterns -- such as triadic closures in social networks or benzene rings in molecular graphs -- that underpin downstream performance. However, most existing graph neural networks (GNNs) rely on message passing, which aggregates local neighborhood information iteratively and struggles to explicitly capture such fundamental motifs, like triangles, k-cliques, and rings. This limitation hinders both expressiveness and long-range dependency modeling. In this paper, we introduce the Neural Graph Pattern Machine (GPM), a novel framework"},"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":"2501.18739","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-01-30T20:37:47Z","cross_cats_sorted":["cs.AI","cs.SI"],"title_canon_sha256":"24cb782c54480ef65e9f40484ef93fb7fde2bbe0d1b8ed664258d253d0274c3d","abstract_canon_sha256":"880a2a492feb906fa087cf66fd15d23be04fb4b606df819b429d60c0568504ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:09:07.285046Z","signature_b64":"oXJbnvZY0mH6UGB7e3ECErA3mYFIETTuxhe9RAgM1ZSL3tVemEfmdfsYaDOia0AKuvt1ISulqD5ScNtgpTtPBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"009c8bbc1f5177e68b44c5f968a137031e2aee3a187a91bc6ae2b97610d831a0","last_reissued_at":"2026-07-05T11:09:07.284458Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:09:07.284458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond Message Passing: Neural Graph Pattern Machine","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.SI"],"primary_cat":"cs.LG","authors_text":"Chuxu Zhang, Nitesh V Chawla, Tianyi Ma, Yanfang Ye, Zehong Wang, Zheyuan Zhang","submitted_at":"2025-01-30T20:37:47Z","abstract_excerpt":"Graph learning tasks often hinge on identifying key substructure patterns -- such as triadic closures in social networks or benzene rings in molecular graphs -- that underpin downstream performance. However, most existing graph neural networks (GNNs) rely on message passing, which aggregates local neighborhood information iteratively and struggles to explicitly capture such fundamental motifs, like triangles, k-cliques, and rings. This limitation hinders both expressiveness and long-range dependency modeling. In this paper, we introduce the Neural Graph Pattern Machine (GPM), a novel framework"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.18739","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/2501.18739/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":"2501.18739","created_at":"2026-07-05T11:09:07.284537+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.18739v2","created_at":"2026-07-05T11:09:07.284537+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.18739","created_at":"2026-07-05T11:09:07.284537+00:00"},{"alias_kind":"pith_short_12","alias_value":"ACOIXPA7KF36","created_at":"2026-07-05T11:09:07.284537+00:00"},{"alias_kind":"pith_short_16","alias_value":"ACOIXPA7KF36NC2E","created_at":"2026-07-05T11:09:07.284537+00:00"},{"alias_kind":"pith_short_8","alias_value":"ACOIXPA7","created_at":"2026-07-05T11:09:07.284537+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/ACOIXPA7KF36NC2EYX4WRIJXAM","json":"https://pith.science/pith/ACOIXPA7KF36NC2EYX4WRIJXAM.json","graph_json":"https://pith.science/api/pith-number/ACOIXPA7KF36NC2EYX4WRIJXAM/graph.json","events_json":"https://pith.science/api/pith-number/ACOIXPA7KF36NC2EYX4WRIJXAM/events.json","paper":"https://pith.science/paper/ACOIXPA7"},"agent_actions":{"view_html":"https://pith.science/pith/ACOIXPA7KF36NC2EYX4WRIJXAM","download_json":"https://pith.science/pith/ACOIXPA7KF36NC2EYX4WRIJXAM.json","view_paper":"https://pith.science/paper/ACOIXPA7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.18739&json=true","fetch_graph":"https://pith.science/api/pith-number/ACOIXPA7KF36NC2EYX4WRIJXAM/graph.json","fetch_events":"https://pith.science/api/pith-number/ACOIXPA7KF36NC2EYX4WRIJXAM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ACOIXPA7KF36NC2EYX4WRIJXAM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ACOIXPA7KF36NC2EYX4WRIJXAM/action/storage_attestation","attest_author":"https://pith.science/pith/ACOIXPA7KF36NC2EYX4WRIJXAM/action/author_attestation","sign_citation":"https://pith.science/pith/ACOIXPA7KF36NC2EYX4WRIJXAM/action/citation_signature","submit_replication":"https://pith.science/pith/ACOIXPA7KF36NC2EYX4WRIJXAM/action/replication_record"}},"created_at":"2026-07-05T11:09:07.284537+00:00","updated_at":"2026-07-05T11:09:07.284537+00:00"}