{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DGTI2YUORCVIURWATML6KDC5HL","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":"fec90ecd5f67d02235a0567794dcd4f141ad7875a0e349c5a74198427d738815","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","math.IT","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-04T09:49:46Z","title_canon_sha256":"9fbe326c5b8a96c1d0c38ead2f20871c99ee5209c45d7c7730be1413fa16c682"},"schema_version":"1.0","source":{"id":"1603.01399","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01399","created_at":"2026-05-18T01:03:19Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01399v2","created_at":"2026-05-18T01:03:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01399","created_at":"2026-05-18T01:03:19Z"},{"alias_kind":"pith_short_12","alias_value":"DGTI2YUORCVI","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DGTI2YUORCVIURWA","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DGTI2YUO","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:5e42b06687f2d5406b8bacc847a3639f682a4c2e04a813d4ac93c15c16964ef7","target":"graph","created_at":"2026-05-18T01:03:19Z","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":"The approximation of a high-dimensional vector by a small combination of column vectors selected from a fixed matrix has been actively debated in several different disciplines. In this paper, a sampling approach based on the Monte Carlo method is presented as an efficient solver for such problems. Especially, the use of simulated annealing (SA), a metaheuristic optimization algorithm, for determining degrees of freedom (the number of used columns) by cross validation is focused on and tested. Test on a synthetic model indicates that our SA-based approach can find a nearly optimal solution for ","authors_text":"Tomoyuki Obuchi, Yoshiyuki Kabashima","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","math.IT","stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-04T09:49:46Z","title":"Sampling approach to sparse approximation problem: determining degrees of freedom by simulated annealing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01399","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:2a48e30ef6243d78feed39a23aa229629a52cfe284c04d9f768b803f253b9321","target":"record","created_at":"2026-05-18T01:03:19Z","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":"fec90ecd5f67d02235a0567794dcd4f141ad7875a0e349c5a74198427d738815","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","math.IT","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-04T09:49:46Z","title_canon_sha256":"9fbe326c5b8a96c1d0c38ead2f20871c99ee5209c45d7c7730be1413fa16c682"},"schema_version":"1.0","source":{"id":"1603.01399","kind":"arxiv","version":2}},"canonical_sha256":"19a68d628e88aa8a46c09b17e50c5d3afe73b418d20a80af1d5a30ebc2bf0981","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"19a68d628e88aa8a46c09b17e50c5d3afe73b418d20a80af1d5a30ebc2bf0981","first_computed_at":"2026-05-18T01:03:19.606759Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:19.606759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xOIrMAGalGq0iiGELuzw/+TS9gANGHxO8VxMV9gC93E1u/zuqWUvjjg9TMnAmroOPWoBT5UYmkLFBHS8/trRAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:19.607351Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.01399","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a48e30ef6243d78feed39a23aa229629a52cfe284c04d9f768b803f253b9321","sha256:5e42b06687f2d5406b8bacc847a3639f682a4c2e04a813d4ac93c15c16964ef7"],"state_sha256":"afa3ed2efa67b681a41bb8e781c7911bbb58a4eb3563d64ec32651aaae1b3c7b"}