{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:BV7B55HM5L6XIV6V76UPPMZ6VB","short_pith_number":"pith:BV7B55HM","schema_version":"1.0","canonical_sha256":"0d7e1ef4eceafd7457d5ffa8f7b33ea87b2c80ef07a0fa10a0d02b44b233bcda","source":{"kind":"arxiv","id":"2004.08067","version":2},"attestation_state":"computed","paper":{"title":"One-vs-Rest Network-based Deep Probability Model for Open Set Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Chang Ouk Kim, Jaeyeon Jang","submitted_at":"2020-04-17T05:24:34Z","abstract_excerpt":"Unknown examples that are unseen during training often appear in real-world computer vision tasks, and an intelligent self-learning system should be able to differentiate between known and unknown examples. Open set recognition, which addresses this problem, has been studied for approximately a decade. However, conventional open set recognition methods based on deep neural networks (DNNs) lack a foundation for post recognition score analysis. In this paper, we propose a DNN structure in which multiple one-vs-rest sigmoid networks follow a convolutional neural network feature extractor. A one-v"},"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":"2004.08067","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-04-17T05:24:34Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ffe42e46c08e7891e044df3c4f6401f05926d9029b1b6e9a8effe2fa92dfc594","abstract_canon_sha256":"e93fe13ff9373f6d45bf70a3f2dda60dcfa2f8d85c4efe80bdf7f56674a6acfa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:06:21.165663Z","signature_b64":"hQQFinfCUueLk7MsPLPG//DKOEC3iKZduMDandZiPowkT0iJhHaxR/TjJSHbvIq13YIZFD8NfxILKgEVrYpLAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d7e1ef4eceafd7457d5ffa8f7b33ea87b2c80ef07a0fa10a0d02b44b233bcda","last_reissued_at":"2026-07-05T01:06:21.165176Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:06:21.165176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"One-vs-Rest Network-based Deep Probability Model for Open Set Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Chang Ouk Kim, Jaeyeon Jang","submitted_at":"2020-04-17T05:24:34Z","abstract_excerpt":"Unknown examples that are unseen during training often appear in real-world computer vision tasks, and an intelligent self-learning system should be able to differentiate between known and unknown examples. Open set recognition, which addresses this problem, has been studied for approximately a decade. However, conventional open set recognition methods based on deep neural networks (DNNs) lack a foundation for post recognition score analysis. In this paper, we propose a DNN structure in which multiple one-vs-rest sigmoid networks follow a convolutional neural network feature extractor. A one-v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.08067","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/2004.08067/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":"2004.08067","created_at":"2026-07-05T01:06:21.165232+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.08067v2","created_at":"2026-07-05T01:06:21.165232+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.08067","created_at":"2026-07-05T01:06:21.165232+00:00"},{"alias_kind":"pith_short_12","alias_value":"BV7B55HM5L6X","created_at":"2026-07-05T01:06:21.165232+00:00"},{"alias_kind":"pith_short_16","alias_value":"BV7B55HM5L6XIV6V","created_at":"2026-07-05T01:06:21.165232+00:00"},{"alias_kind":"pith_short_8","alias_value":"BV7B55HM","created_at":"2026-07-05T01:06:21.165232+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.02230","citing_title":"Efficient Waste Sorting for Circular Economy: A Confidence-guided comparison between One-Vs-All and One-Vs-Rest Classification Strategies with Human-in-the-Loop for Automated Waste Sorting","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BV7B55HM5L6XIV6V76UPPMZ6VB","json":"https://pith.science/pith/BV7B55HM5L6XIV6V76UPPMZ6VB.json","graph_json":"https://pith.science/api/pith-number/BV7B55HM5L6XIV6V76UPPMZ6VB/graph.json","events_json":"https://pith.science/api/pith-number/BV7B55HM5L6XIV6V76UPPMZ6VB/events.json","paper":"https://pith.science/paper/BV7B55HM"},"agent_actions":{"view_html":"https://pith.science/pith/BV7B55HM5L6XIV6V76UPPMZ6VB","download_json":"https://pith.science/pith/BV7B55HM5L6XIV6V76UPPMZ6VB.json","view_paper":"https://pith.science/paper/BV7B55HM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.08067&json=true","fetch_graph":"https://pith.science/api/pith-number/BV7B55HM5L6XIV6V76UPPMZ6VB/graph.json","fetch_events":"https://pith.science/api/pith-number/BV7B55HM5L6XIV6V76UPPMZ6VB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BV7B55HM5L6XIV6V76UPPMZ6VB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BV7B55HM5L6XIV6V76UPPMZ6VB/action/storage_attestation","attest_author":"https://pith.science/pith/BV7B55HM5L6XIV6V76UPPMZ6VB/action/author_attestation","sign_citation":"https://pith.science/pith/BV7B55HM5L6XIV6V76UPPMZ6VB/action/citation_signature","submit_replication":"https://pith.science/pith/BV7B55HM5L6XIV6V76UPPMZ6VB/action/replication_record"}},"created_at":"2026-07-05T01:06:21.165232+00:00","updated_at":"2026-07-05T01:06:21.165232+00:00"}