{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:HYDIVZQ5TZCPPT2PQIZ2NLGXQG","short_pith_number":"pith:HYDIVZQ5","canonical_record":{"source":{"id":"2605.15445","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-14T22:02:31Z","cross_cats_sorted":[],"title_canon_sha256":"70a1b5636a2a737368fd27bec08a773a4491abeb571377f0bd7ef5658b205527","abstract_canon_sha256":"ea69fe50e793b3e011f79a0a1ffd0754bbb91b7617ef70cc7564d990d0c9662a"},"schema_version":"1.0"},"canonical_sha256":"3e068ae61d9e44f7cf4f8233a6acd781910f09631b54b15bf1b413786c80d631","source":{"kind":"arxiv","id":"2605.15445","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15445","created_at":"2026-05-20T00:00:59Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15445v1","created_at":"2026-05-20T00:00:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15445","created_at":"2026-05-20T00:00:59Z"},{"alias_kind":"pith_short_12","alias_value":"HYDIVZQ5TZCP","created_at":"2026-05-20T00:00:59Z"},{"alias_kind":"pith_short_16","alias_value":"HYDIVZQ5TZCPPT2P","created_at":"2026-05-20T00:00:59Z"},{"alias_kind":"pith_short_8","alias_value":"HYDIVZQ5","created_at":"2026-05-20T00:00:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:HYDIVZQ5TZCPPT2PQIZ2NLGXQG","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15445","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-14T22:02:31Z","cross_cats_sorted":[],"title_canon_sha256":"70a1b5636a2a737368fd27bec08a773a4491abeb571377f0bd7ef5658b205527","abstract_canon_sha256":"ea69fe50e793b3e011f79a0a1ffd0754bbb91b7617ef70cc7564d990d0c9662a"},"schema_version":"1.0"},"canonical_sha256":"3e068ae61d9e44f7cf4f8233a6acd781910f09631b54b15bf1b413786c80d631","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:59.004666Z","signature_b64":"KsKfH2WhWnpGqd7YzU/u/R9QB184ehVTogxA9D/w9pjULigqwucAqdHLlET5UHVg/Gx2xzMAAaV0Wo2tpJk2Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e068ae61d9e44f7cf4f8233a6acd781910f09631b54b15bf1b413786c80d631","last_reissued_at":"2026-05-20T00:00:59.003815Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:59.003815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15445","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:00:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ggkLz579n6WtKzVxgT4HEJAQYgRpNylmkjiP9knUz0WwgHK1VPobdgiW+JohhhNevs1PhCsebejJhuSO6ZeQAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:29:38.893967Z"},"content_sha256":"f39138af3a186ebdf63202f9ff42f89a61c31f1eb76f95497af728d013d90fcb","schema_version":"1.0","event_id":"sha256:f39138af3a186ebdf63202f9ff42f89a61c31f1eb76f95497af728d013d90fcb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:HYDIVZQ5TZCPPT2PQIZ2NLGXQG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"From LLM-Generated Conjectures to Lean Formalizations: Automated Polynomial Inequality Proving via Sum-of-Squares Certificates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"LLM-suggested approximate sum-of-squares decompositions can be refined symbolically into exact Lean-verified proofs for polynomial inequalities with up to 10 variables.","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Gaolei He, Hanrui Zhao, Jianlin Wang, Ruobing Zuo, Zhengfeng Yang","submitted_at":"2026-05-14T22:02:31Z","abstract_excerpt":"Automated proving of polynomial inequalities is a fundamental challenge in automated mathematical reasoning, where rich algebraic structure and a rapidly growing certificate search space hinder scalability. Purely symbolic approaches provide strong guarantees but often scale poorly as the number of variables or the degree increases, due to expensive algebraic manipulations and rapidly growing intermediate expressions. In parallel, LLM-guided methods have made notable progress, particularly on competition-style inequalities with a small number of variables. To address the remaining scalability "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"NSPI provides an end-to-end pipeline from LLM heuristic discovery to machine-checked proof for polynomial inequalities and demonstrates effectiveness and scalability on challenging benchmarks involving polynomials with up to 10 variables.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that LLM-generated approximate SOS decompositions are sufficiently close to exact ones that symbolic refinement can always (or mostly) succeed without prohibitive cost or failure on the target benchmarks.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"NSPI uses LLMs to generate approximate SOS conjectures for polynomial inequalities, refines them symbolically into exact proofs, and certifies them in Lean, scaling to benchmarks with up to 10 variables.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"LLM-suggested approximate sum-of-squares decompositions can be refined symbolically into exact Lean-verified proofs for polynomial inequalities with up to 10 variables.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"fc09fd678913330072ea47bf5fa099ffe045b0191a98b346fa4b5582c5c7bc6f"},"source":{"id":"2605.15445","kind":"arxiv","version":1},"verdict":{"id":"dd969c9a-97eb-4d0b-8db4-3c79527f23ad","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T14:36:59.475822Z","strongest_claim":"NSPI provides an end-to-end pipeline from LLM heuristic discovery to machine-checked proof for polynomial inequalities and demonstrates effectiveness and scalability on challenging benchmarks involving polynomials with up to 10 variables.","one_line_summary":"NSPI uses LLMs to generate approximate SOS conjectures for polynomial inequalities, refines them symbolically into exact proofs, and certifies them in Lean, scaling to benchmarks with up to 10 variables.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that LLM-generated approximate SOS decompositions are sufficiently close to exact ones that symbolic refinement can always (or mostly) succeed without prohibitive cost or failure on the target benchmarks.","pith_extraction_headline":"LLM-suggested approximate sum-of-squares decompositions can be refined symbolically into exact Lean-verified proofs for polynomial inequalities with up to 10 variables."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15445/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"cited_work_retraction","ran_at":"2026-05-19T15:51:58.611348Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T15:50:07.579463Z","status":"completed","version":"0.1.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T15:01:17.630751Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T14:50:17.933743Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.115925Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.682145Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"aa5d963ac90c39885d91b6be9343dce1bd37db7ff2f662c8f5044130f294549d"},"references":{"count":15,"sample":[{"doi":"10.1016/j.jsc.2011.08.002","year":1993,"title":"9 From LLM Conjectures to Lean Formalizations: Automated Inequality Proving via Sum-of-Squares Certificates Heule, M","work_id":"a578546f-4ed5-43a5-ab44-0d7166a35417","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1016/j.tcs.2008.09.025","year":2008,"title":"URL https://www.sciencedirect.com/ science/article/pii/S0304397508006452","work_id":"f1ac26e4-c553-4826-9322-362120b22af6","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"The polynomialf(x)admits a rational SOS decomposition, that is, there exist polynomialsf i(x)∈Q[x]such that f(x) = rX i=1 fi(x)2","work_id":"9830e70d-5a7f-40c5-ba97-c554fb0ef293","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2013,"title":"There exists a symmetric positive semidefinite Gram matrixG∈S m ∩Q m×m such that f(x) =v(x) ⊤Gv(x), G⪰0. For the numerical solution GN obtained after the Gauss–Newton refinement, when the backward err","work_id":"ba7446b6-3d06-46b6-b54a-ae3fff110f37","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Analyze the input polynomial carefully, focusing on the coefficients and the combinations of variables involved","work_id":"abda1150-aa12-47f6-812d-63c62d53347a","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":15,"snapshot_sha256":"b7f17edd238315bae9d9a0ae0b3fd44f083063ed44486c3ca2be6d4327eda601","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"c2fd3f61270324e4cbc592e1bd766a85c079a78f7dd62522bda76f7058972e98"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"dd969c9a-97eb-4d0b-8db4-3c79527f23ad"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:00:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zSuaZhndyLW0oMFZwhpSyW6hPVffvrkMSJ5DZLd/x1LVumFr88/uNkEReP7NvPOkhsD+RdWHiYWnKGMEJJQzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:29:38.894715Z"},"content_sha256":"13f9a5edc0d912ba2d4ee53aa8039a2ab7f1f554e6dc52476fb007ac52a49b43","schema_version":"1.0","event_id":"sha256:13f9a5edc0d912ba2d4ee53aa8039a2ab7f1f554e6dc52476fb007ac52a49b43"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HYDIVZQ5TZCPPT2PQIZ2NLGXQG/bundle.json","state_url":"https://pith.science/pith/HYDIVZQ5TZCPPT2PQIZ2NLGXQG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HYDIVZQ5TZCPPT2PQIZ2NLGXQG/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-06-01T23:29:38Z","links":{"resolver":"https://pith.science/pith/HYDIVZQ5TZCPPT2PQIZ2NLGXQG","bundle":"https://pith.science/pith/HYDIVZQ5TZCPPT2PQIZ2NLGXQG/bundle.json","state":"https://pith.science/pith/HYDIVZQ5TZCPPT2PQIZ2NLGXQG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HYDIVZQ5TZCPPT2PQIZ2NLGXQG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:HYDIVZQ5TZCPPT2PQIZ2NLGXQG","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":"ea69fe50e793b3e011f79a0a1ffd0754bbb91b7617ef70cc7564d990d0c9662a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-14T22:02:31Z","title_canon_sha256":"70a1b5636a2a737368fd27bec08a773a4491abeb571377f0bd7ef5658b205527"},"schema_version":"1.0","source":{"id":"2605.15445","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15445","created_at":"2026-05-20T00:00:59Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15445v1","created_at":"2026-05-20T00:00:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15445","created_at":"2026-05-20T00:00:59Z"},{"alias_kind":"pith_short_12","alias_value":"HYDIVZQ5TZCP","created_at":"2026-05-20T00:00:59Z"},{"alias_kind":"pith_short_16","alias_value":"HYDIVZQ5TZCPPT2P","created_at":"2026-05-20T00:00:59Z"},{"alias_kind":"pith_short_8","alias_value":"HYDIVZQ5","created_at":"2026-05-20T00:00:59Z"}],"graph_snapshots":[{"event_id":"sha256:13f9a5edc0d912ba2d4ee53aa8039a2ab7f1f554e6dc52476fb007ac52a49b43","target":"graph","created_at":"2026-05-20T00:00:59Z","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":"NSPI provides an end-to-end pipeline from LLM heuristic discovery to machine-checked proof for polynomial inequalities and demonstrates effectiveness and scalability on challenging benchmarks involving polynomials with up to 10 variables."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that LLM-generated approximate SOS decompositions are sufficiently close to exact ones that symbolic refinement can always (or mostly) succeed without prohibitive cost or failure on the target benchmarks."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"NSPI uses LLMs to generate approximate SOS conjectures for polynomial inequalities, refines them symbolically into exact proofs, and certifies them in Lean, scaling to benchmarks with up to 10 variables."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"LLM-suggested approximate sum-of-squares decompositions can be refined symbolically into exact Lean-verified proofs for polynomial inequalities with up to 10 variables."}],"snapshot_sha256":"fc09fd678913330072ea47bf5fa099ffe045b0191a98b346fa4b5582c5c7bc6f"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"c2fd3f61270324e4cbc592e1bd766a85c079a78f7dd62522bda76f7058972e98"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T15:51:58.611348Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"citation_quote_validity","ran_at":"2026-05-19T15:50:07.579463Z","status":"completed","version":"0.1.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T15:01:17.630751Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T14:50:17.933743Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.115925Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.682145Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.15445/integrity.json","findings":[],"snapshot_sha256":"aa5d963ac90c39885d91b6be9343dce1bd37db7ff2f662c8f5044130f294549d","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Automated proving of polynomial inequalities is a fundamental challenge in automated mathematical reasoning, where rich algebraic structure and a rapidly growing certificate search space hinder scalability. Purely symbolic approaches provide strong guarantees but often scale poorly as the number of variables or the degree increases, due to expensive algebraic manipulations and rapidly growing intermediate expressions. In parallel, LLM-guided methods have made notable progress, particularly on competition-style inequalities with a small number of variables. To address the remaining scalability ","authors_text":"Gaolei He, Hanrui Zhao, Jianlin Wang, Ruobing Zuo, Zhengfeng Yang","cross_cats":[],"headline":"LLM-suggested approximate sum-of-squares decompositions can be refined symbolically into exact Lean-verified proofs for polynomial inequalities with up to 10 variables.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-14T22:02:31Z","title":"From LLM-Generated Conjectures to Lean Formalizations: Automated Polynomial Inequality Proving via Sum-of-Squares Certificates"},"references":{"count":15,"internal_anchors":0,"resolved_work":15,"sample":[{"cited_arxiv_id":"","doi":"10.1016/j.jsc.2011.08.002","is_internal_anchor":false,"ref_index":1,"title":"9 From LLM Conjectures to Lean Formalizations: Automated Inequality Proving via Sum-of-Squares Certificates Heule, M","work_id":"a578546f-4ed5-43a5-ab44-0d7166a35417","year":1993},{"cited_arxiv_id":"","doi":"10.1016/j.tcs.2008.09.025","is_internal_anchor":false,"ref_index":2,"title":"URL https://www.sciencedirect.com/ science/article/pii/S0304397508006452","work_id":"f1ac26e4-c553-4826-9322-362120b22af6","year":2008},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"The polynomialf(x)admits a rational SOS decomposition, that is, there exist polynomialsf i(x)∈Q[x]such that f(x) = rX i=1 fi(x)2","work_id":"9830e70d-5a7f-40c5-ba97-c554fb0ef293","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"There exists a symmetric positive semidefinite Gram matrixG∈S m ∩Q m×m such that f(x) =v(x) ⊤Gv(x), G⪰0. For the numerical solution GN obtained after the Gauss–Newton refinement, when the backward err","work_id":"ba7446b6-3d06-46b6-b54a-ae3fff110f37","year":2013},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Analyze the input polynomial carefully, focusing on the coefficients and the combinations of variables involved","work_id":"abda1150-aa12-47f6-812d-63c62d53347a","year":null}],"snapshot_sha256":"b7f17edd238315bae9d9a0ae0b3fd44f083063ed44486c3ca2be6d4327eda601"},"source":{"id":"2605.15445","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T14:36:59.475822Z","id":"dd969c9a-97eb-4d0b-8db4-3c79527f23ad","model_set":{"reader":"grok-4.3"},"one_line_summary":"NSPI uses LLMs to generate approximate SOS conjectures for polynomial inequalities, refines them symbolically into exact proofs, and certifies them in Lean, scaling to benchmarks with up to 10 variables.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"LLM-suggested approximate sum-of-squares decompositions can be refined symbolically into exact Lean-verified proofs for polynomial inequalities with up to 10 variables.","strongest_claim":"NSPI provides an end-to-end pipeline from LLM heuristic discovery to machine-checked proof for polynomial inequalities and demonstrates effectiveness and scalability on challenging benchmarks involving polynomials with up to 10 variables.","weakest_assumption":"The assumption that LLM-generated approximate SOS decompositions are sufficiently close to exact ones that symbolic refinement can always (or mostly) succeed without prohibitive cost or failure on the target benchmarks."}},"verdict_id":"dd969c9a-97eb-4d0b-8db4-3c79527f23ad"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f39138af3a186ebdf63202f9ff42f89a61c31f1eb76f95497af728d013d90fcb","target":"record","created_at":"2026-05-20T00:00:59Z","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":"ea69fe50e793b3e011f79a0a1ffd0754bbb91b7617ef70cc7564d990d0c9662a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-14T22:02:31Z","title_canon_sha256":"70a1b5636a2a737368fd27bec08a773a4491abeb571377f0bd7ef5658b205527"},"schema_version":"1.0","source":{"id":"2605.15445","kind":"arxiv","version":1}},"canonical_sha256":"3e068ae61d9e44f7cf4f8233a6acd781910f09631b54b15bf1b413786c80d631","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e068ae61d9e44f7cf4f8233a6acd781910f09631b54b15bf1b413786c80d631","first_computed_at":"2026-05-20T00:00:59.003815Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:00:59.003815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KsKfH2WhWnpGqd7YzU/u/R9QB184ehVTogxA9D/w9pjULigqwucAqdHLlET5UHVg/Gx2xzMAAaV0Wo2tpJk2Aw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:00:59.004666Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15445","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f39138af3a186ebdf63202f9ff42f89a61c31f1eb76f95497af728d013d90fcb","sha256:13f9a5edc0d912ba2d4ee53aa8039a2ab7f1f554e6dc52476fb007ac52a49b43"],"state_sha256":"6581accd7403cc2e23531f898c4871c5b07c951d14c3357072d2192f72ca5894"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"opIOoOG6JfSvW/s8sL954RLMeOkvMwDliBSR28IS544HNhKXO0uDFZnMBEJcgREHpJQqV1DLrFivhTByotMUBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T23:29:38.897801Z","bundle_sha256":"ddc396bb9a432cfa6933c3fd1f4ea05aa507a40a3483242894fd69efb8e8e85f"}}