{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:OC245CFVK2VXRJJP7QGDTTLVJZ","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":"607568ed5b9c8e1e0eb1ce1a15c52006ae2a878d66c5922a98bc7154d4918b7b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-03-04T04:51:30Z","title_canon_sha256":"b383d3190b1cc911b63fc1af41fcb8b7ffd3caa52cf09b7036a657457bd100eb"},"schema_version":"1.0","source":{"id":"2603.03723","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.03723","created_at":"2026-05-29T01:04:37Z"},{"alias_kind":"arxiv_version","alias_value":"2603.03723v4","created_at":"2026-05-29T01:04:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.03723","created_at":"2026-05-29T01:04:37Z"},{"alias_kind":"pith_short_12","alias_value":"OC245CFVK2VX","created_at":"2026-05-29T01:04:37Z"},{"alias_kind":"pith_short_16","alias_value":"OC245CFVK2VXRJJP","created_at":"2026-05-29T01:04:37Z"},{"alias_kind":"pith_short_8","alias_value":"OC245CFV","created_at":"2026-05-29T01:04:37Z"}],"graph_snapshots":[{"event_id":"sha256:8b904638f2ed202b27ef9c829ff9ccc58145867623a03c7716050db3471af65a","target":"graph","created_at":"2026-05-29T01:04: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":"we study a recently proposed family of geometric codes capable of handling multiple outliers, and develop a geometric analysis that characterizes their m-height profiles."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the recently proposed geometric codes are indeed capable of handling multiple outliers under the mixed noise model of resistive crossbars, and that a geometric analysis of m-height profiles will meaningfully expand the usable code families."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The authors develop a geometric analysis that characterizes the m-height profiles of geometric codes capable of correcting multiple outliers in analog in-memory computing."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A geometric analysis characterizes m-height profiles of a family of analog codes to handle multiple outliers in resistive crossbar computing."}],"snapshot_sha256":"56bb9d167158a40544e4bc28b26a14c230c0a1cb9066adb890030dac92f369d0"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"0059c9dc31691210c97a192821386564cedba8264f85801a5203ce185e48e1eb"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2603.03723/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Analog error correction codes have been proposed for analog in-memory computing on resistive crossbars, which can accelerate vector-matrix multiplication for machine learning. Unlike traditional communication or storage channels, this setting involves a mixed noise model with small perturbations and outlier errors. A number of analog codes have been proposed for handling a single outlier, and several constructions have also been developed to address multiple outliers. However, the set of available code families remains limited, covering only a narrow range of code lengths and dimensions. In th","authors_text":"Anxiao Jiang, Changcheng Yuan, Paul H. Siegel, Ron M. Roth, Ziyuan Zhu","cross_cats":["math.IT"],"headline":"A geometric analysis characterizes m-height profiles of a family of analog codes to handle multiple outliers in resistive crossbar computing.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-03-04T04:51:30Z","title":"A New Class of Geometric Analog Error Correction Codes for Crossbar Based In-Memory Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.03723","kind":"arxiv","version":4},"verdict":{"created_at":"2026-05-15T17:10:38.530968Z","id":"efd5002c-8336-4789-bba6-0ac3276faf4d","model_set":{"reader":"grok-4.3"},"one_line_summary":"The authors develop a geometric analysis that characterizes the m-height profiles of geometric codes capable of correcting multiple outliers in analog in-memory computing.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A geometric analysis characterizes m-height profiles of a family of analog codes to handle multiple outliers in resistive crossbar computing.","strongest_claim":"we study a recently proposed family of geometric codes capable of handling multiple outliers, and develop a geometric analysis that characterizes their m-height profiles.","weakest_assumption":"That the recently proposed geometric codes are indeed capable of handling multiple outliers under the mixed noise model of resistive crossbars, and that a geometric analysis of m-height profiles will meaningfully expand the usable code families."}},"verdict_id":"efd5002c-8336-4789-bba6-0ac3276faf4d"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9e7d2fafb6f082e4a6b6337a269c9d4aa487a7dc7f79ce202ad10132fd1919a8","target":"record","created_at":"2026-05-29T01:04: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":"607568ed5b9c8e1e0eb1ce1a15c52006ae2a878d66c5922a98bc7154d4918b7b","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-03-04T04:51:30Z","title_canon_sha256":"b383d3190b1cc911b63fc1af41fcb8b7ffd3caa52cf09b7036a657457bd100eb"},"schema_version":"1.0","source":{"id":"2603.03723","kind":"arxiv","version":4}},"canonical_sha256":"70b5ce88b556ab78a52ffc0c39cd754e4c90b329074ecbd18ad353c5edaff438","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70b5ce88b556ab78a52ffc0c39cd754e4c90b329074ecbd18ad353c5edaff438","first_computed_at":"2026-05-29T01:04:37.079269Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-29T01:04:37.079269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YNwOr5yElsuR0j6hczn8FB+ly/VB0KE3P8QgUWh9YC7ZJqh4K12PqLrlOSbafwfoAh4KQYvnc/B44j1sFenABw==","signature_status":"signed_v1","signed_at":"2026-05-29T01:04:37.079761Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.03723","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e7d2fafb6f082e4a6b6337a269c9d4aa487a7dc7f79ce202ad10132fd1919a8","sha256:8b904638f2ed202b27ef9c829ff9ccc58145867623a03c7716050db3471af65a"],"state_sha256":"e780120175bec314def75283fde3dbbe5549bc0a28c8e1c1de13b3527e1219bc"}