{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:J7WIC4JK72CMZE5EZQDS2SDSCW","short_pith_number":"pith:J7WIC4JK","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"},"canonical_sha256":"4fec81712afe84cc93a4cc072d48721598e28376c78524c0c3b60dc31f16dc2d","source":{"kind":"arxiv","id":"1805.02919","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02919","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02919v2","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02919","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"pith_short_12","alias_value":"J7WIC4JK72CM","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"J7WIC4JK72CMZE5E","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"J7WIC4JK","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:J7WIC4JK72CMZE5EZQDS2SDSCW","target":"record","payload":{"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"},"canonical_sha256":"4fec81712afe84cc93a4cc072d48721598e28376c78524c0c3b60dc31f16dc2d","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"},"source_kind":"arxiv","source_id":"1805.02919","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:00:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3N0Hr4mIqppF9MIr7Q8+pQbJ7YXbw2d5f8ew34vKJ+ik78/0TQ2/GutGaRiHth/SD3qjJqcbOQd5bZgiik/oBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T14:24:12.365347Z"},"content_sha256":"2e7c67d034625b7ca8973013141980138b3910e57bd0c893bedc033eb000811b","schema_version":"1.0","event_id":"sha256:2e7c67d034625b7ca8973013141980138b3910e57bd0c893bedc033eb000811b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:J7WIC4JK72CMZE5EZQDS2SDSCW","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:00:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TYn3JWgA8YoxVrz2ZZ/VLz+TrEUtyjg1KliuTlSdnyaEbsWlmb5eNoAqrkSCoFuFjCrSiWdJRqpEZanCpXirAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T14:24:12.366008Z"},"content_sha256":"13111edd91083a662e198b317610584081f59bb33e8aa91e258922fc0fd02a9b","schema_version":"1.0","event_id":"sha256:13111edd91083a662e198b317610584081f59bb33e8aa91e258922fc0fd02a9b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J7WIC4JK72CMZE5EZQDS2SDSCW/bundle.json","state_url":"https://pith.science/pith/J7WIC4JK72CMZE5EZQDS2SDSCW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J7WIC4JK72CMZE5EZQDS2SDSCW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-22T14:24:12Z","links":{"resolver":"https://pith.science/pith/J7WIC4JK72CMZE5EZQDS2SDSCW","bundle":"https://pith.science/pith/J7WIC4JK72CMZE5EZQDS2SDSCW/bundle.json","state":"https://pith.science/pith/J7WIC4JK72CMZE5EZQDS2SDSCW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J7WIC4JK72CMZE5EZQDS2SDSCW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:J7WIC4JK72CMZE5EZQDS2SDSCW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a8581334ae6a3b5e2f15d197f039b3d3748ba39b57bfd7804a0dd3ee815584b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-05-08T09:31:51Z","title_canon_sha256":"39db364a133b29729f019fce078de9dc3bcba11f5ba65539602f0238f3cdf21b"},"schema_version":"1.0","source":{"id":"1805.02919","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02919","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02919v2","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02919","created_at":"2026-05-18T00:00:39Z"},{"alias_kind":"pith_short_12","alias_value":"J7WIC4JK72CM","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"J7WIC4JK72CMZE5E","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"J7WIC4JK","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:13111edd91083a662e198b317610584081f59bb33e8aa91e258922fc0fd02a9b","target":"graph","created_at":"2026-05-18T00:00:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Daniel O\\~noro-Rubio, Mathias Niepert, Roberto J. L\\'opez-Sastre","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-05-08T09:31:51Z","title":"Learning Short-Cut Connections for Object Counting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02919","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2e7c67d034625b7ca8973013141980138b3910e57bd0c893bedc033eb000811b","target":"record","created_at":"2026-05-18T00:00:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a8581334ae6a3b5e2f15d197f039b3d3748ba39b57bfd7804a0dd3ee815584b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-05-08T09:31:51Z","title_canon_sha256":"39db364a133b29729f019fce078de9dc3bcba11f5ba65539602f0238f3cdf21b"},"schema_version":"1.0","source":{"id":"1805.02919","kind":"arxiv","version":2}},"canonical_sha256":"4fec81712afe84cc93a4cc072d48721598e28376c78524c0c3b60dc31f16dc2d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4fec81712afe84cc93a4cc072d48721598e28376c78524c0c3b60dc31f16dc2d","first_computed_at":"2026-05-18T00:00:39.575815Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:39.575815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lawDiyLpgkrRpDPTwspIyY4YnsvBT9h1j3dvamYnkt/dEFX+VRugDhe92BNXqppW3Xt2fC6hQdZSOddl2632CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:39.576337Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.02919","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e7c67d034625b7ca8973013141980138b3910e57bd0c893bedc033eb000811b","sha256:13111edd91083a662e198b317610584081f59bb33e8aa91e258922fc0fd02a9b"],"state_sha256":"bf98a61369ad074caca91e91cfd7de795888811ff0e1316baf8b90ef033ff774"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"12juq/+la5wygb4QkH36Lgoa7axNRsuNcbOyv2l8y4oyyEFAaGZgaFO+fJrmBSZHU+aMozxwrDTeyMd3tKUTBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T14:24:12.368805Z","bundle_sha256":"ac03af49f47d387005b4a69f580686dd8aa85a95f5f12651a380bcde3f5e0cf0"}}