{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:IKII6RIXZDRMFXLRNAWM26WQ3D","short_pith_number":"pith:IKII6RIX","schema_version":"1.0","canonical_sha256":"42908f4517c8e2c2dd71682ccd7ad0d8d60853055bd0df9ed6b9d9e92a08899b","source":{"kind":"arxiv","id":"1005.1560","version":3},"attestation_state":"computed","paper":{"title":"Computation using Noise-based Logic: Efficient String Verification over a Slow Communication Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","physics.gen-ph"],"primary_cat":"cs.IT","authors_text":"Laszlo B. Kish, Sunil Khatri, Tamas Horvath","submitted_at":"2010-05-10T14:24:33Z","abstract_excerpt":"Utilizing the hyperspace of noise-based logic, we show two string verification methods with low communication complexity. One of them is based on continuum noise-based logic. The other one utilizes noise-based logic with random telegraph signals where a mathematical analysis of the error probability is also given. The last operation can also be interpreted as computing universal hash functions with noise-based logic and using them for string comparison. To find out with 10^-25 error probability that two strings with arbitrary length are different (this value is similar to the error probability"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1005.1560","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-05-10T14:24:33Z","cross_cats_sorted":["math.IT","physics.gen-ph"],"title_canon_sha256":"c3727a4d3b702c31e6adf7e2b46800d50e8f60598b38e80997a3a70d7c61f0f9","abstract_canon_sha256":"96a568f97dbe0322b69bf2f648dce56f876678ef096d6608c9f564b90f811e01"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:29:44.587307Z","signature_b64":"37BhDDx6sHUJ36xQ4n/WV8FF7vrFaF2IMF6c8BIRalxsnBjBTT7OUteQE4WAZia+FxNz8eSEx+DPVNGQPbBYAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42908f4517c8e2c2dd71682ccd7ad0d8d60853055bd0df9ed6b9d9e92a08899b","last_reissued_at":"2026-05-18T04:29:44.586850Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:29:44.586850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computation using Noise-based Logic: Efficient String Verification over a Slow Communication Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","physics.gen-ph"],"primary_cat":"cs.IT","authors_text":"Laszlo B. Kish, Sunil Khatri, Tamas Horvath","submitted_at":"2010-05-10T14:24:33Z","abstract_excerpt":"Utilizing the hyperspace of noise-based logic, we show two string verification methods with low communication complexity. One of them is based on continuum noise-based logic. The other one utilizes noise-based logic with random telegraph signals where a mathematical analysis of the error probability is also given. The last operation can also be interpreted as computing universal hash functions with noise-based logic and using them for string comparison. To find out with 10^-25 error probability that two strings with arbitrary length are different (this value is similar to the error probability"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.1560","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1005.1560","created_at":"2026-05-18T04:29:44.586917+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.1560v3","created_at":"2026-05-18T04:29:44.586917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.1560","created_at":"2026-05-18T04:29:44.586917+00:00"},{"alias_kind":"pith_short_12","alias_value":"IKII6RIXZDRM","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"IKII6RIXZDRMFXLR","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"IKII6RIX","created_at":"2026-05-18T12:26:09.077623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IKII6RIXZDRMFXLRNAWM26WQ3D","json":"https://pith.science/pith/IKII6RIXZDRMFXLRNAWM26WQ3D.json","graph_json":"https://pith.science/api/pith-number/IKII6RIXZDRMFXLRNAWM26WQ3D/graph.json","events_json":"https://pith.science/api/pith-number/IKII6RIXZDRMFXLRNAWM26WQ3D/events.json","paper":"https://pith.science/paper/IKII6RIX"},"agent_actions":{"view_html":"https://pith.science/pith/IKII6RIXZDRMFXLRNAWM26WQ3D","download_json":"https://pith.science/pith/IKII6RIXZDRMFXLRNAWM26WQ3D.json","view_paper":"https://pith.science/paper/IKII6RIX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.1560&json=true","fetch_graph":"https://pith.science/api/pith-number/IKII6RIXZDRMFXLRNAWM26WQ3D/graph.json","fetch_events":"https://pith.science/api/pith-number/IKII6RIXZDRMFXLRNAWM26WQ3D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IKII6RIXZDRMFXLRNAWM26WQ3D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IKII6RIXZDRMFXLRNAWM26WQ3D/action/storage_attestation","attest_author":"https://pith.science/pith/IKII6RIXZDRMFXLRNAWM26WQ3D/action/author_attestation","sign_citation":"https://pith.science/pith/IKII6RIXZDRMFXLRNAWM26WQ3D/action/citation_signature","submit_replication":"https://pith.science/pith/IKII6RIXZDRMFXLRNAWM26WQ3D/action/replication_record"}},"created_at":"2026-05-18T04:29:44.586917+00:00","updated_at":"2026-05-18T04:29:44.586917+00:00"}