{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6VKL4MLBZBNQQ7KQQJTVKGSMKS","short_pith_number":"pith:6VKL4MLB","canonical_record":{"source":{"id":"1804.10123","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-26T15:57:00Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"84a4e6fdd7c272761810ea07279913eb0bfaa9c93535e31ed29db352b13fa89c","abstract_canon_sha256":"a2ae619b406db3610f2e37980e57089a3ccaaccf768ce93152a6d5c10e096f52"},"schema_version":"1.0"},"canonical_sha256":"f554be3161c85b087d508267551a4c549db29baf4e8d6aa6333bc4ac2c950bd0","source":{"kind":"arxiv","id":"1804.10123","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10123","created_at":"2026-05-18T00:17:23Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10123v1","created_at":"2026-05-18T00:17:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10123","created_at":"2026-05-18T00:17:23Z"},{"alias_kind":"pith_short_12","alias_value":"6VKL4MLBZBNQ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6VKL4MLBZBNQQ7KQ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6VKL4MLB","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6VKL4MLBZBNQQ7KQQJTVKGSMKS","target":"record","payload":{"canonical_record":{"source":{"id":"1804.10123","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-26T15:57:00Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"84a4e6fdd7c272761810ea07279913eb0bfaa9c93535e31ed29db352b13fa89c","abstract_canon_sha256":"a2ae619b406db3610f2e37980e57089a3ccaaccf768ce93152a6d5c10e096f52"},"schema_version":"1.0"},"canonical_sha256":"f554be3161c85b087d508267551a4c549db29baf4e8d6aa6333bc4ac2c950bd0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:23.468306Z","signature_b64":"fK7rR1StzvSTrHxSSx9hHKYimcIhfWTu0h9D18lwXB4FUzhPq1edQmL1ITHTXbFOTWH+doDkZxjCWiXixzAwAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f554be3161c85b087d508267551a4c549db29baf4e8d6aa6333bc4ac2c950bd0","last_reissued_at":"2026-05-18T00:17:23.467773Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:23.467773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.10123","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:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NxhAUj1EHvPsNWmDztDbytiLjObmlaSbtDzCEW1u22OpWOp8Qj9ezXtCgucZysA0M6S/N94j9gG6GEZ1hGifAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:11:40.742099Z"},"content_sha256":"471bf6fec6b8f3f4268b643c26f5c019ee6f43c4d7c1495959c84168481d52d0","schema_version":"1.0","event_id":"sha256:471bf6fec6b8f3f4268b643c26f5c019ee6f43c4d7c1495959c84168481d52d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6VKL4MLBZBNQQ7KQQJTVKGSMKS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"IamNN: Iterative and Adaptive Mobile Neural Network for Efficient Image Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.CV","authors_text":"Bart Dhoedt, Jan Kautz, Pavlo Molchanov, Pieter Simoens, Sam Leroux, Thomas Breuel","submitted_at":"2018-04-26T15:57:00Z","abstract_excerpt":"Deep residual networks (ResNets) made a recent breakthrough in deep learning. The core idea of ResNets is to have shortcut connections between layers that allow the network to be much deeper while still being easy to optimize avoiding vanishing gradients. These shortcut connections have interesting side-effects that make ResNets behave differently from other typical network architectures. In this work we use these properties to design a network based on a ResNet but with parameter sharing and with adaptive computation time. The resulting network is much smaller than the original network and ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10123","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:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kIECI8J3aRaBtPHLpfL9I1SioOes/8vJp/zTX5JS/Q1mFabtjn0Iabf2v22acWrRTHlORVXRIEMDzSjs9lx1AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:11:40.742705Z"},"content_sha256":"36860dc9bf9a9c079fba34423da0d84e9f1c707f0fde4bee5434023011da1ca0","schema_version":"1.0","event_id":"sha256:36860dc9bf9a9c079fba34423da0d84e9f1c707f0fde4bee5434023011da1ca0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6VKL4MLBZBNQQ7KQQJTVKGSMKS/bundle.json","state_url":"https://pith.science/pith/6VKL4MLBZBNQQ7KQQJTVKGSMKS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6VKL4MLBZBNQQ7KQQJTVKGSMKS/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-28T04:11:40Z","links":{"resolver":"https://pith.science/pith/6VKL4MLBZBNQQ7KQQJTVKGSMKS","bundle":"https://pith.science/pith/6VKL4MLBZBNQQ7KQQJTVKGSMKS/bundle.json","state":"https://pith.science/pith/6VKL4MLBZBNQQ7KQQJTVKGSMKS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6VKL4MLBZBNQQ7KQQJTVKGSMKS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6VKL4MLBZBNQQ7KQQJTVKGSMKS","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":"a2ae619b406db3610f2e37980e57089a3ccaaccf768ce93152a6d5c10e096f52","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-26T15:57:00Z","title_canon_sha256":"84a4e6fdd7c272761810ea07279913eb0bfaa9c93535e31ed29db352b13fa89c"},"schema_version":"1.0","source":{"id":"1804.10123","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10123","created_at":"2026-05-18T00:17:23Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10123v1","created_at":"2026-05-18T00:17:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10123","created_at":"2026-05-18T00:17:23Z"},{"alias_kind":"pith_short_12","alias_value":"6VKL4MLBZBNQ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6VKL4MLBZBNQQ7KQ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6VKL4MLB","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:36860dc9bf9a9c079fba34423da0d84e9f1c707f0fde4bee5434023011da1ca0","target":"graph","created_at":"2026-05-18T00:17:23Z","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":"Deep residual networks (ResNets) made a recent breakthrough in deep learning. The core idea of ResNets is to have shortcut connections between layers that allow the network to be much deeper while still being easy to optimize avoiding vanishing gradients. These shortcut connections have interesting side-effects that make ResNets behave differently from other typical network architectures. In this work we use these properties to design a network based on a ResNet but with parameter sharing and with adaptive computation time. The resulting network is much smaller than the original network and ca","authors_text":"Bart Dhoedt, Jan Kautz, Pavlo Molchanov, Pieter Simoens, Sam Leroux, Thomas Breuel","cross_cats":["cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-26T15:57:00Z","title":"IamNN: Iterative and Adaptive Mobile Neural Network for Efficient Image Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10123","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:471bf6fec6b8f3f4268b643c26f5c019ee6f43c4d7c1495959c84168481d52d0","target":"record","created_at":"2026-05-18T00:17:23Z","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":"a2ae619b406db3610f2e37980e57089a3ccaaccf768ce93152a6d5c10e096f52","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-04-26T15:57:00Z","title_canon_sha256":"84a4e6fdd7c272761810ea07279913eb0bfaa9c93535e31ed29db352b13fa89c"},"schema_version":"1.0","source":{"id":"1804.10123","kind":"arxiv","version":1}},"canonical_sha256":"f554be3161c85b087d508267551a4c549db29baf4e8d6aa6333bc4ac2c950bd0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f554be3161c85b087d508267551a4c549db29baf4e8d6aa6333bc4ac2c950bd0","first_computed_at":"2026-05-18T00:17:23.467773Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:23.467773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fK7rR1StzvSTrHxSSx9hHKYimcIhfWTu0h9D18lwXB4FUzhPq1edQmL1ITHTXbFOTWH+doDkZxjCWiXixzAwAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:23.468306Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.10123","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:471bf6fec6b8f3f4268b643c26f5c019ee6f43c4d7c1495959c84168481d52d0","sha256:36860dc9bf9a9c079fba34423da0d84e9f1c707f0fde4bee5434023011da1ca0"],"state_sha256":"09dbe8cc6ad8e9b872405d6bf0e65f0d091b7cfad40b46bd125199f60ebd84c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ebqXdRECKokCHhu6Lv3HWkJ+nRddtTIosQwFcVpTTX47enzTrdr/z/H4u+3vyDgLsIhp1jN8CJRkXFaK4RQeAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:11:40.745475Z","bundle_sha256":"25f752655deaf3d400b5b5ae27521da167757450fbc9b51acc43058aab160442"}}