{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:27NC3VGAXVVACSBBCJDCAEIP57","short_pith_number":"pith:27NC3VGA","canonical_record":{"source":{"id":"1307.8319","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2013-07-31T13:40:40Z","cross_cats_sorted":[],"title_canon_sha256":"4217ef798b0e16a264de9b2fca85cdeac4b1b42c97b8b30f485ca35bb4895f3a","abstract_canon_sha256":"092d537825b552c2a17d9017c1e7ae27f642c8754ca973876ddba30ecfb88311"},"schema_version":"1.0"},"canonical_sha256":"d7da2dd4c0bd6a014821124620110fefe10bc2918f22f321f8c8dedb642088ce","source":{"kind":"arxiv","id":"1307.8319","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.8319","created_at":"2026-05-18T03:17:01Z"},{"alias_kind":"arxiv_version","alias_value":"1307.8319v1","created_at":"2026-05-18T03:17:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.8319","created_at":"2026-05-18T03:17:01Z"},{"alias_kind":"pith_short_12","alias_value":"27NC3VGAXVVA","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"27NC3VGAXVVACSBB","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"27NC3VGA","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:27NC3VGAXVVACSBBCJDCAEIP57","target":"record","payload":{"canonical_record":{"source":{"id":"1307.8319","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2013-07-31T13:40:40Z","cross_cats_sorted":[],"title_canon_sha256":"4217ef798b0e16a264de9b2fca85cdeac4b1b42c97b8b30f485ca35bb4895f3a","abstract_canon_sha256":"092d537825b552c2a17d9017c1e7ae27f642c8754ca973876ddba30ecfb88311"},"schema_version":"1.0"},"canonical_sha256":"d7da2dd4c0bd6a014821124620110fefe10bc2918f22f321f8c8dedb642088ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:01.604824Z","signature_b64":"Sorn0W+Av2nxVVdnJlmI+orIFy7WvoTxTIb9Vd2pUXTugOofzVqZ1Y82wNcc5d/5rDsaTe6MtysI5gM7E3NqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7da2dd4c0bd6a014821124620110fefe10bc2918f22f321f8c8dedb642088ce","last_reissued_at":"2026-05-18T03:17:01.604081Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:01.604081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.8319","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-18T03:17:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xJAO/8yMc2p7KIW+tCOVYAsQa3ajyb58BwdN9i0f6OMdsy2/cCz7/tkcVguyDidGbhChLnTrcwGjt2XMIZxRBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T04:09:43.069048Z"},"content_sha256":"cc03deb345433ff4ee08f5c5acaf35f9a60a1af2befc8f99a6624b567a8e82e8","schema_version":"1.0","event_id":"sha256:cc03deb345433ff4ee08f5c5acaf35f9a60a1af2befc8f99a6624b567a8e82e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:27NC3VGAXVVACSBBCJDCAEIP57","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Allocating the chains of consecutive additions for optimal fixed-point data path synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Gregory W. Donohoe, Ilya Y. Zhbannikov","submitted_at":"2013-07-31T13:40:40Z","abstract_excerpt":"Minimization of computational errors in the fixed-point data path is often difficult task. Many signal processing algorithms use chains of consecutive additions. The analyzing technique that can be applied to fixed-point data path synthesis has been proposed. This technique takes advantage of allocating the chains of consecutive additions in order to predict growing width of the data path and minimize the design complexity and computational errors."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.8319","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-18T03:17:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1i801y9Ol0k4R6AZ4/wppbRqgm/DcI+o75cZAmu4livzE63L2pr8SkrJoZ6bPBp6oU45IijMyWn/5H9c+uzhAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T04:09:43.069398Z"},"content_sha256":"145e40d485f196c1926bb6e85caab659bc6b1fb0afd5032a1206e0bfdb1a0c7e","schema_version":"1.0","event_id":"sha256:145e40d485f196c1926bb6e85caab659bc6b1fb0afd5032a1206e0bfdb1a0c7e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/27NC3VGAXVVACSBBCJDCAEIP57/bundle.json","state_url":"https://pith.science/pith/27NC3VGAXVVACSBBCJDCAEIP57/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/27NC3VGAXVVACSBBCJDCAEIP57/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-27T04:09:43Z","links":{"resolver":"https://pith.science/pith/27NC3VGAXVVACSBBCJDCAEIP57","bundle":"https://pith.science/pith/27NC3VGAXVVACSBBCJDCAEIP57/bundle.json","state":"https://pith.science/pith/27NC3VGAXVVACSBBCJDCAEIP57/state.json","well_known_bundle":"https://pith.science/.well-known/pith/27NC3VGAXVVACSBBCJDCAEIP57/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:27NC3VGAXVVACSBBCJDCAEIP57","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":"092d537825b552c2a17d9017c1e7ae27f642c8754ca973876ddba30ecfb88311","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2013-07-31T13:40:40Z","title_canon_sha256":"4217ef798b0e16a264de9b2fca85cdeac4b1b42c97b8b30f485ca35bb4895f3a"},"schema_version":"1.0","source":{"id":"1307.8319","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.8319","created_at":"2026-05-18T03:17:01Z"},{"alias_kind":"arxiv_version","alias_value":"1307.8319v1","created_at":"2026-05-18T03:17:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.8319","created_at":"2026-05-18T03:17:01Z"},{"alias_kind":"pith_short_12","alias_value":"27NC3VGAXVVA","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"27NC3VGAXVVACSBB","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"27NC3VGA","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:145e40d485f196c1926bb6e85caab659bc6b1fb0afd5032a1206e0bfdb1a0c7e","target":"graph","created_at":"2026-05-18T03:17:01Z","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":"Minimization of computational errors in the fixed-point data path is often difficult task. Many signal processing algorithms use chains of consecutive additions. The analyzing technique that can be applied to fixed-point data path synthesis has been proposed. This technique takes advantage of allocating the chains of consecutive additions in order to predict growing width of the data path and minimize the design complexity and computational errors.","authors_text":"Gregory W. Donohoe, Ilya Y. Zhbannikov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2013-07-31T13:40:40Z","title":"Allocating the chains of consecutive additions for optimal fixed-point data path synthesis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.8319","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:cc03deb345433ff4ee08f5c5acaf35f9a60a1af2befc8f99a6624b567a8e82e8","target":"record","created_at":"2026-05-18T03:17:01Z","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":"092d537825b552c2a17d9017c1e7ae27f642c8754ca973876ddba30ecfb88311","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2013-07-31T13:40:40Z","title_canon_sha256":"4217ef798b0e16a264de9b2fca85cdeac4b1b42c97b8b30f485ca35bb4895f3a"},"schema_version":"1.0","source":{"id":"1307.8319","kind":"arxiv","version":1}},"canonical_sha256":"d7da2dd4c0bd6a014821124620110fefe10bc2918f22f321f8c8dedb642088ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7da2dd4c0bd6a014821124620110fefe10bc2918f22f321f8c8dedb642088ce","first_computed_at":"2026-05-18T03:17:01.604081Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:01.604081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Sorn0W+Av2nxVVdnJlmI+orIFy7WvoTxTIb9Vd2pUXTugOofzVqZ1Y82wNcc5d/5rDsaTe6MtysI5gM7E3NqAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:01.604824Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.8319","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc03deb345433ff4ee08f5c5acaf35f9a60a1af2befc8f99a6624b567a8e82e8","sha256:145e40d485f196c1926bb6e85caab659bc6b1fb0afd5032a1206e0bfdb1a0c7e"],"state_sha256":"905fda6a8ef2d702cd19834d4a144922b17977fb9f846e5b79170ee9c91e2cb3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1wPkRUmLuXnGi1y7B8Fg30YvZsY9FomxAmJED08I01RVAmFfaisLQabCmLnD+1aZeWT2+C29zu0c/rIBJ2P5AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T04:09:43.071247Z","bundle_sha256":"7ed4e5c0dce92126b33a6e65d397b4a26961675e27f1db7fe785a24e79d1c616"}}