{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:3FLBZL5JV5MS2VJBF62B4SN4CD","short_pith_number":"pith:3FLBZL5J","canonical_record":{"source":{"id":"2104.11105","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2021-04-22T14:38:55Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"1834e82b452a2504458c9e3371bfc0addba2d4000757428863a40e4ddc362562","abstract_canon_sha256":"faea170460fd17249f7da137d5e7cea4763fe75c6ccbe4dafed7494abda2bf7b"},"schema_version":"1.0"},"canonical_sha256":"d9561cafa9af592d55212fb41e49bc10f8029d1d547fa8982f88c3f3ecb41218","source":{"kind":"arxiv","id":"2104.11105","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.11105","created_at":"2026-06-12T01:09:02Z"},{"alias_kind":"arxiv_version","alias_value":"2104.11105v1","created_at":"2026-06-12T01:09:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.11105","created_at":"2026-06-12T01:09:02Z"},{"alias_kind":"pith_short_12","alias_value":"3FLBZL5JV5MS","created_at":"2026-06-12T01:09:02Z"},{"alias_kind":"pith_short_16","alias_value":"3FLBZL5JV5MS2VJB","created_at":"2026-06-12T01:09:02Z"},{"alias_kind":"pith_short_8","alias_value":"3FLBZL5J","created_at":"2026-06-12T01:09:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:3FLBZL5JV5MS2VJBF62B4SN4CD","target":"record","payload":{"canonical_record":{"source":{"id":"2104.11105","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2021-04-22T14:38:55Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"1834e82b452a2504458c9e3371bfc0addba2d4000757428863a40e4ddc362562","abstract_canon_sha256":"faea170460fd17249f7da137d5e7cea4763fe75c6ccbe4dafed7494abda2bf7b"},"schema_version":"1.0"},"canonical_sha256":"d9561cafa9af592d55212fb41e49bc10f8029d1d547fa8982f88c3f3ecb41218","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:09:02.795219Z","signature_b64":"SET5YGiP2D/AOtVzdIsjY6XTWmlpfjiHxue0SNDLeHiZgb8vU8DUVYCE+saeqpSPJtsw7thyygEVq6lE5dfJCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9561cafa9af592d55212fb41e49bc10f8029d1d547fa8982f88c3f3ecb41218","last_reissued_at":"2026-06-12T01:09:02.794435Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:09:02.794435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2104.11105","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-06-12T01:09:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aBaz8iij9R4JM/g7p6FW3AiKGwLAg828bcGQUOH0d2kk7HYpOlDpyl7Rt6vwOzkjRQ/byYGRPhRPtMsRGwS/Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:11:07.397665Z"},"content_sha256":"bbb6253657a8b3eb3931f80003fc25c6a6a85222d2e304d138480fc1053ca2e8","schema_version":"1.0","event_id":"sha256:bbb6253657a8b3eb3931f80003fc25c6a6a85222d2e304d138480fc1053ca2e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:3FLBZL5JV5MS2VJBF62B4SN4CD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Synchronization of Tree Parity Machines using non-binary input vectors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"cs.CR","authors_text":"Marcin Niemiec, Mi{\\l}osz Stypi\\'nski","submitted_at":"2021-04-22T14:38:55Z","abstract_excerpt":"Neural cryptography is the application of artificial neural networks in the subject of cryptography. The functionality of this solution is based on a tree parity machine. It uses artificial neural networks to perform secure key exchange between network entities. This article proposes improvements to the synchronization of two tree parity machines. The improvement is based on learning artificial neural network using input vectors which have a wider range of values than binary ones. As a result, the duration of the synchronization process is reduced. Therefore, tree parity machines achieve commo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.11105","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2104.11105/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-12T01:09:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qBRi5JvWmQP9rDMEfXg3tJyMhISp3KYf8jNyjhty7FUyj9WTqZNmF7Jd++IMVZXvjiFQYYak+Fw04nUz5SBHAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:11:07.398054Z"},"content_sha256":"ff3c344b6b7551f3ae51569d7cadd85a4ef4e56992d76c8816c4b69c3e637f6b","schema_version":"1.0","event_id":"sha256:ff3c344b6b7551f3ae51569d7cadd85a4ef4e56992d76c8816c4b69c3e637f6b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3FLBZL5JV5MS2VJBF62B4SN4CD/bundle.json","state_url":"https://pith.science/pith/3FLBZL5JV5MS2VJBF62B4SN4CD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3FLBZL5JV5MS2VJBF62B4SN4CD/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-24T19:11:07Z","links":{"resolver":"https://pith.science/pith/3FLBZL5JV5MS2VJBF62B4SN4CD","bundle":"https://pith.science/pith/3FLBZL5JV5MS2VJBF62B4SN4CD/bundle.json","state":"https://pith.science/pith/3FLBZL5JV5MS2VJBF62B4SN4CD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3FLBZL5JV5MS2VJBF62B4SN4CD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:3FLBZL5JV5MS2VJBF62B4SN4CD","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":"faea170460fd17249f7da137d5e7cea4763fe75c6ccbe4dafed7494abda2bf7b","cross_cats_sorted":["cs.LG","cs.NE"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2021-04-22T14:38:55Z","title_canon_sha256":"1834e82b452a2504458c9e3371bfc0addba2d4000757428863a40e4ddc362562"},"schema_version":"1.0","source":{"id":"2104.11105","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.11105","created_at":"2026-06-12T01:09:02Z"},{"alias_kind":"arxiv_version","alias_value":"2104.11105v1","created_at":"2026-06-12T01:09:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.11105","created_at":"2026-06-12T01:09:02Z"},{"alias_kind":"pith_short_12","alias_value":"3FLBZL5JV5MS","created_at":"2026-06-12T01:09:02Z"},{"alias_kind":"pith_short_16","alias_value":"3FLBZL5JV5MS2VJB","created_at":"2026-06-12T01:09:02Z"},{"alias_kind":"pith_short_8","alias_value":"3FLBZL5J","created_at":"2026-06-12T01:09:02Z"}],"graph_snapshots":[{"event_id":"sha256:ff3c344b6b7551f3ae51569d7cadd85a4ef4e56992d76c8816c4b69c3e637f6b","target":"graph","created_at":"2026-06-12T01:09:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2104.11105/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Neural cryptography is the application of artificial neural networks in the subject of cryptography. The functionality of this solution is based on a tree parity machine. It uses artificial neural networks to perform secure key exchange between network entities. This article proposes improvements to the synchronization of two tree parity machines. The improvement is based on learning artificial neural network using input vectors which have a wider range of values than binary ones. As a result, the duration of the synchronization process is reduced. Therefore, tree parity machines achieve commo","authors_text":"Marcin Niemiec, Mi{\\l}osz Stypi\\'nski","cross_cats":["cs.LG","cs.NE"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2021-04-22T14:38:55Z","title":"Synchronization of Tree Parity Machines using non-binary input vectors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.11105","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:bbb6253657a8b3eb3931f80003fc25c6a6a85222d2e304d138480fc1053ca2e8","target":"record","created_at":"2026-06-12T01:09:02Z","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":"faea170460fd17249f7da137d5e7cea4763fe75c6ccbe4dafed7494abda2bf7b","cross_cats_sorted":["cs.LG","cs.NE"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2021-04-22T14:38:55Z","title_canon_sha256":"1834e82b452a2504458c9e3371bfc0addba2d4000757428863a40e4ddc362562"},"schema_version":"1.0","source":{"id":"2104.11105","kind":"arxiv","version":1}},"canonical_sha256":"d9561cafa9af592d55212fb41e49bc10f8029d1d547fa8982f88c3f3ecb41218","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9561cafa9af592d55212fb41e49bc10f8029d1d547fa8982f88c3f3ecb41218","first_computed_at":"2026-06-12T01:09:02.794435Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-12T01:09:02.794435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SET5YGiP2D/AOtVzdIsjY6XTWmlpfjiHxue0SNDLeHiZgb8vU8DUVYCE+saeqpSPJtsw7thyygEVq6lE5dfJCQ==","signature_status":"signed_v1","signed_at":"2026-06-12T01:09:02.795219Z","signed_message":"canonical_sha256_bytes"},"source_id":"2104.11105","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbb6253657a8b3eb3931f80003fc25c6a6a85222d2e304d138480fc1053ca2e8","sha256:ff3c344b6b7551f3ae51569d7cadd85a4ef4e56992d76c8816c4b69c3e637f6b"],"state_sha256":"92c4612872fb5469d94a0cf637f6e831e91c02d89355bb924e3e9ccee47687bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4R87VlN0CH2ho+Sl2CK0v1f+539uRvwToYMH2w6OzqBKvp+V5eTTs6fp4FJlsFqXXJYir/J9rJOyhHFcTxLTCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T19:11:07.400115Z","bundle_sha256":"dcd7451cddfa2efc0176a85fb0d0a03e1f21c37446b306e38283e61fb53897b1"}}