{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:T5GD4E6KTGQKTGTZZDBSQ3VQW7","short_pith_number":"pith:T5GD4E6K","canonical_record":{"source":{"id":"1908.05153","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-08-14T14:48:53Z","cross_cats_sorted":[],"title_canon_sha256":"12e9e1bc115a215ac39a38579cc5df594022b02dad94dfd05ecec5a9aa7617c5","abstract_canon_sha256":"9e2ca2b0a9e549375912763f0a005a1b04538641b1acc035184c38a155c5f96f"},"schema_version":"1.0"},"canonical_sha256":"9f4c3e13ca99a0a99a79c8c3286eb0b7fbd8633a65daf12d3523bf2535b32573","source":{"kind":"arxiv","id":"1908.05153","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05153","created_at":"2026-07-05T00:20:53Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05153v2","created_at":"2026-07-05T00:20:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05153","created_at":"2026-07-05T00:20:53Z"},{"alias_kind":"pith_short_12","alias_value":"T5GD4E6KTGQK","created_at":"2026-07-05T00:20:53Z"},{"alias_kind":"pith_short_16","alias_value":"T5GD4E6KTGQKTGTZ","created_at":"2026-07-05T00:20:53Z"},{"alias_kind":"pith_short_8","alias_value":"T5GD4E6K","created_at":"2026-07-05T00:20:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:T5GD4E6KTGQKTGTZZDBSQ3VQW7","target":"record","payload":{"canonical_record":{"source":{"id":"1908.05153","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-08-14T14:48:53Z","cross_cats_sorted":[],"title_canon_sha256":"12e9e1bc115a215ac39a38579cc5df594022b02dad94dfd05ecec5a9aa7617c5","abstract_canon_sha256":"9e2ca2b0a9e549375912763f0a005a1b04538641b1acc035184c38a155c5f96f"},"schema_version":"1.0"},"canonical_sha256":"9f4c3e13ca99a0a99a79c8c3286eb0b7fbd8633a65daf12d3523bf2535b32573","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:20:53.959284Z","signature_b64":"3dzXaGQVWPlUJ7LpUKYCOZMJQp8erlO2+/yEso6hGcqYzDYeJem/Ynnp2eTT7ypBg+qFHm1loFa2MFUuh2nCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f4c3e13ca99a0a99a79c8c3286eb0b7fbd8633a65daf12d3523bf2535b32573","last_reissued_at":"2026-07-05T00:20:53.958823Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:20:53.958823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.05153","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-05T00:20:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gHqpNgl2AS18BN5MLyOldVOq9atsiEk+T+mfkigpUD3bB1peeOzgxs/g+Cf8OaaKbCnKkdtHEFEShlOQEojUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T18:34:56.766409Z"},"content_sha256":"c2f77ccbea8e60363eedae221c346e846469cbc3f3546eb56fb07e40d5b5ace4","schema_version":"1.0","event_id":"sha256:c2f77ccbea8e60363eedae221c346e846469cbc3f3546eb56fb07e40d5b5ace4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:T5GD4E6KTGQKTGTZZDBSQ3VQW7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semi-supervised Learning with Adaptive Neighborhood Graph Propagation Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Bin Luo, Bo Jiang, Jin Tang, Leiling Wang","submitted_at":"2019-08-14T14:48:53Z","abstract_excerpt":"Graph Convolutional Networks (GCNs) have been widely studied for compact data representation and semi-supervised learning tasks. However, existing GCNs usually use a fixed neighborhood graph which is not guaranteed to be optimal for semi-supervised learning tasks. In this paper, we first re-interpret graph convolution operation in GCNs as a composition of feature propagation and (non-linear) transformation. Based on this observation, we then propose a unified adaptive neighborhood feature propagation model and derive a novel Adaptive Neighborhood Graph Propagation Network (ANGPN) for data repr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05153","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/1908.05153/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-05T00:20:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TEEzGC5IN9PKyPIt+pQx9GijFLH5sEvVrDr0nbMvo7FNDMNLY/gRS7cXkU9lSe0D13XS6Z3/IdIWN7OC0iqlAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T18:34:56.767402Z"},"content_sha256":"95486064da3e6ebda7c085a98db7bf3d1df62c9ca1ce7f106907ff81d8f12e3d","schema_version":"1.0","event_id":"sha256:95486064da3e6ebda7c085a98db7bf3d1df62c9ca1ce7f106907ff81d8f12e3d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T5GD4E6KTGQKTGTZZDBSQ3VQW7/bundle.json","state_url":"https://pith.science/pith/T5GD4E6KTGQKTGTZZDBSQ3VQW7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T5GD4E6KTGQKTGTZZDBSQ3VQW7/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-16T18:34:56Z","links":{"resolver":"https://pith.science/pith/T5GD4E6KTGQKTGTZZDBSQ3VQW7","bundle":"https://pith.science/pith/T5GD4E6KTGQKTGTZZDBSQ3VQW7/bundle.json","state":"https://pith.science/pith/T5GD4E6KTGQKTGTZZDBSQ3VQW7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T5GD4E6KTGQKTGTZZDBSQ3VQW7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:T5GD4E6KTGQKTGTZZDBSQ3VQW7","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":"9e2ca2b0a9e549375912763f0a005a1b04538641b1acc035184c38a155c5f96f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-08-14T14:48:53Z","title_canon_sha256":"12e9e1bc115a215ac39a38579cc5df594022b02dad94dfd05ecec5a9aa7617c5"},"schema_version":"1.0","source":{"id":"1908.05153","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05153","created_at":"2026-07-05T00:20:53Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05153v2","created_at":"2026-07-05T00:20:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05153","created_at":"2026-07-05T00:20:53Z"},{"alias_kind":"pith_short_12","alias_value":"T5GD4E6KTGQK","created_at":"2026-07-05T00:20:53Z"},{"alias_kind":"pith_short_16","alias_value":"T5GD4E6KTGQKTGTZ","created_at":"2026-07-05T00:20:53Z"},{"alias_kind":"pith_short_8","alias_value":"T5GD4E6K","created_at":"2026-07-05T00:20:53Z"}],"graph_snapshots":[{"event_id":"sha256:95486064da3e6ebda7c085a98db7bf3d1df62c9ca1ce7f106907ff81d8f12e3d","target":"graph","created_at":"2026-07-05T00:20:53Z","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/1908.05153/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph Convolutional Networks (GCNs) have been widely studied for compact data representation and semi-supervised learning tasks. However, existing GCNs usually use a fixed neighborhood graph which is not guaranteed to be optimal for semi-supervised learning tasks. In this paper, we first re-interpret graph convolution operation in GCNs as a composition of feature propagation and (non-linear) transformation. Based on this observation, we then propose a unified adaptive neighborhood feature propagation model and derive a novel Adaptive Neighborhood Graph Propagation Network (ANGPN) for data repr","authors_text":"Bin Luo, Bo Jiang, Jin Tang, Leiling Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-08-14T14:48:53Z","title":"Semi-supervised Learning with Adaptive Neighborhood Graph Propagation Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05153","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:c2f77ccbea8e60363eedae221c346e846469cbc3f3546eb56fb07e40d5b5ace4","target":"record","created_at":"2026-07-05T00:20:53Z","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":"9e2ca2b0a9e549375912763f0a005a1b04538641b1acc035184c38a155c5f96f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-08-14T14:48:53Z","title_canon_sha256":"12e9e1bc115a215ac39a38579cc5df594022b02dad94dfd05ecec5a9aa7617c5"},"schema_version":"1.0","source":{"id":"1908.05153","kind":"arxiv","version":2}},"canonical_sha256":"9f4c3e13ca99a0a99a79c8c3286eb0b7fbd8633a65daf12d3523bf2535b32573","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f4c3e13ca99a0a99a79c8c3286eb0b7fbd8633a65daf12d3523bf2535b32573","first_computed_at":"2026-07-05T00:20:53.958823Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:20:53.958823Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3dzXaGQVWPlUJ7LpUKYCOZMJQp8erlO2+/yEso6hGcqYzDYeJem/Ynnp2eTT7ypBg+qFHm1loFa2MFUuh2nCBw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:20:53.959284Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.05153","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2f77ccbea8e60363eedae221c346e846469cbc3f3546eb56fb07e40d5b5ace4","sha256:95486064da3e6ebda7c085a98db7bf3d1df62c9ca1ce7f106907ff81d8f12e3d"],"state_sha256":"cfc7e52d627999cd16a79fcb82c8c62a5e316fccb408f85197c9eab2fe2a3c20"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e7bYS6I1psCGi6FcNODq7xfEa+OL04F8lF0R2VnzA6twh4gf7b+AwkaPmvNstyPFbcj2fJq2DwhxXjm3TCl5CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T18:34:56.772556Z","bundle_sha256":"f6d6da8f3ca74bbc6baa14692bc26507e1e70cb75790ab87e9d1c0ac2a475753"}}