{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:QQ5RTZDZ5EKSS42G6YQIEZLI6U","short_pith_number":"pith:QQ5RTZDZ","canonical_record":{"source":{"id":"1612.03364","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-11T01:57:50Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"955eea681583b8689cff26e470bd6def613888420dcb0fb44b05f9f15836f879","abstract_canon_sha256":"dded993ac7298a348553ca6d7628b6cbb081b24ec754584a8586ec5ba28c87a3"},"schema_version":"1.0"},"canonical_sha256":"843b19e479e915297346f620826568f502dea17f8cdcbaf243a2c90c4c809009","source":{"kind":"arxiv","id":"1612.03364","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.03364","created_at":"2026-05-18T00:54:52Z"},{"alias_kind":"arxiv_version","alias_value":"1612.03364v1","created_at":"2026-05-18T00:54:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03364","created_at":"2026-05-18T00:54:52Z"},{"alias_kind":"pith_short_12","alias_value":"QQ5RTZDZ5EKS","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QQ5RTZDZ5EKSS42G","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QQ5RTZDZ","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:QQ5RTZDZ5EKSS42G6YQIEZLI6U","target":"record","payload":{"canonical_record":{"source":{"id":"1612.03364","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-11T01:57:50Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"955eea681583b8689cff26e470bd6def613888420dcb0fb44b05f9f15836f879","abstract_canon_sha256":"dded993ac7298a348553ca6d7628b6cbb081b24ec754584a8586ec5ba28c87a3"},"schema_version":"1.0"},"canonical_sha256":"843b19e479e915297346f620826568f502dea17f8cdcbaf243a2c90c4c809009","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:52.402865Z","signature_b64":"P/7eNymFmTY8evR1+zxs/SALoVud5RaBXk10IRanWtXce+H82iF2anEpcdjCKeRuTxhII/YL0Q9x7UdgAhriCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"843b19e479e915297346f620826568f502dea17f8cdcbaf243a2c90c4c809009","last_reissued_at":"2026-05-18T00:54:52.402435Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:52.402435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.03364","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-18T00:54:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MyLoT6E+ttZNftLRCPaHVD2ggxHTYA+6osECWXHL2mrhVuvrRytKR9JtHZ20Z0ApryInMS+iOhgMb0Aburb6Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:54:27.414229Z"},"content_sha256":"7446418375f962c72c38974c7e72031a42fb27890c11a088260cf54cea59d92a","schema_version":"1.0","event_id":"sha256:7446418375f962c72c38974c7e72031a42fb27890c11a088260cf54cea59d92a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:QQ5RTZDZ5EKSS42G6YQIEZLI6U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Technical Report: A Generalized Matching Pursuit Approach for Graph-Structured Sparsity","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Baojian Zhou, Feng Chen","submitted_at":"2016-12-11T01:57:50Z","abstract_excerpt":"Sparsity-constrained optimization is an important and challenging problem that has wide applicability in data mining, machine learning, and statistics. In this paper, we focus on sparsity-constrained optimization in cases where the cost function is a general nonlinear function and, in particular, the sparsity constraint is defined by a graph-structured sparsity model. Existing methods explore this problem in the context of sparse estimation in linear models. To the best of our knowledge, this is the first work to present an efficient approximation algorithm, namely, Graph-structured Matching P"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03364","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-18T00:54:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oA3G0BZuA0D8kkVesQhnmxqYErHM6MryxpGQcNvVLwaQHaz9x9Mkre3lUz540bEeunfgEyu1cYCfJfcp6TJVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:54:27.414580Z"},"content_sha256":"74339cc632a658f82a0d55298912e311abec8f6331a1130e17a9b0062a8ff329","schema_version":"1.0","event_id":"sha256:74339cc632a658f82a0d55298912e311abec8f6331a1130e17a9b0062a8ff329"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QQ5RTZDZ5EKSS42G6YQIEZLI6U/bundle.json","state_url":"https://pith.science/pith/QQ5RTZDZ5EKSS42G6YQIEZLI6U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QQ5RTZDZ5EKSS42G6YQIEZLI6U/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-02T02:54:27Z","links":{"resolver":"https://pith.science/pith/QQ5RTZDZ5EKSS42G6YQIEZLI6U","bundle":"https://pith.science/pith/QQ5RTZDZ5EKSS42G6YQIEZLI6U/bundle.json","state":"https://pith.science/pith/QQ5RTZDZ5EKSS42G6YQIEZLI6U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QQ5RTZDZ5EKSS42G6YQIEZLI6U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:QQ5RTZDZ5EKSS42G6YQIEZLI6U","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":"dded993ac7298a348553ca6d7628b6cbb081b24ec754584a8586ec5ba28c87a3","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-11T01:57:50Z","title_canon_sha256":"955eea681583b8689cff26e470bd6def613888420dcb0fb44b05f9f15836f879"},"schema_version":"1.0","source":{"id":"1612.03364","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.03364","created_at":"2026-05-18T00:54:52Z"},{"alias_kind":"arxiv_version","alias_value":"1612.03364v1","created_at":"2026-05-18T00:54:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.03364","created_at":"2026-05-18T00:54:52Z"},{"alias_kind":"pith_short_12","alias_value":"QQ5RTZDZ5EKS","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"QQ5RTZDZ5EKSS42G","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"QQ5RTZDZ","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:74339cc632a658f82a0d55298912e311abec8f6331a1130e17a9b0062a8ff329","target":"graph","created_at":"2026-05-18T00:54:52Z","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":"Sparsity-constrained optimization is an important and challenging problem that has wide applicability in data mining, machine learning, and statistics. In this paper, we focus on sparsity-constrained optimization in cases where the cost function is a general nonlinear function and, in particular, the sparsity constraint is defined by a graph-structured sparsity model. Existing methods explore this problem in the context of sparse estimation in linear models. To the best of our knowledge, this is the first work to present an efficient approximation algorithm, namely, Graph-structured Matching P","authors_text":"Baojian Zhou, Feng Chen","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-11T01:57:50Z","title":"Technical Report: A Generalized Matching Pursuit Approach for Graph-Structured Sparsity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.03364","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:7446418375f962c72c38974c7e72031a42fb27890c11a088260cf54cea59d92a","target":"record","created_at":"2026-05-18T00:54:52Z","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":"dded993ac7298a348553ca6d7628b6cbb081b24ec754584a8586ec5ba28c87a3","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-11T01:57:50Z","title_canon_sha256":"955eea681583b8689cff26e470bd6def613888420dcb0fb44b05f9f15836f879"},"schema_version":"1.0","source":{"id":"1612.03364","kind":"arxiv","version":1}},"canonical_sha256":"843b19e479e915297346f620826568f502dea17f8cdcbaf243a2c90c4c809009","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"843b19e479e915297346f620826568f502dea17f8cdcbaf243a2c90c4c809009","first_computed_at":"2026-05-18T00:54:52.402435Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:52.402435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P/7eNymFmTY8evR1+zxs/SALoVud5RaBXk10IRanWtXce+H82iF2anEpcdjCKeRuTxhII/YL0Q9x7UdgAhriCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:52.402865Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.03364","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7446418375f962c72c38974c7e72031a42fb27890c11a088260cf54cea59d92a","sha256:74339cc632a658f82a0d55298912e311abec8f6331a1130e17a9b0062a8ff329"],"state_sha256":"53b2f4a46355d85c2a2e320191fc7dec8d42f4fdf1c04eba4655d18891575ba7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7bSHgi3riD5DlBNOlVwGhSaxt6pRlepeXV6AH30N1/IDOgL7eXVNdo+I6YioMX/drluhTfn6BrQ25aggk61WDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:54:27.416549Z","bundle_sha256":"8fe5e7ca56e871dc7391a9805e9df4a4b7ac7232db2ced98ccd5b78fb7460f23"}}