{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:6J2AWHHBMW4SRPNB3SQLH4YAV5","short_pith_number":"pith:6J2AWHHB","schema_version":"1.0","canonical_sha256":"f2740b1ce165b928bda1dca0b3f300af68ed1a1324d77e08e5ab6baffcbfd2ec","source":{"kind":"arxiv","id":"2605.24611","version":1},"attestation_state":"computed","paper":{"title":"Beyond Fixed Points: Superpolynomial Capacity of Asymmetric Hopfield Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aakash Kumar, Anatoly Khina, Emanuele Natale, Frederik Mallmann-Trenn","submitted_at":"2026-05-23T14:46:49Z","abstract_excerpt":"Classical Hopfield networks are limited to static patterns due to symmetric weights, whereas asymmetric networks can encode temporal sequences via limit-cycle attractors. Achieving high-capacity storage of long sequences in classical synchronous asymmetric networks, however, has remained a challenge. We present a simple and robust construction within the classical asymmetric Hopfield model with binary neurons and synchronous updates, that allows $n$ neurons to support $\\exp\\!\\big(\\Omega(n/(\\log n)^2)\\big)$ distinct limit-cycle attractors, each with period $\\exp\\!\\big(\\Omega(\\sqrt n/\\log n)\\big"},"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":"2605.24611","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-23T14:46:49Z","cross_cats_sorted":[],"title_canon_sha256":"2544470cf10afbe5ac5be00e7bef9e031cf07592babdffd26bfdd587c403fd0c","abstract_canon_sha256":"f96e394cbde03aafe5f75274b39ac5d20e4baf41fa79c693b7107b2309024e22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:03:48.874340Z","signature_b64":"K+Fx/6N6KcoDhsfVk+fnRlBv30E9odQwegQwt7dvfHmOLClVM83m9iBUZN7WPrTOiwXY6fTqo4mlg2BJzbBdAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2740b1ce165b928bda1dca0b3f300af68ed1a1324d77e08e5ab6baffcbfd2ec","last_reissued_at":"2026-05-26T01:03:48.873475Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:03:48.873475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond Fixed Points: Superpolynomial Capacity of Asymmetric Hopfield Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Aakash Kumar, Anatoly Khina, Emanuele Natale, Frederik Mallmann-Trenn","submitted_at":"2026-05-23T14:46:49Z","abstract_excerpt":"Classical Hopfield networks are limited to static patterns due to symmetric weights, whereas asymmetric networks can encode temporal sequences via limit-cycle attractors. Achieving high-capacity storage of long sequences in classical synchronous asymmetric networks, however, has remained a challenge. We present a simple and robust construction within the classical asymmetric Hopfield model with binary neurons and synchronous updates, that allows $n$ neurons to support $\\exp\\!\\big(\\Omega(n/(\\log n)^2)\\big)$ distinct limit-cycle attractors, each with period $\\exp\\!\\big(\\Omega(\\sqrt n/\\log n)\\big"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.24611","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/2605.24611/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":"2605.24611","created_at":"2026-05-26T01:03:48.873630+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.24611v1","created_at":"2026-05-26T01:03:48.873630+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.24611","created_at":"2026-05-26T01:03:48.873630+00:00"},{"alias_kind":"pith_short_12","alias_value":"6J2AWHHBMW4S","created_at":"2026-05-26T01:03:48.873630+00:00"},{"alias_kind":"pith_short_16","alias_value":"6J2AWHHBMW4SRPNB","created_at":"2026-05-26T01:03:48.873630+00:00"},{"alias_kind":"pith_short_8","alias_value":"6J2AWHHB","created_at":"2026-05-26T01:03:48.873630+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/6J2AWHHBMW4SRPNB3SQLH4YAV5","json":"https://pith.science/pith/6J2AWHHBMW4SRPNB3SQLH4YAV5.json","graph_json":"https://pith.science/api/pith-number/6J2AWHHBMW4SRPNB3SQLH4YAV5/graph.json","events_json":"https://pith.science/api/pith-number/6J2AWHHBMW4SRPNB3SQLH4YAV5/events.json","paper":"https://pith.science/paper/6J2AWHHB"},"agent_actions":{"view_html":"https://pith.science/pith/6J2AWHHBMW4SRPNB3SQLH4YAV5","download_json":"https://pith.science/pith/6J2AWHHBMW4SRPNB3SQLH4YAV5.json","view_paper":"https://pith.science/paper/6J2AWHHB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.24611&json=true","fetch_graph":"https://pith.science/api/pith-number/6J2AWHHBMW4SRPNB3SQLH4YAV5/graph.json","fetch_events":"https://pith.science/api/pith-number/6J2AWHHBMW4SRPNB3SQLH4YAV5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6J2AWHHBMW4SRPNB3SQLH4YAV5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6J2AWHHBMW4SRPNB3SQLH4YAV5/action/storage_attestation","attest_author":"https://pith.science/pith/6J2AWHHBMW4SRPNB3SQLH4YAV5/action/author_attestation","sign_citation":"https://pith.science/pith/6J2AWHHBMW4SRPNB3SQLH4YAV5/action/citation_signature","submit_replication":"https://pith.science/pith/6J2AWHHBMW4SRPNB3SQLH4YAV5/action/replication_record"}},"created_at":"2026-05-26T01:03:48.873630+00:00","updated_at":"2026-05-26T01:03:48.873630+00:00"}