{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:J7WIC4JK72CMZE5EZQDS2SDSCW","short_pith_number":"pith:J7WIC4JK","schema_version":"1.0","canonical_sha256":"4fec81712afe84cc93a4cc072d48721598e28376c78524c0c3b60dc31f16dc2d","source":{"kind":"arxiv","id":"1805.02919","version":2},"attestation_state":"computed","paper":{"title":"Learning Short-Cut Connections for Object Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Daniel O\\~noro-Rubio, Mathias Niepert, Roberto J. L\\'opez-Sastre","submitted_at":"2018-05-08T09:31:51Z","abstract_excerpt":"Object counting is an important task in computer vision due to its growing demand in applications such as traffic monitoring or surveillance. In this paper, we consider object counting as a learning problem of a joint feature extraction and pixel-wise object density estimation with Convolutional-Deconvolutional networks. We introduce a novel counting model, named Gated U-Net (GU-Net). Specifically, we propose to enrich the U-Net architecture with the concept of learnable short-cut connections. Standard short-cut connections are connections between layers in deep neural networks which skip at l"},"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":"1805.02919","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-05-08T09:31:51Z","cross_cats_sorted":[],"title_canon_sha256":"39db364a133b29729f019fce078de9dc3bcba11f5ba65539602f0238f3cdf21b","abstract_canon_sha256":"a8581334ae6a3b5e2f15d197f039b3d3748ba39b57bfd7804a0dd3ee815584b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:39.576337Z","signature_b64":"lawDiyLpgkrRpDPTwspIyY4YnsvBT9h1j3dvamYnkt/dEFX+VRugDhe92BNXqppW3Xt2fC6hQdZSOddl2632CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fec81712afe84cc93a4cc072d48721598e28376c78524c0c3b60dc31f16dc2d","last_reissued_at":"2026-05-18T00:00:39.575815Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:39.575815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Short-Cut Connections for Object Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Daniel O\\~noro-Rubio, Mathias Niepert, Roberto J. L\\'opez-Sastre","submitted_at":"2018-05-08T09:31:51Z","abstract_excerpt":"Object counting is an important task in computer vision due to its growing demand in applications such as traffic monitoring or surveillance. In this paper, we consider object counting as a learning problem of a joint feature extraction and pixel-wise object density estimation with Convolutional-Deconvolutional networks. We introduce a novel counting model, named Gated U-Net (GU-Net). Specifically, we propose to enrich the U-Net architecture with the concept of learnable short-cut connections. Standard short-cut connections are connections between layers in deep neural networks which skip at l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02919","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":""},"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":"1805.02919","created_at":"2026-05-18T00:00:39.575901+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.02919v2","created_at":"2026-05-18T00:00:39.575901+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02919","created_at":"2026-05-18T00:00:39.575901+00:00"},{"alias_kind":"pith_short_12","alias_value":"J7WIC4JK72CM","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"J7WIC4JK72CMZE5E","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"J7WIC4JK","created_at":"2026-05-18T12:32:31.084164+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/J7WIC4JK72CMZE5EZQDS2SDSCW","json":"https://pith.science/pith/J7WIC4JK72CMZE5EZQDS2SDSCW.json","graph_json":"https://pith.science/api/pith-number/J7WIC4JK72CMZE5EZQDS2SDSCW/graph.json","events_json":"https://pith.science/api/pith-number/J7WIC4JK72CMZE5EZQDS2SDSCW/events.json","paper":"https://pith.science/paper/J7WIC4JK"},"agent_actions":{"view_html":"https://pith.science/pith/J7WIC4JK72CMZE5EZQDS2SDSCW","download_json":"https://pith.science/pith/J7WIC4JK72CMZE5EZQDS2SDSCW.json","view_paper":"https://pith.science/paper/J7WIC4JK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.02919&json=true","fetch_graph":"https://pith.science/api/pith-number/J7WIC4JK72CMZE5EZQDS2SDSCW/graph.json","fetch_events":"https://pith.science/api/pith-number/J7WIC4JK72CMZE5EZQDS2SDSCW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J7WIC4JK72CMZE5EZQDS2SDSCW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J7WIC4JK72CMZE5EZQDS2SDSCW/action/storage_attestation","attest_author":"https://pith.science/pith/J7WIC4JK72CMZE5EZQDS2SDSCW/action/author_attestation","sign_citation":"https://pith.science/pith/J7WIC4JK72CMZE5EZQDS2SDSCW/action/citation_signature","submit_replication":"https://pith.science/pith/J7WIC4JK72CMZE5EZQDS2SDSCW/action/replication_record"}},"created_at":"2026-05-18T00:00:39.575901+00:00","updated_at":"2026-05-18T00:00:39.575901+00:00"}