{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:Y7PUD77V3KDMNMV6CGHSAW62PY","short_pith_number":"pith:Y7PUD77V","schema_version":"1.0","canonical_sha256":"c7df41fff5da86c6b2be118f205bda7e0a34113efce60bdeb636d453936fbe20","source":{"kind":"arxiv","id":"2003.14043","version":1},"attestation_state":"computed","paper":{"title":"Distance in Latent Space as Novelty Measure","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Mark Philip Philipsen, Thomas Baltzer Moeslund","submitted_at":"2020-03-31T09:14:56Z","abstract_excerpt":"Deep Learning performs well when training data densely covers the experience space. For complex problems this makes data collection prohibitively expensive. We propose to intelligently select samples when constructing data sets in order to best utilize the available labeling budget. The selection methodology is based on the presumption that two dissimilar samples are worth more than two similar samples in a data set. Similarity is measured based on the Euclidean distance between samples in the latent space produced by a DNN. By using a self-supervised method to construct the latent space, it i"},"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":"2003.14043","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2020-03-31T09:14:56Z","cross_cats_sorted":[],"title_canon_sha256":"ab71b70bb4900a2ff04979a99b2a319406b95641fa62625306a389b51f47e678","abstract_canon_sha256":"28a5cbe5c48b086c3942e2a5e2a2468cffc924168f5b39e5c4e8c2853b266024"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:51:47.416262Z","signature_b64":"PwzsB99+Ue0n98nZ4bQZauLpKWN7iQBmk5bnNdGaHz/J40wmmVqnX8XPnW47IqEQH1d6MJ49EIa5gxrd9YaVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7df41fff5da86c6b2be118f205bda7e0a34113efce60bdeb636d453936fbe20","last_reissued_at":"2026-07-05T00:51:47.415809Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:51:47.415809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distance in Latent Space as Novelty Measure","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Mark Philip Philipsen, Thomas Baltzer Moeslund","submitted_at":"2020-03-31T09:14:56Z","abstract_excerpt":"Deep Learning performs well when training data densely covers the experience space. For complex problems this makes data collection prohibitively expensive. We propose to intelligently select samples when constructing data sets in order to best utilize the available labeling budget. The selection methodology is based on the presumption that two dissimilar samples are worth more than two similar samples in a data set. Similarity is measured based on the Euclidean distance between samples in the latent space produced by a DNN. By using a self-supervised method to construct the latent space, it i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.14043","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/2003.14043/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":"2003.14043","created_at":"2026-07-05T00:51:47.415866+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.14043v1","created_at":"2026-07-05T00:51:47.415866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.14043","created_at":"2026-07-05T00:51:47.415866+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y7PUD77V3KDM","created_at":"2026-07-05T00:51:47.415866+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y7PUD77V3KDMNMV6","created_at":"2026-07-05T00:51:47.415866+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y7PUD77V","created_at":"2026-07-05T00:51:47.415866+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.30961","citing_title":"ElemeNet: Multiscale Molecular Machine Learning with Uncertainty Quantification Across the Periodic Table","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y7PUD77V3KDMNMV6CGHSAW62PY","json":"https://pith.science/pith/Y7PUD77V3KDMNMV6CGHSAW62PY.json","graph_json":"https://pith.science/api/pith-number/Y7PUD77V3KDMNMV6CGHSAW62PY/graph.json","events_json":"https://pith.science/api/pith-number/Y7PUD77V3KDMNMV6CGHSAW62PY/events.json","paper":"https://pith.science/paper/Y7PUD77V"},"agent_actions":{"view_html":"https://pith.science/pith/Y7PUD77V3KDMNMV6CGHSAW62PY","download_json":"https://pith.science/pith/Y7PUD77V3KDMNMV6CGHSAW62PY.json","view_paper":"https://pith.science/paper/Y7PUD77V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.14043&json=true","fetch_graph":"https://pith.science/api/pith-number/Y7PUD77V3KDMNMV6CGHSAW62PY/graph.json","fetch_events":"https://pith.science/api/pith-number/Y7PUD77V3KDMNMV6CGHSAW62PY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y7PUD77V3KDMNMV6CGHSAW62PY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y7PUD77V3KDMNMV6CGHSAW62PY/action/storage_attestation","attest_author":"https://pith.science/pith/Y7PUD77V3KDMNMV6CGHSAW62PY/action/author_attestation","sign_citation":"https://pith.science/pith/Y7PUD77V3KDMNMV6CGHSAW62PY/action/citation_signature","submit_replication":"https://pith.science/pith/Y7PUD77V3KDMNMV6CGHSAW62PY/action/replication_record"}},"created_at":"2026-07-05T00:51:47.415866+00:00","updated_at":"2026-07-05T00:51:47.415866+00:00"}