{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:WYFIXP2Q3ZDIWWXJFKWTRYF72Z","short_pith_number":"pith:WYFIXP2Q","canonical_record":{"source":{"id":"2311.18526","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-11-30T13:05:39Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"967e27be28641b4f84cc06f671ac638ccd39dab2077d35cb9ed9c42219faa538","abstract_canon_sha256":"7be653a7bee127cacea421eb1953b7d9c3c1f25632faf4e850a469afcf18c7e9"},"schema_version":"1.0"},"canonical_sha256":"b60a8bbf50de468b5ae92aad38e0bfd6725c8f00798a7bc933b2820456c26f15","source":{"kind":"arxiv","id":"2311.18526","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.18526","created_at":"2026-07-05T08:31:45Z"},{"alias_kind":"arxiv_version","alias_value":"2311.18526v2","created_at":"2026-07-05T08:31:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.18526","created_at":"2026-07-05T08:31:45Z"},{"alias_kind":"pith_short_12","alias_value":"WYFIXP2Q3ZDI","created_at":"2026-07-05T08:31:45Z"},{"alias_kind":"pith_short_16","alias_value":"WYFIXP2Q3ZDIWWXJ","created_at":"2026-07-05T08:31:45Z"},{"alias_kind":"pith_short_8","alias_value":"WYFIXP2Q","created_at":"2026-07-05T08:31:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:WYFIXP2Q3ZDIWWXJFKWTRYF72Z","target":"record","payload":{"canonical_record":{"source":{"id":"2311.18526","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-11-30T13:05:39Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"967e27be28641b4f84cc06f671ac638ccd39dab2077d35cb9ed9c42219faa538","abstract_canon_sha256":"7be653a7bee127cacea421eb1953b7d9c3c1f25632faf4e850a469afcf18c7e9"},"schema_version":"1.0"},"canonical_sha256":"b60a8bbf50de468b5ae92aad38e0bfd6725c8f00798a7bc933b2820456c26f15","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:31:45.142547Z","signature_b64":"8gZzo46EhnnkyMwSCNqFYU8WYrxwAg8CbuwYGlRaj6Qi+7oBB9TNxdCyixAJDwUkdA98AdlW79khWCCsSHhvCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b60a8bbf50de468b5ae92aad38e0bfd6725c8f00798a7bc933b2820456c26f15","last_reissued_at":"2026-07-05T08:31:45.142034Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:31:45.142034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2311.18526","source_version":2,"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-05T08:31:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o/JHp+hOv1rwnPLQrg9sDAFXrj/W47SyL3p8l6N0aCbQV2iE06p9H3d6ibPdMyVK4BD57ztCMaGJwG1W803uCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T06:11:44.067155Z"},"content_sha256":"c5202700edcc26d6f997c6e8ceed89c3f90be0e6aad6036855935ec0fb423b5d","schema_version":"1.0","event_id":"sha256:c5202700edcc26d6f997c6e8ceed89c3f90be0e6aad6036855935ec0fb423b5d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:WYFIXP2Q3ZDIWWXJFKWTRYF72Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"HOT: Higher-Order Dynamic Graph Representation Learning with Efficient Transformers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Afonso Claudino Catarino, Hubert Niewiadomski, Lukas Gianinazzi, Maciej Besta, Nils Blach, Piotr Nyczyk, Torsten Hoefler","submitted_at":"2023-11-30T13:05:39Z","abstract_excerpt":"Many graph representation learning (GRL) problems are dynamic, with millions of edges added or removed per second. A fundamental workload in this setting is dynamic link prediction: using a history of graph updates to predict whether a given pair of vertices will become connected. Recent schemes for link prediction in such dynamic settings employ Transformers, modeling individual graph updates as single tokens. In this work, we propose HOT: a model that enhances this line of works by harnessing higher-order (HO) graph structures; specifically, k-hop neighbors and more general subgraphs contain"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.18526","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/2311.18526/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-05T08:31:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T9rfPYPK0bmqBwBj3Le/qwsUv4HWjQF376ordIXqRo5fO+WqBS2Cf4abWGicoEZPCk1GylwfT6CrRyL2FbGoCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T06:11:44.067546Z"},"content_sha256":"7f934e90c75f0bac648698d03b044a55ab0703977354b80c91572c4f8b1128d7","schema_version":"1.0","event_id":"sha256:7f934e90c75f0bac648698d03b044a55ab0703977354b80c91572c4f8b1128d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WYFIXP2Q3ZDIWWXJFKWTRYF72Z/bundle.json","state_url":"https://pith.science/pith/WYFIXP2Q3ZDIWWXJFKWTRYF72Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WYFIXP2Q3ZDIWWXJFKWTRYF72Z/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-07-10T06:11:44Z","links":{"resolver":"https://pith.science/pith/WYFIXP2Q3ZDIWWXJFKWTRYF72Z","bundle":"https://pith.science/pith/WYFIXP2Q3ZDIWWXJFKWTRYF72Z/bundle.json","state":"https://pith.science/pith/WYFIXP2Q3ZDIWWXJFKWTRYF72Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WYFIXP2Q3ZDIWWXJFKWTRYF72Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:WYFIXP2Q3ZDIWWXJFKWTRYF72Z","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":"7be653a7bee127cacea421eb1953b7d9c3c1f25632faf4e850a469afcf18c7e9","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-11-30T13:05:39Z","title_canon_sha256":"967e27be28641b4f84cc06f671ac638ccd39dab2077d35cb9ed9c42219faa538"},"schema_version":"1.0","source":{"id":"2311.18526","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.18526","created_at":"2026-07-05T08:31:45Z"},{"alias_kind":"arxiv_version","alias_value":"2311.18526v2","created_at":"2026-07-05T08:31:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.18526","created_at":"2026-07-05T08:31:45Z"},{"alias_kind":"pith_short_12","alias_value":"WYFIXP2Q3ZDI","created_at":"2026-07-05T08:31:45Z"},{"alias_kind":"pith_short_16","alias_value":"WYFIXP2Q3ZDIWWXJ","created_at":"2026-07-05T08:31:45Z"},{"alias_kind":"pith_short_8","alias_value":"WYFIXP2Q","created_at":"2026-07-05T08:31:45Z"}],"graph_snapshots":[{"event_id":"sha256:7f934e90c75f0bac648698d03b044a55ab0703977354b80c91572c4f8b1128d7","target":"graph","created_at":"2026-07-05T08:31:45Z","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/2311.18526/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Many graph representation learning (GRL) problems are dynamic, with millions of edges added or removed per second. A fundamental workload in this setting is dynamic link prediction: using a history of graph updates to predict whether a given pair of vertices will become connected. Recent schemes for link prediction in such dynamic settings employ Transformers, modeling individual graph updates as single tokens. In this work, we propose HOT: a model that enhances this line of works by harnessing higher-order (HO) graph structures; specifically, k-hop neighbors and more general subgraphs contain","authors_text":"Afonso Claudino Catarino, Hubert Niewiadomski, Lukas Gianinazzi, Maciej Besta, Nils Blach, Piotr Nyczyk, Torsten Hoefler","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-11-30T13:05:39Z","title":"HOT: Higher-Order Dynamic Graph Representation Learning with Efficient Transformers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.18526","kind":"arxiv","version":2},"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:c5202700edcc26d6f997c6e8ceed89c3f90be0e6aad6036855935ec0fb423b5d","target":"record","created_at":"2026-07-05T08:31:45Z","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":"7be653a7bee127cacea421eb1953b7d9c3c1f25632faf4e850a469afcf18c7e9","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-11-30T13:05:39Z","title_canon_sha256":"967e27be28641b4f84cc06f671ac638ccd39dab2077d35cb9ed9c42219faa538"},"schema_version":"1.0","source":{"id":"2311.18526","kind":"arxiv","version":2}},"canonical_sha256":"b60a8bbf50de468b5ae92aad38e0bfd6725c8f00798a7bc933b2820456c26f15","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b60a8bbf50de468b5ae92aad38e0bfd6725c8f00798a7bc933b2820456c26f15","first_computed_at":"2026-07-05T08:31:45.142034Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:31:45.142034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8gZzo46EhnnkyMwSCNqFYU8WYrxwAg8CbuwYGlRaj6Qi+7oBB9TNxdCyixAJDwUkdA98AdlW79khWCCsSHhvCA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:31:45.142547Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.18526","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c5202700edcc26d6f997c6e8ceed89c3f90be0e6aad6036855935ec0fb423b5d","sha256:7f934e90c75f0bac648698d03b044a55ab0703977354b80c91572c4f8b1128d7"],"state_sha256":"225b148a117bbc3efe63088027c74ba6a4ff248a79ca0ea78c8092101a9a9f22"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hxpeDHhPa8cAlbAm9P5Lz6kpN7Nz08ybW/bX5CPhsEIpEFHWgh+Jdlt6Mah/H0CcS9tAVmAZr/zVzAA297+6DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-10T06:11:44.069732Z","bundle_sha256":"62abec7a510c687fdb8a98cf4c150dc149107984bdb770737e62d5bf7d31da64"}}