{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:L37V63CZ36M2JUFJT5F65YH2WR","short_pith_number":"pith:L37V63CZ","canonical_record":{"source":{"id":"1609.09864","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-09-30T19:26:26Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3064d9533435c0276e694ce3dcaabd04c2b5c547ae560f480b3111669c48e282","abstract_canon_sha256":"8559ea78431b18a5e7d830d2252fc557975dbd77e165e4ea89b88af43c51a266"},"schema_version":"1.0"},"canonical_sha256":"5eff5f6c59df99a4d0a99f4beee0fab455589f7c39154b55e453ffd5706f482b","source":{"kind":"arxiv","id":"1609.09864","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.09864","created_at":"2026-05-18T01:03:33Z"},{"alias_kind":"arxiv_version","alias_value":"1609.09864v1","created_at":"2026-05-18T01:03:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09864","created_at":"2026-05-18T01:03:33Z"},{"alias_kind":"pith_short_12","alias_value":"L37V63CZ36M2","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"L37V63CZ36M2JUFJ","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"L37V63CZ","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:L37V63CZ36M2JUFJT5F65YH2WR","target":"record","payload":{"canonical_record":{"source":{"id":"1609.09864","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-09-30T19:26:26Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3064d9533435c0276e694ce3dcaabd04c2b5c547ae560f480b3111669c48e282","abstract_canon_sha256":"8559ea78431b18a5e7d830d2252fc557975dbd77e165e4ea89b88af43c51a266"},"schema_version":"1.0"},"canonical_sha256":"5eff5f6c59df99a4d0a99f4beee0fab455589f7c39154b55e453ffd5706f482b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:33.158151Z","signature_b64":"0ETgpuAHG31ET/5diF1iDvTVHBpym0Ro9i3mBWm2KPyDnXeriX5pgD0dmKhIyVAeJVrPEHkTNTVQLP6mZt3nBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5eff5f6c59df99a4d0a99f4beee0fab455589f7c39154b55e453ffd5706f482b","last_reissued_at":"2026-05-18T01:03:33.157611Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:33.157611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.09864","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-18T01:03:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kavB9PPZlnO8BU7Q4BssslQT5NREs7yJSMlKf7kWR8ZZp0LnKVUM4Gw0SFbr1XgGVR2j/78fR8nRt/NOJ0NpAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:52:24.928244Z"},"content_sha256":"c9a68d4dd3e1c36999dd4cbb07934fa16fa239ace767721af477e5501d3a7031","schema_version":"1.0","event_id":"sha256:c9a68d4dd3e1c36999dd4cbb07934fa16fa239ace767721af477e5501d3a7031"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:L37V63CZ36M2JUFJT5F65YH2WR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Technical Report: Graph-Structured Sparse Optimization for Connected Subgraph Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.AI","authors_text":"Baojian Zhou, Feng Chen","submitted_at":"2016-09-30T19:26:26Z","abstract_excerpt":"Structured sparse optimization is an important and challenging problem for analyzing high-dimensional data in a variety of applications such as bioinformatics, medical imaging, social networks, and astronomy. Although a number of structured sparsity models have been explored, such as trees, groups, clusters, and paths, connected subgraphs have been rarely explored in the current literature. One of the main technical challenges is that there is no structured sparsity-inducing norm that can directly model the space of connected subgraphs, and there is no exact implementation of a projection orac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09864","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-18T01:03:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FWrZIA2zSm6L7zvXehj5YG0ERYHpWqcyoc36Sxdk+LPmbq0qGEkcwa6FTYlyZxSJuxqSWgwqP5P/6EtvCn47BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:52:24.928613Z"},"content_sha256":"3649ee9275665741e5c02326147f7514946d84deb50b6a886f364068ffad0ffa","schema_version":"1.0","event_id":"sha256:3649ee9275665741e5c02326147f7514946d84deb50b6a886f364068ffad0ffa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L37V63CZ36M2JUFJT5F65YH2WR/bundle.json","state_url":"https://pith.science/pith/L37V63CZ36M2JUFJT5F65YH2WR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L37V63CZ36M2JUFJT5F65YH2WR/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-01T21:52:24Z","links":{"resolver":"https://pith.science/pith/L37V63CZ36M2JUFJT5F65YH2WR","bundle":"https://pith.science/pith/L37V63CZ36M2JUFJT5F65YH2WR/bundle.json","state":"https://pith.science/pith/L37V63CZ36M2JUFJT5F65YH2WR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L37V63CZ36M2JUFJT5F65YH2WR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:L37V63CZ36M2JUFJT5F65YH2WR","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":"8559ea78431b18a5e7d830d2252fc557975dbd77e165e4ea89b88af43c51a266","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-09-30T19:26:26Z","title_canon_sha256":"3064d9533435c0276e694ce3dcaabd04c2b5c547ae560f480b3111669c48e282"},"schema_version":"1.0","source":{"id":"1609.09864","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.09864","created_at":"2026-05-18T01:03:33Z"},{"alias_kind":"arxiv_version","alias_value":"1609.09864v1","created_at":"2026-05-18T01:03:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09864","created_at":"2026-05-18T01:03:33Z"},{"alias_kind":"pith_short_12","alias_value":"L37V63CZ36M2","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"L37V63CZ36M2JUFJ","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"L37V63CZ","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:3649ee9275665741e5c02326147f7514946d84deb50b6a886f364068ffad0ffa","target":"graph","created_at":"2026-05-18T01:03:33Z","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":"Structured sparse optimization is an important and challenging problem for analyzing high-dimensional data in a variety of applications such as bioinformatics, medical imaging, social networks, and astronomy. Although a number of structured sparsity models have been explored, such as trees, groups, clusters, and paths, connected subgraphs have been rarely explored in the current literature. One of the main technical challenges is that there is no structured sparsity-inducing norm that can directly model the space of connected subgraphs, and there is no exact implementation of a projection orac","authors_text":"Baojian Zhou, Feng Chen","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-09-30T19:26:26Z","title":"Technical Report: Graph-Structured Sparse Optimization for Connected Subgraph Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09864","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:c9a68d4dd3e1c36999dd4cbb07934fa16fa239ace767721af477e5501d3a7031","target":"record","created_at":"2026-05-18T01:03:33Z","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":"8559ea78431b18a5e7d830d2252fc557975dbd77e165e4ea89b88af43c51a266","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-09-30T19:26:26Z","title_canon_sha256":"3064d9533435c0276e694ce3dcaabd04c2b5c547ae560f480b3111669c48e282"},"schema_version":"1.0","source":{"id":"1609.09864","kind":"arxiv","version":1}},"canonical_sha256":"5eff5f6c59df99a4d0a99f4beee0fab455589f7c39154b55e453ffd5706f482b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5eff5f6c59df99a4d0a99f4beee0fab455589f7c39154b55e453ffd5706f482b","first_computed_at":"2026-05-18T01:03:33.157611Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:33.157611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0ETgpuAHG31ET/5diF1iDvTVHBpym0Ro9i3mBWm2KPyDnXeriX5pgD0dmKhIyVAeJVrPEHkTNTVQLP6mZt3nBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:33.158151Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.09864","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9a68d4dd3e1c36999dd4cbb07934fa16fa239ace767721af477e5501d3a7031","sha256:3649ee9275665741e5c02326147f7514946d84deb50b6a886f364068ffad0ffa"],"state_sha256":"dcd629ecb9e9258dd07ca8a8cfbf56fe3023956b007af9a08290b056ecb24129"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d/xrtq8Yi5/Xvx2jaQU12rWilkydB4xvBKa4q5mS5DvOxHXF5o8Ridv579nQl4rahnimuEwjvFz3cOqYdcizBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:52:24.930629Z","bundle_sha256":"d1cc957d2e4339a4f573aae8ae11d7c91bdedeb84d888d2f1aa89e2e5958d8d3"}}