{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:P4KNKSZRYUMGPGIJIBC2DDUPKV","short_pith_number":"pith:P4KNKSZR","canonical_record":{"source":{"id":"1401.3928","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-16T08:28:28Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"a066c734dc368ac5f1f73e5b4792ae1cd9745668a70caae2f0c5c1610e310326","abstract_canon_sha256":"1dc98a29141a928e34999d4b3164809cf4fbd9b2399e24253cd675aac93dcb27"},"schema_version":"1.0"},"canonical_sha256":"7f14d54b31c5186799094045a18e8f554d0653952d271ac647473d24e98547e9","source":{"kind":"arxiv","id":"1401.3928","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3928","created_at":"2026-05-18T03:02:05Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3928v1","created_at":"2026-05-18T03:02:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3928","created_at":"2026-05-18T03:02:05Z"},{"alias_kind":"pith_short_12","alias_value":"P4KNKSZRYUMG","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"P4KNKSZRYUMGPGIJ","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"P4KNKSZR","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:P4KNKSZRYUMGPGIJIBC2DDUPKV","target":"record","payload":{"canonical_record":{"source":{"id":"1401.3928","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-16T08:28:28Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"a066c734dc368ac5f1f73e5b4792ae1cd9745668a70caae2f0c5c1610e310326","abstract_canon_sha256":"1dc98a29141a928e34999d4b3164809cf4fbd9b2399e24253cd675aac93dcb27"},"schema_version":"1.0"},"canonical_sha256":"7f14d54b31c5186799094045a18e8f554d0653952d271ac647473d24e98547e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:06.000134Z","signature_b64":"tTowJt0NNTF610jrNhpsMN78u+V3Xxg73Sl/ZqgwnnF4dCQAPln+Q14DxoWJ9Ffc+WgdZSYk/xhkHDs4weKrDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f14d54b31c5186799094045a18e8f554d0653952d271ac647473d24e98547e9","last_reissued_at":"2026-05-18T03:02:05.999678Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:05.999678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.3928","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:02:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0wMp+Eg32viBieW2NAUQYddHSwCU6/9lnTaA8QliKfve5LwAHHZ0fXtDgXffIJPg/svuiyzuv3uLU88KBCO6Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:28:50.231024Z"},"content_sha256":"6324d44e404d10d3cdb12d658af4888b8536c3f69714e5d7c1f1929a71df7e31","schema_version":"1.0","event_id":"sha256:6324d44e404d10d3cdb12d658af4888b8536c3f69714e5d7c1f1929a71df7e31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:P4KNKSZRYUMGPGIJIBC2DDUPKV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiply Constant-Weight Codes and the Reliability of Loop Physically Unclonable Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Han Mao Kiah, Jean-Luc Danger, Jon-Lark Kim, Patrick Sol\\'e, Sylvain Guilley, Xiande Zhang, Yeow Meng Chee, Zouha Cherif","submitted_at":"2014-01-16T08:28:28Z","abstract_excerpt":"We introduce the class of multiply constant-weight codes to improve the reliability of certain physically unclonable function (PUF) response. We extend classical coding methods to construct multiply constant-weight codes from known $q$-ary and constant-weight codes. Analogues of Johnson bounds are derived and are shown to be asymptotically tight to a constant factor under certain conditions. We also examine the rates of the multiply constant-weight codes and interestingly, demonstrate that these rates are the same as those of constant-weight codes of suitable parameters. Asymptotic analysis of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3928","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:02:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lGA/DKTdjcETLrrWftwuQlzemk2ArAbo0l1qZ21VNR7R9xRfN7ore3YBosJmyH4PfXGK5BXHD0kPsjBXPeI2DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:28:50.231384Z"},"content_sha256":"469eb36ee3bd7fc533a0399ffd09e86d5b2ec62471645e867f3919b2d368d085","schema_version":"1.0","event_id":"sha256:469eb36ee3bd7fc533a0399ffd09e86d5b2ec62471645e867f3919b2d368d085"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P4KNKSZRYUMGPGIJIBC2DDUPKV/bundle.json","state_url":"https://pith.science/pith/P4KNKSZRYUMGPGIJIBC2DDUPKV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P4KNKSZRYUMGPGIJIBC2DDUPKV/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-03T19:28:50Z","links":{"resolver":"https://pith.science/pith/P4KNKSZRYUMGPGIJIBC2DDUPKV","bundle":"https://pith.science/pith/P4KNKSZRYUMGPGIJIBC2DDUPKV/bundle.json","state":"https://pith.science/pith/P4KNKSZRYUMGPGIJIBC2DDUPKV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P4KNKSZRYUMGPGIJIBC2DDUPKV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:P4KNKSZRYUMGPGIJIBC2DDUPKV","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":"1dc98a29141a928e34999d4b3164809cf4fbd9b2399e24253cd675aac93dcb27","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-16T08:28:28Z","title_canon_sha256":"a066c734dc368ac5f1f73e5b4792ae1cd9745668a70caae2f0c5c1610e310326"},"schema_version":"1.0","source":{"id":"1401.3928","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3928","created_at":"2026-05-18T03:02:05Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3928v1","created_at":"2026-05-18T03:02:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3928","created_at":"2026-05-18T03:02:05Z"},{"alias_kind":"pith_short_12","alias_value":"P4KNKSZRYUMG","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"P4KNKSZRYUMGPGIJ","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"P4KNKSZR","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:469eb36ee3bd7fc533a0399ffd09e86d5b2ec62471645e867f3919b2d368d085","target":"graph","created_at":"2026-05-18T03:02:05Z","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":"We introduce the class of multiply constant-weight codes to improve the reliability of certain physically unclonable function (PUF) response. We extend classical coding methods to construct multiply constant-weight codes from known $q$-ary and constant-weight codes. Analogues of Johnson bounds are derived and are shown to be asymptotically tight to a constant factor under certain conditions. We also examine the rates of the multiply constant-weight codes and interestingly, demonstrate that these rates are the same as those of constant-weight codes of suitable parameters. Asymptotic analysis of","authors_text":"Han Mao Kiah, Jean-Luc Danger, Jon-Lark Kim, Patrick Sol\\'e, Sylvain Guilley, Xiande Zhang, Yeow Meng Chee, Zouha Cherif","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-16T08:28:28Z","title":"Multiply Constant-Weight Codes and the Reliability of Loop Physically Unclonable Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3928","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:6324d44e404d10d3cdb12d658af4888b8536c3f69714e5d7c1f1929a71df7e31","target":"record","created_at":"2026-05-18T03:02:05Z","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":"1dc98a29141a928e34999d4b3164809cf4fbd9b2399e24253cd675aac93dcb27","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-16T08:28:28Z","title_canon_sha256":"a066c734dc368ac5f1f73e5b4792ae1cd9745668a70caae2f0c5c1610e310326"},"schema_version":"1.0","source":{"id":"1401.3928","kind":"arxiv","version":1}},"canonical_sha256":"7f14d54b31c5186799094045a18e8f554d0653952d271ac647473d24e98547e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f14d54b31c5186799094045a18e8f554d0653952d271ac647473d24e98547e9","first_computed_at":"2026-05-18T03:02:05.999678Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:05.999678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tTowJt0NNTF610jrNhpsMN78u+V3Xxg73Sl/ZqgwnnF4dCQAPln+Q14DxoWJ9Ffc+WgdZSYk/xhkHDs4weKrDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:06.000134Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.3928","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6324d44e404d10d3cdb12d658af4888b8536c3f69714e5d7c1f1929a71df7e31","sha256:469eb36ee3bd7fc533a0399ffd09e86d5b2ec62471645e867f3919b2d368d085"],"state_sha256":"344e26d06b8e3a8d2f289f60b4d0bd042df94cff77f0d1f31b56dcfa3c7b9d7e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yku8D8DPQGCXc6D3AZvxTHjo0yKdwR39K/tsgpfqZrpJEjZJxjnqYSOVTkZosZIRZNC1ZDOKUMu2MEuDRbB2AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:28:50.233384Z","bundle_sha256":"bbbd4619e180762382f5e433434e56ccb7c0a4ce90f2b430dbe18bfebd66b73d"}}