{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:PX3VP6GVT2BCK2K5XCJ2QX52VT","short_pith_number":"pith:PX3VP6GV","canonical_record":{"source":{"id":"2508.09974","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-08-13T17:41:19Z","cross_cats_sorted":[],"title_canon_sha256":"476f1042293cf66c6747122ff41164c0bb200433c5a0cdc22735b0ccd4f9a1ea","abstract_canon_sha256":"07ab5f9e48faff67c76e448331d5d4e45b7c78aebeb2c7294d895863876c5f8a"},"schema_version":"1.0"},"canonical_sha256":"7df757f8d59e8225695db893a85fbaacc32c837a45ae8ba09abb4e831d68d985","source":{"kind":"arxiv","id":"2508.09974","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.09974","created_at":"2026-07-05T11:53:25Z"},{"alias_kind":"arxiv_version","alias_value":"2508.09974v1","created_at":"2026-07-05T11:53:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.09974","created_at":"2026-07-05T11:53:25Z"},{"alias_kind":"pith_short_12","alias_value":"PX3VP6GVT2BC","created_at":"2026-07-05T11:53:25Z"},{"alias_kind":"pith_short_16","alias_value":"PX3VP6GVT2BCK2K5","created_at":"2026-07-05T11:53:25Z"},{"alias_kind":"pith_short_8","alias_value":"PX3VP6GV","created_at":"2026-07-05T11:53:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:PX3VP6GVT2BCK2K5XCJ2QX52VT","target":"record","payload":{"canonical_record":{"source":{"id":"2508.09974","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-08-13T17:41:19Z","cross_cats_sorted":[],"title_canon_sha256":"476f1042293cf66c6747122ff41164c0bb200433c5a0cdc22735b0ccd4f9a1ea","abstract_canon_sha256":"07ab5f9e48faff67c76e448331d5d4e45b7c78aebeb2c7294d895863876c5f8a"},"schema_version":"1.0"},"canonical_sha256":"7df757f8d59e8225695db893a85fbaacc32c837a45ae8ba09abb4e831d68d985","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:53:25.915565Z","signature_b64":"gnZXZJXNW3siaKcUbUwLoiGetc+IAt4LGCik/p9Cnbq8LrXWluEInFIKhVWBoBY4lBovh7zlvuY6Vgft88CHBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7df757f8d59e8225695db893a85fbaacc32c837a45ae8ba09abb4e831d68d985","last_reissued_at":"2026-07-05T11:53:25.915064Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:53:25.915064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2508.09974","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:53:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g4namIDwWIBlJlN1pKfuSfK90Z1mpAfBeaM8MzUWviuKf4YInas+Kg20d/qyIFtj5VFVNrinaWQr5eLQRknRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T10:42:32.034495Z"},"content_sha256":"93f69b6241bfb1b1f7344a0aae217de8a20226cb7458ea0d85b9decdccfa71e8","schema_version":"1.0","event_id":"sha256:93f69b6241bfb1b1f7344a0aae217de8a20226cb7458ea0d85b9decdccfa71e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:PX3VP6GVT2BCK2K5XCJ2QX52VT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Mixture-of-Experts for Incremental Graph Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Han Xie, Lecheng Kong, Seongjun Yun, Theodore Vasiloudis, Xiang Song","submitted_at":"2025-08-13T17:41:19Z","abstract_excerpt":"Graph incremental learning is a learning paradigm that aims to adapt trained models to continuously incremented graphs and data over time without the need for retraining on the full dataset. However, regular graph machine learning methods suffer from catastrophic forgetting when applied to incremental learning settings, where previously learned knowledge is overridden by new knowledge. Previous approaches have tried to address this by treating the previously trained model as an inseparable unit and using techniques to maintain old behaviors while learning new knowledge. These approaches, howev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.09974","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/2508.09974/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:53:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Tlhh55kpILKYi8DKYnBzuSfLhNW9+H0YACHZryS0fnpT5xS59VsfvtGikic9U35Wxx73+LOK0NkPW7PMlP8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T10:42:32.035773Z"},"content_sha256":"2c4bfdf01efeb73b3c8c37667820db5fddc10b92e5c527dcc21b43dbfff6833a","schema_version":"1.0","event_id":"sha256:2c4bfdf01efeb73b3c8c37667820db5fddc10b92e5c527dcc21b43dbfff6833a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PX3VP6GVT2BCK2K5XCJ2QX52VT/bundle.json","state_url":"https://pith.science/pith/PX3VP6GVT2BCK2K5XCJ2QX52VT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PX3VP6GVT2BCK2K5XCJ2QX52VT/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-04T10:42:32Z","links":{"resolver":"https://pith.science/pith/PX3VP6GVT2BCK2K5XCJ2QX52VT","bundle":"https://pith.science/pith/PX3VP6GVT2BCK2K5XCJ2QX52VT/bundle.json","state":"https://pith.science/pith/PX3VP6GVT2BCK2K5XCJ2QX52VT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PX3VP6GVT2BCK2K5XCJ2QX52VT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:PX3VP6GVT2BCK2K5XCJ2QX52VT","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":"07ab5f9e48faff67c76e448331d5d4e45b7c78aebeb2c7294d895863876c5f8a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-08-13T17:41:19Z","title_canon_sha256":"476f1042293cf66c6747122ff41164c0bb200433c5a0cdc22735b0ccd4f9a1ea"},"schema_version":"1.0","source":{"id":"2508.09974","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.09974","created_at":"2026-07-05T11:53:25Z"},{"alias_kind":"arxiv_version","alias_value":"2508.09974v1","created_at":"2026-07-05T11:53:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.09974","created_at":"2026-07-05T11:53:25Z"},{"alias_kind":"pith_short_12","alias_value":"PX3VP6GVT2BC","created_at":"2026-07-05T11:53:25Z"},{"alias_kind":"pith_short_16","alias_value":"PX3VP6GVT2BCK2K5","created_at":"2026-07-05T11:53:25Z"},{"alias_kind":"pith_short_8","alias_value":"PX3VP6GV","created_at":"2026-07-05T11:53:25Z"}],"graph_snapshots":[{"event_id":"sha256:2c4bfdf01efeb73b3c8c37667820db5fddc10b92e5c527dcc21b43dbfff6833a","target":"graph","created_at":"2026-07-05T11:53:25Z","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/2508.09974/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph incremental learning is a learning paradigm that aims to adapt trained models to continuously incremented graphs and data over time without the need for retraining on the full dataset. However, regular graph machine learning methods suffer from catastrophic forgetting when applied to incremental learning settings, where previously learned knowledge is overridden by new knowledge. Previous approaches have tried to address this by treating the previously trained model as an inseparable unit and using techniques to maintain old behaviors while learning new knowledge. These approaches, howev","authors_text":"Han Xie, Lecheng Kong, Seongjun Yun, Theodore Vasiloudis, Xiang Song","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-08-13T17:41:19Z","title":"Dynamic Mixture-of-Experts for Incremental Graph Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.09974","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:93f69b6241bfb1b1f7344a0aae217de8a20226cb7458ea0d85b9decdccfa71e8","target":"record","created_at":"2026-07-05T11:53:25Z","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":"07ab5f9e48faff67c76e448331d5d4e45b7c78aebeb2c7294d895863876c5f8a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-08-13T17:41:19Z","title_canon_sha256":"476f1042293cf66c6747122ff41164c0bb200433c5a0cdc22735b0ccd4f9a1ea"},"schema_version":"1.0","source":{"id":"2508.09974","kind":"arxiv","version":1}},"canonical_sha256":"7df757f8d59e8225695db893a85fbaacc32c837a45ae8ba09abb4e831d68d985","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7df757f8d59e8225695db893a85fbaacc32c837a45ae8ba09abb4e831d68d985","first_computed_at":"2026-07-05T11:53:25.915064Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:53:25.915064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gnZXZJXNW3siaKcUbUwLoiGetc+IAt4LGCik/p9Cnbq8LrXWluEInFIKhVWBoBY4lBovh7zlvuY6Vgft88CHBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:53:25.915565Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.09974","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93f69b6241bfb1b1f7344a0aae217de8a20226cb7458ea0d85b9decdccfa71e8","sha256:2c4bfdf01efeb73b3c8c37667820db5fddc10b92e5c527dcc21b43dbfff6833a"],"state_sha256":"d813c8b2ad4eeb89a8810d504f988d86e5dab3f4d45741aa0ed69c36e46a3f7d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vdhptzmm26+3C67HAVaZMXvBxGjQqBy7QQ4dzKQzhsxL9zc6feeanD2Y1HgKBH6FE5SoU8r1A4DPlVhOZWzFBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T10:42:32.044449Z","bundle_sha256":"b66c65f463d4fa766d30f6f74a98bd74d142e5ec29ef3a3693240e6ef06c9a5c"}}