{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:MTU4LRVOLDXJZ3CSKKNNNLWDP5","short_pith_number":"pith:MTU4LRVO","canonical_record":{"source":{"id":"2306.16060","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2023-06-28T09:49:15Z","cross_cats_sorted":["eess.IV"],"title_canon_sha256":"565f133f77b56a9d6d4358f0023b9c4d05062c209e4a1503461b7d3fe823ce68","abstract_canon_sha256":"569eaf5f1bbfd54c6db47dc7d92b8b494b637b717fb697eb04e6cb8bdedf3273"},"schema_version":"1.0"},"canonical_sha256":"64e9c5c6ae58ee9cec52529ad6aec37f52a4e63b2daeb965318d7b9f485b93ba","source":{"kind":"arxiv","id":"2306.16060","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.16060","created_at":"2026-07-05T07:46:20Z"},{"alias_kind":"arxiv_version","alias_value":"2306.16060v2","created_at":"2026-07-05T07:46:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.16060","created_at":"2026-07-05T07:46:20Z"},{"alias_kind":"pith_short_12","alias_value":"MTU4LRVOLDXJ","created_at":"2026-07-05T07:46:20Z"},{"alias_kind":"pith_short_16","alias_value":"MTU4LRVOLDXJZ3CS","created_at":"2026-07-05T07:46:20Z"},{"alias_kind":"pith_short_8","alias_value":"MTU4LRVO","created_at":"2026-07-05T07:46:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:MTU4LRVOLDXJZ3CSKKNNNLWDP5","target":"record","payload":{"canonical_record":{"source":{"id":"2306.16060","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2023-06-28T09:49:15Z","cross_cats_sorted":["eess.IV"],"title_canon_sha256":"565f133f77b56a9d6d4358f0023b9c4d05062c209e4a1503461b7d3fe823ce68","abstract_canon_sha256":"569eaf5f1bbfd54c6db47dc7d92b8b494b637b717fb697eb04e6cb8bdedf3273"},"schema_version":"1.0"},"canonical_sha256":"64e9c5c6ae58ee9cec52529ad6aec37f52a4e63b2daeb965318d7b9f485b93ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:46:20.059435Z","signature_b64":"kiezfmi1CFxei1i6fKmCAIWv8DEZu58ldNI4eHfLjZIvVzvJtpwmYa479iC0fL0EMGnMzKrwJzDD1UYQsfjcCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64e9c5c6ae58ee9cec52529ad6aec37f52a4e63b2daeb965318d7b9f485b93ba","last_reissued_at":"2026-07-05T07:46:20.058993Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:46:20.058993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2306.16060","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-07-05T07:46:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BldkPCxsT16kkN1bAzXx7czSh3ZczoRPmlgTMUm04g2FUsK6i2i54Rykwh1ecUqNLYMGlyeMIruBcsP2A2y6DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T05:32:46.373138Z"},"content_sha256":"6fd11cb1e2eb73604d4b1c441ab2e81df592f742d1f8051d811996b7c81e4333","schema_version":"1.0","event_id":"sha256:6fd11cb1e2eb73604d4b1c441ab2e81df592f742d1f8051d811996b7c81e4333"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:MTU4LRVOLDXJZ3CSKKNNNLWDP5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Path-Controllable Deep Unfolding Network for Compressive Sensing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["eess.IV"],"primary_cat":"cs.CV","authors_text":"Bin Chen, Jian Zhang, Jiechong Song","submitted_at":"2023-06-28T09:49:15Z","abstract_excerpt":"Deep unfolding network (DUN) that unfolds the optimization algorithm into a deep neural network has achieved great success in compressive sensing (CS) due to its good interpretability and high performance. Each stage in DUN corresponds to one iteration in optimization. At the test time, all the sampling images generally need to be processed by all stages, which comes at a price of computation burden and is also unnecessary for the images whose contents are easier to restore. In this paper, we focus on CS reconstruction and propose a novel Dynamic Path-Controllable Deep Unfolding Network (DPC-D"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.16060","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.16060/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T07:46:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lpewJ+I0JUTCm0J/1S/b2wlQzSXRM0KAb1WLGmt0HwmD4VXyKfxzbcIBRj0w+ZSZB7OXETIX6YLTfpnydTtLAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T05:32:46.373513Z"},"content_sha256":"9f2023c9e61c8e12ab509257b0fa505bbb2b2d534d84eb06a351fc6e1be9b962","schema_version":"1.0","event_id":"sha256:9f2023c9e61c8e12ab509257b0fa505bbb2b2d534d84eb06a351fc6e1be9b962"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MTU4LRVOLDXJZ3CSKKNNNLWDP5/bundle.json","state_url":"https://pith.science/pith/MTU4LRVOLDXJZ3CSKKNNNLWDP5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MTU4LRVOLDXJZ3CSKKNNNLWDP5/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-08-22T05:32:46Z","links":{"resolver":"https://pith.science/pith/MTU4LRVOLDXJZ3CSKKNNNLWDP5","bundle":"https://pith.science/pith/MTU4LRVOLDXJZ3CSKKNNNLWDP5/bundle.json","state":"https://pith.science/pith/MTU4LRVOLDXJZ3CSKKNNNLWDP5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MTU4LRVOLDXJZ3CSKKNNNLWDP5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:MTU4LRVOLDXJZ3CSKKNNNLWDP5","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":"569eaf5f1bbfd54c6db47dc7d92b8b494b637b717fb697eb04e6cb8bdedf3273","cross_cats_sorted":["eess.IV"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2023-06-28T09:49:15Z","title_canon_sha256":"565f133f77b56a9d6d4358f0023b9c4d05062c209e4a1503461b7d3fe823ce68"},"schema_version":"1.0","source":{"id":"2306.16060","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.16060","created_at":"2026-07-05T07:46:20Z"},{"alias_kind":"arxiv_version","alias_value":"2306.16060v2","created_at":"2026-07-05T07:46:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.16060","created_at":"2026-07-05T07:46:20Z"},{"alias_kind":"pith_short_12","alias_value":"MTU4LRVOLDXJ","created_at":"2026-07-05T07:46:20Z"},{"alias_kind":"pith_short_16","alias_value":"MTU4LRVOLDXJZ3CS","created_at":"2026-07-05T07:46:20Z"},{"alias_kind":"pith_short_8","alias_value":"MTU4LRVO","created_at":"2026-07-05T07:46:20Z"}],"graph_snapshots":[{"event_id":"sha256:9f2023c9e61c8e12ab509257b0fa505bbb2b2d534d84eb06a351fc6e1be9b962","target":"graph","created_at":"2026-07-05T07:46:20Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2306.16060/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Deep unfolding network (DUN) that unfolds the optimization algorithm into a deep neural network has achieved great success in compressive sensing (CS) due to its good interpretability and high performance. Each stage in DUN corresponds to one iteration in optimization. At the test time, all the sampling images generally need to be processed by all stages, which comes at a price of computation burden and is also unnecessary for the images whose contents are easier to restore. In this paper, we focus on CS reconstruction and propose a novel Dynamic Path-Controllable Deep Unfolding Network (DPC-D","authors_text":"Bin Chen, Jian Zhang, Jiechong Song","cross_cats":["eess.IV"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2023-06-28T09:49:15Z","title":"Dynamic Path-Controllable Deep Unfolding Network for Compressive Sensing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.16060","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:6fd11cb1e2eb73604d4b1c441ab2e81df592f742d1f8051d811996b7c81e4333","target":"record","created_at":"2026-07-05T07:46:20Z","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":"569eaf5f1bbfd54c6db47dc7d92b8b494b637b717fb697eb04e6cb8bdedf3273","cross_cats_sorted":["eess.IV"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2023-06-28T09:49:15Z","title_canon_sha256":"565f133f77b56a9d6d4358f0023b9c4d05062c209e4a1503461b7d3fe823ce68"},"schema_version":"1.0","source":{"id":"2306.16060","kind":"arxiv","version":2}},"canonical_sha256":"64e9c5c6ae58ee9cec52529ad6aec37f52a4e63b2daeb965318d7b9f485b93ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64e9c5c6ae58ee9cec52529ad6aec37f52a4e63b2daeb965318d7b9f485b93ba","first_computed_at":"2026-07-05T07:46:20.058993Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:46:20.058993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kiezfmi1CFxei1i6fKmCAIWv8DEZu58ldNI4eHfLjZIvVzvJtpwmYa479iC0fL0EMGnMzKrwJzDD1UYQsfjcCg==","signature_status":"signed_v1","signed_at":"2026-07-05T07:46:20.059435Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.16060","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6fd11cb1e2eb73604d4b1c441ab2e81df592f742d1f8051d811996b7c81e4333","sha256:9f2023c9e61c8e12ab509257b0fa505bbb2b2d534d84eb06a351fc6e1be9b962"],"state_sha256":"31bc528d82ddf86f0f8c0b69907d6da117f4a333ec1f0e7b13f245b3307d7522"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JPOGJQdfVptzqnBsMoYv/ppQilvVt/nRn6YFBxPp5sNonv8CGxWO4zcF2fj1RW010jS0QRQje00l43x6FuwLDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T05:32:46.376327Z","bundle_sha256":"085ceed671f11994263839277896bf7ecf2c5e35e1f59cfcaa7c844a0dfaf601"}}