{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5F5JAB4Y72GNXF7BOT5CB7E2AU","short_pith_number":"pith:5F5JAB4Y","canonical_record":{"source":{"id":"1804.10001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-26T11:42:39Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"b8dfc3b64d15576578205de1d1e298d482f1fd7947af26ed18ce582b850e6fe9","abstract_canon_sha256":"fee82edbb3b395af22fa7bcec5fbcd18ed6f44e99779f47462e230ae391acc7f"},"schema_version":"1.0"},"canonical_sha256":"e97a900798fe8cdb97e174fa20fc9a053ddce2bf4695a3578e20e742b5123480","source":{"kind":"arxiv","id":"1804.10001","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10001","created_at":"2026-05-18T00:17:25Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10001v1","created_at":"2026-05-18T00:17:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10001","created_at":"2026-05-18T00:17:25Z"},{"alias_kind":"pith_short_12","alias_value":"5F5JAB4Y72GN","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5F5JAB4Y72GNXF7B","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5F5JAB4Y","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5F5JAB4Y72GNXF7BOT5CB7E2AU","target":"record","payload":{"canonical_record":{"source":{"id":"1804.10001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-26T11:42:39Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"b8dfc3b64d15576578205de1d1e298d482f1fd7947af26ed18ce582b850e6fe9","abstract_canon_sha256":"fee82edbb3b395af22fa7bcec5fbcd18ed6f44e99779f47462e230ae391acc7f"},"schema_version":"1.0"},"canonical_sha256":"e97a900798fe8cdb97e174fa20fc9a053ddce2bf4695a3578e20e742b5123480","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:25.439620Z","signature_b64":"1IrJFZDvf8El1d7nQ2coYatl6f0iRBG9+IHM/0iQtQ4U53Vit092NDhHe0dqosoCjbpVjpE5e/hmUyww9GFLDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e97a900798fe8cdb97e174fa20fc9a053ddce2bf4695a3578e20e742b5123480","last_reissued_at":"2026-05-18T00:17:25.439072Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:25.439072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.10001","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:17:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pcUIrWFAR9qLy+7OcFGmMm6F94aelQImWzPSNPyIZKOWVw5fldWloLjN/Wokptzx6P/YJfgvw7zbV4Ox6o1EAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:03:35.400924Z"},"content_sha256":"4e8d1d41dc13c685ec382852753f1c356277b3c89be26c7c728f96dd1f4575d5","schema_version":"1.0","event_id":"sha256:4e8d1d41dc13c685ec382852753f1c356277b3c89be26c7c728f96dd1f4575d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5F5JAB4Y72GNXF7BOT5CB7E2AU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Profile-guided memory optimization for deep neural networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.DC","authors_text":"Haruki Imai, Rudy Raymond, Takashi Imamichi, Taro Sekiyama","submitted_at":"2018-04-26T11:42:39Z","abstract_excerpt":"Recent years have seen deep neural networks (DNNs) becoming wider and deeper to achieve better performance in many applications of AI. Such DNNs however require huge amounts of memory to store weights and intermediate results (e.g., activations, feature maps, etc.) in propagation. This requirement makes it difficult to run the DNNs on devices with limited, hard-to-extend memory, degrades the running time performance, and restricts the design of network models. We address this challenge by developing a novel profile-guided memory optimization to efficiently and quickly allocate memory blocks du"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10001","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:17:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NCqZ20bVT6H1nhQ8nAZXxtxBVV8l1+K7L0dCduN4OvXR6L8Kq3n1qSO3qGhx/BYlts1SN+KzKB+V5te+a9aiDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:03:35.401274Z"},"content_sha256":"aa8a8f540b692257e54be7019d1afbc7c6205d04539e6fe3565ff4d982f1893d","schema_version":"1.0","event_id":"sha256:aa8a8f540b692257e54be7019d1afbc7c6205d04539e6fe3565ff4d982f1893d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5F5JAB4Y72GNXF7BOT5CB7E2AU/bundle.json","state_url":"https://pith.science/pith/5F5JAB4Y72GNXF7BOT5CB7E2AU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5F5JAB4Y72GNXF7BOT5CB7E2AU/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-06-01T14:03:35Z","links":{"resolver":"https://pith.science/pith/5F5JAB4Y72GNXF7BOT5CB7E2AU","bundle":"https://pith.science/pith/5F5JAB4Y72GNXF7BOT5CB7E2AU/bundle.json","state":"https://pith.science/pith/5F5JAB4Y72GNXF7BOT5CB7E2AU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5F5JAB4Y72GNXF7BOT5CB7E2AU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5F5JAB4Y72GNXF7BOT5CB7E2AU","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":"fee82edbb3b395af22fa7bcec5fbcd18ed6f44e99779f47462e230ae391acc7f","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-26T11:42:39Z","title_canon_sha256":"b8dfc3b64d15576578205de1d1e298d482f1fd7947af26ed18ce582b850e6fe9"},"schema_version":"1.0","source":{"id":"1804.10001","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10001","created_at":"2026-05-18T00:17:25Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10001v1","created_at":"2026-05-18T00:17:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10001","created_at":"2026-05-18T00:17:25Z"},{"alias_kind":"pith_short_12","alias_value":"5F5JAB4Y72GN","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5F5JAB4Y72GNXF7B","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5F5JAB4Y","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:aa8a8f540b692257e54be7019d1afbc7c6205d04539e6fe3565ff4d982f1893d","target":"graph","created_at":"2026-05-18T00:17:25Z","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":"Recent years have seen deep neural networks (DNNs) becoming wider and deeper to achieve better performance in many applications of AI. Such DNNs however require huge amounts of memory to store weights and intermediate results (e.g., activations, feature maps, etc.) in propagation. This requirement makes it difficult to run the DNNs on devices with limited, hard-to-extend memory, degrades the running time performance, and restricts the design of network models. We address this challenge by developing a novel profile-guided memory optimization to efficiently and quickly allocate memory blocks du","authors_text":"Haruki Imai, Rudy Raymond, Takashi Imamichi, Taro Sekiyama","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-26T11:42:39Z","title":"Profile-guided memory optimization for deep neural networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10001","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:4e8d1d41dc13c685ec382852753f1c356277b3c89be26c7c728f96dd1f4575d5","target":"record","created_at":"2026-05-18T00:17:25Z","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":"fee82edbb3b395af22fa7bcec5fbcd18ed6f44e99779f47462e230ae391acc7f","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-26T11:42:39Z","title_canon_sha256":"b8dfc3b64d15576578205de1d1e298d482f1fd7947af26ed18ce582b850e6fe9"},"schema_version":"1.0","source":{"id":"1804.10001","kind":"arxiv","version":1}},"canonical_sha256":"e97a900798fe8cdb97e174fa20fc9a053ddce2bf4695a3578e20e742b5123480","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e97a900798fe8cdb97e174fa20fc9a053ddce2bf4695a3578e20e742b5123480","first_computed_at":"2026-05-18T00:17:25.439072Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:25.439072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1IrJFZDvf8El1d7nQ2coYatl6f0iRBG9+IHM/0iQtQ4U53Vit092NDhHe0dqosoCjbpVjpE5e/hmUyww9GFLDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:25.439620Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.10001","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e8d1d41dc13c685ec382852753f1c356277b3c89be26c7c728f96dd1f4575d5","sha256:aa8a8f540b692257e54be7019d1afbc7c6205d04539e6fe3565ff4d982f1893d"],"state_sha256":"07ca29cec50140af944f28e888c8cd8ec929b94947022f8c20e0ef7c2c559fe6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FroYhj3weX3HVMsNQY/rxgK4656spx5zh/BgdwHBzrTnONf3R25A5OaoRRmtUUxEBNzrw1rIg4Kw8e3ypOwJBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:03:35.403323Z","bundle_sha256":"76853f828849650814041466cd745b23e16d7eb123bcb0fd386c4e68b071f98a"}}