{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CJWMLISXBYX5KXN2LGVD3B4REB","short_pith_number":"pith:CJWMLISX","schema_version":"1.0","canonical_sha256":"126cc5a2570e2fd55dba59aa3d8791204672676b272dfa474d1cfa4dec93f268","source":{"kind":"arxiv","id":"2506.10121","version":1},"attestation_state":"computed","paper":{"title":"HiKO: A Hierarchical Framework for Beyond-Second-Order KO Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Adrish Banerjee, Shubham Srivastava","submitted_at":"2025-06-11T19:05:08Z","abstract_excerpt":"This paper introduces HiKO (Hierarchical Kronecker Operation), a novel framework for training high-rate neural error-correcting codes that enables KO codes to outperform Reed-Muller codes beyond second order. To our knowledge, this is the first attempt to extend KO codes beyond second order. While conventional KO codes show promising results for low-rate regimes ($r < 2$), they degrade at higher rates -- a critical limitation for practical deployment. Our framework incorporates three key innovations: (1) a hierarchical training methodology that decomposes complex high-rate codes into simpler c"},"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":"2506.10121","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2025-06-11T19:05:08Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9a6227254ff06b027158e2d366ad56199553245dd3ca24c8c8dbbe55a1a7a58e","abstract_canon_sha256":"ad76ac22600b8010a906a82b51d6ce0ee1ebe54343e777aaaebb4d0773581267"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:20:16.893618Z","signature_b64":"VYxl4/0B+rNYgpYVUMYnRKhUPOP7s9MDT+385FWi9lEatGmGNnyaPFxMPUAtgiLyTPGOIP9evHistobgclesCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"126cc5a2570e2fd55dba59aa3d8791204672676b272dfa474d1cfa4dec93f268","last_reissued_at":"2026-07-05T11:20:16.893117Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:20:16.893117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HiKO: A Hierarchical Framework for Beyond-Second-Order KO Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Adrish Banerjee, Shubham Srivastava","submitted_at":"2025-06-11T19:05:08Z","abstract_excerpt":"This paper introduces HiKO (Hierarchical Kronecker Operation), a novel framework for training high-rate neural error-correcting codes that enables KO codes to outperform Reed-Muller codes beyond second order. To our knowledge, this is the first attempt to extend KO codes beyond second order. While conventional KO codes show promising results for low-rate regimes ($r < 2$), they degrade at higher rates -- a critical limitation for practical deployment. Our framework incorporates three key innovations: (1) a hierarchical training methodology that decomposes complex high-rate codes into simpler c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.10121","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/2506.10121/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":"2506.10121","created_at":"2026-07-05T11:20:16.893177+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.10121v1","created_at":"2026-07-05T11:20:16.893177+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.10121","created_at":"2026-07-05T11:20:16.893177+00:00"},{"alias_kind":"pith_short_12","alias_value":"CJWMLISXBYX5","created_at":"2026-07-05T11:20:16.893177+00:00"},{"alias_kind":"pith_short_16","alias_value":"CJWMLISXBYX5KXN2","created_at":"2026-07-05T11:20:16.893177+00:00"},{"alias_kind":"pith_short_8","alias_value":"CJWMLISX","created_at":"2026-07-05T11:20:16.893177+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/CJWMLISXBYX5KXN2LGVD3B4REB","json":"https://pith.science/pith/CJWMLISXBYX5KXN2LGVD3B4REB.json","graph_json":"https://pith.science/api/pith-number/CJWMLISXBYX5KXN2LGVD3B4REB/graph.json","events_json":"https://pith.science/api/pith-number/CJWMLISXBYX5KXN2LGVD3B4REB/events.json","paper":"https://pith.science/paper/CJWMLISX"},"agent_actions":{"view_html":"https://pith.science/pith/CJWMLISXBYX5KXN2LGVD3B4REB","download_json":"https://pith.science/pith/CJWMLISXBYX5KXN2LGVD3B4REB.json","view_paper":"https://pith.science/paper/CJWMLISX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.10121&json=true","fetch_graph":"https://pith.science/api/pith-number/CJWMLISXBYX5KXN2LGVD3B4REB/graph.json","fetch_events":"https://pith.science/api/pith-number/CJWMLISXBYX5KXN2LGVD3B4REB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CJWMLISXBYX5KXN2LGVD3B4REB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CJWMLISXBYX5KXN2LGVD3B4REB/action/storage_attestation","attest_author":"https://pith.science/pith/CJWMLISXBYX5KXN2LGVD3B4REB/action/author_attestation","sign_citation":"https://pith.science/pith/CJWMLISXBYX5KXN2LGVD3B4REB/action/citation_signature","submit_replication":"https://pith.science/pith/CJWMLISXBYX5KXN2LGVD3B4REB/action/replication_record"}},"created_at":"2026-07-05T11:20:16.893177+00:00","updated_at":"2026-07-05T11:20:16.893177+00:00"}