{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:6S6ZXYPGJJ6ETMBISQJWHEDIJF","short_pith_number":"pith:6S6ZXYPG","schema_version":"1.0","canonical_sha256":"f4bd9be1e64a7c49b028941363906849451fa78c44dd9e5acf709d420d292c87","source":{"kind":"arxiv","id":"2607.12862","version":1},"attestation_state":"computed","paper":{"title":"A Comparative Analysis of Ising Formulations for Neuromorphic Maximum-Likelihood Channel Decoding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["eess.SP"],"primary_cat":"cs.ET","authors_text":"George N. Katsaros, Konstantinos Nikitopoulos, Morgan Sabine","submitted_at":"2026-07-14T15:13:36Z","abstract_excerpt":"Neuromorphic computing has so far been driven predominantly by machine-learning workloads, yet its underlying properties also make it particularly well suited to combinatorial optimization problems expressed in Ising or QUBO form. While neuromorphic Ising solvers have been demonstrated, how a given problem should be formulated to best suit neuromorphic dynamics has received far less attention. Maximum-likelihood (ML) channel decoding can be expressed as an Ising/QUBO problem, and two distinct formulations already exist in the quantum-annealing literature: a squared-penalty formulation that use"},"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":"2607.12862","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.ET","submitted_at":"2026-07-14T15:13:36Z","cross_cats_sorted":["eess.SP"],"title_canon_sha256":"625034b0287b7d4671291a66a1c0d73d237f35aeac0d3a58d1ab88fd8aa80646","abstract_canon_sha256":"a4a855b12ee2a11ce643c5b6a6d21a91e24218ca2f0171d32d49bfd283b3a611"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-15T01:22:22.294690Z","signature_b64":"LmPhgEfMGxLPqLxsCCu1AaDojQrT0GJMczsAe2PfVRK4VBkPk/aHDxG3w2SAMhpz+tsOgb1IN/JkYMwTOlJfCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4bd9be1e64a7c49b028941363906849451fa78c44dd9e5acf709d420d292c87","last_reissued_at":"2026-07-15T01:22:22.293775Z","signature_status":"signed_v1","first_computed_at":"2026-07-15T01:22:22.293775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Comparative Analysis of Ising Formulations for Neuromorphic Maximum-Likelihood Channel Decoding","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["eess.SP"],"primary_cat":"cs.ET","authors_text":"George N. Katsaros, Konstantinos Nikitopoulos, Morgan Sabine","submitted_at":"2026-07-14T15:13:36Z","abstract_excerpt":"Neuromorphic computing has so far been driven predominantly by machine-learning workloads, yet its underlying properties also make it particularly well suited to combinatorial optimization problems expressed in Ising or QUBO form. While neuromorphic Ising solvers have been demonstrated, how a given problem should be formulated to best suit neuromorphic dynamics has received far less attention. Maximum-likelihood (ML) channel decoding can be expressed as an Ising/QUBO problem, and two distinct formulations already exist in the quantum-annealing literature: a squared-penalty formulation that use"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.12862","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/2607.12862/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":"2607.12862","created_at":"2026-07-15T01:22:22.294200+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.12862v1","created_at":"2026-07-15T01:22:22.294200+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.12862","created_at":"2026-07-15T01:22:22.294200+00:00"},{"alias_kind":"pith_short_12","alias_value":"6S6ZXYPGJJ6E","created_at":"2026-07-15T01:22:22.294200+00:00"},{"alias_kind":"pith_short_16","alias_value":"6S6ZXYPGJJ6ETMBI","created_at":"2026-07-15T01:22:22.294200+00:00"},{"alias_kind":"pith_short_8","alias_value":"6S6ZXYPG","created_at":"2026-07-15T01:22:22.294200+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/6S6ZXYPGJJ6ETMBISQJWHEDIJF","json":"https://pith.science/pith/6S6ZXYPGJJ6ETMBISQJWHEDIJF.json","graph_json":"https://pith.science/api/pith-number/6S6ZXYPGJJ6ETMBISQJWHEDIJF/graph.json","events_json":"https://pith.science/api/pith-number/6S6ZXYPGJJ6ETMBISQJWHEDIJF/events.json","paper":"https://pith.science/paper/6S6ZXYPG"},"agent_actions":{"view_html":"https://pith.science/pith/6S6ZXYPGJJ6ETMBISQJWHEDIJF","download_json":"https://pith.science/pith/6S6ZXYPGJJ6ETMBISQJWHEDIJF.json","view_paper":"https://pith.science/paper/6S6ZXYPG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.12862&json=true","fetch_graph":"https://pith.science/api/pith-number/6S6ZXYPGJJ6ETMBISQJWHEDIJF/graph.json","fetch_events":"https://pith.science/api/pith-number/6S6ZXYPGJJ6ETMBISQJWHEDIJF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6S6ZXYPGJJ6ETMBISQJWHEDIJF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6S6ZXYPGJJ6ETMBISQJWHEDIJF/action/storage_attestation","attest_author":"https://pith.science/pith/6S6ZXYPGJJ6ETMBISQJWHEDIJF/action/author_attestation","sign_citation":"https://pith.science/pith/6S6ZXYPGJJ6ETMBISQJWHEDIJF/action/citation_signature","submit_replication":"https://pith.science/pith/6S6ZXYPGJJ6ETMBISQJWHEDIJF/action/replication_record"}},"created_at":"2026-07-15T01:22:22.294200+00:00","updated_at":"2026-07-15T01:22:22.294200+00:00"}