{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7ZD4OPKJU6OC2GQG3FEJJ5UGO7","short_pith_number":"pith:7ZD4OPKJ","schema_version":"1.0","canonical_sha256":"fe47c73d49a79c2d1a06d94894f68677e22e552c982a5e25ca697ee1c79fc863","source":{"kind":"arxiv","id":"2408.07941","version":2},"attestation_state":"computed","paper":{"title":"Robust Offline Active Learning on Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Yuanchen Wu, Yubai Yuan","submitted_at":"2024-08-15T05:31:26Z","abstract_excerpt":"We consider the problem of active learning on graphs, which has crucial applications in many real-world networks where labeling node responses is expensive. In this paper, we propose an offline active learning method that selects nodes to query by explicitly incorporating information from both the network structure and node covariates. Building on graph signal recovery theories and the random spectral sparsification technique, the proposed method adopts a two-stage biased sampling strategy that takes both informativeness and representativeness into consideration for node querying. Informativen"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2408.07941","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-08-15T05:31:26Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"18563eb0cf992d8d95b65635bc75cd8fb80bd7493467a3ded17481d4db0564a9","abstract_canon_sha256":"408b6b3e1e7876a3dd843883458a0d71e39ad3be54845da6cdc9f66bc9bcd9d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:32:11.421769Z","signature_b64":"AnZC4KV0XBjokZdO4ZPWYdLUax4kZ9nhXDhEb/4E1cO3V5XG4a3v8CKZmEP66uL8GYIlW71H1ITZ0UWeIMx4Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe47c73d49a79c2d1a06d94894f68677e22e552c982a5e25ca697ee1c79fc863","last_reissued_at":"2026-07-05T09:32:11.421364Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:32:11.421364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Offline Active Learning on Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Yuanchen Wu, Yubai Yuan","submitted_at":"2024-08-15T05:31:26Z","abstract_excerpt":"We consider the problem of active learning on graphs, which has crucial applications in many real-world networks where labeling node responses is expensive. In this paper, we propose an offline active learning method that selects nodes to query by explicitly incorporating information from both the network structure and node covariates. Building on graph signal recovery theories and the random spectral sparsification technique, the proposed method adopts a two-stage biased sampling strategy that takes both informativeness and representativeness into consideration for node querying. Informativen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.07941","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/2408.07941/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2408.07941","created_at":"2026-07-05T09:32:11.421421+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.07941v2","created_at":"2026-07-05T09:32:11.421421+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.07941","created_at":"2026-07-05T09:32:11.421421+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ZD4OPKJU6OC","created_at":"2026-07-05T09:32:11.421421+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ZD4OPKJU6OC2GQG","created_at":"2026-07-05T09:32:11.421421+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ZD4OPKJ","created_at":"2026-07-05T09:32:11.421421+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.22434","citing_title":"RANA: Robust Active Learning for Noisy Network Alignment","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7ZD4OPKJU6OC2GQG3FEJJ5UGO7","json":"https://pith.science/pith/7ZD4OPKJU6OC2GQG3FEJJ5UGO7.json","graph_json":"https://pith.science/api/pith-number/7ZD4OPKJU6OC2GQG3FEJJ5UGO7/graph.json","events_json":"https://pith.science/api/pith-number/7ZD4OPKJU6OC2GQG3FEJJ5UGO7/events.json","paper":"https://pith.science/paper/7ZD4OPKJ"},"agent_actions":{"view_html":"https://pith.science/pith/7ZD4OPKJU6OC2GQG3FEJJ5UGO7","download_json":"https://pith.science/pith/7ZD4OPKJU6OC2GQG3FEJJ5UGO7.json","view_paper":"https://pith.science/paper/7ZD4OPKJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.07941&json=true","fetch_graph":"https://pith.science/api/pith-number/7ZD4OPKJU6OC2GQG3FEJJ5UGO7/graph.json","fetch_events":"https://pith.science/api/pith-number/7ZD4OPKJU6OC2GQG3FEJJ5UGO7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ZD4OPKJU6OC2GQG3FEJJ5UGO7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ZD4OPKJU6OC2GQG3FEJJ5UGO7/action/storage_attestation","attest_author":"https://pith.science/pith/7ZD4OPKJU6OC2GQG3FEJJ5UGO7/action/author_attestation","sign_citation":"https://pith.science/pith/7ZD4OPKJU6OC2GQG3FEJJ5UGO7/action/citation_signature","submit_replication":"https://pith.science/pith/7ZD4OPKJU6OC2GQG3FEJJ5UGO7/action/replication_record"}},"created_at":"2026-07-05T09:32:11.421421+00:00","updated_at":"2026-07-05T09:32:11.421421+00:00"}