{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:P3DESVHTUWW4IFNZFK3T3IDONY","short_pith_number":"pith:P3DESVHT","canonical_record":{"source":{"id":"2608.07407","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-08-07T16:54:17Z","cross_cats_sorted":[],"title_canon_sha256":"4e3214a7229a70487b771cb63a961222753ab542a0f065b4162b17a7bbf1ac4e","abstract_canon_sha256":"fb1343d9dcc879c97587cca231b558a2af3a2dd5cccbdde5a36c9dc5c57df7ea"},"schema_version":"1.0"},"canonical_sha256":"7ec64954f3a5adc415b92ab73da06e6e03163a647bc8e18fbb621aeef856ec69","source":{"kind":"arxiv","id":"2608.07407","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.07407","created_at":"2026-08-10T01:15:17Z"},{"alias_kind":"arxiv_version","alias_value":"2608.07407v1","created_at":"2026-08-10T01:15:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.07407","created_at":"2026-08-10T01:15:17Z"},{"alias_kind":"pith_short_12","alias_value":"P3DESVHTUWW4","created_at":"2026-08-10T01:15:17Z"},{"alias_kind":"pith_short_16","alias_value":"P3DESVHTUWW4IFNZ","created_at":"2026-08-10T01:15:17Z"},{"alias_kind":"pith_short_8","alias_value":"P3DESVHT","created_at":"2026-08-10T01:15:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:P3DESVHTUWW4IFNZFK3T3IDONY","target":"record","payload":{"canonical_record":{"source":{"id":"2608.07407","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-08-07T16:54:17Z","cross_cats_sorted":[],"title_canon_sha256":"4e3214a7229a70487b771cb63a961222753ab542a0f065b4162b17a7bbf1ac4e","abstract_canon_sha256":"fb1343d9dcc879c97587cca231b558a2af3a2dd5cccbdde5a36c9dc5c57df7ea"},"schema_version":"1.0"},"canonical_sha256":"7ec64954f3a5adc415b92ab73da06e6e03163a647bc8e18fbb621aeef856ec69","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-10T01:15:17.244192Z","signature_b64":"6sjGHHkeoYIUXiQyAWwzl7TM6sZ+6DmlD/45KuOTtnWSLRda+V9lXZfeWr5X50JIG9mpYYoTtv4Lk7TEQWieDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ec64954f3a5adc415b92ab73da06e6e03163a647bc8e18fbb621aeef856ec69","last_reissued_at":"2026-08-10T01:15:17.241813Z","signature_status":"signed_v1","first_computed_at":"2026-08-10T01:15:17.241813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.07407","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-08-10T01:15:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WM/rbz3bTEkyF505NzcDkkPQLwJW92QFVQGA25SeNxLGzSBaKWt+B4Fx+ZOPNZPw37/GPk9nOExIVEOqf+9lBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T01:41:57.729861Z"},"content_sha256":"ae86c342d57152e70e7882f96149d884d77e6f1a3b5961e3e339131db8f94786","schema_version":"1.0","event_id":"sha256:ae86c342d57152e70e7882f96149d884d77e6f1a3b5961e3e339131db8f94786"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:P3DESVHTUWW4IFNZFK3T3IDONY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Domain-Specific Harness for End-to-End Automation of Optimization Research","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ernest K. Ryu, Heechang Kim, Shuvomoy Das Gupta","submitted_at":"2026-08-07T16:54:17Z","abstract_excerpt":"We present AutoOPT, a domain-specific harness for end-to-end automation of optimization research. AutoOPT organizes the discovery of optimal first-order methods into four stages: numerical design through the BnB-PEP methodology; symbolic discovery of the analytic description and a convergence proof through frontier large language models (LLMs); formal verification in the Lean 4 proof assistant; and human interpretation and write-up. We demonstrate the framework on two case studies, each of independent interest. The first, lemniscate acceleration, is a new accelerated gradient method for minimi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.07407","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.07407/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","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":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-10T01:15:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JPjj9TEB0pzwRZioEamfzDNbvi5rDfD1Isrm8eCXxv28+sXfTCA3L4TCbykivHAtE8QFDjLOtFJRmaQ9kewECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T01:41:57.730231Z"},"content_sha256":"b0a8fe78de0c388a7bb15ff542baeee00f24c226089b1baad81a8b5e916b9c2f","schema_version":"1.0","event_id":"sha256:b0a8fe78de0c388a7bb15ff542baeee00f24c226089b1baad81a8b5e916b9c2f"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:P3DESVHTUWW4IFNZFK3T3IDONY","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/s10107-022-01839-y) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Adrien B. Taylor and Yoel Drori. An optimal gradient method for smooth strongly convex minimization. Mathematical Programming, 199(1–2):557–594, 2023. doi:10.1007/s10107-0 22-01839-y","arxiv_id":"2608.07407","detector":"doi_compliance","evidence":{"ref_index":62,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1007/s10107-0","reconstructed_doi":"10.1007/s10107-022-01839-y"},"severity":"advisory","ref_index":62,"audited_at":"2026-08-15T15:09:53.951426Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/s10107-022-01839-y","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"578f60028fbaedb0cd1c9e912e5fd47a8ad4e0fd4276ebcd3cd15979c5f02f53","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":19925,"payload_sha256":"af445288fc5365e9749ed31a4e60f77a0956214504ad9978f7b98785687b0ae2","signature_b64":"gJn0OQWJBuYLlDmQlsldTnX2rhCD+T3MZNdb2VBVRS9fo2Lbz214Lhdp6ZLR69B9cXM7IehEiVQj37A0XfM5AA==","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-08-15T15:13:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GUbAAThclCCRGrnHansPZrZ49G9v948FTNGlpbPhtXDIaJ+nBuAicmscxeWdVB4svlUIh8wO0UDMfw/ftEq7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T01:41:57.732636Z"},"content_sha256":"dd53f29a8ef28826684f7f5f67793d0926731342d3f9852d1707fff9d96275a6","schema_version":"1.0","event_id":"sha256:dd53f29a8ef28826684f7f5f67793d0926731342d3f9852d1707fff9d96275a6"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:P3DESVHTUWW4IFNZFK3T3IDONY","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/s10107-015-0949-3) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Donghwan Kim and Jeffrey A. Fessler. Optimized first-order methods for smooth convex minimization. Mathematical Programming, 159(1-2):81–107, 2016. doi:10.1007/s10107-015 -0949-3","arxiv_id":"2608.07407","detector":"doi_compliance","evidence":{"ref_index":30,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1007/s10107-015","reconstructed_doi":"10.1007/s10107-015-0949-3"},"severity":"advisory","ref_index":30,"audited_at":"2026-08-15T15:09:53.951426Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/s10107-015-0949-3","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"6b6c17aa4bad9fd0e0497a098a3c870cce7ffdbe3f280c41ddd9a31f01d1fb02","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":19924,"payload_sha256":"04b35c1fc0d1fb00bc44374766bc3f81204ef87f81fc6ecce1a4ab4f0047e34b","signature_b64":"CSWrNd1F70Vt/0OD3SuBtcGfNOpuCIo6fNd9BUZCn9FDw5Xj2FzdDXkQHek8NhfNlx+E4YDUsE3GKQqyy4wgAA==","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-08-15T15:13:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RdsoF+uZzMCNOWCPFRsyPdXPbIlhugG5AmEWmsqSjxcEVtNrt29phPaylyh2RydeAqR0GrwQVCk9QPP7FmMZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T01:41:57.732928Z"},"content_sha256":"cb3b270bd5c158cae0f64fa97baaf4e3c2aa2131ceac6b42242cfc34a98048e7","schema_version":"1.0","event_id":"sha256:cb3b270bd5c158cae0f64fa97baaf4e3c2aa2131ceac6b42242cfc34a98048e7"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:P3DESVHTUWW4IFNZFK3T3IDONY","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/s10107-023-01973-1) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Shuvomoy Das Gupta, Bart P. G. Van Parys, and Ernest K. Ryu. Branch-and-bound perfor- mance estimation programming: A unified methodology for constructing optimal optimization methods. Mathematical Programming, 204(1–2):567–639, 2024. doi:1","arxiv_id":"2608.07407","detector":"doi_compliance","evidence":{"ref_index":14,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1007/s10107-023-0","reconstructed_doi":"10.1007/s10107-023-01973-1"},"severity":"advisory","ref_index":14,"audited_at":"2026-08-15T15:09:53.951426Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/s10107-023-01973-1","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"5f4e2c98d23fa9764d33363bfc7e4bb69cbbfcd84c68e9b01738ed7a62cdeec2","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":19923,"payload_sha256":"43d8be9dc66adb4796d7b3be1b83a42be007946948a1bd2bdd990a582eb421c4","signature_b64":"2Z1jWtPbqPGD/DHMQjBQzCUXRtEuz9d/7/ed2yGCwQwWVekquZ8LgAv4ssRIgdLLdOlnSt6jPM9GQ14e/HN1AQ==","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-08-15T15:13:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P2//ZynKn1ho6C5o4cESqzR8BA/Z23ulFjK27ACEYWbAMRdql4bQ2aYNw9w5pBeMggA/+1oBRswi/9sDyl6WAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T01:41:57.733229Z"},"content_sha256":"d06627a0055840c956595db622fffcd5e1f4baf7cdebeca213835ab060d6aba2","schema_version":"1.0","event_id":"sha256:d06627a0055840c956595db622fffcd5e1f4baf7cdebeca213835ab060d6aba2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P3DESVHTUWW4IFNZFK3T3IDONY/bundle.json","state_url":"https://pith.science/pith/P3DESVHTUWW4IFNZFK3T3IDONY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P3DESVHTUWW4IFNZFK3T3IDONY/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-08-21T01:41:57Z","links":{"resolver":"https://pith.science/pith/P3DESVHTUWW4IFNZFK3T3IDONY","bundle":"https://pith.science/pith/P3DESVHTUWW4IFNZFK3T3IDONY/bundle.json","state":"https://pith.science/pith/P3DESVHTUWW4IFNZFK3T3IDONY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P3DESVHTUWW4IFNZFK3T3IDONY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:P3DESVHTUWW4IFNZFK3T3IDONY","merge_version":"pith-open-graph-merge-v1","event_count":5,"valid_event_count":5,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fb1343d9dcc879c97587cca231b558a2af3a2dd5cccbdde5a36c9dc5c57df7ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-08-07T16:54:17Z","title_canon_sha256":"4e3214a7229a70487b771cb63a961222753ab542a0f065b4162b17a7bbf1ac4e"},"schema_version":"1.0","source":{"id":"2608.07407","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.07407","created_at":"2026-08-10T01:15:17Z"},{"alias_kind":"arxiv_version","alias_value":"2608.07407v1","created_at":"2026-08-10T01:15:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.07407","created_at":"2026-08-10T01:15:17Z"},{"alias_kind":"pith_short_12","alias_value":"P3DESVHTUWW4","created_at":"2026-08-10T01:15:17Z"},{"alias_kind":"pith_short_16","alias_value":"P3DESVHTUWW4IFNZ","created_at":"2026-08-10T01:15:17Z"},{"alias_kind":"pith_short_8","alias_value":"P3DESVHT","created_at":"2026-08-10T01:15:17Z"}],"graph_snapshots":[{"event_id":"sha256:b0a8fe78de0c388a7bb15ff542baeee00f24c226089b1baad81a8b5e916b9c2f","target":"graph","created_at":"2026-08-10T01:15: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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2608.07407/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present AutoOPT, a domain-specific harness for end-to-end automation of optimization research. AutoOPT organizes the discovery of optimal first-order methods into four stages: numerical design through the BnB-PEP methodology; symbolic discovery of the analytic description and a convergence proof through frontier large language models (LLMs); formal verification in the Lean 4 proof assistant; and human interpretation and write-up. We demonstrate the framework on two case studies, each of independent interest. The first, lemniscate acceleration, is a new accelerated gradient method for minimi","authors_text":"Ernest K. Ryu, Heechang Kim, Shuvomoy Das Gupta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-08-07T16:54:17Z","title":"A Domain-Specific Harness for End-to-End Automation of Optimization Research"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.07407","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ae86c342d57152e70e7882f96149d884d77e6f1a3b5961e3e339131db8f94786","target":"record","created_at":"2026-08-10T01:15: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":"fb1343d9dcc879c97587cca231b558a2af3a2dd5cccbdde5a36c9dc5c57df7ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-08-07T16:54:17Z","title_canon_sha256":"4e3214a7229a70487b771cb63a961222753ab542a0f065b4162b17a7bbf1ac4e"},"schema_version":"1.0","source":{"id":"2608.07407","kind":"arxiv","version":1}},"canonical_sha256":"7ec64954f3a5adc415b92ab73da06e6e03163a647bc8e18fbb621aeef856ec69","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ec64954f3a5adc415b92ab73da06e6e03163a647bc8e18fbb621aeef856ec69","first_computed_at":"2026-08-10T01:15:17.241813Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-10T01:15:17.241813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6sjGHHkeoYIUXiQyAWwzl7TM6sZ+6DmlD/45KuOTtnWSLRda+V9lXZfeWr5X50JIG9mpYYoTtv4Lk7TEQWieDw==","signature_status":"signed_v1","signed_at":"2026-08-10T01:15:17.244192Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.07407","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:cb3b270bd5c158cae0f64fa97baaf4e3c2aa2131ceac6b42242cfc34a98048e7","sha256:d06627a0055840c956595db622fffcd5e1f4baf7cdebeca213835ab060d6aba2","sha256:dd53f29a8ef28826684f7f5f67793d0926731342d3f9852d1707fff9d96275a6"]}],"invalid_events":[],"applied_event_ids":["sha256:ae86c342d57152e70e7882f96149d884d77e6f1a3b5961e3e339131db8f94786","sha256:b0a8fe78de0c388a7bb15ff542baeee00f24c226089b1baad81a8b5e916b9c2f"],"state_sha256":"42787fa1e948fad864a2de1f491a274e5bacb014522c3a2c23a75bef9558dce3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M2LVxV6WLL5IYzHDWeIhg4hr1wZUKd+9fjqSSKSRyeg8YM6FvITNj5xkdKaoxeUuyLyPHw5hBAcOyM2yJ95sAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T01:41:57.735129Z","bundle_sha256":"d87b3423104254d1b1579965db73c21fbbb3b0bab4e738f372503112b127d097"}}