{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:QWRCYH5XEA7QBX6P2H3WJZB2YB","short_pith_number":"pith:QWRCYH5X","canonical_record":{"source":{"id":"2605.13616","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-05-13T14:45:49Z","cross_cats_sorted":[],"title_canon_sha256":"ebca3e5e7ec85f51ed3d0b712ed900930d9d22208f099bfd4d27805dddd5e3f7","abstract_canon_sha256":"54433de29671732bb3b8ab6a8dd22d92d3af0793b66feb4d6b37897890c6c992"},"schema_version":"1.0"},"canonical_sha256":"85a22c1fb7203f00dfcfd1f764e43ac062270948044d78210947afc4634d9c75","source":{"kind":"arxiv","id":"2605.13616","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13616","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13616v1","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13616","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"pith_short_12","alias_value":"QWRCYH5XEA7Q","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"QWRCYH5XEA7QBX6P","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"QWRCYH5X","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:QWRCYH5XEA7QBX6P2H3WJZB2YB","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13616","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-05-13T14:45:49Z","cross_cats_sorted":[],"title_canon_sha256":"ebca3e5e7ec85f51ed3d0b712ed900930d9d22208f099bfd4d27805dddd5e3f7","abstract_canon_sha256":"54433de29671732bb3b8ab6a8dd22d92d3af0793b66feb4d6b37897890c6c992"},"schema_version":"1.0"},"canonical_sha256":"85a22c1fb7203f00dfcfd1f764e43ac062270948044d78210947afc4634d9c75","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:17.968903Z","signature_b64":"nLZ+mvLUOr5MtomlFu+37QR4Ll/Oyoiw1w6ExpB2bUF6TwsJ32xY6zAkSbqKOFc2wqHpvYdUHoREqCYBPO7fCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85a22c1fb7203f00dfcfd1f764e43ac062270948044d78210947afc4634d9c75","last_reissued_at":"2026-05-18T02:44:17.968453Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:17.968453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13616","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-18T02:44:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rgudzf7OrNM9gBARZUD+68UN7IP2cjZ5+P/aUsHu8Hs+zpkCRDrymCqC7HcS91lOFYqkPvVSi4iRGadgXEZUCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:35:20.408496Z"},"content_sha256":"08a60f6f9bf8d6c578635e85f1454bff14715546ffc29cc11496ea9290b3ea7d","schema_version":"1.0","event_id":"sha256:08a60f6f9bf8d6c578635e85f1454bff14715546ffc29cc11496ea9290b3ea7d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:QWRCYH5XEA7QBX6P2H3WJZB2YB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Deductive Verification of Data-Level Parallel Programs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Quantifier rewrite rules and non-aliasing specifications reduce verification time for data-parallel array programs by a factor of nine on average.","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Anton Wijs, Lars B. van den Haak, Marieke Huisman","submitted_at":"2026-05-13T14:45:49Z","abstract_excerpt":"This paper introduces several techniques that improve the scalability of the deductive verification of data-level programs working on arrays and matrices. First of all, we introduce a technique to rewrite expressions with (nested) quantifiers, so suitable triggers can be generated for these expressions. We have proven this rewrite technique correct in a theorem prover. Second, we make reasoning about potentially overlapping arrays easier, by providing specification constructs to indicate and verify that two arrays are not aliases, or that they are immutable, so they can be modelled as mathemat"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Using our techniques on a set of typical GPU kernels, we achieve a reduction of verification time by, on average, a factor of 9, with outliers being up to 150 times faster.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The techniques assume that suitable non-aliasing and immutability specifications can be provided by the user and that the programs fit the data-level parallel model without complex aliasing patterns that defeat the new constructs.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Quantifier rewriting and array non-aliasing specifications in VerCors reduce verification time for data-level parallel programs by an average factor of 9.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Quantifier rewrite rules and non-aliasing specifications reduce verification time for data-parallel array programs by a factor of nine on average.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"6442c29c214975acc9e835de3603cec635be1eaac7644c961bfd39100fa5454c"},"source":{"id":"2605.13616","kind":"arxiv","version":1},"verdict":{"id":"1d5f3782-c177-47a8-8380-5765c5413566","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T17:54:40.878012Z","strongest_claim":"Using our techniques on a set of typical GPU kernels, we achieve a reduction of verification time by, on average, a factor of 9, with outliers being up to 150 times faster.","one_line_summary":"Quantifier rewriting and array non-aliasing specifications in VerCors reduce verification time for data-level parallel programs by an average factor of 9.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The techniques assume that suitable non-aliasing and immutability specifications can be provided by the user and that the programs fit the data-level parallel model without complex aliasing patterns that defeat the new constructs.","pith_extraction_headline":"Quantifier rewrite rules and non-aliasing specifications reduce verification time for data-parallel array programs by a factor of nine on average."},"references":{"count":25,"sample":[{"doi":"10.1007/978-3-031-65630-9_1","year":2024,"title":"In: Gurfinkel, A., Ganesh, V","work_id":"d8103442-b646-40a4-b6c4-5aa262eceb0d","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1007/978-3-642-29737-3_22","year":2011,"title":"In: In Proceedings of the 1st Workshop on Grids, Clouds and P2P Programming (CGWS)","work_id":"5fb8de72-8047-4817-81ad-ce7ed45565c9","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1145/2048237.2048242","year":2011,"title":"In: Proceedings of the 10th SIG- PLAN Symposium on New Ideas, New Paradigms, and Reflections on Program- ming and Software","work_id":"b127fb81-1030-4bee-96b0-b05a4d914cb9","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1016/j.scico.2014.03.013","year":2014,"title":"Science of Computer Programming95, 376–388 (Dec 2014).https: //doi.org/10.1016/j.scico.2014.03.013","work_id":"2a1cfae7-e241-4cb7-aff3-e296d1013793","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1007/978-3-540-28644-8_2","year":2004,"title":"In: Gardner, P., Yoshida, N","work_id":"0b3a88c0-51f1-4efd-8adc-1791efe92b4f","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":25,"snapshot_sha256":"7e2bc1ce4c04a1fb7f9150091bb853c0008e4a87131572adcb4f4f94fe4d6e11","internal_anchors":0},"formal_canon":{"evidence_count":1,"snapshot_sha256":"ee30b52a7126f00e31439af26d87342ff03ec70afbc642bb987ce39f5b0e94e2"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"1d5f3782-c177-47a8-8380-5765c5413566"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mXzRXsVxEHLPmavA0lY0uME3u8Uvi2ZNzdWLXfV2cyfI32TdlAJFrpatQFeTSSsXjF73AJRDfkORBJxkgTw9BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:35:20.409604Z"},"content_sha256":"e4755b58260535c4db922abcd176ffb9c12eb21e591b5fcefeaae9413a0ef8ce","schema_version":"1.0","event_id":"sha256:e4755b58260535c4db922abcd176ffb9c12eb21e591b5fcefeaae9413a0ef8ce"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:QWRCYH5XEA7QBX6P2H3WJZB2YB","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-030-81685-8_1722) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Wolf, F.A., Arquint, L., Clochard, M., Oortwijn, W., Pereira, J.C., Müller, P.: Go- bra: Modular Specification and Verification of Go Programs. In: Silva, A., Leino, K.R.M. (eds.) Computer Aided Verification, vol. 12759, pp. 367–379. Spring","arxiv_id":"2605.13616","detector":"doi_compliance","evidence":{"ref_index":26,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Wolf, F.A., Arquint, L., Clochard, M., Oortwijn, W., Pereira, J.C., Müller, P.: Go- bra: Modular Specification and Verification of Go Programs. In: Silva, A., Leino, K.R.M. (eds.) Computer Aided Verification, vol. 12759, pp. 367–379. Spring","reconstructed_doi":"10.1007/978-3-030-81685-8_1722"},"severity":"advisory","ref_index":26,"audited_at":"2026-05-19T06:21:27.538078Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-030-81685-8_1722","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"2a4f6be291796bb2cc3a3367d848f34737d12141c68176ec566d6d87a42aa6fb","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":126,"payload_sha256":"f30f7898b9bf13f90687d000374eab770532712bb7f0c624aabb1974d4036c51","signature_b64":"AnH8ug7kMeqDf3xMNedpq0VHgGjXZiKsILzM050VgHnHn5WH9lTQ+0ka0EZIfvrPvAuWKqsA89m5Rc+jCP11Ag==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-19T06:21:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nxztXZVzLGZ9sztGffac203sCaAvc1GrVKy2yfWlEbiuizGN06zm/ssmlbSi9wJRe0cfhHwZ1MZHrpbVLxIfDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:35:20.410926Z"},"content_sha256":"324bd8f12e7c77d57ef103033ba83d809a81fb1ea8d9010f63895a113f59a378","schema_version":"1.0","event_id":"sha256:324bd8f12e7c77d57ef103033ba83d809a81fb1ea8d9010f63895a113f59a378"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QWRCYH5XEA7QBX6P2H3WJZB2YB/bundle.json","state_url":"https://pith.science/pith/QWRCYH5XEA7QBX6P2H3WJZB2YB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QWRCYH5XEA7QBX6P2H3WJZB2YB/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-27T08:35:20Z","links":{"resolver":"https://pith.science/pith/QWRCYH5XEA7QBX6P2H3WJZB2YB","bundle":"https://pith.science/pith/QWRCYH5XEA7QBX6P2H3WJZB2YB/bundle.json","state":"https://pith.science/pith/QWRCYH5XEA7QBX6P2H3WJZB2YB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QWRCYH5XEA7QBX6P2H3WJZB2YB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QWRCYH5XEA7QBX6P2H3WJZB2YB","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"54433de29671732bb3b8ab6a8dd22d92d3af0793b66feb4d6b37897890c6c992","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-05-13T14:45:49Z","title_canon_sha256":"ebca3e5e7ec85f51ed3d0b712ed900930d9d22208f099bfd4d27805dddd5e3f7"},"schema_version":"1.0","source":{"id":"2605.13616","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13616","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13616v1","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13616","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"pith_short_12","alias_value":"QWRCYH5XEA7Q","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"QWRCYH5XEA7QBX6P","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"QWRCYH5X","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:e4755b58260535c4db922abcd176ffb9c12eb21e591b5fcefeaae9413a0ef8ce","target":"graph","created_at":"2026-05-18T02:44:17Z","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":"Using our techniques on a set of typical GPU kernels, we achieve a reduction of verification time by, on average, a factor of 9, with outliers being up to 150 times faster."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The techniques assume that suitable non-aliasing and immutability specifications can be provided by the user and that the programs fit the data-level parallel model without complex aliasing patterns that defeat the new constructs."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Quantifier rewriting and array non-aliasing specifications in VerCors reduce verification time for data-level parallel programs by an average factor of 9."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Quantifier rewrite rules and non-aliasing specifications reduce verification time for data-parallel array programs by a factor of nine on average."}],"snapshot_sha256":"6442c29c214975acc9e835de3603cec635be1eaac7644c961bfd39100fa5454c"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"ee30b52a7126f00e31439af26d87342ff03ec70afbc642bb987ce39f5b0e94e2"},"paper":{"abstract_excerpt":"This paper introduces several techniques that improve the scalability of the deductive verification of data-level programs working on arrays and matrices. First of all, we introduce a technique to rewrite expressions with (nested) quantifiers, so suitable triggers can be generated for these expressions. We have proven this rewrite technique correct in a theorem prover. Second, we make reasoning about potentially overlapping arrays easier, by providing specification constructs to indicate and verify that two arrays are not aliases, or that they are immutable, so they can be modelled as mathemat","authors_text":"Anton Wijs, Lars B. van den Haak, Marieke Huisman","cross_cats":[],"headline":"Quantifier rewrite rules and non-aliasing specifications reduce verification time for data-parallel array programs by a factor of nine on average.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-05-13T14:45:49Z","title":"Scalable Deductive Verification of Data-Level Parallel Programs"},"references":{"count":25,"internal_anchors":0,"resolved_work":25,"sample":[{"cited_arxiv_id":"","doi":"10.1007/978-3-031-65630-9_1","is_internal_anchor":false,"ref_index":1,"title":"In: Gurfinkel, A., Ganesh, V","work_id":"d8103442-b646-40a4-b6c4-5aa262eceb0d","year":2024},{"cited_arxiv_id":"","doi":"10.1007/978-3-642-29737-3_22","is_internal_anchor":false,"ref_index":2,"title":"In: In Proceedings of the 1st Workshop on Grids, Clouds and P2P Programming (CGWS)","work_id":"5fb8de72-8047-4817-81ad-ce7ed45565c9","year":2011},{"cited_arxiv_id":"","doi":"10.1145/2048237.2048242","is_internal_anchor":false,"ref_index":3,"title":"In: Proceedings of the 10th SIG- PLAN Symposium on New Ideas, New Paradigms, and Reflections on Program- ming and Software","work_id":"b127fb81-1030-4bee-96b0-b05a4d914cb9","year":2011},{"cited_arxiv_id":"","doi":"10.1016/j.scico.2014.03.013","is_internal_anchor":false,"ref_index":4,"title":"Science of Computer Programming95, 376–388 (Dec 2014).https: //doi.org/10.1016/j.scico.2014.03.013","work_id":"2a1cfae7-e241-4cb7-aff3-e296d1013793","year":2014},{"cited_arxiv_id":"","doi":"10.1007/978-3-540-28644-8_2","is_internal_anchor":false,"ref_index":5,"title":"In: Gardner, P., Yoshida, N","work_id":"0b3a88c0-51f1-4efd-8adc-1791efe92b4f","year":2004}],"snapshot_sha256":"7e2bc1ce4c04a1fb7f9150091bb853c0008e4a87131572adcb4f4f94fe4d6e11"},"source":{"id":"2605.13616","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T17:54:40.878012Z","id":"1d5f3782-c177-47a8-8380-5765c5413566","model_set":{"reader":"grok-4.3"},"one_line_summary":"Quantifier rewriting and array non-aliasing specifications in VerCors reduce verification time for data-level parallel programs by an average factor of 9.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Quantifier rewrite rules and non-aliasing specifications reduce verification time for data-parallel array programs by a factor of nine on average.","strongest_claim":"Using our techniques on a set of typical GPU kernels, we achieve a reduction of verification time by, on average, a factor of 9, with outliers being up to 150 times faster.","weakest_assumption":"The techniques assume that suitable non-aliasing and immutability specifications can be provided by the user and that the programs fit the data-level parallel model without complex aliasing patterns that defeat the new constructs."}},"verdict_id":"1d5f3782-c177-47a8-8380-5765c5413566"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:08a60f6f9bf8d6c578635e85f1454bff14715546ffc29cc11496ea9290b3ea7d","target":"record","created_at":"2026-05-18T02:44:17Z","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":"54433de29671732bb3b8ab6a8dd22d92d3af0793b66feb4d6b37897890c6c992","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2026-05-13T14:45:49Z","title_canon_sha256":"ebca3e5e7ec85f51ed3d0b712ed900930d9d22208f099bfd4d27805dddd5e3f7"},"schema_version":"1.0","source":{"id":"2605.13616","kind":"arxiv","version":1}},"canonical_sha256":"85a22c1fb7203f00dfcfd1f764e43ac062270948044d78210947afc4634d9c75","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85a22c1fb7203f00dfcfd1f764e43ac062270948044d78210947afc4634d9c75","first_computed_at":"2026-05-18T02:44:17.968453Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:17.968453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nLZ+mvLUOr5MtomlFu+37QR4Ll/Oyoiw1w6ExpB2bUF6TwsJ32xY6zAkSbqKOFc2wqHpvYdUHoREqCYBPO7fCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:17.968903Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13616","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08a60f6f9bf8d6c578635e85f1454bff14715546ffc29cc11496ea9290b3ea7d","sha256:e4755b58260535c4db922abcd176ffb9c12eb21e591b5fcefeaae9413a0ef8ce","sha256:324bd8f12e7c77d57ef103033ba83d809a81fb1ea8d9010f63895a113f59a378"],"state_sha256":"6311411283b59eb95232dfe349e300e025f28a1bd23215c3c9208cde8200d8ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8LeGtYgjNzlS/8CMyeGU1sYwBcBNBUOeMYYucFMfblbJZmRIW0VCISZj5EHsqGJ3uYaAgrbRCNyMfOURvrr/Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:35:20.413841Z","bundle_sha256":"8bc00efcbc7b9575a8af3a554bb5648431e31448f7b40e53cb18b0a798fa7a53"}}