{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FEIQRTDPJ5DT6TUGUEBOT6DV67","short_pith_number":"pith:FEIQRTDP","schema_version":"1.0","canonical_sha256":"291108cc6f4f473f4e86a102e9f875f7e42a0315cc5fbb9fc94d33879ca684e3","source":{"kind":"arxiv","id":"1911.01149","version":2},"attestation_state":"computed","paper":{"title":"LapNet : Automatic Balanced Loss and Optimal Assignment for Real-Time Dense Object Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Florian Chabot, Mohamed Chaouch, Quoc-Cuong Pham","submitted_at":"2019-11-04T12:13:07Z","abstract_excerpt":"Real-time single-stage object detectors based on deep learning still remain less accurate than more complex ones. The trade-off between model performance and computational speed is a major challenge. In this paper, we propose a new way to efficiently learn a single-shot detector which offers a very good compromise between these two objectives. To this end, we introduce LapNet, an anchor based detector, trained end-to-end without any sampling strategy. Our approach aims to overcome two important problems encountered in training an anchor based detector: (1) ambiguity in the assignment of anchor"},"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":"1911.01149","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-11-04T12:13:07Z","cross_cats_sorted":[],"title_canon_sha256":"cff1c56a25348ad13361dc5d1cef7a7dd230ed66c006c46644277c722f516433","abstract_canon_sha256":"386b9f22b514b188d51e475345a26b09005f0b5667d49984eb3c132aa77a8b58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:48:20.431497Z","signature_b64":"paaZi3UkGukys2ogb3oKcuq1GLebqbIfWyKOIEyQ7JwUchUObybQdOhIgH19PG1/X6rAu76SlgwCKo2b73oaAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"291108cc6f4f473f4e86a102e9f875f7e42a0315cc5fbb9fc94d33879ca684e3","last_reissued_at":"2026-07-05T00:48:20.431076Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:48:20.431076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LapNet : Automatic Balanced Loss and Optimal Assignment for Real-Time Dense Object Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Florian Chabot, Mohamed Chaouch, Quoc-Cuong Pham","submitted_at":"2019-11-04T12:13:07Z","abstract_excerpt":"Real-time single-stage object detectors based on deep learning still remain less accurate than more complex ones. The trade-off between model performance and computational speed is a major challenge. In this paper, we propose a new way to efficiently learn a single-shot detector which offers a very good compromise between these two objectives. To this end, we introduce LapNet, an anchor based detector, trained end-to-end without any sampling strategy. Our approach aims to overcome two important problems encountered in training an anchor based detector: (1) ambiguity in the assignment of anchor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.01149","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/1911.01149/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":"1911.01149","created_at":"2026-07-05T00:48:20.431130+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.01149v2","created_at":"2026-07-05T00:48:20.431130+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.01149","created_at":"2026-07-05T00:48:20.431130+00:00"},{"alias_kind":"pith_short_12","alias_value":"FEIQRTDPJ5DT","created_at":"2026-07-05T00:48:20.431130+00:00"},{"alias_kind":"pith_short_16","alias_value":"FEIQRTDPJ5DT6TUG","created_at":"2026-07-05T00:48:20.431130+00:00"},{"alias_kind":"pith_short_8","alias_value":"FEIQRTDP","created_at":"2026-07-05T00:48:20.431130+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/FEIQRTDPJ5DT6TUGUEBOT6DV67","json":"https://pith.science/pith/FEIQRTDPJ5DT6TUGUEBOT6DV67.json","graph_json":"https://pith.science/api/pith-number/FEIQRTDPJ5DT6TUGUEBOT6DV67/graph.json","events_json":"https://pith.science/api/pith-number/FEIQRTDPJ5DT6TUGUEBOT6DV67/events.json","paper":"https://pith.science/paper/FEIQRTDP"},"agent_actions":{"view_html":"https://pith.science/pith/FEIQRTDPJ5DT6TUGUEBOT6DV67","download_json":"https://pith.science/pith/FEIQRTDPJ5DT6TUGUEBOT6DV67.json","view_paper":"https://pith.science/paper/FEIQRTDP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.01149&json=true","fetch_graph":"https://pith.science/api/pith-number/FEIQRTDPJ5DT6TUGUEBOT6DV67/graph.json","fetch_events":"https://pith.science/api/pith-number/FEIQRTDPJ5DT6TUGUEBOT6DV67/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FEIQRTDPJ5DT6TUGUEBOT6DV67/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FEIQRTDPJ5DT6TUGUEBOT6DV67/action/storage_attestation","attest_author":"https://pith.science/pith/FEIQRTDPJ5DT6TUGUEBOT6DV67/action/author_attestation","sign_citation":"https://pith.science/pith/FEIQRTDPJ5DT6TUGUEBOT6DV67/action/citation_signature","submit_replication":"https://pith.science/pith/FEIQRTDPJ5DT6TUGUEBOT6DV67/action/replication_record"}},"created_at":"2026-07-05T00:48:20.431130+00:00","updated_at":"2026-07-05T00:48:20.431130+00:00"}