{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:A5MVBBD7MS23CB67INOPBVU6DD","short_pith_number":"pith:A5MVBBD7","canonical_record":{"source":{"id":"2506.06728","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2025-06-07T09:25:54Z","cross_cats_sorted":[],"title_canon_sha256":"d8a39f6950aae9e888294cc0fc213b1b5159d3cc996c2a4ece7cf93d49f04316","abstract_canon_sha256":"0c91026f28c6f7085c28be845283fe9fc4f1bbd1b391414065b1951f81fa811d"},"schema_version":"1.0"},"canonical_sha256":"075950847f64b5b107df435cf0d69e18ddacbbb476d64f58a9bcb964562d2f93","source":{"kind":"arxiv","id":"2506.06728","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.06728","created_at":"2026-07-05T11:17:54Z"},{"alias_kind":"arxiv_version","alias_value":"2506.06728v1","created_at":"2026-07-05T11:17:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.06728","created_at":"2026-07-05T11:17:54Z"},{"alias_kind":"pith_short_12","alias_value":"A5MVBBD7MS23","created_at":"2026-07-05T11:17:54Z"},{"alias_kind":"pith_short_16","alias_value":"A5MVBBD7MS23CB67","created_at":"2026-07-05T11:17:54Z"},{"alias_kind":"pith_short_8","alias_value":"A5MVBBD7","created_at":"2026-07-05T11:17:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:A5MVBBD7MS23CB67INOPBVU6DD","target":"record","payload":{"canonical_record":{"source":{"id":"2506.06728","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2025-06-07T09:25:54Z","cross_cats_sorted":[],"title_canon_sha256":"d8a39f6950aae9e888294cc0fc213b1b5159d3cc996c2a4ece7cf93d49f04316","abstract_canon_sha256":"0c91026f28c6f7085c28be845283fe9fc4f1bbd1b391414065b1951f81fa811d"},"schema_version":"1.0"},"canonical_sha256":"075950847f64b5b107df435cf0d69e18ddacbbb476d64f58a9bcb964562d2f93","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:17:54.667286Z","signature_b64":"EF5xVPvRW5/vC/yEltaMN530W9h0JKLftYwrd6C5t7wNcyVWDWnEYR+6gCWkT0zrVO/MWvV5Ct1TjFGFJbVRDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"075950847f64b5b107df435cf0d69e18ddacbbb476d64f58a9bcb964562d2f93","last_reissued_at":"2026-07-05T11:17:54.666862Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:17:54.666862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.06728","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-07-05T11:17:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fh3txZQC+6GBopZfv1IoihMhkRyQjU14hbE8Kx3cey2w6VTentHpRwDrAr3mqX2TNsBSIvp94kO+Bep4OVdVCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T21:50:01.211002Z"},"content_sha256":"21f1aa1beb73bf72ef22f06d20e4ffd01f2b9013e4dde400d4eed50da1041ea0","schema_version":"1.0","event_id":"sha256:21f1aa1beb73bf72ef22f06d20e4ffd01f2b9013e4dde400d4eed50da1041ea0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:A5MVBBD7MS23CB67INOPBVU6DD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neighborhood Overlap-Aware High-Order Graph Neural Network for Dynamic Graph Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Ling Wang","submitted_at":"2025-06-07T09:25:54Z","abstract_excerpt":"Dynamic graph learning (DGL) aims to learn informative and temporally-evolving node embeddings to support downstream tasks such as link prediction. A fundamental challenge in DGL lies in effectively modeling both the temporal dynamics and structural dependencies of evolving graph topologies. Recent advances in Dynamic Graph Neural Networks (DGNNs) have obtained remarkable success by leveraging message-passing mechanisms to capture pairwise node interactions. However, these approaches often overlook more complex structural patterns, particularly neighborhood overlap, which can play a critical r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.06728","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/2506.06728/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"},"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-07-05T11:17:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FrtRQq1SbvlIfRA3WicA6g+dilQV2W/6rW1YjlU87ZXL/rNUekmWMA2VcHFMdQHh+PBDIwkylP0PVKYdhWTwDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T21:50:01.213907Z"},"content_sha256":"bf15c85ce3dcc2a0cae2893f74b2561f688acc8dd6a93456928cc4575e8114be","schema_version":"1.0","event_id":"sha256:bf15c85ce3dcc2a0cae2893f74b2561f688acc8dd6a93456928cc4575e8114be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A5MVBBD7MS23CB67INOPBVU6DD/bundle.json","state_url":"https://pith.science/pith/A5MVBBD7MS23CB67INOPBVU6DD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A5MVBBD7MS23CB67INOPBVU6DD/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-08-07T21:50:01Z","links":{"resolver":"https://pith.science/pith/A5MVBBD7MS23CB67INOPBVU6DD","bundle":"https://pith.science/pith/A5MVBBD7MS23CB67INOPBVU6DD/bundle.json","state":"https://pith.science/pith/A5MVBBD7MS23CB67INOPBVU6DD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A5MVBBD7MS23CB67INOPBVU6DD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:A5MVBBD7MS23CB67INOPBVU6DD","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":"0c91026f28c6f7085c28be845283fe9fc4f1bbd1b391414065b1951f81fa811d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2025-06-07T09:25:54Z","title_canon_sha256":"d8a39f6950aae9e888294cc0fc213b1b5159d3cc996c2a4ece7cf93d49f04316"},"schema_version":"1.0","source":{"id":"2506.06728","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.06728","created_at":"2026-07-05T11:17:54Z"},{"alias_kind":"arxiv_version","alias_value":"2506.06728v1","created_at":"2026-07-05T11:17:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.06728","created_at":"2026-07-05T11:17:54Z"},{"alias_kind":"pith_short_12","alias_value":"A5MVBBD7MS23","created_at":"2026-07-05T11:17:54Z"},{"alias_kind":"pith_short_16","alias_value":"A5MVBBD7MS23CB67","created_at":"2026-07-05T11:17:54Z"},{"alias_kind":"pith_short_8","alias_value":"A5MVBBD7","created_at":"2026-07-05T11:17:54Z"}],"graph_snapshots":[{"event_id":"sha256:bf15c85ce3dcc2a0cae2893f74b2561f688acc8dd6a93456928cc4575e8114be","target":"graph","created_at":"2026-07-05T11:17:54Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.06728/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Dynamic graph learning (DGL) aims to learn informative and temporally-evolving node embeddings to support downstream tasks such as link prediction. A fundamental challenge in DGL lies in effectively modeling both the temporal dynamics and structural dependencies of evolving graph topologies. Recent advances in Dynamic Graph Neural Networks (DGNNs) have obtained remarkable success by leveraging message-passing mechanisms to capture pairwise node interactions. However, these approaches often overlook more complex structural patterns, particularly neighborhood overlap, which can play a critical r","authors_text":"Ling Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2025-06-07T09:25:54Z","title":"Neighborhood Overlap-Aware High-Order Graph Neural Network for Dynamic Graph Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.06728","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:21f1aa1beb73bf72ef22f06d20e4ffd01f2b9013e4dde400d4eed50da1041ea0","target":"record","created_at":"2026-07-05T11:17:54Z","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":"0c91026f28c6f7085c28be845283fe9fc4f1bbd1b391414065b1951f81fa811d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2025-06-07T09:25:54Z","title_canon_sha256":"d8a39f6950aae9e888294cc0fc213b1b5159d3cc996c2a4ece7cf93d49f04316"},"schema_version":"1.0","source":{"id":"2506.06728","kind":"arxiv","version":1}},"canonical_sha256":"075950847f64b5b107df435cf0d69e18ddacbbb476d64f58a9bcb964562d2f93","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"075950847f64b5b107df435cf0d69e18ddacbbb476d64f58a9bcb964562d2f93","first_computed_at":"2026-07-05T11:17:54.666862Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:17:54.666862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EF5xVPvRW5/vC/yEltaMN530W9h0JKLftYwrd6C5t7wNcyVWDWnEYR+6gCWkT0zrVO/MWvV5Ct1TjFGFJbVRDw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:17:54.667286Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.06728","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21f1aa1beb73bf72ef22f06d20e4ffd01f2b9013e4dde400d4eed50da1041ea0","sha256:bf15c85ce3dcc2a0cae2893f74b2561f688acc8dd6a93456928cc4575e8114be"],"state_sha256":"c1c18775d57a808029e052c987731d34664ff850f1c7c5ef012a1f5e9a18e288"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wxuTVfSE9yI8QhnVa1bfy8ZLw9Vtel4hDgxlHZ0BZuRuj5YCYsWaytnL78R09p2JOq9Fd7oMY4DrDwYcUiP+DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T21:50:01.228101Z","bundle_sha256":"7cd354d4849f601e833c1312662cfc4c24dc8182b90cbd408b0fbea3502950ef"}}