**arXiv ID:** 2602.04911 **Authors:** E Bowen, R Granger, A Rodriguez **Published:** 2026-02-04T01:16:37Z **Abstract:** We introduce a simple initial working system in which relations (such as part-whole) are directly represented via an architecture with operating and learning rules fundamentally distinct from standard artificial neural network methods. Arbitrary data are straightforwardly encoded as graphs whose edges correspond to codes from a small fixed primitive set of elemental pairwise...
Scanned 9/11/2026
Install to Claude Code
npx -y skills add hiyenwong/ai_collection --skill a-logical-reconception-of-neural-networks-hamiltonian-bitwise-partwhole-architecture --agent claude-codeInstalls into .claude/skills of the current project.
Are you the author of A Logical Reconception Of Neural Networks Hamiltonian Bitwise Partwhole Architecture?
Add the live security badge to your README — it updates automatically with every re-scan.
[](https://www.skillsdirectory.com/skills/hiyenwong-a-logical-reconception-of-neural-networks-hamilton)More formats (shields.io, HTML) on the badges page.
# A logical re-conception of neural networks: Hamiltonian bitwise part-whole architecture
**arXiv ID:** 2602.04911
**Authors:** E Bowen, R Granger, A Rodriguez
**Published:** 2026-02-04T01:16:37Z
**Abstract:**
We introduce a simple initial working system in which relations (such as part-whole) are directly represented via an architecture with operating and learning rules fundamentally distinct from standard artificial neural network methods. Arbitrary data are straightforwardly encoded as graphs whose edges correspond to codes from a small fixed primitive set of elemental pairwise relations, such that simple relational encoding is not an add-on, but occurs intrinsically within the most basic components of the system. A novel graph-Hamiltonian operator calculates energies among these encodings, with ground states denoting simultaneous satisfaction of all relation constraints among graph vertices. The method solely uses radically low-precision arithmetic; computational cost is correspondingly low, and scales linearly with the number of edges in the data. The resulting unconventional architecture can process standard ANN examples, but also produces representations that exhibit characteristics of symbolic computation. Specifically, the method identifies simple logical relational structures in these data (part-of; next-to), building hierarchical representations that enable abductive inferential steps generating relational position-based encodings, rather than solely statistical representations. Notably, an equivalent set of ANN operations are derived, identifying a special case of embedded vector encodings that may constitute a useful approach to current work in higher-level semantic representation. The very simple current state of the implemented system invites additional tools and improvements.
## Skill Description
This skill is generated from the arXiv paper: A logical re-conception of neural networks: Hamiltonian bitwise part-whole architecture (2602.04911).
## How to Use
[To be filled in by the user or by future automation]
## References
- [arXiv:2602.04911](http://arxiv.org/abs/2602.04911v1)
Is this your skill, or is something wrong with this listing? Request removal or report an issue. Author removals are honored within 72 hours.
No comments yet. Be the first to comment!