{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FVTXXABX7JURBQV3UYZRFUETME","short_pith_number":"pith:FVTXXABX","canonical_record":{"source":{"id":"1812.00974","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-03T18:49:29Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"649d7e3edf26aec3892986086c1259de29c9c44aa58555f7bd01d2a7db7d7139","abstract_canon_sha256":"d3d77d7f1157610a4fc8c7edc59cacecc79d685bec454d92cfa1c38c7f4d5a9c"},"schema_version":"1.0"},"canonical_sha256":"2d677b8037fa6910c2bba63312d09361012b5e0e839bcf1c2fc48d81b460a025","source":{"kind":"arxiv","id":"1812.00974","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.00974","created_at":"2026-05-17T23:47:27Z"},{"alias_kind":"arxiv_version","alias_value":"1812.00974v1","created_at":"2026-05-17T23:47:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00974","created_at":"2026-05-17T23:47:27Z"},{"alias_kind":"pith_short_12","alias_value":"FVTXXABX7JUR","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FVTXXABX7JURBQV3","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FVTXXABX","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FVTXXABX7JURBQV3UYZRFUETME","target":"record","payload":{"canonical_record":{"source":{"id":"1812.00974","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-03T18:49:29Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"649d7e3edf26aec3892986086c1259de29c9c44aa58555f7bd01d2a7db7d7139","abstract_canon_sha256":"d3d77d7f1157610a4fc8c7edc59cacecc79d685bec454d92cfa1c38c7f4d5a9c"},"schema_version":"1.0"},"canonical_sha256":"2d677b8037fa6910c2bba63312d09361012b5e0e839bcf1c2fc48d81b460a025","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:27.323555Z","signature_b64":"DMY6efJA5RHgo96+NPKvmUBz0ucGoceIeNI/ua/yR2yIXrWkEN8jeeAOuR5+WdvPJWDsgZf9U7zYgdSxr+21Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d677b8037fa6910c2bba63312d09361012b5e0e839bcf1c2fc48d81b460a025","last_reissued_at":"2026-05-17T23:47:27.322899Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:27.322899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.00974","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-05-17T23:47:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7q/fw/k1v3oprfNaoDQytr2O8OmYu6qAKZMiYexrdhWkFAYYjKBYLW4WyoG1AlKGCAsFT7CNSIti+uxSSndZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:13:02.203934Z"},"content_sha256":"4a9edaf7c13e7a446802dd956e9e1f0bc73b76d46fc3a930cf56485ae205541f","schema_version":"1.0","event_id":"sha256:4a9edaf7c13e7a446802dd956e9e1f0bc73b76d46fc3a930cf56485ae205541f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FVTXXABX7JURBQV3UYZRFUETME","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Graph-Adaptive Learning with Scalability and Privacy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Geert Leus, Georgios B. Giannakis, Yanning Shen","submitted_at":"2018-12-03T18:49:29Z","abstract_excerpt":"Graphs are widely adopted for modeling complex systems, including financial, biological, and social networks. Nodes in networks usually entail attributes, such as the age or gender of users in a social network. However, real-world networks can have very large size, and nodal attributes can be unavailable to a number of nodes, e.g., due to privacy concerns. Moreover, new nodes can emerge over time, which can necessitate real-time evaluation of their nodal attributes. In this context, the present paper deals with scalable learning of nodal attributes by estimating a nodal function based on noisy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.00974","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":""},"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-05-17T23:47:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K9Q05iCvm+4667dla4amp8EhTa3fY8w63sr27OKlZocmLBpGqcXlqoxXIzpMnFQHXgoB8JqGCk75jmOCd70BDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T16:13:02.204709Z"},"content_sha256":"9c5a6fda3be2ab4d41a5e097937d8b8b76c86fa2fa7fddfdea04ad50f862b244","schema_version":"1.0","event_id":"sha256:9c5a6fda3be2ab4d41a5e097937d8b8b76c86fa2fa7fddfdea04ad50f862b244"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FVTXXABX7JURBQV3UYZRFUETME/bundle.json","state_url":"https://pith.science/pith/FVTXXABX7JURBQV3UYZRFUETME/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FVTXXABX7JURBQV3UYZRFUETME/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-08T16:13:02Z","links":{"resolver":"https://pith.science/pith/FVTXXABX7JURBQV3UYZRFUETME","bundle":"https://pith.science/pith/FVTXXABX7JURBQV3UYZRFUETME/bundle.json","state":"https://pith.science/pith/FVTXXABX7JURBQV3UYZRFUETME/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FVTXXABX7JURBQV3UYZRFUETME/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FVTXXABX7JURBQV3UYZRFUETME","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":"d3d77d7f1157610a4fc8c7edc59cacecc79d685bec454d92cfa1c38c7f4d5a9c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-03T18:49:29Z","title_canon_sha256":"649d7e3edf26aec3892986086c1259de29c9c44aa58555f7bd01d2a7db7d7139"},"schema_version":"1.0","source":{"id":"1812.00974","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.00974","created_at":"2026-05-17T23:47:27Z"},{"alias_kind":"arxiv_version","alias_value":"1812.00974v1","created_at":"2026-05-17T23:47:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00974","created_at":"2026-05-17T23:47:27Z"},{"alias_kind":"pith_short_12","alias_value":"FVTXXABX7JUR","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FVTXXABX7JURBQV3","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FVTXXABX","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:9c5a6fda3be2ab4d41a5e097937d8b8b76c86fa2fa7fddfdea04ad50f862b244","target":"graph","created_at":"2026-05-17T23:47:27Z","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"},"paper":{"abstract_excerpt":"Graphs are widely adopted for modeling complex systems, including financial, biological, and social networks. Nodes in networks usually entail attributes, such as the age or gender of users in a social network. However, real-world networks can have very large size, and nodal attributes can be unavailable to a number of nodes, e.g., due to privacy concerns. Moreover, new nodes can emerge over time, which can necessitate real-time evaluation of their nodal attributes. In this context, the present paper deals with scalable learning of nodal attributes by estimating a nodal function based on noisy","authors_text":"Geert Leus, Georgios B. Giannakis, Yanning Shen","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-03T18:49:29Z","title":"Online Graph-Adaptive Learning with Scalability and Privacy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.00974","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:4a9edaf7c13e7a446802dd956e9e1f0bc73b76d46fc3a930cf56485ae205541f","target":"record","created_at":"2026-05-17T23:47:27Z","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":"d3d77d7f1157610a4fc8c7edc59cacecc79d685bec454d92cfa1c38c7f4d5a9c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-03T18:49:29Z","title_canon_sha256":"649d7e3edf26aec3892986086c1259de29c9c44aa58555f7bd01d2a7db7d7139"},"schema_version":"1.0","source":{"id":"1812.00974","kind":"arxiv","version":1}},"canonical_sha256":"2d677b8037fa6910c2bba63312d09361012b5e0e839bcf1c2fc48d81b460a025","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d677b8037fa6910c2bba63312d09361012b5e0e839bcf1c2fc48d81b460a025","first_computed_at":"2026-05-17T23:47:27.322899Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:27.322899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DMY6efJA5RHgo96+NPKvmUBz0ucGoceIeNI/ua/yR2yIXrWkEN8jeeAOuR5+WdvPJWDsgZf9U7zYgdSxr+21Dw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:27.323555Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.00974","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a9edaf7c13e7a446802dd956e9e1f0bc73b76d46fc3a930cf56485ae205541f","sha256:9c5a6fda3be2ab4d41a5e097937d8b8b76c86fa2fa7fddfdea04ad50f862b244"],"state_sha256":"d758319b77920792d8bcf2673a21d7c7b307c1450345ff7140bb7f764c63a478"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+5nXD8u6U6j3KrEUF+67aEx1dWRpM6Zh3z9NvIXlGqUHSFxsPeuUQyBn4soHwdjcjUezWaz6SNnyN3oQfMY7CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T16:13:02.209132Z","bundle_sha256":"42ac5e936c72884ade0ed4a7296b0c6571ba368eb5482f040a84a1b6023537cd"}}