{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:TFJBYUSRCD4M33A6MQC6X3IGEZ","short_pith_number":"pith:TFJBYUSR","canonical_record":{"source":{"id":"2306.01940","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2023-06-02T22:47:18Z","cross_cats_sorted":["cs.CV","cs.ET","cs.LG"],"title_canon_sha256":"f2d4dde7a4adf1d5a8b05f2c42424b900f6374cc247290ed21b40ea525e2387d","abstract_canon_sha256":"d82b8cf2837668b8bcc1e5332eeefab6867d3b84b26e189d04024b129c09c1b1"},"schema_version":"1.0"},"canonical_sha256":"99521c525110f8cdec1e6405ebed06265525e6738f813e258af7205a24851343","source":{"kind":"arxiv","id":"2306.01940","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.01940","created_at":"2026-07-05T07:16:42Z"},{"alias_kind":"arxiv_version","alias_value":"2306.01940v2","created_at":"2026-07-05T07:16:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.01940","created_at":"2026-07-05T07:16:42Z"},{"alias_kind":"pith_short_12","alias_value":"TFJBYUSRCD4M","created_at":"2026-07-05T07:16:42Z"},{"alias_kind":"pith_short_16","alias_value":"TFJBYUSRCD4M33A6","created_at":"2026-07-05T07:16:42Z"},{"alias_kind":"pith_short_8","alias_value":"TFJBYUSR","created_at":"2026-07-05T07:16:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:TFJBYUSRCD4M33A6MQC6X3IGEZ","target":"record","payload":{"canonical_record":{"source":{"id":"2306.01940","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2023-06-02T22:47:18Z","cross_cats_sorted":["cs.CV","cs.ET","cs.LG"],"title_canon_sha256":"f2d4dde7a4adf1d5a8b05f2c42424b900f6374cc247290ed21b40ea525e2387d","abstract_canon_sha256":"d82b8cf2837668b8bcc1e5332eeefab6867d3b84b26e189d04024b129c09c1b1"},"schema_version":"1.0"},"canonical_sha256":"99521c525110f8cdec1e6405ebed06265525e6738f813e258af7205a24851343","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:16:42.510115Z","signature_b64":"fLokQOtIFKuJvEFZSIivlX6l2ROKWjfdOgaYHHIaHBRM2K0++VgJAyCvSzl0y6Dmvsihwvmn/FwNIB97WvvDCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99521c525110f8cdec1e6405ebed06265525e6738f813e258af7205a24851343","last_reissued_at":"2026-07-05T07:16:42.509664Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:16:42.509664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2306.01940","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-07-05T07:16:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ng7EzjsySbJ//twPr3U8nGUh9LdLfVaJLf5IdiY+j5RVy+kWtR6M9qvuVqDA2JgOXB3mD/JBlHqupNPmOCV0DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:57:11.736859Z"},"content_sha256":"c9a22382f045bd38763abe326475436cd7fd151e092a0656aa9928634788d08d","schema_version":"1.0","event_id":"sha256:c9a22382f045bd38763abe326475436cd7fd151e092a0656aa9928634788d08d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:TFJBYUSRCD4M33A6MQC6X3IGEZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sampling binary sparse coding QUBO models using a spiking neuromorphic processor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.ET","cs.LG"],"primary_cat":"cs.NE","authors_text":"Elijah Pelofske, Garrett T. Kenyon, Georg Hahn, Kyle Henke","submitted_at":"2023-06-02T22:47:18Z","abstract_excerpt":"We consider the problem of computing a sparse binary representation of an image. To be precise, given an image and an overcomplete, non-orthonormal basis, we aim to find a sparse binary vector indicating the minimal set of basis vectors that when added together best reconstruct the given input. We formulate this problem with an $L_2$ loss on the reconstruction error, and an $L_0$ (or, equivalently, an $L_1$) loss on the binary vector enforcing sparsity. This yields a so-called Quadratic Unconstrained Binary Optimization (QUBO) problem, whose solution is generally NP-hard to find. The contribut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.01940","kind":"arxiv","version":2},"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/2306.01940/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:16:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9u0FC7qgDcJEJBwpXrqL1WZEQxAbHnHPsHRKHNpnwpi+KaTXsgwj0mv/1IdATZVQPrjObrwZVpoNdA1tjf7XCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T11:57:11.737235Z"},"content_sha256":"7445d2a1ec480f5b1ed774fb14740858e3db9da8e75850a25d4f831275332329","schema_version":"1.0","event_id":"sha256:7445d2a1ec480f5b1ed774fb14740858e3db9da8e75850a25d4f831275332329"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TFJBYUSRCD4M33A6MQC6X3IGEZ/bundle.json","state_url":"https://pith.science/pith/TFJBYUSRCD4M33A6MQC6X3IGEZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TFJBYUSRCD4M33A6MQC6X3IGEZ/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-07-07T11:57:11Z","links":{"resolver":"https://pith.science/pith/TFJBYUSRCD4M33A6MQC6X3IGEZ","bundle":"https://pith.science/pith/TFJBYUSRCD4M33A6MQC6X3IGEZ/bundle.json","state":"https://pith.science/pith/TFJBYUSRCD4M33A6MQC6X3IGEZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TFJBYUSRCD4M33A6MQC6X3IGEZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:TFJBYUSRCD4M33A6MQC6X3IGEZ","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":"d82b8cf2837668b8bcc1e5332eeefab6867d3b84b26e189d04024b129c09c1b1","cross_cats_sorted":["cs.CV","cs.ET","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2023-06-02T22:47:18Z","title_canon_sha256":"f2d4dde7a4adf1d5a8b05f2c42424b900f6374cc247290ed21b40ea525e2387d"},"schema_version":"1.0","source":{"id":"2306.01940","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.01940","created_at":"2026-07-05T07:16:42Z"},{"alias_kind":"arxiv_version","alias_value":"2306.01940v2","created_at":"2026-07-05T07:16:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.01940","created_at":"2026-07-05T07:16:42Z"},{"alias_kind":"pith_short_12","alias_value":"TFJBYUSRCD4M","created_at":"2026-07-05T07:16:42Z"},{"alias_kind":"pith_short_16","alias_value":"TFJBYUSRCD4M33A6","created_at":"2026-07-05T07:16:42Z"},{"alias_kind":"pith_short_8","alias_value":"TFJBYUSR","created_at":"2026-07-05T07:16:42Z"}],"graph_snapshots":[{"event_id":"sha256:7445d2a1ec480f5b1ed774fb14740858e3db9da8e75850a25d4f831275332329","target":"graph","created_at":"2026-07-05T07:16:42Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2306.01940/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of computing a sparse binary representation of an image. To be precise, given an image and an overcomplete, non-orthonormal basis, we aim to find a sparse binary vector indicating the minimal set of basis vectors that when added together best reconstruct the given input. We formulate this problem with an $L_2$ loss on the reconstruction error, and an $L_0$ (or, equivalently, an $L_1$) loss on the binary vector enforcing sparsity. This yields a so-called Quadratic Unconstrained Binary Optimization (QUBO) problem, whose solution is generally NP-hard to find. The contribut","authors_text":"Elijah Pelofske, Garrett T. Kenyon, Georg Hahn, Kyle Henke","cross_cats":["cs.CV","cs.ET","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2023-06-02T22:47:18Z","title":"Sampling binary sparse coding QUBO models using a spiking neuromorphic processor"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.01940","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c9a22382f045bd38763abe326475436cd7fd151e092a0656aa9928634788d08d","target":"record","created_at":"2026-07-05T07:16:42Z","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":"d82b8cf2837668b8bcc1e5332eeefab6867d3b84b26e189d04024b129c09c1b1","cross_cats_sorted":["cs.CV","cs.ET","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2023-06-02T22:47:18Z","title_canon_sha256":"f2d4dde7a4adf1d5a8b05f2c42424b900f6374cc247290ed21b40ea525e2387d"},"schema_version":"1.0","source":{"id":"2306.01940","kind":"arxiv","version":2}},"canonical_sha256":"99521c525110f8cdec1e6405ebed06265525e6738f813e258af7205a24851343","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99521c525110f8cdec1e6405ebed06265525e6738f813e258af7205a24851343","first_computed_at":"2026-07-05T07:16:42.509664Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:16:42.509664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fLokQOtIFKuJvEFZSIivlX6l2ROKWjfdOgaYHHIaHBRM2K0++VgJAyCvSzl0y6Dmvsihwvmn/FwNIB97WvvDCA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:16:42.510115Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.01940","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9a22382f045bd38763abe326475436cd7fd151e092a0656aa9928634788d08d","sha256:7445d2a1ec480f5b1ed774fb14740858e3db9da8e75850a25d4f831275332329"],"state_sha256":"163546e8d6dd8624c50444143ac2fe36aba4bba9c982f76d8e0bfa557655b634"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zwvfhzleE2TMT0tjoZCiKKk3d3Km2F6GI6woW4TiN70W1TIiKmJ+bc0H0CKA9N2zVOFFv15NgGtDgAbkULZUBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T11:57:11.739196Z","bundle_sha256":"a64f0d3726edf27f549a157b944e3e89ba768f519b66534ebcd48059efce9f9f"}}