{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:FZMDE3LSPVOF2LQ5KLUU6Z3LD5","short_pith_number":"pith:FZMDE3LS","canonical_record":{"source":{"id":"2005.14165","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-05-28T17:29:03Z","cross_cats_sorted":[],"title_canon_sha256":"70b62cc6c025dabeba9b7459e0825b9cc8e3c74057130bb182bdfc6a5cb482f5","abstract_canon_sha256":"dd4f1ea04b346c922e20a115ded0b792e59dd2c63c094228c64c13601df96e76"},"schema_version":"1.0"},"canonical_sha256":"2e58326d727d5c5d2e1d52e94f676b1f7d9bb1e34d3edaa3506004c4be861e15","source":{"kind":"arxiv","id":"2005.14165","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.14165","created_at":"2026-07-05T01:21:37Z"},{"alias_kind":"arxiv_version","alias_value":"2005.14165v4","created_at":"2026-07-05T01:21:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.14165","created_at":"2026-07-05T01:21:37Z"},{"alias_kind":"pith_short_12","alias_value":"FZMDE3LSPVOF","created_at":"2026-07-05T01:21:37Z"},{"alias_kind":"pith_short_16","alias_value":"FZMDE3LSPVOF2LQ5","created_at":"2026-07-05T01:21:37Z"},{"alias_kind":"pith_short_8","alias_value":"FZMDE3LS","created_at":"2026-07-05T01:21:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:FZMDE3LSPVOF2LQ5KLUU6Z3LD5","target":"record","payload":{"canonical_record":{"source":{"id":"2005.14165","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-05-28T17:29:03Z","cross_cats_sorted":[],"title_canon_sha256":"70b62cc6c025dabeba9b7459e0825b9cc8e3c74057130bb182bdfc6a5cb482f5","abstract_canon_sha256":"dd4f1ea04b346c922e20a115ded0b792e59dd2c63c094228c64c13601df96e76"},"schema_version":"1.0"},"canonical_sha256":"2e58326d727d5c5d2e1d52e94f676b1f7d9bb1e34d3edaa3506004c4be861e15","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:21:37.693924Z","signature_b64":"+sQmkhLfV4roIl5pRLXIG6wCmlS1B/S5t//T6mqfBPLdfTqtZatGXqHRXMaEDlyY+Tj0faclvoc5bDEiQ1DUDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e58326d727d5c5d2e1d52e94f676b1f7d9bb1e34d3edaa3506004c4be861e15","last_reissued_at":"2026-07-05T01:21:37.693472Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:21:37.693472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2005.14165","source_version":4,"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:21:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k5c4nFfCm/CdWDYbb8ATfLdV+OCsEngmeUzH1qYSl4o1qkeF7wt5lc06seAzzTHiPUiIlH6ePne/tdxXf4Q4Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-17T16:35:38.009076Z"},"content_sha256":"8d318a4275bdd982c58f1e1c5972177f95783cde6215efde852b30dedda9fca6","schema_version":"1.0","event_id":"sha256:8d318a4275bdd982c58f1e1c5972177f95783cde6215efde852b30dedda9fca6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:FZMDE3LSPVOF2LQ5KLUU6Z3LD5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Language Models are Few-Shot Learners","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Scaling language models to 175 billion parameters enables strong few-shot performance on NLP tasks without any fine-tuning.","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Aditya Ramesh, Alec Radford, Amanda Askell, Ariel Herbert-Voss, Arvind Neelakantan, Benjamin Chess, Benjamin Mann, Christopher Berner, Christopher Hesse, Clemens Winter, Daniel M. Ziegler, Dario Amodei, Eric Sigler, Girish Sastry, Gretchen Krueger, Ilya Sutskever, Jack Clark, Jared Kaplan, Jeffrey Wu, Mark Chen, Mateusz Litwin, Melanie Subbiah, Nick Ryder, Prafulla Dhariwal, Pranav Shyam, Rewon Child, Sam McCandlish, Sandhini Agarwal, Scott Gray, Tom B. Brown, Tom Henighan","submitted_at":"2020-05-28T17:29:03Z","abstract_excerpt":"Recent work has demonstrated substantial gains on many NLP tasks and benchmarks by pre-training on a large corpus of text followed by fine-tuning on a specific task. While typically task-agnostic in architecture, this method still requires task-specific fine-tuning datasets of thousands or tens of thousands of examples. By contrast, humans can generally perform a new language task from only a few examples or from simple instructions - something which current NLP systems still largely struggle to do. Here we show that scaling up language models greatly improves task-agnostic, few-shot performan"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"scaling up language models greatly improves task-agnostic, few-shot performance, sometimes even reaching competitiveness with prior state-of-the-art fine-tuning approaches. Specifically, we train GPT-3, an autoregressive language model with 175 billion parameters, 10x more than any previous non-sparse language model, and test its performance in the few-shot setting.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the few-shot examples placed in the prompt allow genuine generalization rather than the model simply recalling near-duplicates from its web-scale training corpus, and that the chosen evaluation tasks are not contaminated by that corpus.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"GPT-3 shows that scaling an autoregressive language model to 175 billion parameters enables strong few-shot performance across diverse NLP tasks via in-context prompting without fine-tuning.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Scaling language models to 175 billion parameters enables strong few-shot performance on NLP tasks without any fine-tuning.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"ef1c9b14fe1538037924c494bbc2d0e399567a465fa8d1fb94560c7a7d11c863"},"source":{"id":"2005.14165","kind":"arxiv","version":4},"verdict":{"id":"3e5e044a-9f1e-4f8f-8df6-555b07a330b8","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T12:00:32.544002Z","strongest_claim":"scaling up language models greatly improves task-agnostic, few-shot performance, sometimes even reaching competitiveness with prior state-of-the-art fine-tuning approaches. Specifically, we train GPT-3, an autoregressive language model with 175 billion parameters, 10x more than any previous non-sparse language model, and test its performance in the few-shot setting.","one_line_summary":"GPT-3 shows that scaling an autoregressive language model to 175 billion parameters enables strong few-shot performance across diverse NLP tasks via in-context prompting without fine-tuning.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the few-shot examples placed in the prompt allow genuine generalization rather than the model simply recalling near-duplicates from its web-scale training corpus, and that the chosen evaluation tasks are not contaminated by that corpus.","pith_extraction_headline":"Scaling language models to 175 billion parameters enables strong few-shot performance on NLP tasks without any fine-tuning."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.14165/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":86,"sample":[{"doi":"","year":2019,"title":"Massively multilingual neural machine translation","work_id":"2e1f92a4-6faa-47bb-87b0-55c2dd5d65bd","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2005,"title":"arXiv preprint arXiv:2005.14050 , year =","work_id":"df58799e-b670-4f82-bfb3-67cfb3fcceee","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2013,"title":"Semantic parsing on freebase from question-answer pairs","work_id":"9d4212d3-ae64-4b5e-aa57-c1178c245c9b","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2004,"title":"2004.10151 , archiveprefix =","work_id":"8d60e924-b221-49a3-854b-c88413eae1b7","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1911,"title":"PIQA: Reasoning about Physical Commonsense in Natural Language","work_id":"0d865a62-6376-4606-8d3a-eeb3b6e9ba6d","ref_index":5,"cited_arxiv_id":"1911.11641","is_internal_anchor":true}],"resolved_work":86,"snapshot_sha256":"b7175e4cd3d4dd21e69fa87d77fb6dd6c13e8e9f36cd25fd58b382b3b4792b69","internal_anchors":27},"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":"3e5e044a-9f1e-4f8f-8df6-555b07a330b8"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:21:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qAF2b/0Q3MFVGpcGvW+mAccTpUiMBTqMIa9/tRbV/jQMA+ECCqE3sxNrbARTfuxi3ON8fIuQDVTTzqVeyXZdBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-17T16:35:38.009606Z"},"content_sha256":"908dbc91bf3a5d6c11a5285fdff03d511e1ad5eb65518e7dd3cb8da857efad8d","schema_version":"1.0","event_id":"sha256:908dbc91bf3a5d6c11a5285fdff03d511e1ad5eb65518e7dd3cb8da857efad8d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FZMDE3LSPVOF2LQ5KLUU6Z3LD5/bundle.json","state_url":"https://pith.science/pith/FZMDE3LSPVOF2LQ5KLUU6Z3LD5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FZMDE3LSPVOF2LQ5KLUU6Z3LD5/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-17T16:35:38Z","links":{"resolver":"https://pith.science/pith/FZMDE3LSPVOF2LQ5KLUU6Z3LD5","bundle":"https://pith.science/pith/FZMDE3LSPVOF2LQ5KLUU6Z3LD5/bundle.json","state":"https://pith.science/pith/FZMDE3LSPVOF2LQ5KLUU6Z3LD5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FZMDE3LSPVOF2LQ5KLUU6Z3LD5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:FZMDE3LSPVOF2LQ5KLUU6Z3LD5","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":"dd4f1ea04b346c922e20a115ded0b792e59dd2c63c094228c64c13601df96e76","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-05-28T17:29:03Z","title_canon_sha256":"70b62cc6c025dabeba9b7459e0825b9cc8e3c74057130bb182bdfc6a5cb482f5"},"schema_version":"1.0","source":{"id":"2005.14165","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.14165","created_at":"2026-07-05T01:21:37Z"},{"alias_kind":"arxiv_version","alias_value":"2005.14165v4","created_at":"2026-07-05T01:21:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.14165","created_at":"2026-07-05T01:21:37Z"},{"alias_kind":"pith_short_12","alias_value":"FZMDE3LSPVOF","created_at":"2026-07-05T01:21:37Z"},{"alias_kind":"pith_short_16","alias_value":"FZMDE3LSPVOF2LQ5","created_at":"2026-07-05T01:21:37Z"},{"alias_kind":"pith_short_8","alias_value":"FZMDE3LS","created_at":"2026-07-05T01:21:37Z"}],"graph_snapshots":[{"event_id":"sha256:908dbc91bf3a5d6c11a5285fdff03d511e1ad5eb65518e7dd3cb8da857efad8d","target":"graph","created_at":"2026-07-05T01:21:37Z","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":"scaling up language models greatly improves task-agnostic, few-shot performance, sometimes even reaching competitiveness with prior state-of-the-art fine-tuning approaches. Specifically, we train GPT-3, an autoregressive language model with 175 billion parameters, 10x more than any previous non-sparse language model, and test its performance in the few-shot setting."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the few-shot examples placed in the prompt allow genuine generalization rather than the model simply recalling near-duplicates from its web-scale training corpus, and that the chosen evaluation tasks are not contaminated by that corpus."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"GPT-3 shows that scaling an autoregressive language model to 175 billion parameters enables strong few-shot performance across diverse NLP tasks via in-context prompting without fine-tuning."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Scaling language models to 175 billion parameters enables strong few-shot performance on NLP tasks without any fine-tuning."}],"snapshot_sha256":"ef1c9b14fe1538037924c494bbc2d0e399567a465fa8d1fb94560c7a7d11c863"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2005.14165/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recent work has demonstrated substantial gains on many NLP tasks and benchmarks by pre-training on a large corpus of text followed by fine-tuning on a specific task. While typically task-agnostic in architecture, this method still requires task-specific fine-tuning datasets of thousands or tens of thousands of examples. By contrast, humans can generally perform a new language task from only a few examples or from simple instructions - something which current NLP systems still largely struggle to do. Here we show that scaling up language models greatly improves task-agnostic, few-shot performan","authors_text":"Aditya Ramesh, Alec Radford, Amanda Askell, Ariel Herbert-Voss, Arvind Neelakantan, Benjamin Chess, Benjamin Mann, Christopher Berner, Christopher Hesse, Clemens Winter, Daniel M. Ziegler, Dario Amodei, Eric Sigler, Girish Sastry, Gretchen Krueger, Ilya Sutskever, Jack Clark, Jared Kaplan, Jeffrey Wu, Mark Chen, Mateusz Litwin, Melanie Subbiah, Nick Ryder, Prafulla Dhariwal, Pranav Shyam, Rewon Child, Sam McCandlish, Sandhini Agarwal, Scott Gray, Tom B. Brown, Tom Henighan","cross_cats":[],"headline":"Scaling language models to 175 billion parameters enables strong few-shot performance on NLP tasks without any fine-tuning.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-05-28T17:29:03Z","title":"Language Models are Few-Shot Learners"},"references":{"count":86,"internal_anchors":27,"resolved_work":86,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Massively multilingual neural machine translation","work_id":"2e1f92a4-6faa-47bb-87b0-55c2dd5d65bd","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"arXiv preprint arXiv:2005.14050 , year =","work_id":"df58799e-b670-4f82-bfb3-67cfb3fcceee","year":2005},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Semantic parsing on freebase from question-answer pairs","work_id":"9d4212d3-ae64-4b5e-aa57-c1178c245c9b","year":2013},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"2004.10151 , archiveprefix =","work_id":"8d60e924-b221-49a3-854b-c88413eae1b7","year":2004},{"cited_arxiv_id":"1911.11641","doi":"","is_internal_anchor":true,"ref_index":5,"title":"PIQA: Reasoning about Physical Commonsense in Natural Language","work_id":"0d865a62-6376-4606-8d3a-eeb3b6e9ba6d","year":1911}],"snapshot_sha256":"b7175e4cd3d4dd21e69fa87d77fb6dd6c13e8e9f36cd25fd58b382b3b4792b69"},"source":{"id":"2005.14165","kind":"arxiv","version":4},"verdict":{"created_at":"2026-05-10T12:00:32.544002Z","id":"3e5e044a-9f1e-4f8f-8df6-555b07a330b8","model_set":{"reader":"grok-4.3"},"one_line_summary":"GPT-3 shows that scaling an autoregressive language model to 175 billion parameters enables strong few-shot performance across diverse NLP tasks via in-context prompting without fine-tuning.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Scaling language models to 175 billion parameters enables strong few-shot performance on NLP tasks without any fine-tuning.","strongest_claim":"scaling up language models greatly improves task-agnostic, few-shot performance, sometimes even reaching competitiveness with prior state-of-the-art fine-tuning approaches. Specifically, we train GPT-3, an autoregressive language model with 175 billion parameters, 10x more than any previous non-sparse language model, and test its performance in the few-shot setting.","weakest_assumption":"That the few-shot examples placed in the prompt allow genuine generalization rather than the model simply recalling near-duplicates from its web-scale training corpus, and that the chosen evaluation tasks are not contaminated by that corpus."}},"verdict_id":"3e5e044a-9f1e-4f8f-8df6-555b07a330b8"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8d318a4275bdd982c58f1e1c5972177f95783cde6215efde852b30dedda9fca6","target":"record","created_at":"2026-07-05T01:21:37Z","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":"dd4f1ea04b346c922e20a115ded0b792e59dd2c63c094228c64c13601df96e76","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2020-05-28T17:29:03Z","title_canon_sha256":"70b62cc6c025dabeba9b7459e0825b9cc8e3c74057130bb182bdfc6a5cb482f5"},"schema_version":"1.0","source":{"id":"2005.14165","kind":"arxiv","version":4}},"canonical_sha256":"2e58326d727d5c5d2e1d52e94f676b1f7d9bb1e34d3edaa3506004c4be861e15","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e58326d727d5c5d2e1d52e94f676b1f7d9bb1e34d3edaa3506004c4be861e15","first_computed_at":"2026-07-05T01:21:37.693472Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:21:37.693472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+sQmkhLfV4roIl5pRLXIG6wCmlS1B/S5t//T6mqfBPLdfTqtZatGXqHRXMaEDlyY+Tj0faclvoc5bDEiQ1DUDg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:21:37.693924Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.14165","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d318a4275bdd982c58f1e1c5972177f95783cde6215efde852b30dedda9fca6","sha256:908dbc91bf3a5d6c11a5285fdff03d511e1ad5eb65518e7dd3cb8da857efad8d"],"state_sha256":"c3e9f53f7c98838e6a9aeaacb5deb9dd7d875c87bb41e5c20d33db1267cfc612"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p2QHAbJTB4HSM5b6UkeHGTTZQOuYhGcky0G5eKmvq+OEjP+wLXNjUeSJmrsWDzWDEV6PTU7MuxkEWf1jTU4eDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-17T16:35:38.012033Z","bundle_sha256":"31050db88cfed2300be673c5f73a1a42edd58b80d4c65d873566ef9dd487a9e0"}}