{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:UAJKOR6GBDWRYKAQ5XNY44ZX54","short_pith_number":"pith:UAJKOR6G","canonical_record":{"source":{"id":"2602.18767","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-02-21T09:12:51Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ccf83b788dc36b8dd6db0014d1b508fd05cf754fe31097522ac2a9a7b05dc370","abstract_canon_sha256":"72c8748595d19841002a3f8569827dbb9417f26bf898e027fbc80749676dd6ab"},"schema_version":"1.0"},"canonical_sha256":"a012a747c608ed1c2810eddb8e7337ef0f5411b81b9a38a2c8db38123ea09b44","source":{"kind":"arxiv","id":"2602.18767","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.18767","created_at":"2026-07-01T01:18:24Z"},{"alias_kind":"arxiv_version","alias_value":"2602.18767v3","created_at":"2026-07-01T01:18:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.18767","created_at":"2026-07-01T01:18:24Z"},{"alias_kind":"pith_short_12","alias_value":"UAJKOR6GBDWR","created_at":"2026-07-01T01:18:24Z"},{"alias_kind":"pith_short_16","alias_value":"UAJKOR6GBDWRYKAQ","created_at":"2026-07-01T01:18:24Z"},{"alias_kind":"pith_short_8","alias_value":"UAJKOR6G","created_at":"2026-07-01T01:18:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:UAJKOR6GBDWRYKAQ5XNY44ZX54","target":"record","payload":{"canonical_record":{"source":{"id":"2602.18767","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-02-21T09:12:51Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ccf83b788dc36b8dd6db0014d1b508fd05cf754fe31097522ac2a9a7b05dc370","abstract_canon_sha256":"72c8748595d19841002a3f8569827dbb9417f26bf898e027fbc80749676dd6ab"},"schema_version":"1.0"},"canonical_sha256":"a012a747c608ed1c2810eddb8e7337ef0f5411b81b9a38a2c8db38123ea09b44","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-01T01:18:24.384026Z","signature_b64":"+52GRYqZSfqk1qLrKkNudkx/UE3hNWC6fQMWVNvx8v6EJnhm7paVzv4puR8F7KocrHTG4jPM33Sk3u3ogYxHCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a012a747c608ed1c2810eddb8e7337ef0f5411b81b9a38a2c8db38123ea09b44","last_reissued_at":"2026-07-01T01:18:24.383491Z","signature_status":"signed_v1","first_computed_at":"2026-07-01T01:18:24.383491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2602.18767","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-01T01:18:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ui1uLj999owIblrtXs+571JTZJxmvXj5PSc61eN5y6ROsdf1CjWkhhbtumZXI0WDSVAFKjPBjsBVkH2cn5BaBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T06:31:57.468068Z"},"content_sha256":"761e863ce19fa03b946153bebbc54fa6146030cfd989aa546d71876b31695cc0","schema_version":"1.0","event_id":"sha256:761e863ce19fa03b946153bebbc54fa6146030cfd989aa546d71876b31695cc0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:UAJKOR6GBDWRYKAQ5XNY44ZX54","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nazrin: An Atomic Neural Proof Automation Tactic in Lean 4","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.LO","authors_text":"Clark Barrett, David Dill, Iori Oikawa, Leni Aniva","submitted_at":"2026-02-21T09:12:51Z","abstract_excerpt":"In Machine-Assisted Theorem Proving, a theorem proving agent searches for a sequence of expressions and tactics that can prove a statement in a proof assistant. In this work, we introduce several novel concepts and capabilities to address obstacles faced by machine-assisted theorem proving. We first present a set of \\textbf{atomic tactics}, a small finite set of tactics capable of proving any provable statement in Lean. We then introduce a \\textbf{transposing atomization} algorithm which turns arbitrary proof expressions into a series of atomic tactics. We next introduce the \\textbf{ExprGraph}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.18767","kind":"arxiv","version":3},"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/2602.18767/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-07-01T01:18:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kHHrD517DiUEsI4vY2lCYsCiebOImC6JMHW1nNNHMohokDykM95Vtdd8EIQCjkczJCAUs9AANb62PDuO4WXSCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T06:31:57.468579Z"},"content_sha256":"9938121d02fc9d0356ecb1dd4b8ed1d619e073f173ce38dfe693b0e64b600770","schema_version":"1.0","event_id":"sha256:9938121d02fc9d0356ecb1dd4b8ed1d619e073f173ce38dfe693b0e64b600770"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UAJKOR6GBDWRYKAQ5XNY44ZX54/bundle.json","state_url":"https://pith.science/pith/UAJKOR6GBDWRYKAQ5XNY44ZX54/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UAJKOR6GBDWRYKAQ5XNY44ZX54/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-18T06:31:57Z","links":{"resolver":"https://pith.science/pith/UAJKOR6GBDWRYKAQ5XNY44ZX54","bundle":"https://pith.science/pith/UAJKOR6GBDWRYKAQ5XNY44ZX54/bundle.json","state":"https://pith.science/pith/UAJKOR6GBDWRYKAQ5XNY44ZX54/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UAJKOR6GBDWRYKAQ5XNY44ZX54/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:UAJKOR6GBDWRYKAQ5XNY44ZX54","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":"72c8748595d19841002a3f8569827dbb9417f26bf898e027fbc80749676dd6ab","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-02-21T09:12:51Z","title_canon_sha256":"ccf83b788dc36b8dd6db0014d1b508fd05cf754fe31097522ac2a9a7b05dc370"},"schema_version":"1.0","source":{"id":"2602.18767","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.18767","created_at":"2026-07-01T01:18:24Z"},{"alias_kind":"arxiv_version","alias_value":"2602.18767v3","created_at":"2026-07-01T01:18:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.18767","created_at":"2026-07-01T01:18:24Z"},{"alias_kind":"pith_short_12","alias_value":"UAJKOR6GBDWR","created_at":"2026-07-01T01:18:24Z"},{"alias_kind":"pith_short_16","alias_value":"UAJKOR6GBDWRYKAQ","created_at":"2026-07-01T01:18:24Z"},{"alias_kind":"pith_short_8","alias_value":"UAJKOR6G","created_at":"2026-07-01T01:18:24Z"}],"graph_snapshots":[{"event_id":"sha256:9938121d02fc9d0356ecb1dd4b8ed1d619e073f173ce38dfe693b0e64b600770","target":"graph","created_at":"2026-07-01T01:18: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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2602.18767/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In Machine-Assisted Theorem Proving, a theorem proving agent searches for a sequence of expressions and tactics that can prove a statement in a proof assistant. In this work, we introduce several novel concepts and capabilities to address obstacles faced by machine-assisted theorem proving. We first present a set of \\textbf{atomic tactics}, a small finite set of tactics capable of proving any provable statement in Lean. We then introduce a \\textbf{transposing atomization} algorithm which turns arbitrary proof expressions into a series of atomic tactics. We next introduce the \\textbf{ExprGraph}","authors_text":"Clark Barrett, David Dill, Iori Oikawa, Leni Aniva","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-02-21T09:12:51Z","title":"Nazrin: An Atomic Neural Proof Automation Tactic in Lean 4"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.18767","kind":"arxiv","version":3},"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:761e863ce19fa03b946153bebbc54fa6146030cfd989aa546d71876b31695cc0","target":"record","created_at":"2026-07-01T01:18: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":"72c8748595d19841002a3f8569827dbb9417f26bf898e027fbc80749676dd6ab","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2026-02-21T09:12:51Z","title_canon_sha256":"ccf83b788dc36b8dd6db0014d1b508fd05cf754fe31097522ac2a9a7b05dc370"},"schema_version":"1.0","source":{"id":"2602.18767","kind":"arxiv","version":3}},"canonical_sha256":"a012a747c608ed1c2810eddb8e7337ef0f5411b81b9a38a2c8db38123ea09b44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a012a747c608ed1c2810eddb8e7337ef0f5411b81b9a38a2c8db38123ea09b44","first_computed_at":"2026-07-01T01:18:24.383491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-01T01:18:24.383491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+52GRYqZSfqk1qLrKkNudkx/UE3hNWC6fQMWVNvx8v6EJnhm7paVzv4puR8F7KocrHTG4jPM33Sk3u3ogYxHCA==","signature_status":"signed_v1","signed_at":"2026-07-01T01:18:24.384026Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.18767","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:761e863ce19fa03b946153bebbc54fa6146030cfd989aa546d71876b31695cc0","sha256:9938121d02fc9d0356ecb1dd4b8ed1d619e073f173ce38dfe693b0e64b600770"],"state_sha256":"116ce29bae69c656830ed58f7e52f8436ca539f95fd7166b6e79f5e80aa24d7b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z5QEIyAp3ruruCk9c9P0pSCETLqJt7eymRmwI0ASBOqum09YTctRUVy301h8QRa2Ac2r3z83DlPc2LTnCDqLAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T06:31:57.472349Z","bundle_sha256":"9f09bd03900cbc6a8e890f874e23ba95bbca4a885efdc1b9f0d624d5d969cce0"}}