{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:SD3OWSQGTLIJYI7KAN7FQSJ57K","short_pith_number":"pith:SD3OWSQG","schema_version":"1.0","canonical_sha256":"90f6eb4a069ad09c23ea037e58493dfaa884712d4d16cc611813b5de9f0453f6","source":{"kind":"arxiv","id":"2110.10031","version":2},"attestation_state":"computed","paper":{"title":"Online Continual Learning on Class Incremental Blurry Task Configuration with Anytime Inference","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Dahyun Kim, Hyunseo Koh, Jonghyun Choi, Jung-Woo Ha","submitted_at":"2021-10-19T14:59:48Z","abstract_excerpt":"Despite rapid advances in continual learning, a large body of research is devoted to improving performance in the existing setups. While a handful of work do propose new continual learning setups, they still lack practicality in certain aspects. For better practicality, we first propose a novel continual learning setup that is online, task-free, class-incremental, of blurry task boundaries and subject to inference queries at any moment. We additionally propose a new metric to better measure the performance of the continual learning methods subject to inference queries at any moment. To address"},"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":"2110.10031","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2021-10-19T14:59:48Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"6d285c181acb5b7a457004d4d0a789fa4d465150e70fd5a94a3830e9ab6af7db","abstract_canon_sha256":"73bee4901e06ce60337dd8948d6e13067325e1abab6251d4e856d1b59a224802"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:06:46.148486Z","signature_b64":"4zDchOYPaVF76ANjOdKkgcKNg4bokW4YCDjInCo1KavK1pY+jDkmuQVAjktLiiQ3ObVqIVytlx9Sr3DpTVYSCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90f6eb4a069ad09c23ea037e58493dfaa884712d4d16cc611813b5de9f0453f6","last_reissued_at":"2026-07-05T04:06:46.148060Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:06:46.148060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Continual Learning on Class Incremental Blurry Task Configuration with Anytime Inference","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Dahyun Kim, Hyunseo Koh, Jonghyun Choi, Jung-Woo Ha","submitted_at":"2021-10-19T14:59:48Z","abstract_excerpt":"Despite rapid advances in continual learning, a large body of research is devoted to improving performance in the existing setups. While a handful of work do propose new continual learning setups, they still lack practicality in certain aspects. For better practicality, we first propose a novel continual learning setup that is online, task-free, class-incremental, of blurry task boundaries and subject to inference queries at any moment. We additionally propose a new metric to better measure the performance of the continual learning methods subject to inference queries at any moment. To address"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.10031","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2110.10031/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2110.10031","created_at":"2026-07-05T04:06:46.148117+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.10031v2","created_at":"2026-07-05T04:06:46.148117+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.10031","created_at":"2026-07-05T04:06:46.148117+00:00"},{"alias_kind":"pith_short_12","alias_value":"SD3OWSQGTLIJ","created_at":"2026-07-05T04:06:46.148117+00:00"},{"alias_kind":"pith_short_16","alias_value":"SD3OWSQGTLIJYI7K","created_at":"2026-07-05T04:06:46.148117+00:00"},{"alias_kind":"pith_short_8","alias_value":"SD3OWSQG","created_at":"2026-07-05T04:06:46.148117+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2602.07940","citing_title":"MePo: Meta Post-Refinement for Rehearsal-Free General Continual Learning","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SD3OWSQGTLIJYI7KAN7FQSJ57K","json":"https://pith.science/pith/SD3OWSQGTLIJYI7KAN7FQSJ57K.json","graph_json":"https://pith.science/api/pith-number/SD3OWSQGTLIJYI7KAN7FQSJ57K/graph.json","events_json":"https://pith.science/api/pith-number/SD3OWSQGTLIJYI7KAN7FQSJ57K/events.json","paper":"https://pith.science/paper/SD3OWSQG"},"agent_actions":{"view_html":"https://pith.science/pith/SD3OWSQGTLIJYI7KAN7FQSJ57K","download_json":"https://pith.science/pith/SD3OWSQGTLIJYI7KAN7FQSJ57K.json","view_paper":"https://pith.science/paper/SD3OWSQG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.10031&json=true","fetch_graph":"https://pith.science/api/pith-number/SD3OWSQGTLIJYI7KAN7FQSJ57K/graph.json","fetch_events":"https://pith.science/api/pith-number/SD3OWSQGTLIJYI7KAN7FQSJ57K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SD3OWSQGTLIJYI7KAN7FQSJ57K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SD3OWSQGTLIJYI7KAN7FQSJ57K/action/storage_attestation","attest_author":"https://pith.science/pith/SD3OWSQGTLIJYI7KAN7FQSJ57K/action/author_attestation","sign_citation":"https://pith.science/pith/SD3OWSQGTLIJYI7KAN7FQSJ57K/action/citation_signature","submit_replication":"https://pith.science/pith/SD3OWSQGTLIJYI7KAN7FQSJ57K/action/replication_record"}},"created_at":"2026-07-05T04:06:46.148117+00:00","updated_at":"2026-07-05T04:06:46.148117+00:00"}