{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:NPSBR5CXRT6AWEX5HUDGFZPM2R","short_pith_number":"pith:NPSBR5CX","schema_version":"1.0","canonical_sha256":"6be418f4578cfc0b12fd3d0662e5ecd44b54679aa5d9c704b8c81337cae16bdd","source":{"kind":"arxiv","id":"2606.23672","version":1},"attestation_state":"computed","paper":{"title":"Teaching LLMs String Matching, Backtracking, and Error Recovery to Deduce Bases and Truth Tables for the Combinatorially Exploding Bit Manipulation Puzzles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Aditya Prasad, Prabhat Agnihotri, Prateek Agnihotri, Sanchit Jain, Shubham Jain","submitted_at":"2026-06-22T17:57:08Z","abstract_excerpt":"This paper presents our algorithmic innovations for the NVIDIA Nemotron Model Reasoning Challenge, focusing on Bit Manipulation Puzzles. In this task, the objective is to discover a hidden logical rule transforming input binary strings to outputs, then apply it to unseen inputs. Large Language Models (LLMs) notoriously struggle here; traditional methods force them to simulate complex boolean logic and arithmetic, leading to hallucinations. Furthermore, the search space of bitwise operations (combinations of shifts, rotations, and logic gates) suffers from a severe combinatorial explosion. To o"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2606.23672","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-06-22T17:57:08Z","cross_cats_sorted":[],"title_canon_sha256":"e1298e539cd157d7d09c4846eac4c2e9d89026a26162c6774494d00369e8737f","abstract_canon_sha256":"e17b6ecf795dd79d060b1840557da8316db173f2b5f044dbf424a1fe3f8d01cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T03:14:34.238646Z","signature_b64":"uDjKmuy8HJWg1imlnv72VVbzwdpjuSVOa8aY+LM0myhY8LZ4+6WKdrki822NRHbbB1bmP403ZTvTs/hwH9hODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6be418f4578cfc0b12fd3d0662e5ecd44b54679aa5d9c704b8c81337cae16bdd","last_reissued_at":"2026-06-23T03:14:34.238227Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T03:14:34.238227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Teaching LLMs String Matching, Backtracking, and Error Recovery to Deduce Bases and Truth Tables for the Combinatorially Exploding Bit Manipulation Puzzles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Aditya Prasad, Prabhat Agnihotri, Prateek Agnihotri, Sanchit Jain, Shubham Jain","submitted_at":"2026-06-22T17:57:08Z","abstract_excerpt":"This paper presents our algorithmic innovations for the NVIDIA Nemotron Model Reasoning Challenge, focusing on Bit Manipulation Puzzles. In this task, the objective is to discover a hidden logical rule transforming input binary strings to outputs, then apply it to unseen inputs. Large Language Models (LLMs) notoriously struggle here; traditional methods force them to simulate complex boolean logic and arithmetic, leading to hallucinations. Furthermore, the search space of bitwise operations (combinations of shifts, rotations, and logic gates) suffers from a severe combinatorial explosion. To o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.23672","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/2606.23672/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.23672","created_at":"2026-06-23T03:14:34.238292+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.23672v1","created_at":"2026-06-23T03:14:34.238292+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.23672","created_at":"2026-06-23T03:14:34.238292+00:00"},{"alias_kind":"pith_short_12","alias_value":"NPSBR5CXRT6A","created_at":"2026-06-23T03:14:34.238292+00:00"},{"alias_kind":"pith_short_16","alias_value":"NPSBR5CXRT6AWEX5","created_at":"2026-06-23T03:14:34.238292+00:00"},{"alias_kind":"pith_short_8","alias_value":"NPSBR5CX","created_at":"2026-06-23T03:14:34.238292+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NPSBR5CXRT6AWEX5HUDGFZPM2R","json":"https://pith.science/pith/NPSBR5CXRT6AWEX5HUDGFZPM2R.json","graph_json":"https://pith.science/api/pith-number/NPSBR5CXRT6AWEX5HUDGFZPM2R/graph.json","events_json":"https://pith.science/api/pith-number/NPSBR5CXRT6AWEX5HUDGFZPM2R/events.json","paper":"https://pith.science/paper/NPSBR5CX"},"agent_actions":{"view_html":"https://pith.science/pith/NPSBR5CXRT6AWEX5HUDGFZPM2R","download_json":"https://pith.science/pith/NPSBR5CXRT6AWEX5HUDGFZPM2R.json","view_paper":"https://pith.science/paper/NPSBR5CX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.23672&json=true","fetch_graph":"https://pith.science/api/pith-number/NPSBR5CXRT6AWEX5HUDGFZPM2R/graph.json","fetch_events":"https://pith.science/api/pith-number/NPSBR5CXRT6AWEX5HUDGFZPM2R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NPSBR5CXRT6AWEX5HUDGFZPM2R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NPSBR5CXRT6AWEX5HUDGFZPM2R/action/storage_attestation","attest_author":"https://pith.science/pith/NPSBR5CXRT6AWEX5HUDGFZPM2R/action/author_attestation","sign_citation":"https://pith.science/pith/NPSBR5CXRT6AWEX5HUDGFZPM2R/action/citation_signature","submit_replication":"https://pith.science/pith/NPSBR5CXRT6AWEX5HUDGFZPM2R/action/replication_record"}},"created_at":"2026-06-23T03:14:34.238292+00:00","updated_at":"2026-06-23T03:14:34.238292+00:00"}