{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RE4DD47WAZGM44545J7VCBSAFN","short_pith_number":"pith:RE4DD47W","canonical_record":{"source":{"id":"1704.01306","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-05T08:23:18Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"760d7c93cb28c2bbf4a859c696336da8b0ca50b42d5e2a11ecb5872527c1e641","abstract_canon_sha256":"330a31cbc1ef98e55251ac876b9ff88cc52bc4440a5c76e6011c77cb9d4a8a54"},"schema_version":"1.0"},"canonical_sha256":"893831f3f6064cce73bcea7f5106402b58a1612a0c15ee10b0bc05147f7f59f3","source":{"kind":"arxiv","id":"1704.01306","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.01306","created_at":"2026-05-18T00:26:18Z"},{"alias_kind":"arxiv_version","alias_value":"1704.01306v2","created_at":"2026-05-18T00:26:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01306","created_at":"2026-05-18T00:26:18Z"},{"alias_kind":"pith_short_12","alias_value":"RE4DD47WAZGM","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RE4DD47WAZGM4454","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RE4DD47W","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RE4DD47WAZGM44545J7VCBSAFN","target":"record","payload":{"canonical_record":{"source":{"id":"1704.01306","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-05T08:23:18Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"760d7c93cb28c2bbf4a859c696336da8b0ca50b42d5e2a11ecb5872527c1e641","abstract_canon_sha256":"330a31cbc1ef98e55251ac876b9ff88cc52bc4440a5c76e6011c77cb9d4a8a54"},"schema_version":"1.0"},"canonical_sha256":"893831f3f6064cce73bcea7f5106402b58a1612a0c15ee10b0bc05147f7f59f3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:18.322297Z","signature_b64":"FwYmzHgws9RYspEGeksx2aNNkdhJ0oD15Btmuc/wUyBHUUtlvrilXh1EpphTq+TD+J1nZoDwkmSC5UkBCfH0AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"893831f3f6064cce73bcea7f5106402b58a1612a0c15ee10b0bc05147f7f59f3","last_reissued_at":"2026-05-18T00:26:18.321875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:18.321875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.01306","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:26:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l55gJoQr7A3VUNhYpIB/fGBVnU62qBUSEJW8gwu00U8adc3QqArGf8sXIlDBtJV5VQN3K1RWi5u5b3Sk6nJpDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:31:11.163873Z"},"content_sha256":"cbf076023075a387afaa9ac329b340e7b4b437cd6ed1634ccd8621ad51468e0e","schema_version":"1.0","event_id":"sha256:cbf076023075a387afaa9ac329b340e7b4b437cd6ed1634ccd8621ad51468e0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RE4DD47WAZGM44545J7VCBSAFN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using Convolutional Codes for Key Extraction in SRAM Physical Unclonable Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Martin Bossert, Sven M\\\"uelich, Sven Puchinger","submitted_at":"2017-04-05T08:23:18Z","abstract_excerpt":"Physical Unclonable Functions (PUFs) exploit variations in the manufacturing process to derive bit sequences from integrated circuits, which can be used as secure cryptographic keys. Instead of storing the keys in an insecure, non-volatile memory, they can be reproduced when needed. Since the reproduced sequences are not stable due to physical reasons, error correction must be applied. Recently, convolutional codes were shown to be suitable for key reproduction in PUFs based on SRAM. This work shows how to further decrease the reconstruction failure probability and PUF implementation size usin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01306","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:26:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nrrHjcheFlc7+kCJlYlaITmb/T3VYYVkE+1G1XoXk05uPL2sT1YUthyJkn40ZY2K7OywwPiz39Zpo5XuNzwDBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:31:11.164233Z"},"content_sha256":"6a771b77cf178a72c57045680431ea510bcdafe55e56a5c0a312a303bacc8e17","schema_version":"1.0","event_id":"sha256:6a771b77cf178a72c57045680431ea510bcdafe55e56a5c0a312a303bacc8e17"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RE4DD47WAZGM44545J7VCBSAFN/bundle.json","state_url":"https://pith.science/pith/RE4DD47WAZGM44545J7VCBSAFN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RE4DD47WAZGM44545J7VCBSAFN/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-30T23:31:11Z","links":{"resolver":"https://pith.science/pith/RE4DD47WAZGM44545J7VCBSAFN","bundle":"https://pith.science/pith/RE4DD47WAZGM44545J7VCBSAFN/bundle.json","state":"https://pith.science/pith/RE4DD47WAZGM44545J7VCBSAFN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RE4DD47WAZGM44545J7VCBSAFN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RE4DD47WAZGM44545J7VCBSAFN","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":"330a31cbc1ef98e55251ac876b9ff88cc52bc4440a5c76e6011c77cb9d4a8a54","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-05T08:23:18Z","title_canon_sha256":"760d7c93cb28c2bbf4a859c696336da8b0ca50b42d5e2a11ecb5872527c1e641"},"schema_version":"1.0","source":{"id":"1704.01306","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.01306","created_at":"2026-05-18T00:26:18Z"},{"alias_kind":"arxiv_version","alias_value":"1704.01306v2","created_at":"2026-05-18T00:26:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01306","created_at":"2026-05-18T00:26:18Z"},{"alias_kind":"pith_short_12","alias_value":"RE4DD47WAZGM","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RE4DD47WAZGM4454","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RE4DD47W","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:6a771b77cf178a72c57045680431ea510bcdafe55e56a5c0a312a303bacc8e17","target":"graph","created_at":"2026-05-18T00:26:18Z","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":"Physical Unclonable Functions (PUFs) exploit variations in the manufacturing process to derive bit sequences from integrated circuits, which can be used as secure cryptographic keys. Instead of storing the keys in an insecure, non-volatile memory, they can be reproduced when needed. Since the reproduced sequences are not stable due to physical reasons, error correction must be applied. Recently, convolutional codes were shown to be suitable for key reproduction in PUFs based on SRAM. This work shows how to further decrease the reconstruction failure probability and PUF implementation size usin","authors_text":"Martin Bossert, Sven M\\\"uelich, Sven Puchinger","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-05T08:23:18Z","title":"Using Convolutional Codes for Key Extraction in SRAM Physical Unclonable Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01306","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:cbf076023075a387afaa9ac329b340e7b4b437cd6ed1634ccd8621ad51468e0e","target":"record","created_at":"2026-05-18T00:26:18Z","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":"330a31cbc1ef98e55251ac876b9ff88cc52bc4440a5c76e6011c77cb9d4a8a54","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-04-05T08:23:18Z","title_canon_sha256":"760d7c93cb28c2bbf4a859c696336da8b0ca50b42d5e2a11ecb5872527c1e641"},"schema_version":"1.0","source":{"id":"1704.01306","kind":"arxiv","version":2}},"canonical_sha256":"893831f3f6064cce73bcea7f5106402b58a1612a0c15ee10b0bc05147f7f59f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"893831f3f6064cce73bcea7f5106402b58a1612a0c15ee10b0bc05147f7f59f3","first_computed_at":"2026-05-18T00:26:18.321875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:18.321875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FwYmzHgws9RYspEGeksx2aNNkdhJ0oD15Btmuc/wUyBHUUtlvrilXh1EpphTq+TD+J1nZoDwkmSC5UkBCfH0AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:18.322297Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.01306","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cbf076023075a387afaa9ac329b340e7b4b437cd6ed1634ccd8621ad51468e0e","sha256:6a771b77cf178a72c57045680431ea510bcdafe55e56a5c0a312a303bacc8e17"],"state_sha256":"2700985dbd0e87df561ac88be589eaa74a12aaeda2bc62480e3fe599d2ca95e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"39C59Zf+w2d2xgkj0oToE7tWXbEiRtN/5igL1TvKPL7g05Wy7E2x9BNorImFZs91RJ7D+EsTPs5J8A23L0/dCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:31:11.166869Z","bundle_sha256":"ede8ceb376e12003f3baca6c98d7665f8844c52be5a890b7ec605b4c9ed4f654"}}