{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2001:IC6TG4PECDOZRDJAB5SFIVXEFV","short_pith_number":"pith:IC6TG4PE","canonical_record":{"source":{"id":"cs/0109015","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CL","submitted_at":"2001-09-13T14:52:41Z","cross_cats_sorted":[],"title_canon_sha256":"a013bf36be5a98396aa4ef2910ad9694a0f9e64136c810a22f696638d66834df","abstract_canon_sha256":"ab0222ce169ba28aae13412153be2decc160b4a84df21a01c6aadcfda4e4e01e"},"schema_version":"1.0"},"canonical_sha256":"40bd3371e410dd988d200f645456e42d5c9889910bba33e37b32581db4b74392","source":{"kind":"arxiv","id":"cs/0109015","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0109015","created_at":"2026-07-04T14:24:10Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0109015v1","created_at":"2026-07-04T14:24:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0109015","created_at":"2026-07-04T14:24:10Z"},{"alias_kind":"pith_short_12","alias_value":"IC6TG4PECDOZ","created_at":"2026-07-04T14:24:10Z"},{"alias_kind":"pith_short_16","alias_value":"IC6TG4PECDOZRDJA","created_at":"2026-07-04T14:24:10Z"},{"alias_kind":"pith_short_8","alias_value":"IC6TG4PE","created_at":"2026-07-04T14:24:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2001:IC6TG4PECDOZRDJAB5SFIVXEFV","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0109015","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CL","submitted_at":"2001-09-13T14:52:41Z","cross_cats_sorted":[],"title_canon_sha256":"a013bf36be5a98396aa4ef2910ad9694a0f9e64136c810a22f696638d66834df","abstract_canon_sha256":"ab0222ce169ba28aae13412153be2decc160b4a84df21a01c6aadcfda4e4e01e"},"schema_version":"1.0"},"canonical_sha256":"40bd3371e410dd988d200f645456e42d5c9889910bba33e37b32581db4b74392","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:24:10.911410Z","signature_b64":"iK6St+YV4/tqq9X3INLNn9Njirh2X76RNl4KsAEPuKhEW4J84YhwwVgfBGrnUFbs49nsNz6RWuvcuvtynrHUBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40bd3371e410dd988d200f645456e42d5c9889910bba33e37b32581db4b74392","last_reissued_at":"2026-07-04T14:24:10.911069Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:24:10.911069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0109015","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-07-04T14:24:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Woi07+C9j0VrLXn7vcVtjeXJ4hSQpkKyBgwYDMIqwiu3iE1qY+XPKF1TvtglENT1ijltYYMdCbc9StLbP4FjBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T17:12:26.091753Z"},"content_sha256":"ba456b3292e949bbdda22af4733603ad01f44c6acd2d1c64ac63b4d82843006b","schema_version":"1.0","event_id":"sha256:ba456b3292e949bbdda22af4733603ad01f44c6acd2d1c64ac63b4d82843006b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2001:IC6TG4PECDOZRDJAB5SFIVXEFV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Boosting Trees for Anti-Spam Email Filtering","license":"","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Lluis Marquez, Xavier Carreras","submitted_at":"2001-09-13T14:52:41Z","abstract_excerpt":"This paper describes a set of comparative experiments for the problem of automatically filtering unwanted electronic mail messages. Several variants of the AdaBoost algorithm with confidence-rated predictions [Schapire & Singer, 99] have been applied, which differ in the complexity of the base learners considered. Two main conclusions can be drawn from our experiments: a) The boosting-based methods clearly outperform the baseline learning algorithms (Naive Bayes and Induction of Decision Trees) on the PU1 corpus, achieving very high levels of the F1 measure; b) Increasing the complexity of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0109015","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0109015/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"},"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-07-04T14:24:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l3jCXE6h5c1s1v7s/bJSqJ2Q8lCoubzLurzLfOaNwa3mVyg8i7jJUiT4RdfmNwlxpW+kYyYzhu9Sz6a49BVRBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T17:12:26.092659Z"},"content_sha256":"6a522f6259d92804d4151129c6416683920869c07fb25309a04d5c7fca98ce47","schema_version":"1.0","event_id":"sha256:6a522f6259d92804d4151129c6416683920869c07fb25309a04d5c7fca98ce47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IC6TG4PECDOZRDJAB5SFIVXEFV/bundle.json","state_url":"https://pith.science/pith/IC6TG4PECDOZRDJAB5SFIVXEFV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IC6TG4PECDOZRDJAB5SFIVXEFV/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-08-17T17:12:26Z","links":{"resolver":"https://pith.science/pith/IC6TG4PECDOZRDJAB5SFIVXEFV","bundle":"https://pith.science/pith/IC6TG4PECDOZRDJAB5SFIVXEFV/bundle.json","state":"https://pith.science/pith/IC6TG4PECDOZRDJAB5SFIVXEFV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IC6TG4PECDOZRDJAB5SFIVXEFV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2001:IC6TG4PECDOZRDJAB5SFIVXEFV","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":"ab0222ce169ba28aae13412153be2decc160b4a84df21a01c6aadcfda4e4e01e","cross_cats_sorted":[],"license":"","primary_cat":"cs.CL","submitted_at":"2001-09-13T14:52:41Z","title_canon_sha256":"a013bf36be5a98396aa4ef2910ad9694a0f9e64136c810a22f696638d66834df"},"schema_version":"1.0","source":{"id":"cs/0109015","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0109015","created_at":"2026-07-04T14:24:10Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0109015v1","created_at":"2026-07-04T14:24:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0109015","created_at":"2026-07-04T14:24:10Z"},{"alias_kind":"pith_short_12","alias_value":"IC6TG4PECDOZ","created_at":"2026-07-04T14:24:10Z"},{"alias_kind":"pith_short_16","alias_value":"IC6TG4PECDOZRDJA","created_at":"2026-07-04T14:24:10Z"},{"alias_kind":"pith_short_8","alias_value":"IC6TG4PE","created_at":"2026-07-04T14:24:10Z"}],"graph_snapshots":[{"event_id":"sha256:6a522f6259d92804d4151129c6416683920869c07fb25309a04d5c7fca98ce47","target":"graph","created_at":"2026-07-04T14:24:10Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cs/0109015/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper describes a set of comparative experiments for the problem of automatically filtering unwanted electronic mail messages. Several variants of the AdaBoost algorithm with confidence-rated predictions [Schapire & Singer, 99] have been applied, which differ in the complexity of the base learners considered. Two main conclusions can be drawn from our experiments: a) The boosting-based methods clearly outperform the baseline learning algorithms (Naive Bayes and Induction of Decision Trees) on the PU1 corpus, achieving very high levels of the F1 measure; b) Increasing the complexity of the","authors_text":"Lluis Marquez, Xavier Carreras","cross_cats":[],"headline":"","license":"","primary_cat":"cs.CL","submitted_at":"2001-09-13T14:52:41Z","title":"Boosting Trees for Anti-Spam Email Filtering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0109015","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:ba456b3292e949bbdda22af4733603ad01f44c6acd2d1c64ac63b4d82843006b","target":"record","created_at":"2026-07-04T14:24:10Z","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":"ab0222ce169ba28aae13412153be2decc160b4a84df21a01c6aadcfda4e4e01e","cross_cats_sorted":[],"license":"","primary_cat":"cs.CL","submitted_at":"2001-09-13T14:52:41Z","title_canon_sha256":"a013bf36be5a98396aa4ef2910ad9694a0f9e64136c810a22f696638d66834df"},"schema_version":"1.0","source":{"id":"cs/0109015","kind":"arxiv","version":1}},"canonical_sha256":"40bd3371e410dd988d200f645456e42d5c9889910bba33e37b32581db4b74392","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40bd3371e410dd988d200f645456e42d5c9889910bba33e37b32581db4b74392","first_computed_at":"2026-07-04T14:24:10.911069Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:24:10.911069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iK6St+YV4/tqq9X3INLNn9Njirh2X76RNl4KsAEPuKhEW4J84YhwwVgfBGrnUFbs49nsNz6RWuvcuvtynrHUBA==","signature_status":"signed_v1","signed_at":"2026-07-04T14:24:10.911410Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0109015","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba456b3292e949bbdda22af4733603ad01f44c6acd2d1c64ac63b4d82843006b","sha256:6a522f6259d92804d4151129c6416683920869c07fb25309a04d5c7fca98ce47"],"state_sha256":"a63b97ef41b603bcb75da9e35d685acc74fe31d8a474434fe646846845d3d0b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IYwSU423Ot6qyexuaMuUwCAKUkq7EPD7XkZnHF2mQMahvAzyp4HIpUDqejos/7FRg8EZUQ8Boq16p+HTRc/JBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T17:12:26.099692Z","bundle_sha256":"15a982b6cc1f8891e35478153448db4fe62dc7e754db42db0c71c0366bb9f6d8"}}