{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LS7L7QYJ3XAW66F7EYLX56RZOO","short_pith_number":"pith:LS7L7QYJ","canonical_record":{"source":{"id":"1707.06990","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-07-21T17:51:36Z","cross_cats_sorted":[],"title_canon_sha256":"d634128e343ca0d640f790646eb44ce23b87792205ab565742a8f0e75322756c","abstract_canon_sha256":"07ee05299453fb1fa23491f2bda01574ae9ab71ad8a6d1ae83514b73265a3384"},"schema_version":"1.0"},"canonical_sha256":"5cbebfc309ddc16f78bf26177efa3973bbb46a281647567fba54cd22579fe38d","source":{"kind":"arxiv","id":"1707.06990","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06990","created_at":"2026-05-18T00:39:48Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06990v1","created_at":"2026-05-18T00:39:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06990","created_at":"2026-05-18T00:39:48Z"},{"alias_kind":"pith_short_12","alias_value":"LS7L7QYJ3XAW","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LS7L7QYJ3XAW66F7","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LS7L7QYJ","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LS7L7QYJ3XAW66F7EYLX56RZOO","target":"record","payload":{"canonical_record":{"source":{"id":"1707.06990","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-07-21T17:51:36Z","cross_cats_sorted":[],"title_canon_sha256":"d634128e343ca0d640f790646eb44ce23b87792205ab565742a8f0e75322756c","abstract_canon_sha256":"07ee05299453fb1fa23491f2bda01574ae9ab71ad8a6d1ae83514b73265a3384"},"schema_version":"1.0"},"canonical_sha256":"5cbebfc309ddc16f78bf26177efa3973bbb46a281647567fba54cd22579fe38d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:48.636130Z","signature_b64":"OcnWu0duZH0EJGqf35xaaYrzMCGGrxQoS7iFS8U/TsAPVOagroPXm+qGCT6s51M52M835g2cVuhlWDC64ZmMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cbebfc309ddc16f78bf26177efa3973bbb46a281647567fba54cd22579fe38d","last_reissued_at":"2026-05-18T00:39:48.635379Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:48.635379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.06990","source_version":1,"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:39:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FlcDDzuoWte2D8vtFtAkO3JUfPTrM8rOFtMuL74BiUTtg1tF+7ep5Xxonrkgvev2glEcM1omDmWz4xAZe4KECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T11:15:01.477047Z"},"content_sha256":"8a4ce799ba39b2aee5dbe708955cb49599668b2f57f5cea6ccadfea655acd965","schema_version":"1.0","event_id":"sha256:8a4ce799ba39b2aee5dbe708955cb49599668b2f57f5cea6ccadfea655acd965"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LS7L7QYJ3XAW66F7EYLX56RZOO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Memory-Efficient Implementation of DenseNets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Danlu Chen, Gao Huang, Geoff Pleiss, Kilian Q. Weinberger, Laurens van der Maaten, Tongcheng Li","submitted_at":"2017-07-21T17:51:36Z","abstract_excerpt":"The DenseNet architecture is highly computationally efficient as a result of feature reuse. However, a naive DenseNet implementation can require a significant amount of GPU memory: If not properly managed, pre-activation batch normalization and contiguous convolution operations can produce feature maps that grow quadratically with network depth. In this technical report, we introduce strategies to reduce the memory consumption of DenseNets during training. By strategically using shared memory allocations, we reduce the memory cost for storing feature maps from quadratic to linear. Without the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06990","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":""},"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:39:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5lkZiRIUww0WdAocK3xYXkzWRsaYuzBfOu8WVFhtDxv82Dcsf/D4llfi/9HibFrXP03o4uAjI9OUCvnEW4rcBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T11:15:01.477408Z"},"content_sha256":"c9f1032a069f48679ca5631473c2efb0cd52ab35efbbf2bb00874e698aad9f88","schema_version":"1.0","event_id":"sha256:c9f1032a069f48679ca5631473c2efb0cd52ab35efbbf2bb00874e698aad9f88"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LS7L7QYJ3XAW66F7EYLX56RZOO/bundle.json","state_url":"https://pith.science/pith/LS7L7QYJ3XAW66F7EYLX56RZOO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LS7L7QYJ3XAW66F7EYLX56RZOO/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-20T11:15:01Z","links":{"resolver":"https://pith.science/pith/LS7L7QYJ3XAW66F7EYLX56RZOO","bundle":"https://pith.science/pith/LS7L7QYJ3XAW66F7EYLX56RZOO/bundle.json","state":"https://pith.science/pith/LS7L7QYJ3XAW66F7EYLX56RZOO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LS7L7QYJ3XAW66F7EYLX56RZOO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LS7L7QYJ3XAW66F7EYLX56RZOO","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":"07ee05299453fb1fa23491f2bda01574ae9ab71ad8a6d1ae83514b73265a3384","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-07-21T17:51:36Z","title_canon_sha256":"d634128e343ca0d640f790646eb44ce23b87792205ab565742a8f0e75322756c"},"schema_version":"1.0","source":{"id":"1707.06990","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06990","created_at":"2026-05-18T00:39:48Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06990v1","created_at":"2026-05-18T00:39:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06990","created_at":"2026-05-18T00:39:48Z"},{"alias_kind":"pith_short_12","alias_value":"LS7L7QYJ3XAW","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LS7L7QYJ3XAW66F7","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LS7L7QYJ","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:c9f1032a069f48679ca5631473c2efb0cd52ab35efbbf2bb00874e698aad9f88","target":"graph","created_at":"2026-05-18T00:39:48Z","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":"The DenseNet architecture is highly computationally efficient as a result of feature reuse. However, a naive DenseNet implementation can require a significant amount of GPU memory: If not properly managed, pre-activation batch normalization and contiguous convolution operations can produce feature maps that grow quadratically with network depth. In this technical report, we introduce strategies to reduce the memory consumption of DenseNets during training. By strategically using shared memory allocations, we reduce the memory cost for storing feature maps from quadratic to linear. Without the ","authors_text":"Danlu Chen, Gao Huang, Geoff Pleiss, Kilian Q. Weinberger, Laurens van der Maaten, Tongcheng Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-07-21T17:51:36Z","title":"Memory-Efficient Implementation of DenseNets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06990","kind":"arxiv","version":1},"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:8a4ce799ba39b2aee5dbe708955cb49599668b2f57f5cea6ccadfea655acd965","target":"record","created_at":"2026-05-18T00:39:48Z","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":"07ee05299453fb1fa23491f2bda01574ae9ab71ad8a6d1ae83514b73265a3384","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-07-21T17:51:36Z","title_canon_sha256":"d634128e343ca0d640f790646eb44ce23b87792205ab565742a8f0e75322756c"},"schema_version":"1.0","source":{"id":"1707.06990","kind":"arxiv","version":1}},"canonical_sha256":"5cbebfc309ddc16f78bf26177efa3973bbb46a281647567fba54cd22579fe38d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5cbebfc309ddc16f78bf26177efa3973bbb46a281647567fba54cd22579fe38d","first_computed_at":"2026-05-18T00:39:48.635379Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:48.635379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OcnWu0duZH0EJGqf35xaaYrzMCGGrxQoS7iFS8U/TsAPVOagroPXm+qGCT6s51M52M835g2cVuhlWDC64ZmMDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:48.636130Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.06990","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a4ce799ba39b2aee5dbe708955cb49599668b2f57f5cea6ccadfea655acd965","sha256:c9f1032a069f48679ca5631473c2efb0cd52ab35efbbf2bb00874e698aad9f88"],"state_sha256":"947872d808ee78578682b8fcbf2c8ad1739d71e8aed3883e574766e6fb8e324c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bdJO2XfU1cfPrOFj9k0DEVTYKFhxl6gMlntsE794ukoIlZaDV0U0M3e8p+btyfvrTcJkm8kjndZwuYI2gx/vBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T11:15:01.479636Z","bundle_sha256":"8d12334d636e28736d9ae88f7249cfa2b78dd3b4ced80d3dc07160df88889b7a"}}