{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OT5BTQ7T355ZGNXE546DFE72JF","short_pith_number":"pith:OT5BTQ7T","canonical_record":{"source":{"id":"1806.08095","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2018-06-21T07:35:37Z","cross_cats_sorted":[],"title_canon_sha256":"b2a3f7c3815afe384614b9b280bc07f528126240a8400e0770ea4f1e8208f335","abstract_canon_sha256":"2f132fec9573011c9b8076e869c1a16601399f480b163e7a25b30b97cb746fec"},"schema_version":"1.0"},"canonical_sha256":"74fa19c3f3df7b9336e4ef3c3293fa4954ed8daa7360396516718b2448e9ee31","source":{"kind":"arxiv","id":"1806.08095","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08095","created_at":"2026-05-18T00:12:42Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08095v1","created_at":"2026-05-18T00:12:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08095","created_at":"2026-05-18T00:12:42Z"},{"alias_kind":"pith_short_12","alias_value":"OT5BTQ7T355Z","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OT5BTQ7T355ZGNXE","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OT5BTQ7T","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OT5BTQ7T355ZGNXE546DFE72JF","target":"record","payload":{"canonical_record":{"source":{"id":"1806.08095","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2018-06-21T07:35:37Z","cross_cats_sorted":[],"title_canon_sha256":"b2a3f7c3815afe384614b9b280bc07f528126240a8400e0770ea4f1e8208f335","abstract_canon_sha256":"2f132fec9573011c9b8076e869c1a16601399f480b163e7a25b30b97cb746fec"},"schema_version":"1.0"},"canonical_sha256":"74fa19c3f3df7b9336e4ef3c3293fa4954ed8daa7360396516718b2448e9ee31","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:42.069376Z","signature_b64":"qY1kvlUKb2xs4L1AsYfTTpgt40gAUr7J8OXn3b3pkjLgy4srutCxSFv66EQn1MeQe52cWDXA6JGo0DEq4P3jDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74fa19c3f3df7b9336e4ef3c3293fa4954ed8daa7360396516718b2448e9ee31","last_reissued_at":"2026-05-18T00:12:42.068718Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:42.068718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.08095","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:12:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pP2eD8e36SDe7XtvZA2749Krf0SCh6U/myWk9OBm9t68UOJp5PV9b53hlQHjHFMF01cB65D5a9djaODiDdQ2AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T05:13:29.186975Z"},"content_sha256":"a939a3a61701a252cfe8efc97937583daa6038c810fd3faed5d646f6a0084d6e","schema_version":"1.0","event_id":"sha256:a939a3a61701a252cfe8efc97937583daa6038c810fd3faed5d646f6a0084d6e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OT5BTQ7T355ZGNXE546DFE72JF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generic and Universal Parallel Matrix Summation with a Flexible Compression Goal for Xilinx FPGAs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Thomas B. Preu{\\ss}er","submitted_at":"2018-06-21T07:35:37Z","abstract_excerpt":"Bit matrix compression is a highly relevant operation in computer arithmetic. Essentially being a multi-operand addition, it is the key operation behind fast multiplication and many higher-level operations such as multiply-accumulate, the computation of the dot product or the implementation of FIR filters. Compressor implementations have been constantly evolving for greater efficiency both in general and in the context of concrete applications or specific implementation technologies. This paper is building on this history and describes a generic implementation of a bit matrix compressor for Xi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08095","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:12:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rjbV2sfKQza44ADqV328moc8vugPt6s9pLjMPhJyZ/h/2ItKxK/1cWpqZzagtaG/vmNKbHwvbt2ck7S8lnqiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T05:13:29.187335Z"},"content_sha256":"7a9f57ae0f37910b86beb02370632cb401747702f6ac023c015094087f2016c6","schema_version":"1.0","event_id":"sha256:7a9f57ae0f37910b86beb02370632cb401747702f6ac023c015094087f2016c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OT5BTQ7T355ZGNXE546DFE72JF/bundle.json","state_url":"https://pith.science/pith/OT5BTQ7T355ZGNXE546DFE72JF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OT5BTQ7T355ZGNXE546DFE72JF/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-22T05:13:29Z","links":{"resolver":"https://pith.science/pith/OT5BTQ7T355ZGNXE546DFE72JF","bundle":"https://pith.science/pith/OT5BTQ7T355ZGNXE546DFE72JF/bundle.json","state":"https://pith.science/pith/OT5BTQ7T355ZGNXE546DFE72JF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OT5BTQ7T355ZGNXE546DFE72JF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OT5BTQ7T355ZGNXE546DFE72JF","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":"2f132fec9573011c9b8076e869c1a16601399f480b163e7a25b30b97cb746fec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2018-06-21T07:35:37Z","title_canon_sha256":"b2a3f7c3815afe384614b9b280bc07f528126240a8400e0770ea4f1e8208f335"},"schema_version":"1.0","source":{"id":"1806.08095","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.08095","created_at":"2026-05-18T00:12:42Z"},{"alias_kind":"arxiv_version","alias_value":"1806.08095v1","created_at":"2026-05-18T00:12:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08095","created_at":"2026-05-18T00:12:42Z"},{"alias_kind":"pith_short_12","alias_value":"OT5BTQ7T355Z","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OT5BTQ7T355ZGNXE","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OT5BTQ7T","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:7a9f57ae0f37910b86beb02370632cb401747702f6ac023c015094087f2016c6","target":"graph","created_at":"2026-05-18T00:12:42Z","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":"Bit matrix compression is a highly relevant operation in computer arithmetic. Essentially being a multi-operand addition, it is the key operation behind fast multiplication and many higher-level operations such as multiply-accumulate, the computation of the dot product or the implementation of FIR filters. Compressor implementations have been constantly evolving for greater efficiency both in general and in the context of concrete applications or specific implementation technologies. This paper is building on this history and describes a generic implementation of a bit matrix compressor for Xi","authors_text":"Thomas B. Preu{\\ss}er","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2018-06-21T07:35:37Z","title":"Generic and Universal Parallel Matrix Summation with a Flexible Compression Goal for Xilinx FPGAs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08095","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:a939a3a61701a252cfe8efc97937583daa6038c810fd3faed5d646f6a0084d6e","target":"record","created_at":"2026-05-18T00:12:42Z","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":"2f132fec9573011c9b8076e869c1a16601399f480b163e7a25b30b97cb746fec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2018-06-21T07:35:37Z","title_canon_sha256":"b2a3f7c3815afe384614b9b280bc07f528126240a8400e0770ea4f1e8208f335"},"schema_version":"1.0","source":{"id":"1806.08095","kind":"arxiv","version":1}},"canonical_sha256":"74fa19c3f3df7b9336e4ef3c3293fa4954ed8daa7360396516718b2448e9ee31","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74fa19c3f3df7b9336e4ef3c3293fa4954ed8daa7360396516718b2448e9ee31","first_computed_at":"2026-05-18T00:12:42.068718Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:42.068718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qY1kvlUKb2xs4L1AsYfTTpgt40gAUr7J8OXn3b3pkjLgy4srutCxSFv66EQn1MeQe52cWDXA6JGo0DEq4P3jDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:42.069376Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.08095","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a939a3a61701a252cfe8efc97937583daa6038c810fd3faed5d646f6a0084d6e","sha256:7a9f57ae0f37910b86beb02370632cb401747702f6ac023c015094087f2016c6"],"state_sha256":"d4e6b0e3a4dd67442a3fd7c92ed970425bd6d7a0854fea4489f527578b4fa8bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SWnZL2zkIKh7vxf5nOcOqg/8TQaNRH2LsCSRhuxRANz+8uDQquOYs65U3MtxNg6C75YsUdFAD658rJYwc3NICw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T05:13:29.189290Z","bundle_sha256":"688ac917f18b701f89a859159935b925c6f870f890a557ed5f9e34ddfd59b9a2"}}