{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VXXW6EXHYZFLCKRILHIENGFPJS","short_pith_number":"pith:VXXW6EXH","schema_version":"1.0","canonical_sha256":"adef6f12e7c64ab12a2859d04698af4c9219e8e7097cf5eea4290eb4739ceac4","source":{"kind":"arxiv","id":"1601.01074","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1601.01074","created_at":"2026-05-18T01:15:51.502682+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.01074v2","created_at":"2026-05-18T01:15:51.502682+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01074","created_at":"2026-05-18T01:15:51.502682+00:00"},{"alias_kind":"pith_short_12","alias_value":"VXXW6EXHYZFL","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VXXW6EXHYZFLCKRI","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VXXW6EXH","created_at":"2026-05-18T12:30:48.956258+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/VXXW6EXHYZFLCKRILHIENGFPJS","json":"https://pith.science/pith/VXXW6EXHYZFLCKRILHIENGFPJS.json","graph_json":"https://pith.science/api/pith-number/VXXW6EXHYZFLCKRILHIENGFPJS/graph.json","events_json":"https://pith.science/api/pith-number/VXXW6EXHYZFLCKRILHIENGFPJS/events.json","paper":"https://pith.science/paper/VXXW6EXH"},"agent_actions":{"view_html":"https://pith.science/pith/VXXW6EXHYZFLCKRILHIENGFPJS","download_json":"https://pith.science/pith/VXXW6EXHYZFLCKRILHIENGFPJS.json","view_paper":"https://pith.science/paper/VXXW6EXH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.01074&json=true","fetch_graph":"https://pith.science/api/pith-number/VXXW6EXHYZFLCKRILHIENGFPJS/graph.json","fetch_events":"https://pith.science/api/pith-number/VXXW6EXHYZFLCKRILHIENGFPJS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VXXW6EXHYZFLCKRILHIENGFPJS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VXXW6EXHYZFLCKRILHIENGFPJS/action/storage_attestation","attest_author":"https://pith.science/pith/VXXW6EXHYZFLCKRILHIENGFPJS/action/author_attestation","sign_citation":"https://pith.science/pith/VXXW6EXHYZFLCKRILHIENGFPJS/action/citation_signature","submit_replication":"https://pith.science/pith/VXXW6EXHYZFLCKRILHIENGFPJS/action/replication_record"}},"created_at":"2026-05-18T01:15:51.502682+00:00","updated_at":"2026-05-18T01:15:51.502682+00:00"}