{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:AOX6CGWYNHNCX5TME3U5QNHUKB","short_pith_number":"pith:AOX6CGWY","canonical_record":{"source":{"id":"2102.10403","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-20T17:56:52Z","cross_cats_sorted":[],"title_canon_sha256":"f229cca48d7c13a8c384f3c38ff224f30d0a2bd5bf8150bec17235daa12c76dc","abstract_canon_sha256":"935f2f19b33e2712e6660bf7f82669340762a1be23c01bf27da1d6a87c8c70f4"},"schema_version":"1.0"},"canonical_sha256":"03afe11ad869da2bf66c26e9d834f4506be7e99d803f9c79cfc68f4904a1c7b3","source":{"kind":"arxiv","id":"2102.10403","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.10403","created_at":"2026-07-05T02:16:57Z"},{"alias_kind":"arxiv_version","alias_value":"2102.10403v1","created_at":"2026-07-05T02:16:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.10403","created_at":"2026-07-05T02:16:57Z"},{"alias_kind":"pith_short_12","alias_value":"AOX6CGWYNHNC","created_at":"2026-07-05T02:16:57Z"},{"alias_kind":"pith_short_16","alias_value":"AOX6CGWYNHNCX5TM","created_at":"2026-07-05T02:16:57Z"},{"alias_kind":"pith_short_8","alias_value":"AOX6CGWY","created_at":"2026-07-05T02:16:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:AOX6CGWYNHNCX5TME3U5QNHUKB","target":"record","payload":{"canonical_record":{"source":{"id":"2102.10403","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-20T17:56:52Z","cross_cats_sorted":[],"title_canon_sha256":"f229cca48d7c13a8c384f3c38ff224f30d0a2bd5bf8150bec17235daa12c76dc","abstract_canon_sha256":"935f2f19b33e2712e6660bf7f82669340762a1be23c01bf27da1d6a87c8c70f4"},"schema_version":"1.0"},"canonical_sha256":"03afe11ad869da2bf66c26e9d834f4506be7e99d803f9c79cfc68f4904a1c7b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:16:57.514991Z","signature_b64":"rjp4MGRKN7LmKKvQbzA69GIGFTtB4xu3o8UK1seiCt4Zta1zNia2QAe5jtWfsiwO3kME3FEefQqZCQACSU2GBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03afe11ad869da2bf66c26e9d834f4506be7e99d803f9c79cfc68f4904a1c7b3","last_reissued_at":"2026-07-05T02:16:57.514532Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:16:57.514532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2102.10403","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-05T02:16:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"827AxmxgSxHjTpKj/JsW6eTm63lMm5Y1/78vNscB4eqdCi6gT9BqbByk3H04kQNY45IqTz1w0VIuArASVIT4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T16:53:12.392199Z"},"content_sha256":"69f386130d143a63d42850dcd24d9cf05e6e42e161c96c433d7d503fc0c37e1a","schema_version":"1.0","event_id":"sha256:69f386130d143a63d42850dcd24d9cf05e6e42e161c96c433d7d503fc0c37e1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:AOX6CGWYNHNCX5TME3U5QNHUKB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GLAM: Graph Learning by Modeling Affinity to Labeled Nodes for Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Arun Iyer, Rahul Ragesh, Vijay Lingam","submitted_at":"2021-02-20T17:56:52Z","abstract_excerpt":"Graph Neural Networks have shown excellent performance on semi-supervised classification tasks. However, they assume access to a graph that may not be often available in practice. In the absence of any graph, constructing k-Nearest Neighbor (kNN) graphs from the given data have shown to give improvements when used with GNNs over other semi-supervised methods. This paper proposes a semi-supervised graph learning method for cases when there are no graphs available. This method learns a graph as a convex combination of the unsupervised kNN graph and a supervised label-affinity graph. The label-af"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.10403","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/2102.10403/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-05T02:16:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"URlVhMpPcM7mlid6AlKcHS7Dlfp0/3WRQoDmEOF9lBGUCEWnBaZr9khTduQsqQOqwtcCCjLbVoTUD/1nuxJWBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T16:53:12.405895Z"},"content_sha256":"c68e5698e568baa7a3e99d0f9cc6f7ba464ea4a90c1fbbb4ef02bc3f12ce80ae","schema_version":"1.0","event_id":"sha256:c68e5698e568baa7a3e99d0f9cc6f7ba464ea4a90c1fbbb4ef02bc3f12ce80ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AOX6CGWYNHNCX5TME3U5QNHUKB/bundle.json","state_url":"https://pith.science/pith/AOX6CGWYNHNCX5TME3U5QNHUKB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AOX6CGWYNHNCX5TME3U5QNHUKB/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-12T16:53:12Z","links":{"resolver":"https://pith.science/pith/AOX6CGWYNHNCX5TME3U5QNHUKB","bundle":"https://pith.science/pith/AOX6CGWYNHNCX5TME3U5QNHUKB/bundle.json","state":"https://pith.science/pith/AOX6CGWYNHNCX5TME3U5QNHUKB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AOX6CGWYNHNCX5TME3U5QNHUKB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:AOX6CGWYNHNCX5TME3U5QNHUKB","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":"935f2f19b33e2712e6660bf7f82669340762a1be23c01bf27da1d6a87c8c70f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-20T17:56:52Z","title_canon_sha256":"f229cca48d7c13a8c384f3c38ff224f30d0a2bd5bf8150bec17235daa12c76dc"},"schema_version":"1.0","source":{"id":"2102.10403","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.10403","created_at":"2026-07-05T02:16:57Z"},{"alias_kind":"arxiv_version","alias_value":"2102.10403v1","created_at":"2026-07-05T02:16:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.10403","created_at":"2026-07-05T02:16:57Z"},{"alias_kind":"pith_short_12","alias_value":"AOX6CGWYNHNC","created_at":"2026-07-05T02:16:57Z"},{"alias_kind":"pith_short_16","alias_value":"AOX6CGWYNHNCX5TM","created_at":"2026-07-05T02:16:57Z"},{"alias_kind":"pith_short_8","alias_value":"AOX6CGWY","created_at":"2026-07-05T02:16:57Z"}],"graph_snapshots":[{"event_id":"sha256:c68e5698e568baa7a3e99d0f9cc6f7ba464ea4a90c1fbbb4ef02bc3f12ce80ae","target":"graph","created_at":"2026-07-05T02:16:57Z","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/2102.10403/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph Neural Networks have shown excellent performance on semi-supervised classification tasks. However, they assume access to a graph that may not be often available in practice. In the absence of any graph, constructing k-Nearest Neighbor (kNN) graphs from the given data have shown to give improvements when used with GNNs over other semi-supervised methods. This paper proposes a semi-supervised graph learning method for cases when there are no graphs available. This method learns a graph as a convex combination of the unsupervised kNN graph and a supervised label-affinity graph. The label-af","authors_text":"Arun Iyer, Rahul Ragesh, Vijay Lingam","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-20T17:56:52Z","title":"GLAM: Graph Learning by Modeling Affinity to Labeled Nodes for Graph Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.10403","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:69f386130d143a63d42850dcd24d9cf05e6e42e161c96c433d7d503fc0c37e1a","target":"record","created_at":"2026-07-05T02:16:57Z","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":"935f2f19b33e2712e6660bf7f82669340762a1be23c01bf27da1d6a87c8c70f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-20T17:56:52Z","title_canon_sha256":"f229cca48d7c13a8c384f3c38ff224f30d0a2bd5bf8150bec17235daa12c76dc"},"schema_version":"1.0","source":{"id":"2102.10403","kind":"arxiv","version":1}},"canonical_sha256":"03afe11ad869da2bf66c26e9d834f4506be7e99d803f9c79cfc68f4904a1c7b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03afe11ad869da2bf66c26e9d834f4506be7e99d803f9c79cfc68f4904a1c7b3","first_computed_at":"2026-07-05T02:16:57.514532Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:16:57.514532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rjp4MGRKN7LmKKvQbzA69GIGFTtB4xu3o8UK1seiCt4Zta1zNia2QAe5jtWfsiwO3kME3FEefQqZCQACSU2GBw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:16:57.514991Z","signed_message":"canonical_sha256_bytes"},"source_id":"2102.10403","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69f386130d143a63d42850dcd24d9cf05e6e42e161c96c433d7d503fc0c37e1a","sha256:c68e5698e568baa7a3e99d0f9cc6f7ba464ea4a90c1fbbb4ef02bc3f12ce80ae"],"state_sha256":"ad2afe221cbd6ef0a43419e4635e445d76a289c224324b63d8b09d423fe410c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dpuN62Lfikf0VnKeJadXUmefgVukkqYilOmAg27eiNOT3+rGX70ePpf3ekesAip5jfvDk3MH9hpVSkF6jg7rAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T16:53:12.417665Z","bundle_sha256":"a03cbef29e35767c5106d3af6bfe5c2cc89fbddfcbb9af870deb97c953feb9fc"}}