{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:357UNJ2AJQSR4JZNDX2JKN6JA2","short_pith_number":"pith:357UNJ2A","canonical_record":{"source":{"id":"2002.07106","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-17T17:54:27Z","cross_cats_sorted":["cs.CL","stat.ML"],"title_canon_sha256":"9d967e568e132c90498f2060edb118a19d423f02db68caadfd8979421c355524","abstract_canon_sha256":"9a532318e3792309bb5100205074d3271179638854142eb0615f64ffe3f98a38"},"schema_version":"1.0"},"canonical_sha256":"df7f46a7404c251e272d1df49537c9068b53984b5bbbeec514520cc4e75538ca","source":{"kind":"arxiv","id":"2002.07106","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.07106","created_at":"2026-07-05T00:55:30Z"},{"alias_kind":"arxiv_version","alias_value":"2002.07106v2","created_at":"2026-07-05T00:55:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.07106","created_at":"2026-07-05T00:55:30Z"},{"alias_kind":"pith_short_12","alias_value":"357UNJ2AJQSR","created_at":"2026-07-05T00:55:30Z"},{"alias_kind":"pith_short_16","alias_value":"357UNJ2AJQSR4JZN","created_at":"2026-07-05T00:55:30Z"},{"alias_kind":"pith_short_8","alias_value":"357UNJ2A","created_at":"2026-07-05T00:55:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:357UNJ2AJQSR4JZNDX2JKN6JA2","target":"record","payload":{"canonical_record":{"source":{"id":"2002.07106","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-17T17:54:27Z","cross_cats_sorted":["cs.CL","stat.ML"],"title_canon_sha256":"9d967e568e132c90498f2060edb118a19d423f02db68caadfd8979421c355524","abstract_canon_sha256":"9a532318e3792309bb5100205074d3271179638854142eb0615f64ffe3f98a38"},"schema_version":"1.0"},"canonical_sha256":"df7f46a7404c251e272d1df49537c9068b53984b5bbbeec514520cc4e75538ca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:55:30.729938Z","signature_b64":"fwsgVNMnig+vVfnn71TEsuR2RUEGvw0fY7UwIEYevSm0gMkNDFQHVVXzVHHy/wioF0mRBNWs6tSgVw3NUVFMCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df7f46a7404c251e272d1df49537c9068b53984b5bbbeec514520cc4e75538ca","last_reissued_at":"2026-07-05T00:55:30.729507Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:55:30.729507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2002.07106","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-07-05T00:55:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4mkndVtris2Kz8NY0re+tIAcnP3pIutJsjS7xv0+vF3jgY8sTxHp+jMlmUDu42qvqCgOQyu1rYhV20KTLUI+BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T10:04:36.622829Z"},"content_sha256":"7551048ddde7452cf74002ab33e8c18e3358664e0ca7c4cfe7e3b91eb0b8c65b","schema_version":"1.0","event_id":"sha256:7551048ddde7452cf74002ab33e8c18e3358664e0ca7c4cfe7e3b91eb0b8c65b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:357UNJ2AJQSR4JZNDX2JKN6JA2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Controlling Computation versus Quality for Neural Sequence Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ankur Bapna, Naveen Arivazhagan, Orhan Firat","submitted_at":"2020-02-17T17:54:27Z","abstract_excerpt":"Most neural networks utilize the same amount of compute for every example independent of the inherent complexity of the input. Further, methods that adapt the amount of computation to the example focus on finding a fixed inference-time computational graph per example, ignoring any external computational budgets or varying inference time limitations. In this work, we utilize conditional computation to make neural sequence models (Transformer) more efficient and computation-aware during inference. We first modify the Transformer architecture, making each set of operations conditionally executabl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.07106","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2002.07106/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:55:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LrUgDbAyDk4segouereyin7tG7LsVbSZFmRGqLYEkOMALq2vSQjlA7twqvj5fse+anQU5frQjmAWHVrojpzdCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T10:04:36.623350Z"},"content_sha256":"17f318514aef3ea6132ee544e908c814c5cc79e7093ed866023d7fc6205236d6","schema_version":"1.0","event_id":"sha256:17f318514aef3ea6132ee544e908c814c5cc79e7093ed866023d7fc6205236d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/357UNJ2AJQSR4JZNDX2JKN6JA2/bundle.json","state_url":"https://pith.science/pith/357UNJ2AJQSR4JZNDX2JKN6JA2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/357UNJ2AJQSR4JZNDX2JKN6JA2/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-08-15T10:04:36Z","links":{"resolver":"https://pith.science/pith/357UNJ2AJQSR4JZNDX2JKN6JA2","bundle":"https://pith.science/pith/357UNJ2AJQSR4JZNDX2JKN6JA2/bundle.json","state":"https://pith.science/pith/357UNJ2AJQSR4JZNDX2JKN6JA2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/357UNJ2AJQSR4JZNDX2JKN6JA2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:357UNJ2AJQSR4JZNDX2JKN6JA2","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":"9a532318e3792309bb5100205074d3271179638854142eb0615f64ffe3f98a38","cross_cats_sorted":["cs.CL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-17T17:54:27Z","title_canon_sha256":"9d967e568e132c90498f2060edb118a19d423f02db68caadfd8979421c355524"},"schema_version":"1.0","source":{"id":"2002.07106","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.07106","created_at":"2026-07-05T00:55:30Z"},{"alias_kind":"arxiv_version","alias_value":"2002.07106v2","created_at":"2026-07-05T00:55:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.07106","created_at":"2026-07-05T00:55:30Z"},{"alias_kind":"pith_short_12","alias_value":"357UNJ2AJQSR","created_at":"2026-07-05T00:55:30Z"},{"alias_kind":"pith_short_16","alias_value":"357UNJ2AJQSR4JZN","created_at":"2026-07-05T00:55:30Z"},{"alias_kind":"pith_short_8","alias_value":"357UNJ2A","created_at":"2026-07-05T00:55:30Z"}],"graph_snapshots":[{"event_id":"sha256:17f318514aef3ea6132ee544e908c814c5cc79e7093ed866023d7fc6205236d6","target":"graph","created_at":"2026-07-05T00:55:30Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2002.07106/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Most neural networks utilize the same amount of compute for every example independent of the inherent complexity of the input. Further, methods that adapt the amount of computation to the example focus on finding a fixed inference-time computational graph per example, ignoring any external computational budgets or varying inference time limitations. In this work, we utilize conditional computation to make neural sequence models (Transformer) more efficient and computation-aware during inference. We first modify the Transformer architecture, making each set of operations conditionally executabl","authors_text":"Ankur Bapna, Naveen Arivazhagan, Orhan Firat","cross_cats":["cs.CL","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-17T17:54:27Z","title":"Controlling Computation versus Quality for Neural Sequence Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.07106","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:7551048ddde7452cf74002ab33e8c18e3358664e0ca7c4cfe7e3b91eb0b8c65b","target":"record","created_at":"2026-07-05T00:55:30Z","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":"9a532318e3792309bb5100205074d3271179638854142eb0615f64ffe3f98a38","cross_cats_sorted":["cs.CL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-17T17:54:27Z","title_canon_sha256":"9d967e568e132c90498f2060edb118a19d423f02db68caadfd8979421c355524"},"schema_version":"1.0","source":{"id":"2002.07106","kind":"arxiv","version":2}},"canonical_sha256":"df7f46a7404c251e272d1df49537c9068b53984b5bbbeec514520cc4e75538ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df7f46a7404c251e272d1df49537c9068b53984b5bbbeec514520cc4e75538ca","first_computed_at":"2026-07-05T00:55:30.729507Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:55:30.729507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fwsgVNMnig+vVfnn71TEsuR2RUEGvw0fY7UwIEYevSm0gMkNDFQHVVXzVHHy/wioF0mRBNWs6tSgVw3NUVFMCA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:55:30.729938Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.07106","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7551048ddde7452cf74002ab33e8c18e3358664e0ca7c4cfe7e3b91eb0b8c65b","sha256:17f318514aef3ea6132ee544e908c814c5cc79e7093ed866023d7fc6205236d6"],"state_sha256":"78d5a8fd22ceb81eaf3431c50ee9b14b3fe4211abdc2cb1197e055204840442f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6VRg1JYdXDonH61sUt7tSG56BqcriI7lwCnutY/VpL6FOw7SzFDZ5F4kqFpFK39kT5gLNGVzlluhgwpOa3W3Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T10:04:36.629601Z","bundle_sha256":"29f889805e5afee3e4576a2f45a6ba212dcee9e02004b862cb5d5b7967ca8db4"}}