{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EDKOXVUWO5IA5USGVUCFTWKY7H","short_pith_number":"pith:EDKOXVUW","canonical_record":{"source":{"id":"1405.4324","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-16T22:31:42Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0a03456212c106aa762b6856cb15e6a8c820bc761fd33629a473d76d5696c60f","abstract_canon_sha256":"3c99ef36490f05cec3803ad7a2f6b92f4fad38480fb70b699dccf339db7cef0d"},"schema_version":"1.0"},"canonical_sha256":"20d4ebd69677500ed246ad0459d958f9e149895944c0c4e7985f32a6f894898f","source":{"kind":"arxiv","id":"1405.4324","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4324","created_at":"2026-05-18T02:51:41Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4324v1","created_at":"2026-05-18T02:51:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4324","created_at":"2026-05-18T02:51:41Z"},{"alias_kind":"pith_short_12","alias_value":"EDKOXVUWO5IA","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EDKOXVUWO5IA5USG","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EDKOXVUW","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EDKOXVUWO5IA5USGVUCFTWKY7H","target":"record","payload":{"canonical_record":{"source":{"id":"1405.4324","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-16T22:31:42Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"0a03456212c106aa762b6856cb15e6a8c820bc761fd33629a473d76d5696c60f","abstract_canon_sha256":"3c99ef36490f05cec3803ad7a2f6b92f4fad38480fb70b699dccf339db7cef0d"},"schema_version":"1.0"},"canonical_sha256":"20d4ebd69677500ed246ad0459d958f9e149895944c0c4e7985f32a6f894898f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:41.157182Z","signature_b64":"6Kia3ihZrREv6Hu/K9s70GlrhPaOBEqWV9j5vgX9gBu/UnJYqYXYZQREtbNKp/AttbA1WHWA/PBnugZ107jIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20d4ebd69677500ed246ad0459d958f9e149895944c0c4e7985f32a6f894898f","last_reissued_at":"2026-05-18T02:51:41.156740Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:41.156740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.4324","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-18T02:51:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f7VGkaHXHAHtEkwZLceoL7VD0TswhK/dliyKC9Z3Y0jyYo96SxPMa3mpAP1C7EGRs746OnPPMHyoO4MuX8wkDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:48:38.602416Z"},"content_sha256":"c030053636512cb6f251e72e6dbedf398059e3a7bf6553a9437e3c00ac7f9c00","schema_version":"1.0","event_id":"sha256:c030053636512cb6f251e72e6dbedf398059e3a7bf6553a9437e3c00ac7f9c00"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EDKOXVUWO5IA5USGVUCFTWKY7H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Active Semi-Supervised Learning Using Sampling Theory for Graph Signals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Aamir Anis, Akshay Gadde, Antonio Ortega","submitted_at":"2014-05-16T22:31:42Z","abstract_excerpt":"We consider the problem of offline, pool-based active semi-supervised learning on graphs. This problem is important when the labeled data is scarce and expensive whereas unlabeled data is easily available. The data points are represented by the vertices of an undirected graph with the similarity between them captured by the edge weights. Given a target number of nodes to label, the goal is to choose those nodes that are most informative and then predict the unknown labels. We propose a novel framework for this problem based on our recent results on sampling theory for graph signals. A graph si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4324","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-18T02:51:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kuNcTDTgibI1PSDrQIyaCEN12EIBKDeXFjWDakeZnf/mTDNQHefR/KzPTL1VOb6JyPq1L4ijndMOPoXFGpyLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:48:38.603094Z"},"content_sha256":"d619d9a99dff1921c10f5242f88d1bd8b4331c90ea0d3fb3364440d12e54ce7c","schema_version":"1.0","event_id":"sha256:d619d9a99dff1921c10f5242f88d1bd8b4331c90ea0d3fb3364440d12e54ce7c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EDKOXVUWO5IA5USGVUCFTWKY7H/bundle.json","state_url":"https://pith.science/pith/EDKOXVUWO5IA5USGVUCFTWKY7H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EDKOXVUWO5IA5USGVUCFTWKY7H/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-05-28T18:48:38Z","links":{"resolver":"https://pith.science/pith/EDKOXVUWO5IA5USGVUCFTWKY7H","bundle":"https://pith.science/pith/EDKOXVUWO5IA5USGVUCFTWKY7H/bundle.json","state":"https://pith.science/pith/EDKOXVUWO5IA5USGVUCFTWKY7H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EDKOXVUWO5IA5USGVUCFTWKY7H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EDKOXVUWO5IA5USGVUCFTWKY7H","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":"3c99ef36490f05cec3803ad7a2f6b92f4fad38480fb70b699dccf339db7cef0d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-16T22:31:42Z","title_canon_sha256":"0a03456212c106aa762b6856cb15e6a8c820bc761fd33629a473d76d5696c60f"},"schema_version":"1.0","source":{"id":"1405.4324","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.4324","created_at":"2026-05-18T02:51:41Z"},{"alias_kind":"arxiv_version","alias_value":"1405.4324v1","created_at":"2026-05-18T02:51:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.4324","created_at":"2026-05-18T02:51:41Z"},{"alias_kind":"pith_short_12","alias_value":"EDKOXVUWO5IA","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"EDKOXVUWO5IA5USG","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"EDKOXVUW","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:d619d9a99dff1921c10f5242f88d1bd8b4331c90ea0d3fb3364440d12e54ce7c","target":"graph","created_at":"2026-05-18T02:51:41Z","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":"We consider the problem of offline, pool-based active semi-supervised learning on graphs. This problem is important when the labeled data is scarce and expensive whereas unlabeled data is easily available. The data points are represented by the vertices of an undirected graph with the similarity between them captured by the edge weights. Given a target number of nodes to label, the goal is to choose those nodes that are most informative and then predict the unknown labels. We propose a novel framework for this problem based on our recent results on sampling theory for graph signals. A graph si","authors_text":"Aamir Anis, Akshay Gadde, Antonio Ortega","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-16T22:31:42Z","title":"Active Semi-Supervised Learning Using Sampling Theory for Graph Signals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.4324","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:c030053636512cb6f251e72e6dbedf398059e3a7bf6553a9437e3c00ac7f9c00","target":"record","created_at":"2026-05-18T02:51:41Z","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":"3c99ef36490f05cec3803ad7a2f6b92f4fad38480fb70b699dccf339db7cef0d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-16T22:31:42Z","title_canon_sha256":"0a03456212c106aa762b6856cb15e6a8c820bc761fd33629a473d76d5696c60f"},"schema_version":"1.0","source":{"id":"1405.4324","kind":"arxiv","version":1}},"canonical_sha256":"20d4ebd69677500ed246ad0459d958f9e149895944c0c4e7985f32a6f894898f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20d4ebd69677500ed246ad0459d958f9e149895944c0c4e7985f32a6f894898f","first_computed_at":"2026-05-18T02:51:41.156740Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:41.156740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6Kia3ihZrREv6Hu/K9s70GlrhPaOBEqWV9j5vgX9gBu/UnJYqYXYZQREtbNKp/AttbA1WHWA/PBnugZ107jIBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:41.157182Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.4324","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c030053636512cb6f251e72e6dbedf398059e3a7bf6553a9437e3c00ac7f9c00","sha256:d619d9a99dff1921c10f5242f88d1bd8b4331c90ea0d3fb3364440d12e54ce7c"],"state_sha256":"7811da7c1f986e7aa158f0c6c09a73051a4322677c947fbac3bd41793b006de5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EUOOtJ0E3631eaZDBP8nchz4pEnGCEsVIUaALHVs1URW55BsmhZKMdfAlZsaqdGeInE2ofry7WsUygOQMzmWCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T18:48:38.606345Z","bundle_sha256":"c47dc6051c93f8a32958f719eb3f0c5b8bfbd046223a543d8d84789d1c65248e"}}