{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:DTJ7V2NSZZGBXLKN6NOWCR3N3I","short_pith_number":"pith:DTJ7V2NS","canonical_record":{"source":{"id":"2606.03462","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-02T10:39:24Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"c980edd05205d25203f679456847fb4e8d00f2c254cbf77b2389ee847a8ead3a","abstract_canon_sha256":"987fbf66373dbae3ef3a982258b54dd9f6b8ab7ee93d9c10d915bfabc202136f"},"schema_version":"1.0"},"canonical_sha256":"1cd3fae9b2ce4c1bad4df35d61476dda203b5b918b8ad4ea49524137aecfe298","source":{"kind":"arxiv","id":"2606.03462","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.03462","created_at":"2026-06-03T01:05:58Z"},{"alias_kind":"arxiv_version","alias_value":"2606.03462v1","created_at":"2026-06-03T01:05:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.03462","created_at":"2026-06-03T01:05:58Z"},{"alias_kind":"pith_short_12","alias_value":"DTJ7V2NSZZGB","created_at":"2026-06-03T01:05:58Z"},{"alias_kind":"pith_short_16","alias_value":"DTJ7V2NSZZGBXLKN","created_at":"2026-06-03T01:05:58Z"},{"alias_kind":"pith_short_8","alias_value":"DTJ7V2NS","created_at":"2026-06-03T01:05:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:DTJ7V2NSZZGBXLKN6NOWCR3N3I","target":"record","payload":{"canonical_record":{"source":{"id":"2606.03462","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-02T10:39:24Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"c980edd05205d25203f679456847fb4e8d00f2c254cbf77b2389ee847a8ead3a","abstract_canon_sha256":"987fbf66373dbae3ef3a982258b54dd9f6b8ab7ee93d9c10d915bfabc202136f"},"schema_version":"1.0"},"canonical_sha256":"1cd3fae9b2ce4c1bad4df35d61476dda203b5b918b8ad4ea49524137aecfe298","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:58.540770Z","signature_b64":"J/XQ5H4qGqIHSjPcSRgzzz+vUqmXJzn9HbICmaYLJAjkDWnslOm/la99Gtm5g4liVZVLa/CmXN/ZBOlcK3nrAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cd3fae9b2ce4c1bad4df35d61476dda203b5b918b8ad4ea49524137aecfe298","last_reissued_at":"2026-06-03T01:05:58.540439Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:58.540439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.03462","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-06-03T01:05:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pzmJ7Q1xujTAtueMVQNe77vrj/Pog3QKG1PcrG4DBwoi+sYeaQu3sJBiKhq3ES6WUaqXz63FXdq7CRC6wHbmBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T08:52:43.498897Z"},"content_sha256":"e1a524ab3f0228b5da0115ffe821b3e2a21a7869ba2f9e54d6e6a85c0049d73d","schema_version":"1.0","event_id":"sha256:e1a524ab3f0228b5da0115ffe821b3e2a21a7869ba2f9e54d6e6a85c0049d73d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:DTJ7V2NSZZGBXLKN6NOWCR3N3I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Topology-Aware Gaussian Graph Repair for Robust Graph Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Anubha Goel, Juho Kanniainen","submitted_at":"2026-06-02T10:39:24Z","abstract_excerpt":"Graph neural networks have achieved strong performance on graph-structured data, but their effectiveness depends heavily on the quality of the observed graph. In real applications, graph topology is often imperfect: noisy edges may connect unrelated nodes, while missing edges may prevent useful information from being propagated. Existing robust graph learning methods mainly address this problem by removing suspicious edges or by learning a new graph structure during training. However, edge removal alone cannot recover missing connections, and graph structure learning may introduce additional o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.03462","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/2606.03462/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-06-03T01:05:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XvREhv2JJ9lIAbKIqfiWwtXShxm1x+N4RXmbRugKPdBHOzafcNY1PhcqzkTG3DI9PvxUT/nShy8bWOdxLhQ2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T08:52:43.499264Z"},"content_sha256":"d29094f3711fe9e8f9da7e498f9b73091dc98d01b4a5e1947d4e77a487e53d08","schema_version":"1.0","event_id":"sha256:d29094f3711fe9e8f9da7e498f9b73091dc98d01b4a5e1947d4e77a487e53d08"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DTJ7V2NSZZGBXLKN6NOWCR3N3I/bundle.json","state_url":"https://pith.science/pith/DTJ7V2NSZZGBXLKN6NOWCR3N3I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DTJ7V2NSZZGBXLKN6NOWCR3N3I/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-06-30T08:52:43Z","links":{"resolver":"https://pith.science/pith/DTJ7V2NSZZGBXLKN6NOWCR3N3I","bundle":"https://pith.science/pith/DTJ7V2NSZZGBXLKN6NOWCR3N3I/bundle.json","state":"https://pith.science/pith/DTJ7V2NSZZGBXLKN6NOWCR3N3I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DTJ7V2NSZZGBXLKN6NOWCR3N3I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:DTJ7V2NSZZGBXLKN6NOWCR3N3I","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":"987fbf66373dbae3ef3a982258b54dd9f6b8ab7ee93d9c10d915bfabc202136f","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-02T10:39:24Z","title_canon_sha256":"c980edd05205d25203f679456847fb4e8d00f2c254cbf77b2389ee847a8ead3a"},"schema_version":"1.0","source":{"id":"2606.03462","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.03462","created_at":"2026-06-03T01:05:58Z"},{"alias_kind":"arxiv_version","alias_value":"2606.03462v1","created_at":"2026-06-03T01:05:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.03462","created_at":"2026-06-03T01:05:58Z"},{"alias_kind":"pith_short_12","alias_value":"DTJ7V2NSZZGB","created_at":"2026-06-03T01:05:58Z"},{"alias_kind":"pith_short_16","alias_value":"DTJ7V2NSZZGBXLKN","created_at":"2026-06-03T01:05:58Z"},{"alias_kind":"pith_short_8","alias_value":"DTJ7V2NS","created_at":"2026-06-03T01:05:58Z"}],"graph_snapshots":[{"event_id":"sha256:d29094f3711fe9e8f9da7e498f9b73091dc98d01b4a5e1947d4e77a487e53d08","target":"graph","created_at":"2026-06-03T01:05:58Z","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/2606.03462/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph neural networks have achieved strong performance on graph-structured data, but their effectiveness depends heavily on the quality of the observed graph. In real applications, graph topology is often imperfect: noisy edges may connect unrelated nodes, while missing edges may prevent useful information from being propagated. Existing robust graph learning methods mainly address this problem by removing suspicious edges or by learning a new graph structure during training. However, edge removal alone cannot recover missing connections, and graph structure learning may introduce additional o","authors_text":"Anubha Goel, Juho Kanniainen","cross_cats":["cs.SI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-02T10:39:24Z","title":"Topology-Aware Gaussian Graph Repair for Robust Graph Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.03462","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:e1a524ab3f0228b5da0115ffe821b3e2a21a7869ba2f9e54d6e6a85c0049d73d","target":"record","created_at":"2026-06-03T01:05:58Z","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":"987fbf66373dbae3ef3a982258b54dd9f6b8ab7ee93d9c10d915bfabc202136f","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-02T10:39:24Z","title_canon_sha256":"c980edd05205d25203f679456847fb4e8d00f2c254cbf77b2389ee847a8ead3a"},"schema_version":"1.0","source":{"id":"2606.03462","kind":"arxiv","version":1}},"canonical_sha256":"1cd3fae9b2ce4c1bad4df35d61476dda203b5b918b8ad4ea49524137aecfe298","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1cd3fae9b2ce4c1bad4df35d61476dda203b5b918b8ad4ea49524137aecfe298","first_computed_at":"2026-06-03T01:05:58.540439Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T01:05:58.540439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J/XQ5H4qGqIHSjPcSRgzzz+vUqmXJzn9HbICmaYLJAjkDWnslOm/la99Gtm5g4liVZVLa/CmXN/ZBOlcK3nrAg==","signature_status":"signed_v1","signed_at":"2026-06-03T01:05:58.540770Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.03462","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e1a524ab3f0228b5da0115ffe821b3e2a21a7869ba2f9e54d6e6a85c0049d73d","sha256:d29094f3711fe9e8f9da7e498f9b73091dc98d01b4a5e1947d4e77a487e53d08"],"state_sha256":"831daa859055d36b18f483d14821c45a51d7f559b5fcb68496f310fce6bec7cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oVhoaowBRlzzH0tJOi9du1oEGK2cRb9dwuEm3PSSPUwEUqJJAo+iFHGQdtHEdfibQLBE1Tw7ZK1hxmNxGivVAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T08:52:43.502329Z","bundle_sha256":"a0440e34487c3d901d2bf46ac273db8f8fd824df4a91ab551f2081eb09d11cae"}}