{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:XSGOGCZ5DTQL36CJHWLGB46ZOM","short_pith_number":"pith:XSGOGCZ5","canonical_record":{"source":{"id":"2603.05430","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-03-05T17:53:35Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"3175b4b65a254aa15d33002c3b032c7d3f716364880c624023ad148a5a864239","abstract_canon_sha256":"97177f04c794c5ea2c4687a1d3cd0bd661e45b69e6e6aff9188e7c23adbbb4d7"},"schema_version":"1.0"},"canonical_sha256":"bc8ce30b3d1ce0bdf8493d9660f3d9732eb67fb078dc120b3c4147396919730c","source":{"kind":"arxiv","id":"2603.05430","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.05430","created_at":"2026-05-17T23:38:59Z"},{"alias_kind":"arxiv_version","alias_value":"2603.05430v2","created_at":"2026-05-17T23:38:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.05430","created_at":"2026-05-17T23:38:59Z"},{"alias_kind":"pith_short_12","alias_value":"XSGOGCZ5DTQL","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"XSGOGCZ5DTQL36CJ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"XSGOGCZ5","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:XSGOGCZ5DTQL36CJHWLGB46ZOM","target":"record","payload":{"canonical_record":{"source":{"id":"2603.05430","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-03-05T17:53:35Z","cross_cats_sorted":["cond-mat.dis-nn"],"title_canon_sha256":"3175b4b65a254aa15d33002c3b032c7d3f716364880c624023ad148a5a864239","abstract_canon_sha256":"97177f04c794c5ea2c4687a1d3cd0bd661e45b69e6e6aff9188e7c23adbbb4d7"},"schema_version":"1.0"},"canonical_sha256":"bc8ce30b3d1ce0bdf8493d9660f3d9732eb67fb078dc120b3c4147396919730c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:38:59.749555Z","signature_b64":"1moefpYIt2qY2kFrJgNEi/1uqPf9PrTdmm08X6c2ua04lF4ZaHt7xLzMVwEbhPoRGgOpEwq6LDa4KgjJl7DLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc8ce30b3d1ce0bdf8493d9660f3d9732eb67fb078dc120b3c4147396919730c","last_reissued_at":"2026-05-17T23:38:59.748899Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:38:59.748899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2603.05430","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:38:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6HKw0c0jq6EF1eKjHsVRFQuFMN9WuBujTAyFhtNNiwmizL72Ns8fFrIvI7d9Gi2x50AFkUP1qwi31HL1eZ1FCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:12:15.033493Z"},"content_sha256":"952d47f79e1c8e5645ed507836e46bac24209f68d994cd781171b1aaa2fcec03","schema_version":"1.0","event_id":"sha256:952d47f79e1c8e5645ed507836e46bac24209f68d994cd781171b1aaa2fcec03"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:XSGOGCZ5DTQL36CJHWLGB46ZOM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extreme Quantum Cognition Machines for Deliberative Decision Making","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Extreme Quantum Cognition Machines use an input-dependent Hamiltonian term to bias quantum feature maps toward relevant correlations, enabling tolerance to noisy training data in decision tasks.","cross_cats":["cond-mat.dis-nn"],"primary_cat":"quant-ph","authors_text":"Francesco Romeo, Jacopo Settino","submitted_at":"2026-03-05T17:53:35Z","abstract_excerpt":"We introduce Extreme Quantum Cognition Machines, a class of quantum learning architectures for deliberative decision making that is tolerant to noisy and contradictory training data. Inspired by the quantum cognition paradigm, Extreme Quantum Cognition Machines are closely related to quantum extreme learning and quantum reservoir computing, where fixed quantum dynamics generates a nonlinear feature map and learning is confined to a linear readout. A dynamical attention mechanism, implemented through an input-dependent interaction term in the Hamiltonian, modulates the quantum evolution and bia"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We introduce Extreme Quantum Cognition Machines, a class of quantum learning architectures for deliberative decision making that is tolerant to noisy and contradictory training data.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That an input-dependent interaction term in the Hamiltonian can reliably bias the quantum feature embedding toward task-relevant correlations in linguistic classification tasks, without the paper showing that this bias survives hardware noise or outperforms classical attention mechanisms.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Extreme Quantum Cognition Machines combine quantum reservoir-style evolution with a dynamical attention mechanism in the Hamiltonian to produce robust nonlinear embeddings for decision making from noisy training data.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Extreme Quantum Cognition Machines use an input-dependent Hamiltonian term to bias quantum feature maps toward relevant correlations, enabling tolerance to noisy training data in decision tasks.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"e86c47a5fbc4e35dec1633960ac06931fdf44cb34432a49dfeae7e16b13f1179"},"source":{"id":"2603.05430","kind":"arxiv","version":2},"verdict":{"id":"46a635bc-e8e1-448a-99d1-5887de84632a","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T15:58:15.942499Z","strongest_claim":"We introduce Extreme Quantum Cognition Machines, a class of quantum learning architectures for deliberative decision making that is tolerant to noisy and contradictory training data.","one_line_summary":"Extreme Quantum Cognition Machines combine quantum reservoir-style evolution with a dynamical attention mechanism in the Hamiltonian to produce robust nonlinear embeddings for decision making from noisy training data.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That an input-dependent interaction term in the Hamiltonian can reliably bias the quantum feature embedding toward task-relevant correlations in linguistic classification tasks, without the paper showing that this bias survives hardware noise or outperforms classical attention mechanisms.","pith_extraction_headline":"Extreme Quantum Cognition Machines use an input-dependent Hamiltonian term to bias quantum feature maps toward relevant correlations, enabling tolerance to noisy training data in decision tasks."},"references":{"count":61,"sample":[{"doi":"","year":1958,"title":"The perceptron: a probabilistic model for information storage and organization in the brain.Psychological review, 65(6):386","work_id":"499e5269-2720-497d-b8c0-ef06dfe5b098","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1982,"title":"Neural networks and physical systems with emergent collective computational abilities","work_id":"5280c692-7dd1-42c0-8444-41b3a6131cd7","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1985,"title":"Spin-glass models of neural networks","work_id":"07327bb9-a6d4-493c-a3ae-f4945dc2aa05","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1985,"title":"A learning algorithm for boltzmann machines.Cognitive science, 9(1):147–169, 1985","work_id":"6028af13-3da1-496f-b972-7e7f748fdb54","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1943,"title":"A logical calculus of the ideas immanent in nervous activity","work_id":"f86e1a3c-f1ee-45b0-971e-67285759a43e","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":61,"snapshot_sha256":"88a9598f5e8e45cf3d0305612b734a2c17819a573825f6118349d3714fe4888b","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"5f82d43ac64eae6349e14e269a96916696f30b6f2a51e289ca6d75eea57046be"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"46a635bc-e8e1-448a-99d1-5887de84632a"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:38:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jh2L7z3r5uTrLbMomuIuXQ3K4TTmIOtcOuJ0ua0cQnO/jw5wQoZY46h2cJLOFNzELFkOK+di4LpKDQ0HjWhiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:12:15.034882Z"},"content_sha256":"2e98c5b6954a52fc0f1aa1efc8d23e944b8bf616ca6675d65e7b7522a2d919a5","schema_version":"1.0","event_id":"sha256:2e98c5b6954a52fc0f1aa1efc8d23e944b8bf616ca6675d65e7b7522a2d919a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XSGOGCZ5DTQL36CJHWLGB46ZOM/bundle.json","state_url":"https://pith.science/pith/XSGOGCZ5DTQL36CJHWLGB46ZOM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XSGOGCZ5DTQL36CJHWLGB46ZOM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T19:12:15Z","links":{"resolver":"https://pith.science/pith/XSGOGCZ5DTQL36CJHWLGB46ZOM","bundle":"https://pith.science/pith/XSGOGCZ5DTQL36CJHWLGB46ZOM/bundle.json","state":"https://pith.science/pith/XSGOGCZ5DTQL36CJHWLGB46ZOM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XSGOGCZ5DTQL36CJHWLGB46ZOM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XSGOGCZ5DTQL36CJHWLGB46ZOM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"97177f04c794c5ea2c4687a1d3cd0bd661e45b69e6e6aff9188e7c23adbbb4d7","cross_cats_sorted":["cond-mat.dis-nn"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-03-05T17:53:35Z","title_canon_sha256":"3175b4b65a254aa15d33002c3b032c7d3f716364880c624023ad148a5a864239"},"schema_version":"1.0","source":{"id":"2603.05430","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.05430","created_at":"2026-05-17T23:38:59Z"},{"alias_kind":"arxiv_version","alias_value":"2603.05430v2","created_at":"2026-05-17T23:38:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.05430","created_at":"2026-05-17T23:38:59Z"},{"alias_kind":"pith_short_12","alias_value":"XSGOGCZ5DTQL","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"XSGOGCZ5DTQL36CJ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"XSGOGCZ5","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:2e98c5b6954a52fc0f1aa1efc8d23e944b8bf616ca6675d65e7b7522a2d919a5","target":"graph","created_at":"2026-05-17T23:38:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We introduce Extreme Quantum Cognition Machines, a class of quantum learning architectures for deliberative decision making that is tolerant to noisy and contradictory training data."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That an input-dependent interaction term in the Hamiltonian can reliably bias the quantum feature embedding toward task-relevant correlations in linguistic classification tasks, without the paper showing that this bias survives hardware noise or outperforms classical attention mechanisms."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Extreme Quantum Cognition Machines combine quantum reservoir-style evolution with a dynamical attention mechanism in the Hamiltonian to produce robust nonlinear embeddings for decision making from noisy training data."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Extreme Quantum Cognition Machines use an input-dependent Hamiltonian term to bias quantum feature maps toward relevant correlations, enabling tolerance to noisy training data in decision tasks."}],"snapshot_sha256":"e86c47a5fbc4e35dec1633960ac06931fdf44cb34432a49dfeae7e16b13f1179"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"5f82d43ac64eae6349e14e269a96916696f30b6f2a51e289ca6d75eea57046be"},"paper":{"abstract_excerpt":"We introduce Extreme Quantum Cognition Machines, a class of quantum learning architectures for deliberative decision making that is tolerant to noisy and contradictory training data. Inspired by the quantum cognition paradigm, Extreme Quantum Cognition Machines are closely related to quantum extreme learning and quantum reservoir computing, where fixed quantum dynamics generates a nonlinear feature map and learning is confined to a linear readout. A dynamical attention mechanism, implemented through an input-dependent interaction term in the Hamiltonian, modulates the quantum evolution and bia","authors_text":"Francesco Romeo, Jacopo Settino","cross_cats":["cond-mat.dis-nn"],"headline":"Extreme Quantum Cognition Machines use an input-dependent Hamiltonian term to bias quantum feature maps toward relevant correlations, enabling tolerance to noisy training data in decision tasks.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-03-05T17:53:35Z","title":"Extreme Quantum Cognition Machines for Deliberative Decision Making"},"references":{"count":61,"internal_anchors":0,"resolved_work":61,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"The perceptron: a probabilistic model for information storage and organization in the brain.Psychological review, 65(6):386","work_id":"499e5269-2720-497d-b8c0-ef06dfe5b098","year":1958},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Neural networks and physical systems with emergent collective computational abilities","work_id":"5280c692-7dd1-42c0-8444-41b3a6131cd7","year":1982},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Spin-glass models of neural networks","work_id":"07327bb9-a6d4-493c-a3ae-f4945dc2aa05","year":1985},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"A learning algorithm for boltzmann machines.Cognitive science, 9(1):147–169, 1985","work_id":"6028af13-3da1-496f-b972-7e7f748fdb54","year":1985},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"A logical calculus of the ideas immanent in nervous activity","work_id":"f86e1a3c-f1ee-45b0-971e-67285759a43e","year":1943}],"snapshot_sha256":"88a9598f5e8e45cf3d0305612b734a2c17819a573825f6118349d3714fe4888b"},"source":{"id":"2603.05430","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-15T15:58:15.942499Z","id":"46a635bc-e8e1-448a-99d1-5887de84632a","model_set":{"reader":"grok-4.3"},"one_line_summary":"Extreme Quantum Cognition Machines combine quantum reservoir-style evolution with a dynamical attention mechanism in the Hamiltonian to produce robust nonlinear embeddings for decision making from noisy training data.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Extreme Quantum Cognition Machines use an input-dependent Hamiltonian term to bias quantum feature maps toward relevant correlations, enabling tolerance to noisy training data in decision tasks.","strongest_claim":"We introduce Extreme Quantum Cognition Machines, a class of quantum learning architectures for deliberative decision making that is tolerant to noisy and contradictory training data.","weakest_assumption":"That an input-dependent interaction term in the Hamiltonian can reliably bias the quantum feature embedding toward task-relevant correlations in linguistic classification tasks, without the paper showing that this bias survives hardware noise or outperforms classical attention mechanisms."}},"verdict_id":"46a635bc-e8e1-448a-99d1-5887de84632a"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:952d47f79e1c8e5645ed507836e46bac24209f68d994cd781171b1aaa2fcec03","target":"record","created_at":"2026-05-17T23:38:59Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"97177f04c794c5ea2c4687a1d3cd0bd661e45b69e6e6aff9188e7c23adbbb4d7","cross_cats_sorted":["cond-mat.dis-nn"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-03-05T17:53:35Z","title_canon_sha256":"3175b4b65a254aa15d33002c3b032c7d3f716364880c624023ad148a5a864239"},"schema_version":"1.0","source":{"id":"2603.05430","kind":"arxiv","version":2}},"canonical_sha256":"bc8ce30b3d1ce0bdf8493d9660f3d9732eb67fb078dc120b3c4147396919730c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc8ce30b3d1ce0bdf8493d9660f3d9732eb67fb078dc120b3c4147396919730c","first_computed_at":"2026-05-17T23:38:59.748899Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:38:59.748899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1moefpYIt2qY2kFrJgNEi/1uqPf9PrTdmm08X6c2ua04lF4ZaHt7xLzMVwEbhPoRGgOpEwq6LDa4KgjJl7DLCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:38:59.749555Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.05430","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:952d47f79e1c8e5645ed507836e46bac24209f68d994cd781171b1aaa2fcec03","sha256:2e98c5b6954a52fc0f1aa1efc8d23e944b8bf616ca6675d65e7b7522a2d919a5"],"state_sha256":"e4f0e8087346328dc3ad0bac6cbd3f277ae871babd7f9c3aaafb5fd239395c04"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"imCnWndIHMqRCGif0XYNeaIyg8UOAZ56VJO3FahgqXMrkRml/yPskfkLpu7obkDd/P/4e6VwcFcQYB6yyKDEAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T19:12:15.039873Z","bundle_sha256":"4947a8116c1aee59d44ac0c021787858ee11b4ac5d200fadd27e76d206c906a3"}}