{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:NYSNM5L4SUZAIMMYH4Y7CUB6OX","short_pith_number":"pith:NYSNM5L4","canonical_record":{"source":{"id":"1904.00864","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-01T14:05:41Z","cross_cats_sorted":["eess.SP","stat.ML"],"title_canon_sha256":"0bb46379e0b7bd3b0f5decae25d76206a814ed29e5177688ea0af558ad5f9f05","abstract_canon_sha256":"9eaa9b5c6e2b4318755e14d49fcfa65065c1533a0234ace65435ce25d3989683"},"schema_version":"1.0"},"canonical_sha256":"6e24d6757c95320431983f31f1503e75e2c7b3f38648d7105525a63308aa00c0","source":{"kind":"arxiv","id":"1904.00864","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.00864","created_at":"2026-05-17T23:49:45Z"},{"alias_kind":"arxiv_version","alias_value":"1904.00864v1","created_at":"2026-05-17T23:49:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.00864","created_at":"2026-05-17T23:49:45Z"},{"alias_kind":"pith_short_12","alias_value":"NYSNM5L4SUZA","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NYSNM5L4SUZAIMMY","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NYSNM5L4","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:NYSNM5L4SUZAIMMYH4Y7CUB6OX","target":"record","payload":{"canonical_record":{"source":{"id":"1904.00864","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-01T14:05:41Z","cross_cats_sorted":["eess.SP","stat.ML"],"title_canon_sha256":"0bb46379e0b7bd3b0f5decae25d76206a814ed29e5177688ea0af558ad5f9f05","abstract_canon_sha256":"9eaa9b5c6e2b4318755e14d49fcfa65065c1533a0234ace65435ce25d3989683"},"schema_version":"1.0"},"canonical_sha256":"6e24d6757c95320431983f31f1503e75e2c7b3f38648d7105525a63308aa00c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:45.279856Z","signature_b64":"oEl5YAPLPD0jrFp/YExYq3zKrvcr26nAS9uUSdwCvF4xwzEELcwstnxaLBeE7zV9fsSKtdwOvqEc9KaMI4RzCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e24d6757c95320431983f31f1503e75e2c7b3f38648d7105525a63308aa00c0","last_reissued_at":"2026-05-17T23:49:45.279307Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:45.279307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.00864","source_version":1,"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-17T23:49:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i8AojCP3FSjVEbURFdWCDaYEkb1R5Km0Vxc0yoeFHa/zhY1th1HKXtADk+OAI+gqp8Si+nV/vntlCLf3dMcKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:04:19.637039Z"},"content_sha256":"4a090051f95982bb5a836baafeaf706f52147b5ad79a01b077aba0a2643811a5","schema_version":"1.0","event_id":"sha256:4a090051f95982bb5a836baafeaf706f52147b5ad79a01b077aba0a2643811a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:NYSNM5L4SUZAIMMYH4Y7CUB6OX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tree Search Network for Sparse Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","stat.ML"],"primary_cat":"cs.LG","authors_text":"Kyung-Su Kim, Sae-Young Chung","submitted_at":"2019-04-01T14:05:41Z","abstract_excerpt":"We consider the classical sparse regression problem of recovering a sparse signal $x_0$ given a measurement vector $y = \\Phi x_0+w$. We propose a tree search algorithm driven by the deep neural network for sparse regression (TSN). TSN improves the signal reconstruction performance of the deep neural network designed for sparse regression by performing a tree search with pruning. It is observed in both noiseless and noisy cases, TSN recovers synthetic and real signals with lower complexity than a conventional tree search and is superior to existing algorithms by a large margin for various types"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.00864","kind":"arxiv","version":1},"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-17T23:49:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OGE/w5gSC0BoFEA59BEz9A4r/avozWAnY4NdIWK864UAo3fbFnuAOr3FAhOXxCjoTgqBq4Kh8G37ktq+8QanDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T07:04:19.637438Z"},"content_sha256":"3f0cf6094d39946be0481922248c4ddde631c3cd748bfaac1f7afb34e6b18dc6","schema_version":"1.0","event_id":"sha256:3f0cf6094d39946be0481922248c4ddde631c3cd748bfaac1f7afb34e6b18dc6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NYSNM5L4SUZAIMMYH4Y7CUB6OX/bundle.json","state_url":"https://pith.science/pith/NYSNM5L4SUZAIMMYH4Y7CUB6OX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NYSNM5L4SUZAIMMYH4Y7CUB6OX/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-01T07:04:19Z","links":{"resolver":"https://pith.science/pith/NYSNM5L4SUZAIMMYH4Y7CUB6OX","bundle":"https://pith.science/pith/NYSNM5L4SUZAIMMYH4Y7CUB6OX/bundle.json","state":"https://pith.science/pith/NYSNM5L4SUZAIMMYH4Y7CUB6OX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NYSNM5L4SUZAIMMYH4Y7CUB6OX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NYSNM5L4SUZAIMMYH4Y7CUB6OX","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":"9eaa9b5c6e2b4318755e14d49fcfa65065c1533a0234ace65435ce25d3989683","cross_cats_sorted":["eess.SP","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-01T14:05:41Z","title_canon_sha256":"0bb46379e0b7bd3b0f5decae25d76206a814ed29e5177688ea0af558ad5f9f05"},"schema_version":"1.0","source":{"id":"1904.00864","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.00864","created_at":"2026-05-17T23:49:45Z"},{"alias_kind":"arxiv_version","alias_value":"1904.00864v1","created_at":"2026-05-17T23:49:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.00864","created_at":"2026-05-17T23:49:45Z"},{"alias_kind":"pith_short_12","alias_value":"NYSNM5L4SUZA","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NYSNM5L4SUZAIMMY","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NYSNM5L4","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:3f0cf6094d39946be0481922248c4ddde631c3cd748bfaac1f7afb34e6b18dc6","target":"graph","created_at":"2026-05-17T23:49:45Z","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":"We consider the classical sparse regression problem of recovering a sparse signal $x_0$ given a measurement vector $y = \\Phi x_0+w$. We propose a tree search algorithm driven by the deep neural network for sparse regression (TSN). TSN improves the signal reconstruction performance of the deep neural network designed for sparse regression by performing a tree search with pruning. It is observed in both noiseless and noisy cases, TSN recovers synthetic and real signals with lower complexity than a conventional tree search and is superior to existing algorithms by a large margin for various types","authors_text":"Kyung-Su Kim, Sae-Young Chung","cross_cats":["eess.SP","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-01T14:05:41Z","title":"Tree Search Network for Sparse Regression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.00864","kind":"arxiv","version":1},"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:4a090051f95982bb5a836baafeaf706f52147b5ad79a01b077aba0a2643811a5","target":"record","created_at":"2026-05-17T23:49:45Z","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":"9eaa9b5c6e2b4318755e14d49fcfa65065c1533a0234ace65435ce25d3989683","cross_cats_sorted":["eess.SP","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-01T14:05:41Z","title_canon_sha256":"0bb46379e0b7bd3b0f5decae25d76206a814ed29e5177688ea0af558ad5f9f05"},"schema_version":"1.0","source":{"id":"1904.00864","kind":"arxiv","version":1}},"canonical_sha256":"6e24d6757c95320431983f31f1503e75e2c7b3f38648d7105525a63308aa00c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e24d6757c95320431983f31f1503e75e2c7b3f38648d7105525a63308aa00c0","first_computed_at":"2026-05-17T23:49:45.279307Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:45.279307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oEl5YAPLPD0jrFp/YExYq3zKrvcr26nAS9uUSdwCvF4xwzEELcwstnxaLBeE7zV9fsSKtdwOvqEc9KaMI4RzCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:45.279856Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.00864","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a090051f95982bb5a836baafeaf706f52147b5ad79a01b077aba0a2643811a5","sha256:3f0cf6094d39946be0481922248c4ddde631c3cd748bfaac1f7afb34e6b18dc6"],"state_sha256":"0b4529d7e89bcb1ada1a770e90f211dbaef63bc6aa8a59a52a6bfed8f997306e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ofA6O1YrXYCXkDmBBxsPdz/UE5jrhnbzDw8V+bwJ/MEo/JYl3d6EaNqfq/gr2SXAF3KFS1HqLRqYY3Bpmkj2Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T07:04:19.639531Z","bundle_sha256":"bf64eae7428269952c4f8692c13727fa88524a5521f4c225d844eaf929b8491d"}}