{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:H2O7K2TZM7YAB5FVUOMUCRPE5D","short_pith_number":"pith:H2O7K2TZ","canonical_record":{"source":{"id":"1904.10996","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-24T18:20:15Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","cs.SI","stat.ML"],"title_canon_sha256":"94d0af879a8a313e52576fdb69e31916e53d65295d6371f2c219d74fbc118f7c","abstract_canon_sha256":"bb90ba49028004a5c1789cddba0713384f47b59f2a4b3a8f6ec2086d12e1df62"},"schema_version":"1.0"},"canonical_sha256":"3e9df56a7967f000f4b5a3994145e4e8e508230e7dcae4ec30caae1db00df1c6","source":{"kind":"arxiv","id":"1904.10996","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.10996","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"arxiv_version","alias_value":"1904.10996v1","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10996","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"pith_short_12","alias_value":"H2O7K2TZM7YA","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"H2O7K2TZM7YAB5FV","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"H2O7K2TZ","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:H2O7K2TZM7YAB5FVUOMUCRPE5D","target":"record","payload":{"canonical_record":{"source":{"id":"1904.10996","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-24T18:20:15Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","cs.SI","stat.ML"],"title_canon_sha256":"94d0af879a8a313e52576fdb69e31916e53d65295d6371f2c219d74fbc118f7c","abstract_canon_sha256":"bb90ba49028004a5c1789cddba0713384f47b59f2a4b3a8f6ec2086d12e1df62"},"schema_version":"1.0"},"canonical_sha256":"3e9df56a7967f000f4b5a3994145e4e8e508230e7dcae4ec30caae1db00df1c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:10.922474Z","signature_b64":"Xy5x5gyIvLWU/ld7K+xeusospmeAC07HN77bCduYdUpi8v840oMyXte83U+saRNqzgZqJpMwPkkeW+g199y8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e9df56a7967f000f4b5a3994145e4e8e508230e7dcae4ec30caae1db00df1c6","last_reissued_at":"2026-05-17T23:40:10.921812Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:10.921812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.10996","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-05-17T23:40:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8pxe/5I9Kto9EkFSEmPunHtv944ayQjbXYSBvfVtaRHCI6ignrCkteBhkNtLdJX1gYNozZRqoN8HHgFe7bNuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:09:42.112000Z"},"content_sha256":"a05c20e4913e7825dae05481353305dc7e76e25adf10b4207145b6147e869ec2","schema_version":"1.0","event_id":"sha256:a05c20e4913e7825dae05481353305dc7e76e25adf10b4207145b6147e869ec2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:H2O7K2TZM7YAB5FVUOMUCRPE5D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PAN: Path Integral Based Convolution for Deep Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ming Li, Yuguang Wang, Zheng Ma","submitted_at":"2019-04-24T18:20:15Z","abstract_excerpt":"Convolution operations designed for graph-structured data usually utilize the graph Laplacian, which can be seen as message passing between the adjacent neighbors through a generic random walk. In this paper, we propose PAN, a new graph convolution framework that involves every path linking the message sender and receiver with learnable weights depending on the path length, which corresponds to the maximal entropy random walk. PAN generalizes the graph Laplacian to a new transition matrix we call \\emph{maximal entropy transition} (MET) matrix derived from a path integral formalism. Most previo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.10996","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":""},"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-05-17T23:40:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7492BWupcSYqGIcvXZ2hyLxUImgaG3ZZe2V+yQACEfQucK50xEofMyPscO32SxQxUR8KryNXcW3AHMadS9SbAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:09:42.112361Z"},"content_sha256":"f8308a66cf6fa16ca867cba5896d200e5bc27f7d51eea05c0afd281560079a04","schema_version":"1.0","event_id":"sha256:f8308a66cf6fa16ca867cba5896d200e5bc27f7d51eea05c0afd281560079a04"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H2O7K2TZM7YAB5FVUOMUCRPE5D/bundle.json","state_url":"https://pith.science/pith/H2O7K2TZM7YAB5FVUOMUCRPE5D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H2O7K2TZM7YAB5FVUOMUCRPE5D/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-05-28T23:09:42Z","links":{"resolver":"https://pith.science/pith/H2O7K2TZM7YAB5FVUOMUCRPE5D","bundle":"https://pith.science/pith/H2O7K2TZM7YAB5FVUOMUCRPE5D/bundle.json","state":"https://pith.science/pith/H2O7K2TZM7YAB5FVUOMUCRPE5D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H2O7K2TZM7YAB5FVUOMUCRPE5D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:H2O7K2TZM7YAB5FVUOMUCRPE5D","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":"bb90ba49028004a5c1789cddba0713384f47b59f2a4b3a8f6ec2086d12e1df62","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-24T18:20:15Z","title_canon_sha256":"94d0af879a8a313e52576fdb69e31916e53d65295d6371f2c219d74fbc118f7c"},"schema_version":"1.0","source":{"id":"1904.10996","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.10996","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"arxiv_version","alias_value":"1904.10996v1","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10996","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"pith_short_12","alias_value":"H2O7K2TZM7YA","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"H2O7K2TZM7YAB5FV","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"H2O7K2TZ","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:f8308a66cf6fa16ca867cba5896d200e5bc27f7d51eea05c0afd281560079a04","target":"graph","created_at":"2026-05-17T23:40:10Z","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"},"paper":{"abstract_excerpt":"Convolution operations designed for graph-structured data usually utilize the graph Laplacian, which can be seen as message passing between the adjacent neighbors through a generic random walk. In this paper, we propose PAN, a new graph convolution framework that involves every path linking the message sender and receiver with learnable weights depending on the path length, which corresponds to the maximal entropy random walk. PAN generalizes the graph Laplacian to a new transition matrix we call \\emph{maximal entropy transition} (MET) matrix derived from a path integral formalism. Most previo","authors_text":"Ming Li, Yuguang Wang, Zheng Ma","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","cs.SI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-24T18:20:15Z","title":"PAN: Path Integral Based Convolution for Deep Graph Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.10996","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:a05c20e4913e7825dae05481353305dc7e76e25adf10b4207145b6147e869ec2","target":"record","created_at":"2026-05-17T23:40:10Z","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":"bb90ba49028004a5c1789cddba0713384f47b59f2a4b3a8f6ec2086d12e1df62","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-24T18:20:15Z","title_canon_sha256":"94d0af879a8a313e52576fdb69e31916e53d65295d6371f2c219d74fbc118f7c"},"schema_version":"1.0","source":{"id":"1904.10996","kind":"arxiv","version":1}},"canonical_sha256":"3e9df56a7967f000f4b5a3994145e4e8e508230e7dcae4ec30caae1db00df1c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e9df56a7967f000f4b5a3994145e4e8e508230e7dcae4ec30caae1db00df1c6","first_computed_at":"2026-05-17T23:40:10.921812Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:10.921812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xy5x5gyIvLWU/ld7K+xeusospmeAC07HN77bCduYdUpi8v840oMyXte83U+saRNqzgZqJpMwPkkeW+g199y8Dg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:10.922474Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.10996","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a05c20e4913e7825dae05481353305dc7e76e25adf10b4207145b6147e869ec2","sha256:f8308a66cf6fa16ca867cba5896d200e5bc27f7d51eea05c0afd281560079a04"],"state_sha256":"5dc4ac1cabc71ae79cd60f4f85db3b6d1af17df393bc08b147f763a92a5f2e55"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZTb/SF+8u/395fN/zqco9SE5JAuAs/p4WsjbSVQ1Q2GbdC2pekD94bCVptnC8fPgMzW0PZk8CFIJtckrNjR/Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T23:09:42.114413Z","bundle_sha256":"5b946c6e440bce74034a2319116834cb974e5bc19bc9c01635f3a622db455bb1"}}