{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MXS25URICG7R5NNXIACDVCVYDC","short_pith_number":"pith:MXS25URI","canonical_record":{"source":{"id":"1611.00558","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-11-02T11:52:49Z","cross_cats_sorted":[],"title_canon_sha256":"0a1381591d46042ce8cf8111f8c0592d8fd6d59504291bf1f3a36a0c72b12a94","abstract_canon_sha256":"11ef00b7d3f8669511b6dfb3545c72d870c245a18b1bc30b5f32fc66f1e809a3"},"schema_version":"1.0"},"canonical_sha256":"65e5aed22811bf1eb5b740043a8ab818aefe92ff9fe31efbe05ff6530f4ae69e","source":{"kind":"arxiv","id":"1611.00558","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00558","created_at":"2026-05-18T00:20:17Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00558v2","created_at":"2026-05-18T00:20:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00558","created_at":"2026-05-18T00:20:17Z"},{"alias_kind":"pith_short_12","alias_value":"MXS25URICG7R","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MXS25URICG7R5NNX","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MXS25URI","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MXS25URICG7R5NNXIACDVCVYDC","target":"record","payload":{"canonical_record":{"source":{"id":"1611.00558","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-11-02T11:52:49Z","cross_cats_sorted":[],"title_canon_sha256":"0a1381591d46042ce8cf8111f8c0592d8fd6d59504291bf1f3a36a0c72b12a94","abstract_canon_sha256":"11ef00b7d3f8669511b6dfb3545c72d870c245a18b1bc30b5f32fc66f1e809a3"},"schema_version":"1.0"},"canonical_sha256":"65e5aed22811bf1eb5b740043a8ab818aefe92ff9fe31efbe05ff6530f4ae69e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:17.648062Z","signature_b64":"H8urpa3LWhdwRzbwzFhnbBhtxcTYDaIdgt5E0Pl5uwa9w6oLYltw4eA0G9OyQ3q/SwmvogEz4A2x4YvkKbpWCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65e5aed22811bf1eb5b740043a8ab818aefe92ff9fe31efbe05ff6530f4ae69e","last_reissued_at":"2026-05-18T00:20:17.647440Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:17.647440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.00558","source_version":2,"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-18T00:20:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YVkU/f5tWJOxnfn0PPopGr30shF5FACt2CY03ZV15Y3SIGp13/UqT/0L0MWV/335Gw4XCB+tvF+0jr8kPbCvCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:22:19.485049Z"},"content_sha256":"2246f6a83169fbc6e92b22bd4ee810cceb2873a6b217cbbaf1a054a82ec9638b","schema_version":"1.0","event_id":"sha256:2246f6a83169fbc6e92b22bd4ee810cceb2873a6b217cbbaf1a054a82ec9638b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MXS25URICG7R5NNXIACDVCVYDC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving incremental recommenders with online bagging","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Al\\'ipio M\\'ario Jorge, Jo\\~ao Gama, Jo\\~ao Vinagre","submitted_at":"2016-11-02T11:52:49Z","abstract_excerpt":"Online recommender systems often deal with continuous, potentially fast and unbounded flows of data. Ensemble methods for recommender systems have been used in the past in batch algorithms, however they have never been studied with incremental algorithms that learn from data streams. We evaluate online bagging with an incremental matrix factorization algorithm for top-N recommendation with positive-only -- binary -- ratings. Our results show that online bagging is able to improve accuracy up to 35% over the baseline, with small computational overhead."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00558","kind":"arxiv","version":2},"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-18T00:20:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vT6j3toe2sZwozQ4BM4M83z1aebQNzZMPp0uAEY5OLbAO9w0cJ2Sk8xahLPKsBkMshcDxiCeQCELqcKdpX7vAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:22:19.485406Z"},"content_sha256":"8f05a71a5bb54cc68d9fcee8797d176801998c371fe5d5b628e1970fce588db5","schema_version":"1.0","event_id":"sha256:8f05a71a5bb54cc68d9fcee8797d176801998c371fe5d5b628e1970fce588db5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MXS25URICG7R5NNXIACDVCVYDC/bundle.json","state_url":"https://pith.science/pith/MXS25URICG7R5NNXIACDVCVYDC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MXS25URICG7R5NNXIACDVCVYDC/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-01T05:22:19Z","links":{"resolver":"https://pith.science/pith/MXS25URICG7R5NNXIACDVCVYDC","bundle":"https://pith.science/pith/MXS25URICG7R5NNXIACDVCVYDC/bundle.json","state":"https://pith.science/pith/MXS25URICG7R5NNXIACDVCVYDC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MXS25URICG7R5NNXIACDVCVYDC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MXS25URICG7R5NNXIACDVCVYDC","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":"11ef00b7d3f8669511b6dfb3545c72d870c245a18b1bc30b5f32fc66f1e809a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-11-02T11:52:49Z","title_canon_sha256":"0a1381591d46042ce8cf8111f8c0592d8fd6d59504291bf1f3a36a0c72b12a94"},"schema_version":"1.0","source":{"id":"1611.00558","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.00558","created_at":"2026-05-18T00:20:17Z"},{"alias_kind":"arxiv_version","alias_value":"1611.00558v2","created_at":"2026-05-18T00:20:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00558","created_at":"2026-05-18T00:20:17Z"},{"alias_kind":"pith_short_12","alias_value":"MXS25URICG7R","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MXS25URICG7R5NNX","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MXS25URI","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:8f05a71a5bb54cc68d9fcee8797d176801998c371fe5d5b628e1970fce588db5","target":"graph","created_at":"2026-05-18T00:20:17Z","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":"Online recommender systems often deal with continuous, potentially fast and unbounded flows of data. Ensemble methods for recommender systems have been used in the past in batch algorithms, however they have never been studied with incremental algorithms that learn from data streams. We evaluate online bagging with an incremental matrix factorization algorithm for top-N recommendation with positive-only -- binary -- ratings. Our results show that online bagging is able to improve accuracy up to 35% over the baseline, with small computational overhead.","authors_text":"Al\\'ipio M\\'ario Jorge, Jo\\~ao Gama, Jo\\~ao Vinagre","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-11-02T11:52:49Z","title":"Improving incremental recommenders with online bagging"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00558","kind":"arxiv","version":2},"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:2246f6a83169fbc6e92b22bd4ee810cceb2873a6b217cbbaf1a054a82ec9638b","target":"record","created_at":"2026-05-18T00:20:17Z","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":"11ef00b7d3f8669511b6dfb3545c72d870c245a18b1bc30b5f32fc66f1e809a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2016-11-02T11:52:49Z","title_canon_sha256":"0a1381591d46042ce8cf8111f8c0592d8fd6d59504291bf1f3a36a0c72b12a94"},"schema_version":"1.0","source":{"id":"1611.00558","kind":"arxiv","version":2}},"canonical_sha256":"65e5aed22811bf1eb5b740043a8ab818aefe92ff9fe31efbe05ff6530f4ae69e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65e5aed22811bf1eb5b740043a8ab818aefe92ff9fe31efbe05ff6530f4ae69e","first_computed_at":"2026-05-18T00:20:17.647440Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:17.647440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H8urpa3LWhdwRzbwzFhnbBhtxcTYDaIdgt5E0Pl5uwa9w6oLYltw4eA0G9OyQ3q/SwmvogEz4A2x4YvkKbpWCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:17.648062Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.00558","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2246f6a83169fbc6e92b22bd4ee810cceb2873a6b217cbbaf1a054a82ec9638b","sha256:8f05a71a5bb54cc68d9fcee8797d176801998c371fe5d5b628e1970fce588db5"],"state_sha256":"f2346d462dd450f35533d22693615bd4e3d3766dcc5b3397355317fc55da088e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w+OUoXB6rVvV/oUzrxle4zEGeACi64YWYM+5cIjHjkqZEN9fXTfOKFX39fjsj75+2CDVATqS8homviRiCaH+Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:22:19.487418Z","bundle_sha256":"4295ec2c06a2166f92de3ac8f550a459469b1732314f71b560ae6a4eb3064fc1"}}