{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:DGTI2YUORCVIURWATML6KDC5HL","short_pith_number":"pith:DGTI2YUO","canonical_record":{"source":{"id":"1603.01399","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-04T09:49:46Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","math.IT","stat.ME"],"title_canon_sha256":"9fbe326c5b8a96c1d0c38ead2f20871c99ee5209c45d7c7730be1413fa16c682","abstract_canon_sha256":"fec90ecd5f67d02235a0567794dcd4f141ad7875a0e349c5a74198427d738815"},"schema_version":"1.0"},"canonical_sha256":"19a68d628e88aa8a46c09b17e50c5d3afe73b418d20a80af1d5a30ebc2bf0981","source":{"kind":"arxiv","id":"1603.01399","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:DGTI2YUORCVIURWATML6KDC5HL","target":"record","payload":{"canonical_record":{"source":{"id":"1603.01399","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-04T09:49:46Z","cross_cats_sorted":["cond-mat.dis-nn","cond-mat.stat-mech","math.IT","stat.ME"],"title_canon_sha256":"9fbe326c5b8a96c1d0c38ead2f20871c99ee5209c45d7c7730be1413fa16c682","abstract_canon_sha256":"fec90ecd5f67d02235a0567794dcd4f141ad7875a0e349c5a74198427d738815"},"schema_version":"1.0"},"canonical_sha256":"19a68d628e88aa8a46c09b17e50c5d3afe73b418d20a80af1d5a30ebc2bf0981","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:19.607351Z","signature_b64":"xOIrMAGalGq0iiGELuzw/+TS9gANGHxO8VxMV9gC93E1u/zuqWUvjjg9TMnAmroOPWoBT5UYmkLFBHS8/trRAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19a68d628e88aa8a46c09b17e50c5d3afe73b418d20a80af1d5a30ebc2bf0981","last_reissued_at":"2026-05-18T01:03:19.606759Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:19.606759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.01399","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:03:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vqo0ETtPplItbBDWsxfF9jmjJCTUIsjksViYww599xDeYu30pp/jmEl7hgl/P21i3tZkR7xVl6tKhXWtKabJAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:26:39.529816Z"},"content_sha256":"2a48e30ef6243d78feed39a23aa229629a52cfe284c04d9f768b803f253b9321","schema_version":"1.0","event_id":"sha256:2a48e30ef6243d78feed39a23aa229629a52cfe284c04d9f768b803f253b9321"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:DGTI2YUORCVIURWATML6KDC5HL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sampling approach to sparse approximation problem: determining degrees of freedom by simulated annealing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cond-mat.stat-mech","math.IT","stat.ME"],"primary_cat":"cs.IT","authors_text":"Tomoyuki Obuchi, Yoshiyuki Kabashima","submitted_at":"2016-03-04T09:49:46Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01399","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:03:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nAGOfP2doWrcZ06STr7xIKCFe6nQMfIcSgE4b0MpHxxU/oLRRF0f8ps2MZEbWsyO/d/6393MFArLBt35LijSCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:26:39.530169Z"},"content_sha256":"5e42b06687f2d5406b8bacc847a3639f682a4c2e04a813d4ac93c15c16964ef7","schema_version":"1.0","event_id":"sha256:5e42b06687f2d5406b8bacc847a3639f682a4c2e04a813d4ac93c15c16964ef7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DGTI2YUORCVIURWATML6KDC5HL/bundle.json","state_url":"https://pith.science/pith/DGTI2YUORCVIURWATML6KDC5HL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DGTI2YUORCVIURWATML6KDC5HL/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-04T20:26:39Z","links":{"resolver":"https://pith.science/pith/DGTI2YUORCVIURWATML6KDC5HL","bundle":"https://pith.science/pith/DGTI2YUORCVIURWATML6KDC5HL/bundle.json","state":"https://pith.science/pith/DGTI2YUORCVIURWATML6KDC5HL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DGTI2YUORCVIURWATML6KDC5HL/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1riYsACMh2BlH5FFpV91dOsHuSqNpoKyho/+ZAoJ+petynqTvM96MtOkOoPY3KGUBcMOnlEO+iEZbDwlL+gUAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:26:39.532201Z","bundle_sha256":"277d609431d8717189ba6c40fb58bc09a7a63f28a67d325d5a6a60a24a1fb946"}}