{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:W35KERMQ6OS3HNMCCKUXYO7RL5","short_pith_number":"pith:W35KERMQ","canonical_record":{"source":{"id":"2605.16767","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-16T02:40:01Z","cross_cats_sorted":[],"title_canon_sha256":"a5fe3bfcf5f47643c3dbf1f5828ad488804fb62b3b4818b700e704b1145b1e27","abstract_canon_sha256":"075401109011c74f96c342b9fd43906cd997048e64e9ba584719b6d5d15c97d7"},"schema_version":"1.0"},"canonical_sha256":"b6faa24590f3a5b3b58212a97c3bf15f7df37a609721db66b9245c926346757f","source":{"kind":"arxiv","id":"2605.16767","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16767","created_at":"2026-05-20T00:03:20Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16767v1","created_at":"2026-05-20T00:03:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16767","created_at":"2026-05-20T00:03:20Z"},{"alias_kind":"pith_short_12","alias_value":"W35KERMQ6OS3","created_at":"2026-05-20T00:03:20Z"},{"alias_kind":"pith_short_16","alias_value":"W35KERMQ6OS3HNMC","created_at":"2026-05-20T00:03:20Z"},{"alias_kind":"pith_short_8","alias_value":"W35KERMQ","created_at":"2026-05-20T00:03:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:W35KERMQ6OS3HNMCCKUXYO7RL5","target":"record","payload":{"canonical_record":{"source":{"id":"2605.16767","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-16T02:40:01Z","cross_cats_sorted":[],"title_canon_sha256":"a5fe3bfcf5f47643c3dbf1f5828ad488804fb62b3b4818b700e704b1145b1e27","abstract_canon_sha256":"075401109011c74f96c342b9fd43906cd997048e64e9ba584719b6d5d15c97d7"},"schema_version":"1.0"},"canonical_sha256":"b6faa24590f3a5b3b58212a97c3bf15f7df37a609721db66b9245c926346757f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:20.876155Z","signature_b64":"kEDQRvTrCxb1WXjKfOEipBSe78zVzQvotkvu+lje3kCMmMCAjwSinumhHhl9YP44JgKivrLOxpLzoUMiUvo9Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6faa24590f3a5b3b58212a97c3bf15f7df37a609721db66b9245c926346757f","last_reissued_at":"2026-05-20T00:03:20.875166Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:20.875166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.16767","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:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jq38as5MMqW2vTcYWxh6n02xjUWw/q95ASMIuMRNX8UyJLQazWO22ygsHE80Y1ypA75VMnxpn11cY6yh3N05Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T23:33:58.424079Z"},"content_sha256":"260303e4c013c523983a899c73ce0fcc86d130fbc47bc0c711c2ca7cf40fc23d","schema_version":"1.0","event_id":"sha256:260303e4c013c523983a899c73ce0fcc86d130fbc47bc0c711c2ca7cf40fc23d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:W35KERMQ6OS3HNMCCKUXYO7RL5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Retrieval-Based Multi-Label Legal Annotation: Extensible, Data-Efficient and Hallucination-Free","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"Retrieval in a frozen embedding space assigns multiple legal labels to documents with competitive accuracy, strong data efficiency, and no risk of hallucinating outside the taxonomy.","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jaromir Savelka, Kevin Ashley, Li Zhang","submitted_at":"2026-05-16T02:40:01Z","abstract_excerpt":"Multi-label legal annotation requires assigning multiple labels from large, evolving taxonomies to long, fact-intensive documents, often under limited supervision. Parametric encoders typically require task-specific training and retraining when the label set changes, while prompting generative large language models becomes costly and degrades as the label space grows. We cast legal annotation as retrieval: we embed documents and label descriptions with a frozen retrieval model and predict labels via k-nearest neighbors in the embedding space, enabling updates by re-embedding and re-indexing ra"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Across three legal datasets, retrieval achieves competitive accuracy and strong data efficiency; on Eurlex, Qwen-8B retrieval improves Macro-F1 from 40.41 (GPT-5.2, zero-shot) to 49.12 while reducing estimated compute by 20-30 times compared to fine-tuning, and with N=100 training samples nearly doubles Micro-F1 over hierarchical Legal-BERT on ECtHR-A.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That similarity in the frozen retrieval embedding space reliably indicates label applicability for long, fact-intensive legal documents without any task-specific adaptation or fine-tuning of the embedder.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Retrieval with frozen embeddings and k-NN delivers competitive accuracy, high data efficiency, and zero hallucinations on legal multi-label annotation across ECtHR and Eurlex datasets.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Retrieval in a frozen embedding space assigns multiple legal labels to documents with competitive accuracy, strong data efficiency, and no risk of hallucinating outside the taxonomy.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"96e5454bcaab74bab3b9de4b178399406b7b5b0ef35e6dd96d3281f315c27b63"},"source":{"id":"2605.16767","kind":"arxiv","version":1},"verdict":{"id":"227b96a6-abef-4248-820a-6289953f6b99","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T21:36:03.815453Z","strongest_claim":"Across three legal datasets, retrieval achieves competitive accuracy and strong data efficiency; on Eurlex, Qwen-8B retrieval improves Macro-F1 from 40.41 (GPT-5.2, zero-shot) to 49.12 while reducing estimated compute by 20-30 times compared to fine-tuning, and with N=100 training samples nearly doubles Micro-F1 over hierarchical Legal-BERT on ECtHR-A.","one_line_summary":"Retrieval with frozen embeddings and k-NN delivers competitive accuracy, high data efficiency, and zero hallucinations on legal multi-label annotation across ECtHR and Eurlex datasets.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That similarity in the frozen retrieval embedding space reliably indicates label applicability for long, fact-intensive legal documents without any task-specific adaptation or fine-tuning of the embedder.","pith_extraction_headline":"Retrieval in a frozen embedding space assigns multiple legal labels to documents with competitive accuracy, strong data efficiency, and no risk of hallucinating outside the taxonomy."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16767/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T22:01:19.752116Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T21:40:53.803060Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.313657Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.447215Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"ac59bdd6cdaf9b16ed0b83840e62121c909debf5499a70985354a4cbb7d7f088"},"references":{"count":37,"sample":[{"doi":"","year":2017,"title":"K. D. Ashley, Artificial intelligence and legal analytics: new tools for law practice in the digital age, Cambridge University Press, 2017","work_id":"3089d55e-0ac5-456f-b65f-959d4d33bdc6","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"I. Chalkidis, A. Jana, D. Hartung, M. Bommarito, I. Androutsopoulos, D. Katz, N. Aletras, Lexglue: A benchmark dataset for legal language understanding in english, in: Proceedings of the 60th Annual M","work_id":"75699e84-9918-4637-89dc-b7c5b24780e0","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2016,"title":"N. Aletras, D. Tsarapatsanis, D. Preoţiuc-Pietro, V. Lampos, Predicting judicial decisions of the european court of human rights: A natural language processing perspective, PeerJ computer science 2 (2","work_id":"9b115abc-17c2-4e6b-b006-1d1612db283b","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"I. Chalkidis, E. Fergadiotis, P. Malakasiotis, I. Androutsopoulos, Large-scale multi-label text classification on eu legislation, in: Proceedings of the 57th annual meeting of the association for comp","work_id":"176e2bf5-e663-43f5-a87d-b2075a589cf9","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"W.-C. Chang, H.-F. Yu, K. Zhong, Y. Yang, I. S. Dhillon, Taming pretrained transformers for extreme multi-label text classification, in: Proceedings of the 26th ACM SIGKDD international conference on ","work_id":"974911e0-572f-46ef-89c9-17ae79cd2c26","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":37,"snapshot_sha256":"9957652cd2a0410ea7124e55c8423ea97a85b29b4afd76e3c13f7f41a5072342","internal_anchors":8},"formal_canon":{"evidence_count":1,"snapshot_sha256":"f6289cbd5237cf977d30235174ce61b5fdbc4f023ba7600fe38e29f3de68d4d6"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"227b96a6-abef-4248-820a-6289953f6b99"},"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:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RbVitDdPD/r9+3uCFzRxGGnozO39zArIFDsFnE27p3ZHpcUo7bVebtwVgPAfLsR2vsgdmy0LmBArRoiSpyohDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T23:33:58.425682Z"},"content_sha256":"ba656f74a63c5d171f380b2c66ba176432d9a37e8e909edf26c9f0326c2f2374","schema_version":"1.0","event_id":"sha256:ba656f74a63c5d171f380b2c66ba176432d9a37e8e909edf26c9f0326c2f2374"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W35KERMQ6OS3HNMCCKUXYO7RL5/bundle.json","state_url":"https://pith.science/pith/W35KERMQ6OS3HNMCCKUXYO7RL5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W35KERMQ6OS3HNMCCKUXYO7RL5/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-20T23:33:58Z","links":{"resolver":"https://pith.science/pith/W35KERMQ6OS3HNMCCKUXYO7RL5","bundle":"https://pith.science/pith/W35KERMQ6OS3HNMCCKUXYO7RL5/bundle.json","state":"https://pith.science/pith/W35KERMQ6OS3HNMCCKUXYO7RL5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W35KERMQ6OS3HNMCCKUXYO7RL5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:W35KERMQ6OS3HNMCCKUXYO7RL5","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":"075401109011c74f96c342b9fd43906cd997048e64e9ba584719b6d5d15c97d7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-16T02:40:01Z","title_canon_sha256":"a5fe3bfcf5f47643c3dbf1f5828ad488804fb62b3b4818b700e704b1145b1e27"},"schema_version":"1.0","source":{"id":"2605.16767","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16767","created_at":"2026-05-20T00:03:20Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16767v1","created_at":"2026-05-20T00:03:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16767","created_at":"2026-05-20T00:03:20Z"},{"alias_kind":"pith_short_12","alias_value":"W35KERMQ6OS3","created_at":"2026-05-20T00:03:20Z"},{"alias_kind":"pith_short_16","alias_value":"W35KERMQ6OS3HNMC","created_at":"2026-05-20T00:03:20Z"},{"alias_kind":"pith_short_8","alias_value":"W35KERMQ","created_at":"2026-05-20T00:03:20Z"}],"graph_snapshots":[{"event_id":"sha256:ba656f74a63c5d171f380b2c66ba176432d9a37e8e909edf26c9f0326c2f2374","target":"graph","created_at":"2026-05-20T00:03:20Z","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":"Across three legal datasets, retrieval achieves competitive accuracy and strong data efficiency; on Eurlex, Qwen-8B retrieval improves Macro-F1 from 40.41 (GPT-5.2, zero-shot) to 49.12 while reducing estimated compute by 20-30 times compared to fine-tuning, and with N=100 training samples nearly doubles Micro-F1 over hierarchical Legal-BERT on ECtHR-A."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That similarity in the frozen retrieval embedding space reliably indicates label applicability for long, fact-intensive legal documents without any task-specific adaptation or fine-tuning of the embedder."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Retrieval with frozen embeddings and k-NN delivers competitive accuracy, high data efficiency, and zero hallucinations on legal multi-label annotation across ECtHR and Eurlex datasets."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Retrieval in a frozen embedding space assigns multiple legal labels to documents with competitive accuracy, strong data efficiency, and no risk of hallucinating outside the taxonomy."}],"snapshot_sha256":"96e5454bcaab74bab3b9de4b178399406b7b5b0ef35e6dd96d3281f315c27b63"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"f6289cbd5237cf977d30235174ce61b5fdbc4f023ba7600fe38e29f3de68d4d6"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T22:01:19.752116Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T21:40:53.803060Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.313657Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.447215Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.16767/integrity.json","findings":[],"snapshot_sha256":"ac59bdd6cdaf9b16ed0b83840e62121c909debf5499a70985354a4cbb7d7f088","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multi-label legal annotation requires assigning multiple labels from large, evolving taxonomies to long, fact-intensive documents, often under limited supervision. Parametric encoders typically require task-specific training and retraining when the label set changes, while prompting generative large language models becomes costly and degrades as the label space grows. We cast legal annotation as retrieval: we embed documents and label descriptions with a frozen retrieval model and predict labels via k-nearest neighbors in the embedding space, enabling updates by re-embedding and re-indexing ra","authors_text":"Jaromir Savelka, Kevin Ashley, Li Zhang","cross_cats":[],"headline":"Retrieval in a frozen embedding space assigns multiple legal labels to documents with competitive accuracy, strong data efficiency, and no risk of hallucinating outside the taxonomy.","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-16T02:40:01Z","title":"Retrieval-Based Multi-Label Legal Annotation: Extensible, Data-Efficient and Hallucination-Free"},"references":{"count":37,"internal_anchors":8,"resolved_work":37,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"K. D. Ashley, Artificial intelligence and legal analytics: new tools for law practice in the digital age, Cambridge University Press, 2017","work_id":"3089d55e-0ac5-456f-b65f-959d4d33bdc6","year":2017},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"I. Chalkidis, A. Jana, D. Hartung, M. Bommarito, I. Androutsopoulos, D. Katz, N. Aletras, Lexglue: A benchmark dataset for legal language understanding in english, in: Proceedings of the 60th Annual M","work_id":"75699e84-9918-4637-89dc-b7c5b24780e0","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"N. Aletras, D. Tsarapatsanis, D. Preoţiuc-Pietro, V. Lampos, Predicting judicial decisions of the european court of human rights: A natural language processing perspective, PeerJ computer science 2 (2","work_id":"9b115abc-17c2-4e6b-b006-1d1612db283b","year":2016},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"I. Chalkidis, E. Fergadiotis, P. Malakasiotis, I. Androutsopoulos, Large-scale multi-label text classification on eu legislation, in: Proceedings of the 57th annual meeting of the association for comp","work_id":"176e2bf5-e663-43f5-a87d-b2075a589cf9","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"W.-C. Chang, H.-F. Yu, K. Zhong, Y. Yang, I. S. Dhillon, Taming pretrained transformers for extreme multi-label text classification, in: Proceedings of the 26th ACM SIGKDD international conference on ","work_id":"974911e0-572f-46ef-89c9-17ae79cd2c26","year":2020}],"snapshot_sha256":"9957652cd2a0410ea7124e55c8423ea97a85b29b4afd76e3c13f7f41a5072342"},"source":{"id":"2605.16767","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T21:36:03.815453Z","id":"227b96a6-abef-4248-820a-6289953f6b99","model_set":{"reader":"grok-4.3"},"one_line_summary":"Retrieval with frozen embeddings and k-NN delivers competitive accuracy, high data efficiency, and zero hallucinations on legal multi-label annotation across ECtHR and Eurlex datasets.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Retrieval in a frozen embedding space assigns multiple legal labels to documents with competitive accuracy, strong data efficiency, and no risk of hallucinating outside the taxonomy.","strongest_claim":"Across three legal datasets, retrieval achieves competitive accuracy and strong data efficiency; on Eurlex, Qwen-8B retrieval improves Macro-F1 from 40.41 (GPT-5.2, zero-shot) to 49.12 while reducing estimated compute by 20-30 times compared to fine-tuning, and with N=100 training samples nearly doubles Micro-F1 over hierarchical Legal-BERT on ECtHR-A.","weakest_assumption":"That similarity in the frozen retrieval embedding space reliably indicates label applicability for long, fact-intensive legal documents without any task-specific adaptation or fine-tuning of the embedder."}},"verdict_id":"227b96a6-abef-4248-820a-6289953f6b99"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:260303e4c013c523983a899c73ce0fcc86d130fbc47bc0c711c2ca7cf40fc23d","target":"record","created_at":"2026-05-20T00:03:20Z","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":"075401109011c74f96c342b9fd43906cd997048e64e9ba584719b6d5d15c97d7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-16T02:40:01Z","title_canon_sha256":"a5fe3bfcf5f47643c3dbf1f5828ad488804fb62b3b4818b700e704b1145b1e27"},"schema_version":"1.0","source":{"id":"2605.16767","kind":"arxiv","version":1}},"canonical_sha256":"b6faa24590f3a5b3b58212a97c3bf15f7df37a609721db66b9245c926346757f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6faa24590f3a5b3b58212a97c3bf15f7df37a609721db66b9245c926346757f","first_computed_at":"2026-05-20T00:03:20.875166Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:20.875166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kEDQRvTrCxb1WXjKfOEipBSe78zVzQvotkvu+lje3kCMmMCAjwSinumhHhl9YP44JgKivrLOxpLzoUMiUvo9Ag==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:20.876155Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16767","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:260303e4c013c523983a899c73ce0fcc86d130fbc47bc0c711c2ca7cf40fc23d","sha256:ba656f74a63c5d171f380b2c66ba176432d9a37e8e909edf26c9f0326c2f2374"],"state_sha256":"1200090fa52bd38f15717145622ad56d2b5ed2121b8eb1e7243242dc59813a7c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8TXM19IXKwBPrvprqC6oMTA0yZEoUBpO4EX0dB4/XjClTMYtjKNuoGIh6fonLgcj+aJkJ+jnTW5ZHqlIeyEgBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T23:33:58.431547Z","bundle_sha256":"48f702ff7c7725944930cbc1a12f7552ceb069feca70e08d6b5917d7bdc6a9e6"}}