{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:DDP7GEWKTAQNASIEAWKVKRWPV2","short_pith_number":"pith:DDP7GEWK","schema_version":"1.0","canonical_sha256":"18dff312ca9820d0490405955546cfaea2fd3b259a4e5fda514eaf3809ea662f","source":{"kind":"arxiv","id":"1908.05884","version":1},"attestation_state":"computed","paper":{"title":"GODS: Generalized One-class Discriminative Subspaces for Anomaly Detection","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Anoop Cherian, Jue Wang","submitted_at":"2019-08-16T08:19:20Z","abstract_excerpt":"One-class learning is the classic problem of fitting a model to data for which annotations are available only for a single class. In this paper, we propose a novel objective for one-class learning. Our key idea is to use a pair of orthonormal frames -- as subspaces -- to \"sandwich\" the labeled data via optimizing for two objectives jointly: i) minimize the distance between the origins of the two subspaces, and ii) to maximize the margin between the hyperplanes and the data, either subspace demanding the data to be in its positive and negative orthant respectively. Our proposed objective howeve"},"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":"1908.05884","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CV","submitted_at":"2019-08-16T08:19:20Z","cross_cats_sorted":[],"title_canon_sha256":"809dd265aaff8bff4462d0e43ca784670038f40bab0a056add31daa6d0e771dc","abstract_canon_sha256":"7bf68d58751e4c5ca6883ab8d0fd5c18931b9480ff30eafd44797579ae838578"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:57:54.007138Z","signature_b64":"0DNY6XM7MUELMAySuIhhFBOolmic5qg43LvqTVbSPs8knRjc6xhvC16DnmlNAhQess4kyEPkZ0A8jBVDQ/RQAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18dff312ca9820d0490405955546cfaea2fd3b259a4e5fda514eaf3809ea662f","last_reissued_at":"2026-07-04T23:57:54.006771Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:57:54.006771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GODS: Generalized One-class Discriminative Subspaces for Anomaly Detection","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Anoop Cherian, Jue Wang","submitted_at":"2019-08-16T08:19:20Z","abstract_excerpt":"One-class learning is the classic problem of fitting a model to data for which annotations are available only for a single class. In this paper, we propose a novel objective for one-class learning. Our key idea is to use a pair of orthonormal frames -- as subspaces -- to \"sandwich\" the labeled data via optimizing for two objectives jointly: i) minimize the distance between the origins of the two subspaces, and ii) to maximize the margin between the hyperplanes and the data, either subspace demanding the data to be in its positive and negative orthant respectively. Our proposed objective howeve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05884","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/1908.05884/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":"1908.05884","created_at":"2026-07-04T23:57:54.006815+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.05884v1","created_at":"2026-07-04T23:57:54.006815+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05884","created_at":"2026-07-04T23:57:54.006815+00:00"},{"alias_kind":"pith_short_12","alias_value":"DDP7GEWKTAQN","created_at":"2026-07-04T23:57:54.006815+00:00"},{"alias_kind":"pith_short_16","alias_value":"DDP7GEWKTAQNASIE","created_at":"2026-07-04T23:57:54.006815+00:00"},{"alias_kind":"pith_short_8","alias_value":"DDP7GEWK","created_at":"2026-07-04T23:57:54.006815+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.06189","citing_title":"MA-CBP: A Criminal Behavior Prediction Framework Based on Multi-Agent Asynchronous Collaboration","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DDP7GEWKTAQNASIEAWKVKRWPV2","json":"https://pith.science/pith/DDP7GEWKTAQNASIEAWKVKRWPV2.json","graph_json":"https://pith.science/api/pith-number/DDP7GEWKTAQNASIEAWKVKRWPV2/graph.json","events_json":"https://pith.science/api/pith-number/DDP7GEWKTAQNASIEAWKVKRWPV2/events.json","paper":"https://pith.science/paper/DDP7GEWK"},"agent_actions":{"view_html":"https://pith.science/pith/DDP7GEWKTAQNASIEAWKVKRWPV2","download_json":"https://pith.science/pith/DDP7GEWKTAQNASIEAWKVKRWPV2.json","view_paper":"https://pith.science/paper/DDP7GEWK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.05884&json=true","fetch_graph":"https://pith.science/api/pith-number/DDP7GEWKTAQNASIEAWKVKRWPV2/graph.json","fetch_events":"https://pith.science/api/pith-number/DDP7GEWKTAQNASIEAWKVKRWPV2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DDP7GEWKTAQNASIEAWKVKRWPV2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DDP7GEWKTAQNASIEAWKVKRWPV2/action/storage_attestation","attest_author":"https://pith.science/pith/DDP7GEWKTAQNASIEAWKVKRWPV2/action/author_attestation","sign_citation":"https://pith.science/pith/DDP7GEWKTAQNASIEAWKVKRWPV2/action/citation_signature","submit_replication":"https://pith.science/pith/DDP7GEWKTAQNASIEAWKVKRWPV2/action/replication_record"}},"created_at":"2026-07-04T23:57:54.006815+00:00","updated_at":"2026-07-04T23:57:54.006815+00:00"}