{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4IPOKMJKMNFBR6KT3HSUEQOANU","short_pith_number":"pith:4IPOKMJK","canonical_record":{"source":{"id":"1909.09436","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-20T11:52:45Z","cross_cats_sorted":["cs.IR","cs.SE","stat.ML"],"title_canon_sha256":"30eb13f7e19b295d94df00528fcc5f3e2875ebea204bb9870398d335e448954e","abstract_canon_sha256":"33e2d50bac7613c65aff732583ff944c4a2428b24e64c4b1b2072a205f86e5cc"},"schema_version":"1.0"},"canonical_sha256":"e21ee5312a634a18f953d9e54241c06d2ac2a8a438558fe4bbe6d0847e2c3071","source":{"kind":"arxiv","id":"1909.09436","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.09436","created_at":"2026-07-05T01:08:24Z"},{"alias_kind":"arxiv_version","alias_value":"1909.09436v3","created_at":"2026-07-05T01:08:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.09436","created_at":"2026-07-05T01:08:24Z"},{"alias_kind":"pith_short_12","alias_value":"4IPOKMJKMNFB","created_at":"2026-07-05T01:08:24Z"},{"alias_kind":"pith_short_16","alias_value":"4IPOKMJKMNFBR6KT","created_at":"2026-07-05T01:08:24Z"},{"alias_kind":"pith_short_8","alias_value":"4IPOKMJK","created_at":"2026-07-05T01:08:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4IPOKMJKMNFBR6KT3HSUEQOANU","target":"record","payload":{"canonical_record":{"source":{"id":"1909.09436","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-20T11:52:45Z","cross_cats_sorted":["cs.IR","cs.SE","stat.ML"],"title_canon_sha256":"30eb13f7e19b295d94df00528fcc5f3e2875ebea204bb9870398d335e448954e","abstract_canon_sha256":"33e2d50bac7613c65aff732583ff944c4a2428b24e64c4b1b2072a205f86e5cc"},"schema_version":"1.0"},"canonical_sha256":"e21ee5312a634a18f953d9e54241c06d2ac2a8a438558fe4bbe6d0847e2c3071","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:08:24.850341Z","signature_b64":"P5z0iH2qvPjTLeTi0rvejwny/0E8w+muQVAgPaDlO31pyOuhgki9c4tFI42pzJ42e6G5uTuavgh3lyr8zILUAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e21ee5312a634a18f953d9e54241c06d2ac2a8a438558fe4bbe6d0847e2c3071","last_reissued_at":"2026-07-05T01:08:24.849922Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:08:24.849922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1909.09436","source_version":3,"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-07-05T01:08:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h7EHf80uze0xrW/bn1iQlx3RUSQMCqr5YpXd2WC31xTmfFQQcZBkuwMqxWzv/K207ibAat1gC6TquHcXKdkdBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T14:08:46.275563Z"},"content_sha256":"f865595a6c61d9e9913373fb9c7c40e3d7a586f490cc3860d1dd4e61fa7e985d","schema_version":"1.0","event_id":"sha256:f865595a6c61d9e9913373fb9c7c40e3d7a586f490cc3860d1dd4e61fa7e985d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4IPOKMJKMNFBR6KT3HSUEQOANU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CodeSearchNet Challenge: Evaluating the State of Semantic Code Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Releasing the CodeSearchNet Corpus of 6 million functions and a challenge with 99 annotated queries enables evaluation of semantic code search across six languages.","cross_cats":["cs.IR","cs.SE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Hamel Husain, Ho-Hsiang Wu, Marc Brockschmidt, Miltiadis Allamanis, Tiferet Gazit","submitted_at":"2019-09-20T11:52:45Z","abstract_excerpt":"Semantic code search is the task of retrieving relevant code given a natural language query. While related to other information retrieval tasks, it requires bridging the gap between the language used in code (often abbreviated and highly technical) and natural language more suitable to describe vague concepts and ideas.\n  To enable evaluation of progress on code search, we are releasing the CodeSearchNet Corpus and are presenting the CodeSearchNet Challenge, which consists of 99 natural language queries with about 4k expert relevance annotations of likely results from CodeSearchNet Corpus. The"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"To enable evaluation of progress on code search, we are releasing the CodeSearchNet Corpus and are presenting the CodeSearchNet Challenge, which consists of 99 natural language queries with about 4k expert relevance annotations of likely results from CodeSearchNet Corpus.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that mechanically scraped and preprocessed function documentation yields sufficiently accurate and representative natural-language queries, and that the expert annotations are consistent and unbiased measures of relevance.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Releases a large multi-language code corpus and expert-annotated challenge to benchmark semantic code search.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Releasing the CodeSearchNet Corpus of 6 million functions and a challenge with 99 annotated queries enables evaluation of semantic code search across six languages.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"8dc5cff80129a1bba3a4933a945206601984ac61bb24dea5c405d5ff3fe72ecc"},"source":{"id":"1909.09436","kind":"arxiv","version":3},"verdict":{"id":"cf2c739e-89a0-47ee-99eb-ff88f7c7f9ea","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-12T16:00:39.026015Z","strongest_claim":"To enable evaluation of progress on code search, we are releasing the CodeSearchNet Corpus and are presenting the CodeSearchNet Challenge, which consists of 99 natural language queries with about 4k expert relevance annotations of likely results from CodeSearchNet Corpus.","one_line_summary":"Releases a large multi-language code corpus and expert-annotated challenge to benchmark semantic code search.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that mechanically scraped and preprocessed function documentation yields sufficiently accurate and representative natural-language queries, and that the expert annotations are consistent and unbiased measures of relevance.","pith_extraction_headline":"Releasing the CodeSearchNet Corpus of 6 million functions and a challenge with 99 annotated queries enables evaluation of semantic code search across six languages."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.09436/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":26,"sample":[{"doi":"","year":2018,"title":"Miltiadis Allamanis. 2018. The Adverse Effects of Code Duplication in Machine Learning Models of Code. arXiv preprint arXiv:1812.06469 (2018)","work_id":"ec049e9a-4ab6-434d-8752-48618636162a","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"Miltiadis Allamanis, Earl T Barr, Premkumar Devanbu, and Charles Sutton. 2018. A survey of machine learning for big code and naturalness. ACM Computing Surveys (CSUR) 51, 4 (2018), 81","work_id":"7f0977f1-2213-4528-a924-89e2f327a516","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2016,"title":"Miltiadis Allamanis, Hao Peng, and Charles Sutton. 2016. A Convolutional Attention Network for Extreme Summarization of Source Code. In Proceedings of the International Conference on Machine Learning ","work_id":"7aeef716-5af6-4a34-b2a0-fe454133cb79","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"code2seq: Generating Sequences from Structured Representations of Code","work_id":"f4d5c460-f108-4fb4-97a4-6109f749e7ba","ref_index":4,"cited_arxiv_id":"1808.01400","is_internal_anchor":false},{"doi":"","year":2017,"title":"A parallel corpus of Python functions and documentation strings for automated code documentation and code generation","work_id":"3484b4d3-268c-4c6a-8eb5-315f36c3de9a","ref_index":5,"cited_arxiv_id":"1707.02275","is_internal_anchor":false}],"resolved_work":26,"snapshot_sha256":"daa9c241e1b4db220b931a723df354d3368eb96327533d25986ed8fda92c5753","internal_anchors":1},"formal_canon":{"evidence_count":2,"snapshot_sha256":"d95495fcd98942c9d51b78e2f699401dad5ae1529d67a2d5d341e0a79c14ee53"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"cf2c739e-89a0-47ee-99eb-ff88f7c7f9ea"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:08:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8mhRBbJmyFKxuioo2CaYbPqF8K/UjQG++Vp8M0/DLarkZ0/D2mpi0ZhehynXlJCGVFsoD/KRoJ1HQxYPIkRoAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T14:08:46.275997Z"},"content_sha256":"cf57f0cef1ce451a125b0c9b71e33ce8b501a18d721351e9bdd962b5d2fbde3f","schema_version":"1.0","event_id":"sha256:cf57f0cef1ce451a125b0c9b71e33ce8b501a18d721351e9bdd962b5d2fbde3f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4IPOKMJKMNFBR6KT3HSUEQOANU/bundle.json","state_url":"https://pith.science/pith/4IPOKMJKMNFBR6KT3HSUEQOANU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4IPOKMJKMNFBR6KT3HSUEQOANU/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-07-31T14:08:46Z","links":{"resolver":"https://pith.science/pith/4IPOKMJKMNFBR6KT3HSUEQOANU","bundle":"https://pith.science/pith/4IPOKMJKMNFBR6KT3HSUEQOANU/bundle.json","state":"https://pith.science/pith/4IPOKMJKMNFBR6KT3HSUEQOANU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4IPOKMJKMNFBR6KT3HSUEQOANU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4IPOKMJKMNFBR6KT3HSUEQOANU","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":"33e2d50bac7613c65aff732583ff944c4a2428b24e64c4b1b2072a205f86e5cc","cross_cats_sorted":["cs.IR","cs.SE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-20T11:52:45Z","title_canon_sha256":"30eb13f7e19b295d94df00528fcc5f3e2875ebea204bb9870398d335e448954e"},"schema_version":"1.0","source":{"id":"1909.09436","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.09436","created_at":"2026-07-05T01:08:24Z"},{"alias_kind":"arxiv_version","alias_value":"1909.09436v3","created_at":"2026-07-05T01:08:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.09436","created_at":"2026-07-05T01:08:24Z"},{"alias_kind":"pith_short_12","alias_value":"4IPOKMJKMNFB","created_at":"2026-07-05T01:08:24Z"},{"alias_kind":"pith_short_16","alias_value":"4IPOKMJKMNFBR6KT","created_at":"2026-07-05T01:08:24Z"},{"alias_kind":"pith_short_8","alias_value":"4IPOKMJK","created_at":"2026-07-05T01:08:24Z"}],"graph_snapshots":[{"event_id":"sha256:cf57f0cef1ce451a125b0c9b71e33ce8b501a18d721351e9bdd962b5d2fbde3f","target":"graph","created_at":"2026-07-05T01:08:24Z","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":"To enable evaluation of progress on code search, we are releasing the CodeSearchNet Corpus and are presenting the CodeSearchNet Challenge, which consists of 99 natural language queries with about 4k expert relevance annotations of likely results from CodeSearchNet Corpus."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that mechanically scraped and preprocessed function documentation yields sufficiently accurate and representative natural-language queries, and that the expert annotations are consistent and unbiased measures of relevance."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Releases a large multi-language code corpus and expert-annotated challenge to benchmark semantic code search."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Releasing the CodeSearchNet Corpus of 6 million functions and a challenge with 99 annotated queries enables evaluation of semantic code search across six languages."}],"snapshot_sha256":"8dc5cff80129a1bba3a4933a945206601984ac61bb24dea5c405d5ff3fe72ecc"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"d95495fcd98942c9d51b78e2f699401dad5ae1529d67a2d5d341e0a79c14ee53"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1909.09436/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Semantic code search is the task of retrieving relevant code given a natural language query. While related to other information retrieval tasks, it requires bridging the gap between the language used in code (often abbreviated and highly technical) and natural language more suitable to describe vague concepts and ideas.\n  To enable evaluation of progress on code search, we are releasing the CodeSearchNet Corpus and are presenting the CodeSearchNet Challenge, which consists of 99 natural language queries with about 4k expert relevance annotations of likely results from CodeSearchNet Corpus. The","authors_text":"Hamel Husain, Ho-Hsiang Wu, Marc Brockschmidt, Miltiadis Allamanis, Tiferet Gazit","cross_cats":["cs.IR","cs.SE","stat.ML"],"headline":"Releasing the CodeSearchNet Corpus of 6 million functions and a challenge with 99 annotated queries enables evaluation of semantic code search across six languages.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-20T11:52:45Z","title":"CodeSearchNet Challenge: Evaluating the State of Semantic Code Search"},"references":{"count":26,"internal_anchors":1,"resolved_work":26,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Miltiadis Allamanis. 2018. The Adverse Effects of Code Duplication in Machine Learning Models of Code. arXiv preprint arXiv:1812.06469 (2018)","work_id":"ec049e9a-4ab6-434d-8752-48618636162a","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Miltiadis Allamanis, Earl T Barr, Premkumar Devanbu, and Charles Sutton. 2018. A survey of machine learning for big code and naturalness. ACM Computing Surveys (CSUR) 51, 4 (2018), 81","work_id":"7f0977f1-2213-4528-a924-89e2f327a516","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Miltiadis Allamanis, Hao Peng, and Charles Sutton. 2016. A Convolutional Attention Network for Extreme Summarization of Source Code. In Proceedings of the International Conference on Machine Learning ","work_id":"7aeef716-5af6-4a34-b2a0-fe454133cb79","year":2016},{"cited_arxiv_id":"1808.01400","doi":"","is_internal_anchor":false,"ref_index":4,"title":"code2seq: Generating Sequences from Structured Representations of Code","work_id":"f4d5c460-f108-4fb4-97a4-6109f749e7ba","year":2018},{"cited_arxiv_id":"1707.02275","doi":"","is_internal_anchor":false,"ref_index":5,"title":"A parallel corpus of Python functions and documentation strings for automated code documentation and code generation","work_id":"3484b4d3-268c-4c6a-8eb5-315f36c3de9a","year":2017}],"snapshot_sha256":"daa9c241e1b4db220b931a723df354d3368eb96327533d25986ed8fda92c5753"},"source":{"id":"1909.09436","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-12T16:00:39.026015Z","id":"cf2c739e-89a0-47ee-99eb-ff88f7c7f9ea","model_set":{"reader":"grok-4.3"},"one_line_summary":"Releases a large multi-language code corpus and expert-annotated challenge to benchmark semantic code search.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Releasing the CodeSearchNet Corpus of 6 million functions and a challenge with 99 annotated queries enables evaluation of semantic code search across six languages.","strongest_claim":"To enable evaluation of progress on code search, we are releasing the CodeSearchNet Corpus and are presenting the CodeSearchNet Challenge, which consists of 99 natural language queries with about 4k expert relevance annotations of likely results from CodeSearchNet Corpus.","weakest_assumption":"The assumption that mechanically scraped and preprocessed function documentation yields sufficiently accurate and representative natural-language queries, and that the expert annotations are consistent and unbiased measures of relevance."}},"verdict_id":"cf2c739e-89a0-47ee-99eb-ff88f7c7f9ea"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f865595a6c61d9e9913373fb9c7c40e3d7a586f490cc3860d1dd4e61fa7e985d","target":"record","created_at":"2026-07-05T01:08:24Z","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":"33e2d50bac7613c65aff732583ff944c4a2428b24e64c4b1b2072a205f86e5cc","cross_cats_sorted":["cs.IR","cs.SE","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-20T11:52:45Z","title_canon_sha256":"30eb13f7e19b295d94df00528fcc5f3e2875ebea204bb9870398d335e448954e"},"schema_version":"1.0","source":{"id":"1909.09436","kind":"arxiv","version":3}},"canonical_sha256":"e21ee5312a634a18f953d9e54241c06d2ac2a8a438558fe4bbe6d0847e2c3071","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e21ee5312a634a18f953d9e54241c06d2ac2a8a438558fe4bbe6d0847e2c3071","first_computed_at":"2026-07-05T01:08:24.849922Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:08:24.849922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P5z0iH2qvPjTLeTi0rvejwny/0E8w+muQVAgPaDlO31pyOuhgki9c4tFI42pzJ42e6G5uTuavgh3lyr8zILUAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:08:24.850341Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.09436","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f865595a6c61d9e9913373fb9c7c40e3d7a586f490cc3860d1dd4e61fa7e985d","sha256:cf57f0cef1ce451a125b0c9b71e33ce8b501a18d721351e9bdd962b5d2fbde3f"],"state_sha256":"d0fc780cf9ece187c59d0c798a977673b491a025cd07b0ae9c13ecab58d9f0bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o+PiuGFVdCxBAgk3mqY4bbpLgCLVnkSMZ/3PYoyB6Idt1RRcVS7b09xyB7rrs+7RfIRd6jPD49vpkRykI2dFBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T14:08:46.278688Z","bundle_sha256":"eaee20596b9d0fd5ec2ee331df3c3d5d2a0c36d1d34389f54c14de4eed92f227"}}