{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:UY3BLCPI3YYNKM7NGC57MESCD4","short_pith_number":"pith:UY3BLCPI","canonical_record":{"source":{"id":"2605.16912","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-16T09:58:54Z","cross_cats_sorted":[],"title_canon_sha256":"28fb8515a95174e5e16d844f45d933c0c2c1b8c40ff740fe5d18f823007957be","abstract_canon_sha256":"2468623e480c16b45ed6877c478f3b73a8aa43cabae9e6c0163ef0a3b0139055"},"schema_version":"1.0"},"canonical_sha256":"a6361589e8de30d533ed30bbf612421f10b2d8848ab12cce15c0381bffa1a8cc","source":{"kind":"arxiv","id":"2605.16912","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16912","created_at":"2026-05-20T00:03:29Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16912v1","created_at":"2026-05-20T00:03:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16912","created_at":"2026-05-20T00:03:29Z"},{"alias_kind":"pith_short_12","alias_value":"UY3BLCPI3YYN","created_at":"2026-05-20T00:03:29Z"},{"alias_kind":"pith_short_16","alias_value":"UY3BLCPI3YYNKM7N","created_at":"2026-05-20T00:03:29Z"},{"alias_kind":"pith_short_8","alias_value":"UY3BLCPI","created_at":"2026-05-20T00:03:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:UY3BLCPI3YYNKM7NGC57MESCD4","target":"record","payload":{"canonical_record":{"source":{"id":"2605.16912","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-16T09:58:54Z","cross_cats_sorted":[],"title_canon_sha256":"28fb8515a95174e5e16d844f45d933c0c2c1b8c40ff740fe5d18f823007957be","abstract_canon_sha256":"2468623e480c16b45ed6877c478f3b73a8aa43cabae9e6c0163ef0a3b0139055"},"schema_version":"1.0"},"canonical_sha256":"a6361589e8de30d533ed30bbf612421f10b2d8848ab12cce15c0381bffa1a8cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:29.819309Z","signature_b64":"CkEiCuG5MIGVQB7wrDc9scRecLO4tDeogH5vLsiitLofmZFi/hWL8DzbpmLakmW2007982W4U/ADmCyavB65DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6361589e8de30d533ed30bbf612421f10b2d8848ab12cce15c0381bffa1a8cc","last_reissued_at":"2026-05-20T00:03:29.818386Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:29.818386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.16912","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-20T00:03:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hd3OPqj4kn5v0n85eEElIuc4JRf9CJ6LxX+JgmM6ggYb3k3XpUPQmnm5VzG12UuirsMpf7S1PFBv6b4esTrpBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T09:53:57.979819Z"},"content_sha256":"225ec858b96c6b72a8c1a3d629a4f6cb49ad1b31b6bbd66a2873765d481b5299","schema_version":"1.0","event_id":"sha256:225ec858b96c6b72a8c1a3d629a4f6cb49ad1b31b6bbd66a2873765d481b5299"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:UY3BLCPI3YYNKM7NGC57MESCD4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Lightweight QR-assisted Zero-knowledge Identification Protocol For Secure Authentication","license":"http://creativecommons.org/licenses/by/4.0/","headline":"The QR-assisted Schnorr protocol verifies secret key knowledge without revealing it, with millisecond proof times and constant 0.5 KB size.","cross_cats":[],"primary_cat":"cs.CR","authors_text":"H\\\"useyin Bodur","submitted_at":"2026-05-16T09:58:54Z","abstract_excerpt":"This study proposes a lightweight Zero-Knowledge authentication model supported by QR codes. The approach is based on the Schnorr authentication protocol and provides an additional security layer against replay attacks through nonce and timestamp mechanisms. The proof data generated by the prover is embedded within a QR code and transmitted to the verifier. Thus, the system enables verification of knowledge of the secret key without revealing it. Simulation results show that proof generation and verification times under a 256-bit security level are in the millisecond range. Additionally, the p"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The proposed model enables verification of knowledge of the secret key without revealing it, with proof generation and verification times in the millisecond range and constant proof size of approximately 0.5 KB under 256-bit security, making it suitable for mobile and low-resource systems.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The security and practicality claims rest on the assumption that the Schnorr protocol combined with nonce and timestamp mechanisms provides sufficient protection against replay and other attacks in real deployments, as the abstract provides no formal security reduction or implementation details beyond simulation timing.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A Schnorr-based zero-knowledge protocol embeds constant-size proofs in QR codes for replay-resistant authentication with millisecond generation and verification times.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The QR-assisted Schnorr protocol verifies secret key knowledge without revealing it, with millisecond proof times and constant 0.5 KB size.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"fcd9fdfc914540ba727281cef2a04b96f370bd52e49b4a0489ce3833dfa690ce"},"source":{"id":"2605.16912","kind":"arxiv","version":1},"verdict":{"id":"15c7e593-3e7a-4f8b-a945-14990b7626f3","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T20:33:23.994926Z","strongest_claim":"The proposed model enables verification of knowledge of the secret key without revealing it, with proof generation and verification times in the millisecond range and constant proof size of approximately 0.5 KB under 256-bit security, making it suitable for mobile and low-resource systems.","one_line_summary":"A Schnorr-based zero-knowledge protocol embeds constant-size proofs in QR codes for replay-resistant authentication with millisecond generation and verification times.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The security and practicality claims rest on the assumption that the Schnorr protocol combined with nonce and timestamp mechanisms provides sufficient protection against replay and other attacks in real deployments, as the abstract provides no formal security reduction or implementation details beyond simulation timing.","pith_extraction_headline":"The QR-assisted Schnorr protocol verifies secret key knowledge without revealing it, with millisecond proof times and constant 0.5 KB size."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16912/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T21:01:19.169382Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"cited_work_retraction","ran_at":"2026-05-19T20:52:03.068571Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T20:40:52.251039Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T18:41:56.268468Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.348482Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"76ac45e1ce22106cdbd6066f64812a138f83d3beadcd0dde6595e7e48b8a3dc2"},"references":{"count":17,"sample":[{"doi":"","year":2012,"title":"C., & Stajano, F","work_id":"4e21c928-7fbe-42dc-ac55-e3ea1e1e9e09","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Nie, Y. (2025). WAScope: Detecting privacy data leakage with web application -specific API analysis. Journal of Web Systems and Security (Elsevier)","work_id":"466f60de-4806-4266-904c-9ed19c6dd1b5","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Alotaibi, A. (2025). A review of authentication techniques for Internet of Things (IoT) in smart cities. Sensors, 25(6)","work_id":"b6f5e830-954f-4209-94f4-7db60829bdd6","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1985,"title":"Goldwasser, S., Micali, S., & Rackoff, C. (1985). The knowledge complexity of interactive proof systems. SIAM Journal on Computing, 18(1), 186–208","work_id":"a32ed62a-16b2-4ac6-bd6c-09e221cd010a","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1986,"title":"Fiat, A., & Shamir, A. (1986). How to prove yourself: Practical solutions to identification and signature problems. Advances in Cryptology — CRYPTO ’86, 186–194","work_id":"adc5960d-4269-40d3-bf15-80b77612f41e","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":17,"snapshot_sha256":"e0a5dd0f59fbff3eea294a1c512388940f807ee6fddbb32079c225efcd942cec","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":"15c7e593-3e7a-4f8b-a945-14990b7626f3"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:03:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wTeMlpRtuUWffzQEl8Z2PCCBmp8Vg/K3t/7CfNajlMgMG00J2ZVJDiNOSVVdAVXNv6wouhSj08681BWKmb4EDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T09:53:57.980609Z"},"content_sha256":"0771c92fe8d24e4784c2dc600494fee14b912156b1e8644ad4c5e399e4ed98e8","schema_version":"1.0","event_id":"sha256:0771c92fe8d24e4784c2dc600494fee14b912156b1e8644ad4c5e399e4ed98e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UY3BLCPI3YYNKM7NGC57MESCD4/bundle.json","state_url":"https://pith.science/pith/UY3BLCPI3YYNKM7NGC57MESCD4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UY3BLCPI3YYNKM7NGC57MESCD4/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-20T09:53:57Z","links":{"resolver":"https://pith.science/pith/UY3BLCPI3YYNKM7NGC57MESCD4","bundle":"https://pith.science/pith/UY3BLCPI3YYNKM7NGC57MESCD4/bundle.json","state":"https://pith.science/pith/UY3BLCPI3YYNKM7NGC57MESCD4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UY3BLCPI3YYNKM7NGC57MESCD4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:UY3BLCPI3YYNKM7NGC57MESCD4","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":"2468623e480c16b45ed6877c478f3b73a8aa43cabae9e6c0163ef0a3b0139055","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-16T09:58:54Z","title_canon_sha256":"28fb8515a95174e5e16d844f45d933c0c2c1b8c40ff740fe5d18f823007957be"},"schema_version":"1.0","source":{"id":"2605.16912","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16912","created_at":"2026-05-20T00:03:29Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16912v1","created_at":"2026-05-20T00:03:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16912","created_at":"2026-05-20T00:03:29Z"},{"alias_kind":"pith_short_12","alias_value":"UY3BLCPI3YYN","created_at":"2026-05-20T00:03:29Z"},{"alias_kind":"pith_short_16","alias_value":"UY3BLCPI3YYNKM7N","created_at":"2026-05-20T00:03:29Z"},{"alias_kind":"pith_short_8","alias_value":"UY3BLCPI","created_at":"2026-05-20T00:03:29Z"}],"graph_snapshots":[{"event_id":"sha256:0771c92fe8d24e4784c2dc600494fee14b912156b1e8644ad4c5e399e4ed98e8","target":"graph","created_at":"2026-05-20T00:03:29Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"The proposed model enables verification of knowledge of the secret key without revealing it, with proof generation and verification times in the millisecond range and constant proof size of approximately 0.5 KB under 256-bit security, making it suitable for mobile and low-resource systems."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The security and practicality claims rest on the assumption that the Schnorr protocol combined with nonce and timestamp mechanisms provides sufficient protection against replay and other attacks in real deployments, as the abstract provides no formal security reduction or implementation details beyond simulation timing."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A Schnorr-based zero-knowledge protocol embeds constant-size proofs in QR codes for replay-resistant authentication with millisecond generation and verification times."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The QR-assisted Schnorr protocol verifies secret key knowledge without revealing it, with millisecond proof times and constant 0.5 KB size."}],"snapshot_sha256":"fcd9fdfc914540ba727281cef2a04b96f370bd52e49b4a0489ce3833dfa690ce"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T21:01:19.169382Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T20:52:03.068571Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T20:40:52.251039Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T18:41:56.268468Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.348482Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.16912/integrity.json","findings":[],"snapshot_sha256":"76ac45e1ce22106cdbd6066f64812a138f83d3beadcd0dde6595e7e48b8a3dc2","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This study proposes a lightweight Zero-Knowledge authentication model supported by QR codes. The approach is based on the Schnorr authentication protocol and provides an additional security layer against replay attacks through nonce and timestamp mechanisms. The proof data generated by the prover is embedded within a QR code and transmitted to the verifier. Thus, the system enables verification of knowledge of the secret key without revealing it. Simulation results show that proof generation and verification times under a 256-bit security level are in the millisecond range. Additionally, the p","authors_text":"H\\\"useyin Bodur","cross_cats":[],"headline":"The QR-assisted Schnorr protocol verifies secret key knowledge without revealing it, with millisecond proof times and constant 0.5 KB size.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-16T09:58:54Z","title":"A Lightweight QR-assisted Zero-knowledge Identification Protocol For Secure Authentication"},"references":{"count":17,"internal_anchors":0,"resolved_work":17,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"C., & Stajano, F","work_id":"4e21c928-7fbe-42dc-ac55-e3ea1e1e9e09","year":2012},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Nie, Y. (2025). WAScope: Detecting privacy data leakage with web application -specific API analysis. Journal of Web Systems and Security (Elsevier)","work_id":"466f60de-4806-4266-904c-9ed19c6dd1b5","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Alotaibi, A. (2025). A review of authentication techniques for Internet of Things (IoT) in smart cities. Sensors, 25(6)","work_id":"b6f5e830-954f-4209-94f4-7db60829bdd6","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Goldwasser, S., Micali, S., & Rackoff, C. (1985). The knowledge complexity of interactive proof systems. SIAM Journal on Computing, 18(1), 186–208","work_id":"a32ed62a-16b2-4ac6-bd6c-09e221cd010a","year":1985},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Fiat, A., & Shamir, A. (1986). How to prove yourself: Practical solutions to identification and signature problems. Advances in Cryptology — CRYPTO ’86, 186–194","work_id":"adc5960d-4269-40d3-bf15-80b77612f41e","year":1986}],"snapshot_sha256":"e0a5dd0f59fbff3eea294a1c512388940f807ee6fddbb32079c225efcd942cec"},"source":{"id":"2605.16912","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T20:33:23.994926Z","id":"15c7e593-3e7a-4f8b-a945-14990b7626f3","model_set":{"reader":"grok-4.3"},"one_line_summary":"A Schnorr-based zero-knowledge protocol embeds constant-size proofs in QR codes for replay-resistant authentication with millisecond generation and verification times.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The QR-assisted Schnorr protocol verifies secret key knowledge without revealing it, with millisecond proof times and constant 0.5 KB size.","strongest_claim":"The proposed model enables verification of knowledge of the secret key without revealing it, with proof generation and verification times in the millisecond range and constant proof size of approximately 0.5 KB under 256-bit security, making it suitable for mobile and low-resource systems.","weakest_assumption":"The security and practicality claims rest on the assumption that the Schnorr protocol combined with nonce and timestamp mechanisms provides sufficient protection against replay and other attacks in real deployments, as the abstract provides no formal security reduction or implementation details beyond simulation timing."}},"verdict_id":"15c7e593-3e7a-4f8b-a945-14990b7626f3"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:225ec858b96c6b72a8c1a3d629a4f6cb49ad1b31b6bbd66a2873765d481b5299","target":"record","created_at":"2026-05-20T00:03:29Z","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":"2468623e480c16b45ed6877c478f3b73a8aa43cabae9e6c0163ef0a3b0139055","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-16T09:58:54Z","title_canon_sha256":"28fb8515a95174e5e16d844f45d933c0c2c1b8c40ff740fe5d18f823007957be"},"schema_version":"1.0","source":{"id":"2605.16912","kind":"arxiv","version":1}},"canonical_sha256":"a6361589e8de30d533ed30bbf612421f10b2d8848ab12cce15c0381bffa1a8cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6361589e8de30d533ed30bbf612421f10b2d8848ab12cce15c0381bffa1a8cc","first_computed_at":"2026-05-20T00:03:29.818386Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:29.818386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CkEiCuG5MIGVQB7wrDc9scRecLO4tDeogH5vLsiitLofmZFi/hWL8DzbpmLakmW2007982W4U/ADmCyavB65DQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:29.819309Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16912","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:225ec858b96c6b72a8c1a3d629a4f6cb49ad1b31b6bbd66a2873765d481b5299","sha256:0771c92fe8d24e4784c2dc600494fee14b912156b1e8644ad4c5e399e4ed98e8"],"state_sha256":"1e4b6b6ffc8318e8e25461ab15d57a7b9a05dc2379e0bea49e538f6a83744870"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O7tF1HLjqyj5kQijKCoBGLUHpRgvHAfvdZRUmC6xZJ3tXscavSQFZfCg71vP10jMTB3TPEbSa6kghSPY1ks0AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T09:53:57.983452Z","bundle_sha256":"84992b7e3ebeb400e9a762f4c34c36018782253b61a69ac019a7e3b72d668989"}}