{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:PJEUZHXN2SJP7ZSUSPXK3UNOF5","short_pith_number":"pith:PJEUZHXN","schema_version":"1.0","canonical_sha256":"7a494c9eedd492ffe65493eeadd1ae2f660b812ee3c73a140d86c8181b525402","source":{"kind":"arxiv","id":"2401.14885","version":3},"attestation_state":"computed","paper":{"title":"Neuromorphic quadratic programming for efficient and scalable model predictive control","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET","cs.RO"],"primary_cat":"cs.NE","authors_text":"Andreas Wild, Ashish Rao Mangalore, Gabriel Andres Fonseca Guerra, Philipp Stratmann, Sumedh R. Risbud","submitted_at":"2024-01-26T14:12:35Z","abstract_excerpt":"Applications in robotics or other size-, weight- and power-constrained autonomous systems at the edge often require real-time and low-energy solutions to large optimization problems. Event-based and memory-integrated neuromorphic architectures promise to solve such optimization problems with superior energy efficiency and performance compared to conventional von Neumann architectures. Here, we present a method to solve convex continuous optimization problems with quadratic cost functions and linear constraints on Intel's scalable neuromorphic research chip Loihi 2. When applied to model predic"},"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":"2401.14885","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2024-01-26T14:12:35Z","cross_cats_sorted":["cs.ET","cs.RO"],"title_canon_sha256":"80750b65dfc49109476f974fa60f68cd7c15b7b49cd36f6e36ad465e2035d32b","abstract_canon_sha256":"4fdd2a007ba51dd64a7a50baa2ee68a3ce589ff00f9932835aad5e49f53c8a6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:34:11.900263Z","signature_b64":"xh4TZ0SG77KBvr9Ar1ZweeoexsZnZdJ4ImPDY/YoEAWlOD3zGgOb9iLQU8CjjBrzdbdf9MB6csAOgS2SIev/Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a494c9eedd492ffe65493eeadd1ae2f660b812ee3c73a140d86c8181b525402","last_reissued_at":"2026-07-05T08:34:11.899765Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:34:11.899765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neuromorphic quadratic programming for efficient and scalable model predictive control","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET","cs.RO"],"primary_cat":"cs.NE","authors_text":"Andreas Wild, Ashish Rao Mangalore, Gabriel Andres Fonseca Guerra, Philipp Stratmann, Sumedh R. Risbud","submitted_at":"2024-01-26T14:12:35Z","abstract_excerpt":"Applications in robotics or other size-, weight- and power-constrained autonomous systems at the edge often require real-time and low-energy solutions to large optimization problems. Event-based and memory-integrated neuromorphic architectures promise to solve such optimization problems with superior energy efficiency and performance compared to conventional von Neumann architectures. Here, we present a method to solve convex continuous optimization problems with quadratic cost functions and linear constraints on Intel's scalable neuromorphic research chip Loihi 2. When applied to model predic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.14885","kind":"arxiv","version":3},"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/2401.14885/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":"2401.14885","created_at":"2026-07-05T08:34:11.899827+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.14885v3","created_at":"2026-07-05T08:34:11.899827+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.14885","created_at":"2026-07-05T08:34:11.899827+00:00"},{"alias_kind":"pith_short_12","alias_value":"PJEUZHXN2SJP","created_at":"2026-07-05T08:34:11.899827+00:00"},{"alias_kind":"pith_short_16","alias_value":"PJEUZHXN2SJP7ZSU","created_at":"2026-07-05T08:34:11.899827+00:00"},{"alias_kind":"pith_short_8","alias_value":"PJEUZHXN","created_at":"2026-07-05T08:34:11.899827+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.14191","citing_title":"Optimal Preconditioning for Online Quadratic Cone Programming","ref_index":39,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PJEUZHXN2SJP7ZSUSPXK3UNOF5","json":"https://pith.science/pith/PJEUZHXN2SJP7ZSUSPXK3UNOF5.json","graph_json":"https://pith.science/api/pith-number/PJEUZHXN2SJP7ZSUSPXK3UNOF5/graph.json","events_json":"https://pith.science/api/pith-number/PJEUZHXN2SJP7ZSUSPXK3UNOF5/events.json","paper":"https://pith.science/paper/PJEUZHXN"},"agent_actions":{"view_html":"https://pith.science/pith/PJEUZHXN2SJP7ZSUSPXK3UNOF5","download_json":"https://pith.science/pith/PJEUZHXN2SJP7ZSUSPXK3UNOF5.json","view_paper":"https://pith.science/paper/PJEUZHXN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.14885&json=true","fetch_graph":"https://pith.science/api/pith-number/PJEUZHXN2SJP7ZSUSPXK3UNOF5/graph.json","fetch_events":"https://pith.science/api/pith-number/PJEUZHXN2SJP7ZSUSPXK3UNOF5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PJEUZHXN2SJP7ZSUSPXK3UNOF5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PJEUZHXN2SJP7ZSUSPXK3UNOF5/action/storage_attestation","attest_author":"https://pith.science/pith/PJEUZHXN2SJP7ZSUSPXK3UNOF5/action/author_attestation","sign_citation":"https://pith.science/pith/PJEUZHXN2SJP7ZSUSPXK3UNOF5/action/citation_signature","submit_replication":"https://pith.science/pith/PJEUZHXN2SJP7ZSUSPXK3UNOF5/action/replication_record"}},"created_at":"2026-07-05T08:34:11.899827+00:00","updated_at":"2026-07-05T08:34:11.899827+00:00"}