{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VCBAPAIVWPLFWV76DQ6BNBC5WA","short_pith_number":"pith:VCBAPAIV","canonical_record":{"source":{"id":"1506.08760","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-29T18:03:25Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5c6a81e9b90c8e5dd7ebe097be9d7144a4949d5b66e7d43272ee7578dac0d866","abstract_canon_sha256":"7a8f68779cb91d02d9a978b1d294809b60e016d4133ce72a42ed773e90148920"},"schema_version":"1.0"},"canonical_sha256":"a882078115b3d65b57fe1c3c16845db00550af503d6fee323b046ca7d4e2ca62","source":{"kind":"arxiv","id":"1506.08760","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08760","created_at":"2026-05-18T01:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08760v1","created_at":"2026-05-18T01:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08760","created_at":"2026-05-18T01:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"VCBAPAIVWPLF","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VCBAPAIVWPLFWV76","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VCBAPAIV","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VCBAPAIVWPLFWV76DQ6BNBC5WA","target":"record","payload":{"canonical_record":{"source":{"id":"1506.08760","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-29T18:03:25Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5c6a81e9b90c8e5dd7ebe097be9d7144a4949d5b66e7d43272ee7578dac0d866","abstract_canon_sha256":"7a8f68779cb91d02d9a978b1d294809b60e016d4133ce72a42ed773e90148920"},"schema_version":"1.0"},"canonical_sha256":"a882078115b3d65b57fe1c3c16845db00550af503d6fee323b046ca7d4e2ca62","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:43.496293Z","signature_b64":"hN6RJmW1qCV93WYkOJ4KhjkmbRHblpfZSUeIjbJZnNRHs+jXwtSvhqidOhrZ7aH4bAR1gz7TVuLLD5m4c0R0Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a882078115b3d65b57fe1c3c16845db00550af503d6fee323b046ca7d4e2ca62","last_reissued_at":"2026-05-18T01:37:43.495709Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:43.495709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.08760","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-18T01:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wNk1FTxw7DtBclomWxXATh+iLWJxyzbQwSM/E4fijRvxNqrnkLBpOlsBA8vWen2+ih8Fb3sT0aaFolXW4lBPDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T21:55:56.378650Z"},"content_sha256":"419f1908758a08cafadedfa99231b86124467f98e4663715a53478fccea000e0","schema_version":"1.0","event_id":"sha256:419f1908758a08cafadedfa99231b86124467f98e4663715a53478fccea000e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VCBAPAIVWPLFWV76DQ6BNBC5WA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"S2: An Efficient Graph Based Active Learning Algorithm with Application to Nonparametric Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Gautam Dasarathy, Robert Nowak, Xiaojin Zhu","submitted_at":"2015-06-29T18:03:25Z","abstract_excerpt":"This paper investigates the problem of active learning for binary label prediction on a graph. We introduce a simple and label-efficient algorithm called S2 for this task. At each step, S2 selects the vertex to be labeled based on the structure of the graph and all previously gathered labels. Specifically, S2 queries for the label of the vertex that bisects the *shortest shortest* path between any pair of oppositely labeled vertices. We present a theoretical estimate of the number of queries S2 needs in terms of a novel parametrization of the complexity of binary functions on graphs. We also p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08760","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-18T01:37:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GLIY4VlPC1mmzryVndqrQWGFrAODnf9cQkuzlSpYRn3+qB5qMFTzwIGPhDVMdYIrlTZwst8FhB7z1aPtJfZcAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T21:55:56.379001Z"},"content_sha256":"0b69bf06a8bfc397f243d761e1baa9463bf8bd14f8019d0f7072651408f9cb87","schema_version":"1.0","event_id":"sha256:0b69bf06a8bfc397f243d761e1baa9463bf8bd14f8019d0f7072651408f9cb87"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VCBAPAIVWPLFWV76DQ6BNBC5WA/bundle.json","state_url":"https://pith.science/pith/VCBAPAIVWPLFWV76DQ6BNBC5WA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VCBAPAIVWPLFWV76DQ6BNBC5WA/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-24T21:55:56Z","links":{"resolver":"https://pith.science/pith/VCBAPAIVWPLFWV76DQ6BNBC5WA","bundle":"https://pith.science/pith/VCBAPAIVWPLFWV76DQ6BNBC5WA/bundle.json","state":"https://pith.science/pith/VCBAPAIVWPLFWV76DQ6BNBC5WA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VCBAPAIVWPLFWV76DQ6BNBC5WA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VCBAPAIVWPLFWV76DQ6BNBC5WA","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":"7a8f68779cb91d02d9a978b1d294809b60e016d4133ce72a42ed773e90148920","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-29T18:03:25Z","title_canon_sha256":"5c6a81e9b90c8e5dd7ebe097be9d7144a4949d5b66e7d43272ee7578dac0d866"},"schema_version":"1.0","source":{"id":"1506.08760","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08760","created_at":"2026-05-18T01:37:43Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08760v1","created_at":"2026-05-18T01:37:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08760","created_at":"2026-05-18T01:37:43Z"},{"alias_kind":"pith_short_12","alias_value":"VCBAPAIVWPLF","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VCBAPAIVWPLFWV76","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VCBAPAIV","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:0b69bf06a8bfc397f243d761e1baa9463bf8bd14f8019d0f7072651408f9cb87","target":"graph","created_at":"2026-05-18T01:37:43Z","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":"This paper investigates the problem of active learning for binary label prediction on a graph. We introduce a simple and label-efficient algorithm called S2 for this task. At each step, S2 selects the vertex to be labeled based on the structure of the graph and all previously gathered labels. Specifically, S2 queries for the label of the vertex that bisects the *shortest shortest* path between any pair of oppositely labeled vertices. We present a theoretical estimate of the number of queries S2 needs in terms of a novel parametrization of the complexity of binary functions on graphs. We also p","authors_text":"Gautam Dasarathy, Robert Nowak, Xiaojin Zhu","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-29T18:03:25Z","title":"S2: An Efficient Graph Based Active Learning Algorithm with Application to Nonparametric Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08760","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:419f1908758a08cafadedfa99231b86124467f98e4663715a53478fccea000e0","target":"record","created_at":"2026-05-18T01:37:43Z","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":"7a8f68779cb91d02d9a978b1d294809b60e016d4133ce72a42ed773e90148920","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-06-29T18:03:25Z","title_canon_sha256":"5c6a81e9b90c8e5dd7ebe097be9d7144a4949d5b66e7d43272ee7578dac0d866"},"schema_version":"1.0","source":{"id":"1506.08760","kind":"arxiv","version":1}},"canonical_sha256":"a882078115b3d65b57fe1c3c16845db00550af503d6fee323b046ca7d4e2ca62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a882078115b3d65b57fe1c3c16845db00550af503d6fee323b046ca7d4e2ca62","first_computed_at":"2026-05-18T01:37:43.495709Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:43.495709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hN6RJmW1qCV93WYkOJ4KhjkmbRHblpfZSUeIjbJZnNRHs+jXwtSvhqidOhrZ7aH4bAR1gz7TVuLLD5m4c0R0Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:43.496293Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.08760","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:419f1908758a08cafadedfa99231b86124467f98e4663715a53478fccea000e0","sha256:0b69bf06a8bfc397f243d761e1baa9463bf8bd14f8019d0f7072651408f9cb87"],"state_sha256":"976586d912e3e39a3d54275b5abb5c08e82e8b319388777c9d0b99dd7dc62e13"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MB1QwZVK8FUWcdbSp2wgvN+XSq++u8J+GMrK1MS2dmAqGYdizcC8Q45nftZlqGl/1NKWQYw7U7bkgWfo28ARBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T21:55:56.381289Z","bundle_sha256":"a541099738e47bcb969ef593128168f45cc16ac424fd266341d102bbd16a4b35"}}