{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FIQJHICCXJCINZN6EA2BVNE54I","short_pith_number":"pith:FIQJHICC","canonical_record":{"source":{"id":"1804.11275","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-04-30T15:32:19Z","cross_cats_sorted":[],"title_canon_sha256":"62cf7a55cbf6f5aa94c7c006677efbb5ed484698f96e55e11df56467d9f7d64c","abstract_canon_sha256":"f35fae9c2a0101b60c5bc30e984f7da65de6e673d701270561acce962606c0ed"},"schema_version":"1.0"},"canonical_sha256":"2a2093a042ba4486e5be20341ab49de22a256c7c1a04c7cf98b5216c8f4bfe22","source":{"kind":"arxiv","id":"1804.11275","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.11275","created_at":"2026-05-18T00:16:15Z"},{"alias_kind":"arxiv_version","alias_value":"1804.11275v2","created_at":"2026-05-18T00:16:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.11275","created_at":"2026-05-18T00:16:15Z"},{"alias_kind":"pith_short_12","alias_value":"FIQJHICCXJCI","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FIQJHICCXJCINZN6","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FIQJHICC","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FIQJHICCXJCINZN6EA2BVNE54I","target":"record","payload":{"canonical_record":{"source":{"id":"1804.11275","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-04-30T15:32:19Z","cross_cats_sorted":[],"title_canon_sha256":"62cf7a55cbf6f5aa94c7c006677efbb5ed484698f96e55e11df56467d9f7d64c","abstract_canon_sha256":"f35fae9c2a0101b60c5bc30e984f7da65de6e673d701270561acce962606c0ed"},"schema_version":"1.0"},"canonical_sha256":"2a2093a042ba4486e5be20341ab49de22a256c7c1a04c7cf98b5216c8f4bfe22","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:15.819713Z","signature_b64":"M+YE60oxek3uSrFS+Ty1rvTSgcrG9RsZ5MBKnuWfue0plh3OLblz2HURsre44d4gwy462j9T9Vd4FV6/cOixBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a2093a042ba4486e5be20341ab49de22a256c7c1a04c7cf98b5216c8f4bfe22","last_reissued_at":"2026-05-18T00:16:15.819105Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:15.819105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.11275","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-05-18T00:16:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4ZGb3oNsNVpx27dDdV7uxuHuyhj7HAyztI8BH6NVg0hIBihIWGSl1t/Nic6QYoTBWJ5xZ3KDla/ME6m72N2sBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T15:09:28.209163Z"},"content_sha256":"fd3bf317a6554732c6823a28a9808fe4cf63ab2b0e999435610e1a23b397566f","schema_version":"1.0","event_id":"sha256:fd3bf317a6554732c6823a28a9808fe4cf63ab2b0e999435610e1a23b397566f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FIQJHICCXJCINZN6EA2BVNE54I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"LUT-Lock: A Novel LUT-based Logic Obfuscation for FPGA-Bitstream and ASIC-Hardware Protection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Avesta Sasan, Hadi Mardani Kamali, Houman Homayoun, Kimia Zamiri Azar, Kris Gaj","submitted_at":"2018-04-30T15:32:19Z","abstract_excerpt":"In this work, we propose LUT-Lock, a novel Look-Up-Table-based netlist obfuscation algorithm, for protecting the intellectual property that is mapped to an FPGA bitstream or an ASIC netlist. We, first, illustrate the effectiveness of several key features that make the LUT-based obfuscation more resilient against SAT attacks and then we embed the proposed key features into our proposed LUT-Lock algorithm. We illustrates that LUT-Lock maximizes the resiliency of the LUT-based obfuscation against SAT attacks by forcing a near exponential increase in the execution time of a SAT solver with respect"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.11275","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":""},"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:16:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wdk5bnPRtNF9zoFgfDfpuEKwdmxdTssh+9xVCFZi/1bz5lwZyYYneLntLn4icf1M5sFI4E1UvuK+KWxJtXwEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T15:09:28.209514Z"},"content_sha256":"59a7b6156eb3a34e6340a8badef9dcf6b23de047bd5986646485ddc6073b4992","schema_version":"1.0","event_id":"sha256:59a7b6156eb3a34e6340a8badef9dcf6b23de047bd5986646485ddc6073b4992"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FIQJHICCXJCINZN6EA2BVNE54I/bundle.json","state_url":"https://pith.science/pith/FIQJHICCXJCINZN6EA2BVNE54I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FIQJHICCXJCINZN6EA2BVNE54I/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-28T15:09:28Z","links":{"resolver":"https://pith.science/pith/FIQJHICCXJCINZN6EA2BVNE54I","bundle":"https://pith.science/pith/FIQJHICCXJCINZN6EA2BVNE54I/bundle.json","state":"https://pith.science/pith/FIQJHICCXJCINZN6EA2BVNE54I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FIQJHICCXJCINZN6EA2BVNE54I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FIQJHICCXJCINZN6EA2BVNE54I","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":"f35fae9c2a0101b60c5bc30e984f7da65de6e673d701270561acce962606c0ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-04-30T15:32:19Z","title_canon_sha256":"62cf7a55cbf6f5aa94c7c006677efbb5ed484698f96e55e11df56467d9f7d64c"},"schema_version":"1.0","source":{"id":"1804.11275","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.11275","created_at":"2026-05-18T00:16:15Z"},{"alias_kind":"arxiv_version","alias_value":"1804.11275v2","created_at":"2026-05-18T00:16:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.11275","created_at":"2026-05-18T00:16:15Z"},{"alias_kind":"pith_short_12","alias_value":"FIQJHICCXJCI","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FIQJHICCXJCINZN6","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FIQJHICC","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:59a7b6156eb3a34e6340a8badef9dcf6b23de047bd5986646485ddc6073b4992","target":"graph","created_at":"2026-05-18T00:16:15Z","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":"In this work, we propose LUT-Lock, a novel Look-Up-Table-based netlist obfuscation algorithm, for protecting the intellectual property that is mapped to an FPGA bitstream or an ASIC netlist. We, first, illustrate the effectiveness of several key features that make the LUT-based obfuscation more resilient against SAT attacks and then we embed the proposed key features into our proposed LUT-Lock algorithm. We illustrates that LUT-Lock maximizes the resiliency of the LUT-based obfuscation against SAT attacks by forcing a near exponential increase in the execution time of a SAT solver with respect","authors_text":"Avesta Sasan, Hadi Mardani Kamali, Houman Homayoun, Kimia Zamiri Azar, Kris Gaj","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-04-30T15:32:19Z","title":"LUT-Lock: A Novel LUT-based Logic Obfuscation for FPGA-Bitstream and ASIC-Hardware Protection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.11275","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:fd3bf317a6554732c6823a28a9808fe4cf63ab2b0e999435610e1a23b397566f","target":"record","created_at":"2026-05-18T00:16:15Z","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":"f35fae9c2a0101b60c5bc30e984f7da65de6e673d701270561acce962606c0ed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-04-30T15:32:19Z","title_canon_sha256":"62cf7a55cbf6f5aa94c7c006677efbb5ed484698f96e55e11df56467d9f7d64c"},"schema_version":"1.0","source":{"id":"1804.11275","kind":"arxiv","version":2}},"canonical_sha256":"2a2093a042ba4486e5be20341ab49de22a256c7c1a04c7cf98b5216c8f4bfe22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a2093a042ba4486e5be20341ab49de22a256c7c1a04c7cf98b5216c8f4bfe22","first_computed_at":"2026-05-18T00:16:15.819105Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:15.819105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M+YE60oxek3uSrFS+Ty1rvTSgcrG9RsZ5MBKnuWfue0plh3OLblz2HURsre44d4gwy462j9T9Vd4FV6/cOixBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:15.819713Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.11275","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd3bf317a6554732c6823a28a9808fe4cf63ab2b0e999435610e1a23b397566f","sha256:59a7b6156eb3a34e6340a8badef9dcf6b23de047bd5986646485ddc6073b4992"],"state_sha256":"efd18387411578ae876b5df7e19edfa0d9e4f962be949a04e314c6d0d1966bce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KSHWjJmMY6aLf0O3tq9HLHXMof/e2RPVPPWq/abjT5UWxwkpWgQgIxhaIPob86i619sv27P3HGqeFDkxkrqiDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T15:09:28.212344Z","bundle_sha256":"aa7c672e504238749f1f047c9a8d0b262bbeb6c4bfcb2a1181d24418dc868310"}}