{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:1994:EWO2VRTCFF7HOSLQWHFRDZ7NO7","short_pith_number":"pith:EWO2VRTC","canonical_record":{"source":{"id":"math/9411223","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"1994-11-22T00:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"1afe71b454fc4cbab966fca79011644132b9d218d188c9e6824e0372ba67ff23","abstract_canon_sha256":"c06ff85ef8b4c4740841fc364224fe2d9c4d621c5694cb81e881ae837bffddc2"},"schema_version":"1.0"},"canonical_sha256":"259daac662297e774970b1cb11e7ed77c82b9d6790a9b863dcd09f19ac7cc1cd","source":{"kind":"arxiv","id":"math/9411223","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/9411223","created_at":"2026-05-18T01:05:50Z"},{"alias_kind":"arxiv_version","alias_value":"math/9411223v1","created_at":"2026-05-18T01:05:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9411223","created_at":"2026-05-18T01:05:50Z"},{"alias_kind":"pith_short_12","alias_value":"EWO2VRTCFF7H","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_16","alias_value":"EWO2VRTCFF7HOSLQ","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_8","alias_value":"EWO2VRTC","created_at":"2026-05-18T12:25:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:1994:EWO2VRTCFF7HOSLQWHFRDZ7NO7","target":"record","payload":{"canonical_record":{"source":{"id":"math/9411223","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"1994-11-22T00:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"1afe71b454fc4cbab966fca79011644132b9d218d188c9e6824e0372ba67ff23","abstract_canon_sha256":"c06ff85ef8b4c4740841fc364224fe2d9c4d621c5694cb81e881ae837bffddc2"},"schema_version":"1.0"},"canonical_sha256":"259daac662297e774970b1cb11e7ed77c82b9d6790a9b863dcd09f19ac7cc1cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:50.847963Z","signature_b64":"9QyHKv54kkeIuIrjZ4YrfYJcP+oCovwS38do5CgvsNPcnn031HBi2kZeobaqiV4IidClYMjTxmaLRrp2qgKHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"259daac662297e774970b1cb11e7ed77c82b9d6790a9b863dcd09f19ac7cc1cd","last_reissued_at":"2026-05-18T01:05:50.847459Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:50.847459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/9411223","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:05:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xhuLMxizPvPrtWk0ruwjg6Ez3sjIpTpsIXhn1AkX2RJInw5gr8Yr0uAoUTRq5AtAe1Vnhocgio1JJvGZ4bjVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T20:16:32.367914Z"},"content_sha256":"2de841a8861b384d763f6ecfb89602733134e62686a1b318ab835173b899e8c5","schema_version":"1.0","event_id":"sha256:2de841a8861b384d763f6ecfb89602733134e62686a1b318ab835173b899e8c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:1994:EWO2VRTCFF7HOSLQWHFRDZ7NO7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms for learning and teaching sets of vertices in graphs","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lane H. Clark, Michael R. Fellows, Patricia A. Evans, Walter D. Wallis","submitted_at":"1994-11-22T00:00:00Z","abstract_excerpt":"The learning complexity of special sets of vertices in graphs is studied in the model(s) of exact learning by (extended) equivalence and membership queries. Polynomial-time learning algorithms are described for vertex covers, independent sets, and dominating sets. The complexity of learning vertex sets of fixed size is also investigated, and it is shown that the k-element vertex covers in a graph can be learned in a number of rounds of interaction that is independent of the size of the graph. Apart from the elegance of these algorithmic problems, the chief motivation is the surprising recently"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9411223","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:05:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yV1qd7uuxL0ZlXR4xunTM1fPtSAGUZnaPUSodbOSDwc5Rdf7wQ0llfFmH7Fr2qEVuOZrTG0g9gUM75P+D5yXAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T20:16:32.368264Z"},"content_sha256":"16daa257e845ab9f56a6a713f582524f4d7cf479b26cb41980aa0fbe9f9e7542","schema_version":"1.0","event_id":"sha256:16daa257e845ab9f56a6a713f582524f4d7cf479b26cb41980aa0fbe9f9e7542"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EWO2VRTCFF7HOSLQWHFRDZ7NO7/bundle.json","state_url":"https://pith.science/pith/EWO2VRTCFF7HOSLQWHFRDZ7NO7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EWO2VRTCFF7HOSLQWHFRDZ7NO7/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-21T20:16:32Z","links":{"resolver":"https://pith.science/pith/EWO2VRTCFF7HOSLQWHFRDZ7NO7","bundle":"https://pith.science/pith/EWO2VRTCFF7HOSLQWHFRDZ7NO7/bundle.json","state":"https://pith.science/pith/EWO2VRTCFF7HOSLQWHFRDZ7NO7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EWO2VRTCFF7HOSLQWHFRDZ7NO7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:1994:EWO2VRTCFF7HOSLQWHFRDZ7NO7","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":"c06ff85ef8b4c4740841fc364224fe2d9c4d621c5694cb81e881ae837bffddc2","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"1994-11-22T00:00:00Z","title_canon_sha256":"1afe71b454fc4cbab966fca79011644132b9d218d188c9e6824e0372ba67ff23"},"schema_version":"1.0","source":{"id":"math/9411223","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/9411223","created_at":"2026-05-18T01:05:50Z"},{"alias_kind":"arxiv_version","alias_value":"math/9411223v1","created_at":"2026-05-18T01:05:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9411223","created_at":"2026-05-18T01:05:50Z"},{"alias_kind":"pith_short_12","alias_value":"EWO2VRTCFF7H","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_16","alias_value":"EWO2VRTCFF7HOSLQ","created_at":"2026-05-18T12:25:47Z"},{"alias_kind":"pith_short_8","alias_value":"EWO2VRTC","created_at":"2026-05-18T12:25:47Z"}],"graph_snapshots":[{"event_id":"sha256:16daa257e845ab9f56a6a713f582524f4d7cf479b26cb41980aa0fbe9f9e7542","target":"graph","created_at":"2026-05-18T01:05:50Z","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":"The learning complexity of special sets of vertices in graphs is studied in the model(s) of exact learning by (extended) equivalence and membership queries. Polynomial-time learning algorithms are described for vertex covers, independent sets, and dominating sets. The complexity of learning vertex sets of fixed size is also investigated, and it is shown that the k-element vertex covers in a graph can be learned in a number of rounds of interaction that is independent of the size of the graph. Apart from the elegance of these algorithmic problems, the chief motivation is the surprising recently","authors_text":"Lane H. Clark, Michael R. Fellows, Patricia A. Evans, Walter D. Wallis","cross_cats":[],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"1994-11-22T00:00:00Z","title":"Algorithms for learning and teaching sets of vertices in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9411223","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:2de841a8861b384d763f6ecfb89602733134e62686a1b318ab835173b899e8c5","target":"record","created_at":"2026-05-18T01:05:50Z","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":"c06ff85ef8b4c4740841fc364224fe2d9c4d621c5694cb81e881ae837bffddc2","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"1994-11-22T00:00:00Z","title_canon_sha256":"1afe71b454fc4cbab966fca79011644132b9d218d188c9e6824e0372ba67ff23"},"schema_version":"1.0","source":{"id":"math/9411223","kind":"arxiv","version":1}},"canonical_sha256":"259daac662297e774970b1cb11e7ed77c82b9d6790a9b863dcd09f19ac7cc1cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"259daac662297e774970b1cb11e7ed77c82b9d6790a9b863dcd09f19ac7cc1cd","first_computed_at":"2026-05-18T01:05:50.847459Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:05:50.847459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9QyHKv54kkeIuIrjZ4YrfYJcP+oCovwS38do5CgvsNPcnn031HBi2kZeobaqiV4IidClYMjTxmaLRrp2qgKHDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:05:50.847963Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/9411223","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2de841a8861b384d763f6ecfb89602733134e62686a1b318ab835173b899e8c5","sha256:16daa257e845ab9f56a6a713f582524f4d7cf479b26cb41980aa0fbe9f9e7542"],"state_sha256":"fa695330c09ec6d846cbc573bd25a5bea11cf61b8c86e88bcaccde8a5878b590"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IWeO43Hl9kIwV024vXfDFdKU4Ak39PJf6/BVs9I+IC9Y+MC9T1BnIOSNii1Fbivuk5eTxpSuGBc/LF8mF7MTCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T20:16:32.370187Z","bundle_sha256":"12dac598daea6cab7d1e1218fa165ceaca8f9cd6e9c71ac9126b4dfd8d86b559"}}