{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VXXW6EXHYZFLCKRILHIENGFPJS","short_pith_number":"pith:VXXW6EXH","canonical_record":{"source":{"id":"1601.01074","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-06T04:15:04Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","math.IT"],"title_canon_sha256":"c03bbb17f833a7245aa3d23036d42280ef042c9da484dcce37e35bdb08ebc244","abstract_canon_sha256":"f826161ebded721b3ffceee8e03aba4b58234251083b056864dff1a54d9adf4b"},"schema_version":"1.0"},"canonical_sha256":"adef6f12e7c64ab12a2859d04698af4c9219e8e7097cf5eea4290eb4739ceac4","source":{"kind":"arxiv","id":"1601.01074","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.01074","created_at":"2026-05-18T01:15:51Z"},{"alias_kind":"arxiv_version","alias_value":"1601.01074v2","created_at":"2026-05-18T01:15:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01074","created_at":"2026-05-18T01:15:51Z"},{"alias_kind":"pith_short_12","alias_value":"VXXW6EXHYZFL","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VXXW6EXHYZFLCKRI","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VXXW6EXH","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VXXW6EXHYZFLCKRILHIENGFPJS","target":"record","payload":{"canonical_record":{"source":{"id":"1601.01074","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-06T04:15:04Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","math.IT"],"title_canon_sha256":"c03bbb17f833a7245aa3d23036d42280ef042c9da484dcce37e35bdb08ebc244","abstract_canon_sha256":"f826161ebded721b3ffceee8e03aba4b58234251083b056864dff1a54d9adf4b"},"schema_version":"1.0"},"canonical_sha256":"adef6f12e7c64ab12a2859d04698af4c9219e8e7097cf5eea4290eb4739ceac4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:51.503055Z","signature_b64":"4FjhQJyVghQc7YcvH8CzNziHnZvlTSDXjYGVJcxwykcpEt7XrZr2pc51nRfNZwymZi2w90doPgiKUOfNwznnDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"adef6f12e7c64ab12a2859d04698af4c9219e8e7097cf5eea4290eb4739ceac4","last_reissued_at":"2026-05-18T01:15:51.502609Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:51.502609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.01074","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-18T01:15:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"46akWZ2U6zqoY11PeiieZdhuypGAmCWx5JzcxBsdlTeIHn5IFrBPZqXanHiBPQsfo4nxzVRwMqVgykvIu1OFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:16:05.551117Z"},"content_sha256":"92ad8c5f568082ffae623d3d9c9189ca2f90c6cb1f83bbfb8db65d77a4745e31","schema_version":"1.0","event_id":"sha256:92ad8c5f568082ffae623d3d9c9189ca2f90c6cb1f83bbfb8db65d77a4745e31"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VXXW6EXHYZFLCKRILHIENGFPJS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse approximation problem: how rapid simulated annealing succeeds and fails","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","math.IT"],"primary_cat":"cs.IT","authors_text":"Tomoyuki Obuchi, Yoshiyuki Kabashima","submitted_at":"2016-01-06T04:15:04Z","abstract_excerpt":"Information processing techniques based on sparseness have been actively studied in several disciplines. Among them, a mathematical framework to approximately express a given dataset by a combination of a small number of basis vectors of an overcomplete basis is termed the {\\em sparse approximation}. In this paper, we apply simulated annealing, a metaheuristic algorithm for general optimization problems, to sparse approximation in the situation where the given data have a planted sparse representation and noise is present. The result in the noiseless case shows that our simulated annealing wor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01074","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":""},"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-05-18T01:15:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VrvgQ1uI4xKdQ2vO9iIylJI3xziMHApRd5/mf+QTkUD8EVS3iGHmFbJy6SaQia/MjzGBvDWnk0afVsb9WYUXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:16:05.551529Z"},"content_sha256":"532a4adeddd8830ff2fbbc68edc3125f298ac619856191532210f37c59177fb8","schema_version":"1.0","event_id":"sha256:532a4adeddd8830ff2fbbc68edc3125f298ac619856191532210f37c59177fb8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VXXW6EXHYZFLCKRILHIENGFPJS/bundle.json","state_url":"https://pith.science/pith/VXXW6EXHYZFLCKRILHIENGFPJS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VXXW6EXHYZFLCKRILHIENGFPJS/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-04T19:16:05Z","links":{"resolver":"https://pith.science/pith/VXXW6EXHYZFLCKRILHIENGFPJS","bundle":"https://pith.science/pith/VXXW6EXHYZFLCKRILHIENGFPJS/bundle.json","state":"https://pith.science/pith/VXXW6EXHYZFLCKRILHIENGFPJS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VXXW6EXHYZFLCKRILHIENGFPJS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VXXW6EXHYZFLCKRILHIENGFPJS","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":"f826161ebded721b3ffceee8e03aba4b58234251083b056864dff1a54d9adf4b","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-06T04:15:04Z","title_canon_sha256":"c03bbb17f833a7245aa3d23036d42280ef042c9da484dcce37e35bdb08ebc244"},"schema_version":"1.0","source":{"id":"1601.01074","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.01074","created_at":"2026-05-18T01:15:51Z"},{"alias_kind":"arxiv_version","alias_value":"1601.01074v2","created_at":"2026-05-18T01:15:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01074","created_at":"2026-05-18T01:15:51Z"},{"alias_kind":"pith_short_12","alias_value":"VXXW6EXHYZFL","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VXXW6EXHYZFLCKRI","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VXXW6EXH","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:532a4adeddd8830ff2fbbc68edc3125f298ac619856191532210f37c59177fb8","target":"graph","created_at":"2026-05-18T01:15:51Z","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"},"paper":{"abstract_excerpt":"Information processing techniques based on sparseness have been actively studied in several disciplines. Among them, a mathematical framework to approximately express a given dataset by a combination of a small number of basis vectors of an overcomplete basis is termed the {\\em sparse approximation}. In this paper, we apply simulated annealing, a metaheuristic algorithm for general optimization problems, to sparse approximation in the situation where the given data have a planted sparse representation and noise is present. The result in the noiseless case shows that our simulated annealing wor","authors_text":"Tomoyuki Obuchi, Yoshiyuki Kabashima","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-06T04:15:04Z","title":"Sparse approximation problem: how rapid simulated annealing succeeds and fails"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01074","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:92ad8c5f568082ffae623d3d9c9189ca2f90c6cb1f83bbfb8db65d77a4745e31","target":"record","created_at":"2026-05-18T01:15:51Z","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":"f826161ebded721b3ffceee8e03aba4b58234251083b056864dff1a54d9adf4b","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-01-06T04:15:04Z","title_canon_sha256":"c03bbb17f833a7245aa3d23036d42280ef042c9da484dcce37e35bdb08ebc244"},"schema_version":"1.0","source":{"id":"1601.01074","kind":"arxiv","version":2}},"canonical_sha256":"adef6f12e7c64ab12a2859d04698af4c9219e8e7097cf5eea4290eb4739ceac4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"adef6f12e7c64ab12a2859d04698af4c9219e8e7097cf5eea4290eb4739ceac4","first_computed_at":"2026-05-18T01:15:51.502609Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:51.502609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4FjhQJyVghQc7YcvH8CzNziHnZvlTSDXjYGVJcxwykcpEt7XrZr2pc51nRfNZwymZi2w90doPgiKUOfNwznnDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:51.503055Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.01074","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92ad8c5f568082ffae623d3d9c9189ca2f90c6cb1f83bbfb8db65d77a4745e31","sha256:532a4adeddd8830ff2fbbc68edc3125f298ac619856191532210f37c59177fb8"],"state_sha256":"8bcf208ca8d2adf6865199f1b2c7dcaefa85e8b576d114922f74b481ff2e6a93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0lRFP15IRXahf3KeNc5NwhPYmVyi/sKfiSWIUp0HiXQx8Gu6OSr+kbOHsLZbuq/ZbAHxVRuSJxajdrwXp/hgAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T19:16:05.553632Z","bundle_sha256":"adaef021d102f5d9883b859eabc6dc04a6809c70421f2857359ae979501856ca"}}