{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ZGFCKAWQM3N7AT2252EUBDYGYE","short_pith_number":"pith:ZGFCKAWQ","schema_version":"1.0","canonical_sha256":"c98a2502d066dbf04f5aee89408f06c121979017b3cd2d5c53dee1f19153828c","source":{"kind":"arxiv","id":"1805.06368","version":2},"attestation_state":"computed","paper":{"title":"Strict Very Fast Decision Tree: a memory conservative algorithm for data stream mining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Andr\\'e Carlos Ponce de Leon Ferreira de Carvalho, Sylvio Barbon Junior, Victor Guilherme Turrisi da Costa","submitted_at":"2018-05-16T15:28:39Z","abstract_excerpt":"Dealing with memory and time constraints are current challenges when learning from data streams with a massive amount of data. Many algorithms have been proposed to handle these difficulties, among them, the Very Fast Decision Tree (VFDT) algorithm. Although the VFDT has been widely used in data stream mining, in the last years, several authors have suggested modifications to increase its performance, putting aside memory concerns by proposing memory-costly solutions. Besides, most data stream mining solutions have been centred around ensembles, which combine the memory costs of their weak lea"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1805.06368","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-16T15:28:39Z","cross_cats_sorted":[],"title_canon_sha256":"50826ecbf1f57628a5a98f88fd3a6d3075f74e2d254f558802ab845d82e717c0","abstract_canon_sha256":"686e0e0bac6611dc959cbbe48eadec1119820deeef5cddc6330f88d454669ac4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:46.200594Z","signature_b64":"2cayN//+lt2Y2XiXpr290aQudUMOjtvSA3rhHPrdPKhNXuQiOLUrxowdfwQDGQ9jaFNTP8DalLpLq33oEQgGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c98a2502d066dbf04f5aee89408f06c121979017b3cd2d5c53dee1f19153828c","last_reissued_at":"2026-05-18T00:15:46.200034Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:46.200034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strict Very Fast Decision Tree: a memory conservative algorithm for data stream mining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Andr\\'e Carlos Ponce de Leon Ferreira de Carvalho, Sylvio Barbon Junior, Victor Guilherme Turrisi da Costa","submitted_at":"2018-05-16T15:28:39Z","abstract_excerpt":"Dealing with memory and time constraints are current challenges when learning from data streams with a massive amount of data. Many algorithms have been proposed to handle these difficulties, among them, the Very Fast Decision Tree (VFDT) algorithm. Although the VFDT has been widely used in data stream mining, in the last years, several authors have suggested modifications to increase its performance, putting aside memory concerns by proposing memory-costly solutions. Besides, most data stream mining solutions have been centred around ensembles, which combine the memory costs of their weak lea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06368","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.06368","created_at":"2026-05-18T00:15:46.200125+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.06368v2","created_at":"2026-05-18T00:15:46.200125+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06368","created_at":"2026-05-18T00:15:46.200125+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZGFCKAWQM3N7","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZGFCKAWQM3N7AT22","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZGFCKAWQ","created_at":"2026-05-18T12:33:07.085635+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZGFCKAWQM3N7AT2252EUBDYGYE","json":"https://pith.science/pith/ZGFCKAWQM3N7AT2252EUBDYGYE.json","graph_json":"https://pith.science/api/pith-number/ZGFCKAWQM3N7AT2252EUBDYGYE/graph.json","events_json":"https://pith.science/api/pith-number/ZGFCKAWQM3N7AT2252EUBDYGYE/events.json","paper":"https://pith.science/paper/ZGFCKAWQ"},"agent_actions":{"view_html":"https://pith.science/pith/ZGFCKAWQM3N7AT2252EUBDYGYE","download_json":"https://pith.science/pith/ZGFCKAWQM3N7AT2252EUBDYGYE.json","view_paper":"https://pith.science/paper/ZGFCKAWQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.06368&json=true","fetch_graph":"https://pith.science/api/pith-number/ZGFCKAWQM3N7AT2252EUBDYGYE/graph.json","fetch_events":"https://pith.science/api/pith-number/ZGFCKAWQM3N7AT2252EUBDYGYE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZGFCKAWQM3N7AT2252EUBDYGYE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZGFCKAWQM3N7AT2252EUBDYGYE/action/storage_attestation","attest_author":"https://pith.science/pith/ZGFCKAWQM3N7AT2252EUBDYGYE/action/author_attestation","sign_citation":"https://pith.science/pith/ZGFCKAWQM3N7AT2252EUBDYGYE/action/citation_signature","submit_replication":"https://pith.science/pith/ZGFCKAWQM3N7AT2252EUBDYGYE/action/replication_record"}},"created_at":"2026-05-18T00:15:46.200125+00:00","updated_at":"2026-05-18T00:15:46.200125+00:00"}