{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7WU2NVUBVA53MXPMNRMB3ZXR3P","short_pith_number":"pith:7WU2NVUB","canonical_record":{"source":{"id":"1904.11883","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-26T15:05:45Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b02435a681b41ba75b78bac1bdb787fda5f740970e42917a149e973ebc83b181","abstract_canon_sha256":"a08b894a9d4438922139345162a798c67be7c1aec2004f323367c4bba8a55b6f"},"schema_version":"1.0"},"canonical_sha256":"fda9a6d681a83bb65dec6c581de6f1dbffa22791ba490faca25e0caceb6df36d","source":{"kind":"arxiv","id":"1904.11883","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.11883","created_at":"2026-07-05T03:22:18Z"},{"alias_kind":"arxiv_version","alias_value":"1904.11883v2","created_at":"2026-07-05T03:22:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11883","created_at":"2026-07-05T03:22:18Z"},{"alias_kind":"pith_short_12","alias_value":"7WU2NVUBVA53","created_at":"2026-07-05T03:22:18Z"},{"alias_kind":"pith_short_16","alias_value":"7WU2NVUBVA53MXPM","created_at":"2026-07-05T03:22:18Z"},{"alias_kind":"pith_short_8","alias_value":"7WU2NVUB","created_at":"2026-07-05T03:22:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7WU2NVUBVA53MXPMNRMB3ZXR3P","target":"record","payload":{"canonical_record":{"source":{"id":"1904.11883","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-26T15:05:45Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b02435a681b41ba75b78bac1bdb787fda5f740970e42917a149e973ebc83b181","abstract_canon_sha256":"a08b894a9d4438922139345162a798c67be7c1aec2004f323367c4bba8a55b6f"},"schema_version":"1.0"},"canonical_sha256":"fda9a6d681a83bb65dec6c581de6f1dbffa22791ba490faca25e0caceb6df36d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:22:18.597342Z","signature_b64":"rh9TONn54eWHTna0mt/eRTdo5NivbmiX9+Vf6z24JySLC3/rW3bk0RWQ0AOgWfQwCFCtR4qn8xdiDRPkqjmZAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fda9a6d681a83bb65dec6c581de6f1dbffa22791ba490faca25e0caceb6df36d","last_reissued_at":"2026-07-05T03:22:18.596943Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:22:18.596943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.11883","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-05T03:22:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rhOSlwclbovVCLXkE1016AgfTm06rhhpNmcfmcOcxdpjjSEX/pATrg6MwuVowqluxlJTXw+s0fSe+hciIrZfCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T07:06:27.497692Z"},"content_sha256":"41245da7ee68f42287f35a2c1a4600cf3d9c6ea6ee52cb702faba9ced2c0c039","schema_version":"1.0","event_id":"sha256:41245da7ee68f42287f35a2c1a4600cf3d9c6ea6ee52cb702faba9ced2c0c039"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7WU2NVUBVA53MXPMNRMB3ZXR3P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Graph Data Learning via Latent Graph Convolutional Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Bin Luo, Bo Jiang, Ziyan Zhang","submitted_at":"2019-04-26T15:05:45Z","abstract_excerpt":"Graph Convolutional Representation (GCR) has achieved impressive performance for graph data representation. However, existing GCR is generally defined on the input fixed graph which may restrict the representation capacity and also be vulnerable to the structural attacks and noises. To address this issue, we propose a novel Latent Graph Convolutional Representation (LatGCR) for robust graph data representation and learning. Our LatGCR is derived based on reformulating graph convolutional representation from the aspect of graph neighborhood reconstruction. Given an input graph $\\textbf{A}$, Lat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11883","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/1904.11883/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-05T03:22:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ig2m9ySPA1D5vpcaqCZe7Lb6ZpXh4+oOKjKZyssaurqjJz5kj/RdIx+EHxE7t1q+ETrxvNv1ie1xZtnWtEUmDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T07:06:27.498736Z"},"content_sha256":"70c15c6fcc9bccc55aea2c4d8d6d392d5032d177534bc3e3e7370782226630ca","schema_version":"1.0","event_id":"sha256:70c15c6fcc9bccc55aea2c4d8d6d392d5032d177534bc3e3e7370782226630ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7WU2NVUBVA53MXPMNRMB3ZXR3P/bundle.json","state_url":"https://pith.science/pith/7WU2NVUBVA53MXPMNRMB3ZXR3P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7WU2NVUBVA53MXPMNRMB3ZXR3P/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-17T07:06:27Z","links":{"resolver":"https://pith.science/pith/7WU2NVUBVA53MXPMNRMB3ZXR3P","bundle":"https://pith.science/pith/7WU2NVUBVA53MXPMNRMB3ZXR3P/bundle.json","state":"https://pith.science/pith/7WU2NVUBVA53MXPMNRMB3ZXR3P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7WU2NVUBVA53MXPMNRMB3ZXR3P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7WU2NVUBVA53MXPMNRMB3ZXR3P","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":"a08b894a9d4438922139345162a798c67be7c1aec2004f323367c4bba8a55b6f","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-26T15:05:45Z","title_canon_sha256":"b02435a681b41ba75b78bac1bdb787fda5f740970e42917a149e973ebc83b181"},"schema_version":"1.0","source":{"id":"1904.11883","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.11883","created_at":"2026-07-05T03:22:18Z"},{"alias_kind":"arxiv_version","alias_value":"1904.11883v2","created_at":"2026-07-05T03:22:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11883","created_at":"2026-07-05T03:22:18Z"},{"alias_kind":"pith_short_12","alias_value":"7WU2NVUBVA53","created_at":"2026-07-05T03:22:18Z"},{"alias_kind":"pith_short_16","alias_value":"7WU2NVUBVA53MXPM","created_at":"2026-07-05T03:22:18Z"},{"alias_kind":"pith_short_8","alias_value":"7WU2NVUB","created_at":"2026-07-05T03:22:18Z"}],"graph_snapshots":[{"event_id":"sha256:70c15c6fcc9bccc55aea2c4d8d6d392d5032d177534bc3e3e7370782226630ca","target":"graph","created_at":"2026-07-05T03:22:18Z","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/1904.11883/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph Convolutional Representation (GCR) has achieved impressive performance for graph data representation. However, existing GCR is generally defined on the input fixed graph which may restrict the representation capacity and also be vulnerable to the structural attacks and noises. To address this issue, we propose a novel Latent Graph Convolutional Representation (LatGCR) for robust graph data representation and learning. Our LatGCR is derived based on reformulating graph convolutional representation from the aspect of graph neighborhood reconstruction. Given an input graph $\\textbf{A}$, Lat","authors_text":"Bin Luo, Bo Jiang, Ziyan Zhang","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-26T15:05:45Z","title":"Robust Graph Data Learning via Latent Graph Convolutional Representation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11883","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:41245da7ee68f42287f35a2c1a4600cf3d9c6ea6ee52cb702faba9ced2c0c039","target":"record","created_at":"2026-07-05T03:22:18Z","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":"a08b894a9d4438922139345162a798c67be7c1aec2004f323367c4bba8a55b6f","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-26T15:05:45Z","title_canon_sha256":"b02435a681b41ba75b78bac1bdb787fda5f740970e42917a149e973ebc83b181"},"schema_version":"1.0","source":{"id":"1904.11883","kind":"arxiv","version":2}},"canonical_sha256":"fda9a6d681a83bb65dec6c581de6f1dbffa22791ba490faca25e0caceb6df36d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fda9a6d681a83bb65dec6c581de6f1dbffa22791ba490faca25e0caceb6df36d","first_computed_at":"2026-07-05T03:22:18.596943Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:22:18.596943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rh9TONn54eWHTna0mt/eRTdo5NivbmiX9+Vf6z24JySLC3/rW3bk0RWQ0AOgWfQwCFCtR4qn8xdiDRPkqjmZAA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:22:18.597342Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.11883","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41245da7ee68f42287f35a2c1a4600cf3d9c6ea6ee52cb702faba9ced2c0c039","sha256:70c15c6fcc9bccc55aea2c4d8d6d392d5032d177534bc3e3e7370782226630ca"],"state_sha256":"da6464eb037b04d4174786101076fad6d8ea7e3b1dec7c25782fb26ed6bcb460"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+0OtYshPXBzzCpmnUYpVdGrkmUfP/FKK1btTKv8plPc2XUYtoFt4tLs9YPcDEMjEHxJczGI3JXD787amTXvaAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T07:06:27.505772Z","bundle_sha256":"0b63cfa231c9d2c2caffb73fe073660fd2fe8b334a2b7a289b3d450d6f64760f"}}