{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3GJTUQWMUOWT3RA3N2U2QUEZ2Q","short_pith_number":"pith:3GJTUQWM","canonical_record":{"source":{"id":"1802.00150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-01T04:06:39Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5379c7fbbf76840f8766add5eecf922f058ba4ffc7e980ceab8e3901327f2838","abstract_canon_sha256":"fc41cb5f12d7210dadd834755070daf9458e07bf277f3cad2b8a8347c7f0c6d3"},"schema_version":"1.0"},"canonical_sha256":"d9933a42cca3ad3dc41b6ea9a85099d4183cbc230bb84189a75218abb08325a7","source":{"kind":"arxiv","id":"1802.00150","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.00150","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"arxiv_version","alias_value":"1802.00150v1","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00150","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"pith_short_12","alias_value":"3GJTUQWMUOWT","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3GJTUQWMUOWT3RA3","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3GJTUQWM","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3GJTUQWMUOWT3RA3N2U2QUEZ2Q","target":"record","payload":{"canonical_record":{"source":{"id":"1802.00150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-01T04:06:39Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5379c7fbbf76840f8766add5eecf922f058ba4ffc7e980ceab8e3901327f2838","abstract_canon_sha256":"fc41cb5f12d7210dadd834755070daf9458e07bf277f3cad2b8a8347c7f0c6d3"},"schema_version":"1.0"},"canonical_sha256":"d9933a42cca3ad3dc41b6ea9a85099d4183cbc230bb84189a75218abb08325a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:36.680396Z","signature_b64":"NllQMyElhXPzV/BeYuAaXpQus8+M1lXY1ZpWtoVlFup38vQAeXpGhHUQtsyXQzWdqsE6SBjDD9Y9wMOofujWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9933a42cca3ad3dc41b6ea9a85099d4183cbc230bb84189a75218abb08325a7","last_reissued_at":"2026-05-18T00:24:36.679897Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:36.679897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.00150","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:24:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2t+6oFkbQhufkJoLwcgWxtA6n+ku6qQYmY8VFJRjrhrhcZQNmiZAiPrHokq+C5uuXSrIe8ydSngjF8TyCqjkAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:25:46.788086Z"},"content_sha256":"80dca51d11b37d7d27fd390330235a176c6f2dfdff6e7032a3368c4c237ea9bc","schema_version":"1.0","event_id":"sha256:80dca51d11b37d7d27fd390330235a176c6f2dfdff6e7032a3368c4c237ea9bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3GJTUQWMUOWT3RA3N2U2QUEZ2Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Alternating Multi-bit Quantization for Recurrent Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chen Xu, Hongbin Zha, Jianqiang Yao, Wenwu Ou, Yuanbin Cao, Zhirong Wang, Zhouchen Lin","submitted_at":"2018-02-01T04:06:39Z","abstract_excerpt":"Recurrent neural networks have achieved excellent performance in many applications. However, on portable devices with limited resources, the models are often too large to deploy. For applications on the server with large scale concurrent requests, the latency during inference can also be very critical for costly computing resources. In this work, we address these problems by quantizing the network, both weights and activations, into multiple binary codes {-1,+1}. We formulate the quantization as an optimization problem. Under the key observation that once the quantization coefficients are fixe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00150","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:24:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qqQ9s6pS4MJbwXBa3c6tM3je5sNpXr6O3Sc1Wo0eLa8r4mqqs9pvbjaIDjKCD+zu7la1w891RDRM6uMan3BNAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:25:46.788747Z"},"content_sha256":"6717e21d53e7b04c9d50c6e24391c798f154fb15dcafa2ec0fecf63f38bf2597","schema_version":"1.0","event_id":"sha256:6717e21d53e7b04c9d50c6e24391c798f154fb15dcafa2ec0fecf63f38bf2597"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3GJTUQWMUOWT3RA3N2U2QUEZ2Q/bundle.json","state_url":"https://pith.science/pith/3GJTUQWMUOWT3RA3N2U2QUEZ2Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3GJTUQWMUOWT3RA3N2U2QUEZ2Q/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-27T06:25:46Z","links":{"resolver":"https://pith.science/pith/3GJTUQWMUOWT3RA3N2U2QUEZ2Q","bundle":"https://pith.science/pith/3GJTUQWMUOWT3RA3N2U2QUEZ2Q/bundle.json","state":"https://pith.science/pith/3GJTUQWMUOWT3RA3N2U2QUEZ2Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3GJTUQWMUOWT3RA3N2U2QUEZ2Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3GJTUQWMUOWT3RA3N2U2QUEZ2Q","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":"fc41cb5f12d7210dadd834755070daf9458e07bf277f3cad2b8a8347c7f0c6d3","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-01T04:06:39Z","title_canon_sha256":"5379c7fbbf76840f8766add5eecf922f058ba4ffc7e980ceab8e3901327f2838"},"schema_version":"1.0","source":{"id":"1802.00150","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.00150","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"arxiv_version","alias_value":"1802.00150v1","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00150","created_at":"2026-05-18T00:24:36Z"},{"alias_kind":"pith_short_12","alias_value":"3GJTUQWMUOWT","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3GJTUQWMUOWT3RA3","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3GJTUQWM","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:6717e21d53e7b04c9d50c6e24391c798f154fb15dcafa2ec0fecf63f38bf2597","target":"graph","created_at":"2026-05-18T00:24:36Z","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":"Recurrent neural networks have achieved excellent performance in many applications. However, on portable devices with limited resources, the models are often too large to deploy. For applications on the server with large scale concurrent requests, the latency during inference can also be very critical for costly computing resources. In this work, we address these problems by quantizing the network, both weights and activations, into multiple binary codes {-1,+1}. We formulate the quantization as an optimization problem. Under the key observation that once the quantization coefficients are fixe","authors_text":"Chen Xu, Hongbin Zha, Jianqiang Yao, Wenwu Ou, Yuanbin Cao, Zhirong Wang, Zhouchen Lin","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-01T04:06:39Z","title":"Alternating Multi-bit Quantization for Recurrent Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00150","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:80dca51d11b37d7d27fd390330235a176c6f2dfdff6e7032a3368c4c237ea9bc","target":"record","created_at":"2026-05-18T00:24:36Z","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":"fc41cb5f12d7210dadd834755070daf9458e07bf277f3cad2b8a8347c7f0c6d3","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-01T04:06:39Z","title_canon_sha256":"5379c7fbbf76840f8766add5eecf922f058ba4ffc7e980ceab8e3901327f2838"},"schema_version":"1.0","source":{"id":"1802.00150","kind":"arxiv","version":1}},"canonical_sha256":"d9933a42cca3ad3dc41b6ea9a85099d4183cbc230bb84189a75218abb08325a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9933a42cca3ad3dc41b6ea9a85099d4183cbc230bb84189a75218abb08325a7","first_computed_at":"2026-05-18T00:24:36.679897Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:36.679897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NllQMyElhXPzV/BeYuAaXpQus8+M1lXY1ZpWtoVlFup38vQAeXpGhHUQtsyXQzWdqsE6SBjDD9Y9wMOofujWBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:36.680396Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.00150","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80dca51d11b37d7d27fd390330235a176c6f2dfdff6e7032a3368c4c237ea9bc","sha256:6717e21d53e7b04c9d50c6e24391c798f154fb15dcafa2ec0fecf63f38bf2597"],"state_sha256":"16e363346e062bb889dbc6dbdf8174a7ee8ec7d2dbb7552a5faefc6c5058b278"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dkCiRPzvekShrOIbWP7YR72YKxo8jPcCzAFJhUW/1Ydt5bi6of7LlbNy9i3UQiq+EcBnUD0PvmECeT2YBmexAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T06:25:46.791987Z","bundle_sha256":"4dea3601d3044011892c14856396602d8323d5bd3bf6b527df89c5b5f66aaa22"}}