{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:UTXZHIPBTFM6BOH3QYAFVBY5DJ","short_pith_number":"pith:UTXZHIPB","canonical_record":{"source":{"id":"1109.2141","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-09T20:31:05Z","cross_cats_sorted":[],"title_canon_sha256":"1029c63f9b0bffcaf7eb1c242f4947d57434e3c8ed3a77a4c3ed5ee9f8b61f94","abstract_canon_sha256":"4b0ed6cf1fc9b93229fcc9ffbbfa6d5792c67c8164e9f05ac4314413ac272eb7"},"schema_version":"1.0"},"canonical_sha256":"a4ef93a1e19959e0b8fb86005a871d1a7d8306458f992417e65ce31b1692d750","source":{"kind":"arxiv","id":"1109.2141","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2141","created_at":"2026-05-18T04:13:38Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2141v1","created_at":"2026-05-18T04:13:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2141","created_at":"2026-05-18T04:13:38Z"},{"alias_kind":"pith_short_12","alias_value":"UTXZHIPBTFM6","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UTXZHIPBTFM6BOH3","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UTXZHIPB","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:UTXZHIPBTFM6BOH3QYAFVBY5DJ","target":"record","payload":{"canonical_record":{"source":{"id":"1109.2141","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-09T20:31:05Z","cross_cats_sorted":[],"title_canon_sha256":"1029c63f9b0bffcaf7eb1c242f4947d57434e3c8ed3a77a4c3ed5ee9f8b61f94","abstract_canon_sha256":"4b0ed6cf1fc9b93229fcc9ffbbfa6d5792c67c8164e9f05ac4314413ac272eb7"},"schema_version":"1.0"},"canonical_sha256":"a4ef93a1e19959e0b8fb86005a871d1a7d8306458f992417e65ce31b1692d750","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:13:38.510886Z","signature_b64":"y5W84HgocNATR8BPlQAXgYxjIXosFUgrXovvGL0AzFNX4KReO3Z3uG/B4XuP7o8uLufQnOF4dqK2Q8syk3ARAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4ef93a1e19959e0b8fb86005a871d1a7d8306458f992417e65ce31b1692d750","last_reissued_at":"2026-05-18T04:13:38.510083Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:13:38.510083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.2141","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-18T04:13:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HL3QaMNisPI9ugXprJgpG7va5YrFaTZl/naoUdiDP7rXEj+4FmlZGAeNY5NtJ8dbll5pn64AbKeR3GqyHo0dCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T15:53:23.703770Z"},"content_sha256":"388ccb34e3adf9177a2cc8e89278b7b289befd8c876dc6d1e3c3285dd9628513","schema_version":"1.0","event_id":"sha256:388ccb34e3adf9177a2cc8e89278b7b289befd8c876dc6d1e3c3285dd9628513"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:UTXZHIPBTFM6BOH3QYAFVBY5DJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"D. Roth, R. A. Servedio, R. Khardon","submitted_at":"2011-09-09T20:31:05Z","abstract_excerpt":"The paper studies machine learning problems where each example is described using a set of Boolean features and where hypotheses are represented by linear threshold elements.  One method of increasing the expressiveness of learned hypotheses in this context is to expand the feature set to include conjunctions of basic features. This can be done explicitly or where possible by using a kernel function. Focusing on the well known Perceptron and Winnow algorithms, the paper demonstrates a tradeoff between the computational efficiency with which the algorithm can be run over the expanded feature sp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2141","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-18T04:13:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qSIp5cdA0rgeYWH8+C0drl8eloILr9FiPrq5HlbD85jZQmL8tVdcgbozZio5CT4OVCMn/hw26KUQLJW2d2XuBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T15:53:23.704600Z"},"content_sha256":"17e6efd2539a29c2adaa71d50d0d83ec4cb693cae0ba62fb6bc077a2230b2ecb","schema_version":"1.0","event_id":"sha256:17e6efd2539a29c2adaa71d50d0d83ec4cb693cae0ba62fb6bc077a2230b2ecb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UTXZHIPBTFM6BOH3QYAFVBY5DJ/bundle.json","state_url":"https://pith.science/pith/UTXZHIPBTFM6BOH3QYAFVBY5DJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UTXZHIPBTFM6BOH3QYAFVBY5DJ/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-11T15:53:23Z","links":{"resolver":"https://pith.science/pith/UTXZHIPBTFM6BOH3QYAFVBY5DJ","bundle":"https://pith.science/pith/UTXZHIPBTFM6BOH3QYAFVBY5DJ/bundle.json","state":"https://pith.science/pith/UTXZHIPBTFM6BOH3QYAFVBY5DJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UTXZHIPBTFM6BOH3QYAFVBY5DJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:UTXZHIPBTFM6BOH3QYAFVBY5DJ","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":"4b0ed6cf1fc9b93229fcc9ffbbfa6d5792c67c8164e9f05ac4314413ac272eb7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-09T20:31:05Z","title_canon_sha256":"1029c63f9b0bffcaf7eb1c242f4947d57434e3c8ed3a77a4c3ed5ee9f8b61f94"},"schema_version":"1.0","source":{"id":"1109.2141","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2141","created_at":"2026-05-18T04:13:38Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2141v1","created_at":"2026-05-18T04:13:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2141","created_at":"2026-05-18T04:13:38Z"},{"alias_kind":"pith_short_12","alias_value":"UTXZHIPBTFM6","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UTXZHIPBTFM6BOH3","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UTXZHIPB","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:17e6efd2539a29c2adaa71d50d0d83ec4cb693cae0ba62fb6bc077a2230b2ecb","target":"graph","created_at":"2026-05-18T04:13:38Z","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 paper studies machine learning problems where each example is described using a set of Boolean features and where hypotheses are represented by linear threshold elements.  One method of increasing the expressiveness of learned hypotheses in this context is to expand the feature set to include conjunctions of basic features. This can be done explicitly or where possible by using a kernel function. Focusing on the well known Perceptron and Winnow algorithms, the paper demonstrates a tradeoff between the computational efficiency with which the algorithm can be run over the expanded feature sp","authors_text":"D. Roth, R. A. Servedio, R. Khardon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-09T20:31:05Z","title":"Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2141","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:388ccb34e3adf9177a2cc8e89278b7b289befd8c876dc6d1e3c3285dd9628513","target":"record","created_at":"2026-05-18T04:13:38Z","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":"4b0ed6cf1fc9b93229fcc9ffbbfa6d5792c67c8164e9f05ac4314413ac272eb7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-09T20:31:05Z","title_canon_sha256":"1029c63f9b0bffcaf7eb1c242f4947d57434e3c8ed3a77a4c3ed5ee9f8b61f94"},"schema_version":"1.0","source":{"id":"1109.2141","kind":"arxiv","version":1}},"canonical_sha256":"a4ef93a1e19959e0b8fb86005a871d1a7d8306458f992417e65ce31b1692d750","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4ef93a1e19959e0b8fb86005a871d1a7d8306458f992417e65ce31b1692d750","first_computed_at":"2026-05-18T04:13:38.510083Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:13:38.510083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y5W84HgocNATR8BPlQAXgYxjIXosFUgrXovvGL0AzFNX4KReO3Z3uG/B4XuP7o8uLufQnOF4dqK2Q8syk3ARAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:13:38.510886Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.2141","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:388ccb34e3adf9177a2cc8e89278b7b289befd8c876dc6d1e3c3285dd9628513","sha256:17e6efd2539a29c2adaa71d50d0d83ec4cb693cae0ba62fb6bc077a2230b2ecb"],"state_sha256":"2634b5d43c3be528930d64b2d24040cedbf8258a61bcaa35eac73515e462f981"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1CYwwCAyMwxgoq5gy35GtVEk1gjP0jWgMl7tUTy4lOBDWDOXEBWhs7bqm1Cq4f3CMQ4aFQV4spJcE2c6Xs2zCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T15:53:23.708407Z","bundle_sha256":"5750e3b7c724df978a9cab4d02b9defea5c3e3816105d9a2ab538d3a903ae7b2"}}