{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:YRLZ3OC4SQ66LWLG6QLUHZLJ4X","short_pith_number":"pith:YRLZ3OC4","canonical_record":{"source":{"id":"2007.05003","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-09T18:00:53Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"828f56896b81c19cf1a2ceaaea2114e3e81e35ea39e3ef70fd8ba439405ffd84","abstract_canon_sha256":"495480c9412777bd9fe4f3b0222501fbe658547be376c95daabbcfc2eb4dbd2b"},"schema_version":"1.0"},"canonical_sha256":"c4579db85c943de5d966f41743e569e5fcab8e5d2037892416ab21faea482574","source":{"kind":"arxiv","id":"2007.05003","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.05003","created_at":"2026-07-05T01:17:42Z"},{"alias_kind":"arxiv_version","alias_value":"2007.05003v1","created_at":"2026-07-05T01:17:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.05003","created_at":"2026-07-05T01:17:42Z"},{"alias_kind":"pith_short_12","alias_value":"YRLZ3OC4SQ66","created_at":"2026-07-05T01:17:42Z"},{"alias_kind":"pith_short_16","alias_value":"YRLZ3OC4SQ66LWLG","created_at":"2026-07-05T01:17:42Z"},{"alias_kind":"pith_short_8","alias_value":"YRLZ3OC4","created_at":"2026-07-05T01:17:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:YRLZ3OC4SQ66LWLG6QLUHZLJ4X","target":"record","payload":{"canonical_record":{"source":{"id":"2007.05003","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-09T18:00:53Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"828f56896b81c19cf1a2ceaaea2114e3e81e35ea39e3ef70fd8ba439405ffd84","abstract_canon_sha256":"495480c9412777bd9fe4f3b0222501fbe658547be376c95daabbcfc2eb4dbd2b"},"schema_version":"1.0"},"canonical_sha256":"c4579db85c943de5d966f41743e569e5fcab8e5d2037892416ab21faea482574","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:17:42.492442Z","signature_b64":"P3V31W+svBjBhin79pSrTGHqEm6Yc5Z9FUKFpf1dD52qlfKPtjwXR4ZC6CkXwqa4SYYN1r6YMa4H+AfHkEx3Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4579db85c943de5d966f41743e569e5fcab8e5d2037892416ab21faea482574","last_reissued_at":"2026-07-05T01:17:42.491822Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:17:42.491822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.05003","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-05T01:17:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N6nEvlGo3sMPA3XW7t+17075m1c06hDLPhqpTOYJuO1aRtLu9Gl2cKteRlMSlGu066BertkKvJlYiePwmDegCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T19:25:30.973347Z"},"content_sha256":"50e45775b96425153a56d9c751477a6ab46c36b22ea0c02bc487f97fcdfd99e2","schema_version":"1.0","event_id":"sha256:50e45775b96425153a56d9c751477a6ab46c36b22ea0c02bc487f97fcdfd99e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:YRLZ3OC4SQ66LWLG6QLUHZLJ4X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Active Learning on Attributed Graphs via Graph Cognizant Logistic Regression and Preemptive Query Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Florence Regol, Mark Coates, Soumyasundar Pal, Yingxue Zhang","submitted_at":"2020-07-09T18:00:53Z","abstract_excerpt":"Node classification in attributed graphs is an important task in multiple practical settings, but it can often be difficult or expensive to obtain labels. Active learning can improve the achieved classification performance for a given budget on the number of queried labels. The best existing methods are based on graph neural networks, but they often perform poorly unless a sizeable validation set of labelled nodes is available in order to choose good hyperparameters. We propose a novel graph-based active learning algorithm for the task of node classification in attributed graphs; our algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.05003","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/2007.05003/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-05T01:17:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lNlgS8xQyuixS2AAe5s4yDxUDuwLyI8o9OzdmaDbRlhgQpivnsqjBgdG9n4fFFRHKxnWFLuU2i5bFvcVkUlbDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T19:25:30.973846Z"},"content_sha256":"9b75251a92e4f54548987b18e53bb077d5fc614bebeb984c91758d6c6553da02","schema_version":"1.0","event_id":"sha256:9b75251a92e4f54548987b18e53bb077d5fc614bebeb984c91758d6c6553da02"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YRLZ3OC4SQ66LWLG6QLUHZLJ4X/bundle.json","state_url":"https://pith.science/pith/YRLZ3OC4SQ66LWLG6QLUHZLJ4X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YRLZ3OC4SQ66LWLG6QLUHZLJ4X/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-22T19:25:30Z","links":{"resolver":"https://pith.science/pith/YRLZ3OC4SQ66LWLG6QLUHZLJ4X","bundle":"https://pith.science/pith/YRLZ3OC4SQ66LWLG6QLUHZLJ4X/bundle.json","state":"https://pith.science/pith/YRLZ3OC4SQ66LWLG6QLUHZLJ4X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YRLZ3OC4SQ66LWLG6QLUHZLJ4X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:YRLZ3OC4SQ66LWLG6QLUHZLJ4X","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":"495480c9412777bd9fe4f3b0222501fbe658547be376c95daabbcfc2eb4dbd2b","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-09T18:00:53Z","title_canon_sha256":"828f56896b81c19cf1a2ceaaea2114e3e81e35ea39e3ef70fd8ba439405ffd84"},"schema_version":"1.0","source":{"id":"2007.05003","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.05003","created_at":"2026-07-05T01:17:42Z"},{"alias_kind":"arxiv_version","alias_value":"2007.05003v1","created_at":"2026-07-05T01:17:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.05003","created_at":"2026-07-05T01:17:42Z"},{"alias_kind":"pith_short_12","alias_value":"YRLZ3OC4SQ66","created_at":"2026-07-05T01:17:42Z"},{"alias_kind":"pith_short_16","alias_value":"YRLZ3OC4SQ66LWLG","created_at":"2026-07-05T01:17:42Z"},{"alias_kind":"pith_short_8","alias_value":"YRLZ3OC4","created_at":"2026-07-05T01:17:42Z"}],"graph_snapshots":[{"event_id":"sha256:9b75251a92e4f54548987b18e53bb077d5fc614bebeb984c91758d6c6553da02","target":"graph","created_at":"2026-07-05T01:17:42Z","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/2007.05003/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Node classification in attributed graphs is an important task in multiple practical settings, but it can often be difficult or expensive to obtain labels. Active learning can improve the achieved classification performance for a given budget on the number of queried labels. The best existing methods are based on graph neural networks, but they often perform poorly unless a sizeable validation set of labelled nodes is available in order to choose good hyperparameters. We propose a novel graph-based active learning algorithm for the task of node classification in attributed graphs; our algorithm","authors_text":"Florence Regol, Mark Coates, Soumyasundar Pal, Yingxue Zhang","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-09T18:00:53Z","title":"Active Learning on Attributed Graphs via Graph Cognizant Logistic Regression and Preemptive Query Generation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.05003","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:50e45775b96425153a56d9c751477a6ab46c36b22ea0c02bc487f97fcdfd99e2","target":"record","created_at":"2026-07-05T01:17:42Z","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":"495480c9412777bd9fe4f3b0222501fbe658547be376c95daabbcfc2eb4dbd2b","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-09T18:00:53Z","title_canon_sha256":"828f56896b81c19cf1a2ceaaea2114e3e81e35ea39e3ef70fd8ba439405ffd84"},"schema_version":"1.0","source":{"id":"2007.05003","kind":"arxiv","version":1}},"canonical_sha256":"c4579db85c943de5d966f41743e569e5fcab8e5d2037892416ab21faea482574","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4579db85c943de5d966f41743e569e5fcab8e5d2037892416ab21faea482574","first_computed_at":"2026-07-05T01:17:42.491822Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:17:42.491822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P3V31W+svBjBhin79pSrTGHqEm6Yc5Z9FUKFpf1dD52qlfKPtjwXR4ZC6CkXwqa4SYYN1r6YMa4H+AfHkEx3Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T01:17:42.492442Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.05003","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50e45775b96425153a56d9c751477a6ab46c36b22ea0c02bc487f97fcdfd99e2","sha256:9b75251a92e4f54548987b18e53bb077d5fc614bebeb984c91758d6c6553da02"],"state_sha256":"3a7ad2b3ed1cef57cfa11215a4fdf665a4bd02a38ed86488cf14bc6d56a3171f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ps0DAi9STrZdmmzlG4NnHWDlG/DE/7bS+bMFuVpZ0RcwCFasIY6qhuvz+nWu0qqku8MBgJMN4LTCsUcI6/NpCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T19:25:30.977686Z","bundle_sha256":"1d7375bdfbd98673f6be374842f423a59d57bf7f52c4e30ef96ea7ec88588421"}}