{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QKXAX447XKRIFCQ7TZVLYJ2JPI","short_pith_number":"pith:QKXAX447","canonical_record":{"source":{"id":"1908.02370","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-06T21:14:42Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"bb571b3887d37a1de7493ad0b4c8df75f28a7ba84d0689ef99eed0b9a1eadbcb","abstract_canon_sha256":"446b7c803baa59eef57e2df636582092df5442e5333fafe2b0de21838cf8f503"},"schema_version":"1.0"},"canonical_sha256":"82ae0bf39fbaa2828a1f9e6abc27497a266311c04c06ab568adeff7e6a46813f","source":{"kind":"arxiv","id":"1908.02370","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02370","created_at":"2026-07-04T23:52:08Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02370v1","created_at":"2026-07-04T23:52:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02370","created_at":"2026-07-04T23:52:08Z"},{"alias_kind":"pith_short_12","alias_value":"QKXAX447XKRI","created_at":"2026-07-04T23:52:08Z"},{"alias_kind":"pith_short_16","alias_value":"QKXAX447XKRIFCQ7","created_at":"2026-07-04T23:52:08Z"},{"alias_kind":"pith_short_8","alias_value":"QKXAX447","created_at":"2026-07-04T23:52:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QKXAX447XKRIFCQ7TZVLYJ2JPI","target":"record","payload":{"canonical_record":{"source":{"id":"1908.02370","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-06T21:14:42Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"bb571b3887d37a1de7493ad0b4c8df75f28a7ba84d0689ef99eed0b9a1eadbcb","abstract_canon_sha256":"446b7c803baa59eef57e2df636582092df5442e5333fafe2b0de21838cf8f503"},"schema_version":"1.0"},"canonical_sha256":"82ae0bf39fbaa2828a1f9e6abc27497a266311c04c06ab568adeff7e6a46813f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:52:08.047851Z","signature_b64":"UlI+wgqXeFG+tJwogxtFYBLm7LsuHQN6ICv7NDRmZalzecj5GqmVb1HZVQPOUiiIglp2JS4OVKIFxk/62mitCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82ae0bf39fbaa2828a1f9e6abc27497a266311c04c06ab568adeff7e6a46813f","last_reissued_at":"2026-07-04T23:52:08.047391Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:52:08.047391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.02370","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-07-04T23:52:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AD4yk37aPLeYYXo3Hh2em5L6mLEsY6tanUVQj76/s2b4kJ/tWpGHMr7G+EVvGJKwQ7Se0vHlsz/T/fldr8l3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T14:23:55.419544Z"},"content_sha256":"33b5016577d34596a3b72b15c372735dbd5dda4d8e3517ceab36e090a0bad8b3","schema_version":"1.0","event_id":"sha256:33b5016577d34596a3b72b15c372735dbd5dda4d8e3517ceab36e090a0bad8b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QKXAX447XKRIFCQ7TZVLYJ2JPI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"math.OC","authors_text":"Feng Yu, Teng Zhang, Yi Yang","submitted_at":"2019-08-06T21:14:42Z","abstract_excerpt":"This work proposes a new algorithm for solving the graph-fused lasso (GFL), a method for parameter estimation that operates under the assumption that the signal tends to be locally constant over a predefined graph structure. The proposed method applies the alternating direction method of multipliers (ADMM) algorithm and is based on the decomposition of the objective function into two components. While ADMM has been widely used in this problem, existing works such as network lasso decompose the objective function into the loss function component and the total variation penalty component. In com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02370","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.02370/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-04T23:52:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6RoTTiEpz8CFByUatIKf+x41UxdHYyHo/Jm6wd/qXuQA85Pg6ISAlthmw79XyLatkzKUqMv0PlRVatjAiGK1DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T14:23:55.420219Z"},"content_sha256":"357505ed2af499c750278c8e1149f9ccf7cf02b4c4e7705806583bf78a83fdce","schema_version":"1.0","event_id":"sha256:357505ed2af499c750278c8e1149f9ccf7cf02b4c4e7705806583bf78a83fdce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QKXAX447XKRIFCQ7TZVLYJ2JPI/bundle.json","state_url":"https://pith.science/pith/QKXAX447XKRIFCQ7TZVLYJ2JPI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QKXAX447XKRIFCQ7TZVLYJ2JPI/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-16T14:23:55Z","links":{"resolver":"https://pith.science/pith/QKXAX447XKRIFCQ7TZVLYJ2JPI","bundle":"https://pith.science/pith/QKXAX447XKRIFCQ7TZVLYJ2JPI/bundle.json","state":"https://pith.science/pith/QKXAX447XKRIFCQ7TZVLYJ2JPI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QKXAX447XKRIFCQ7TZVLYJ2JPI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QKXAX447XKRIFCQ7TZVLYJ2JPI","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":"446b7c803baa59eef57e2df636582092df5442e5333fafe2b0de21838cf8f503","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-06T21:14:42Z","title_canon_sha256":"bb571b3887d37a1de7493ad0b4c8df75f28a7ba84d0689ef99eed0b9a1eadbcb"},"schema_version":"1.0","source":{"id":"1908.02370","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.02370","created_at":"2026-07-04T23:52:08Z"},{"alias_kind":"arxiv_version","alias_value":"1908.02370v1","created_at":"2026-07-04T23:52:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.02370","created_at":"2026-07-04T23:52:08Z"},{"alias_kind":"pith_short_12","alias_value":"QKXAX447XKRI","created_at":"2026-07-04T23:52:08Z"},{"alias_kind":"pith_short_16","alias_value":"QKXAX447XKRIFCQ7","created_at":"2026-07-04T23:52:08Z"},{"alias_kind":"pith_short_8","alias_value":"QKXAX447","created_at":"2026-07-04T23:52:08Z"}],"graph_snapshots":[{"event_id":"sha256:357505ed2af499c750278c8e1149f9ccf7cf02b4c4e7705806583bf78a83fdce","target":"graph","created_at":"2026-07-04T23:52:08Z","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/1908.02370/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This work proposes a new algorithm for solving the graph-fused lasso (GFL), a method for parameter estimation that operates under the assumption that the signal tends to be locally constant over a predefined graph structure. The proposed method applies the alternating direction method of multipliers (ADMM) algorithm and is based on the decomposition of the objective function into two components. While ADMM has been widely used in this problem, existing works such as network lasso decompose the objective function into the loss function component and the total variation penalty component. In com","authors_text":"Feng Yu, Teng Zhang, Yi Yang","cross_cats":["stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-06T21:14:42Z","title":"An Algorithm for Graph-Fused Lasso Based on Graph Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.02370","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:33b5016577d34596a3b72b15c372735dbd5dda4d8e3517ceab36e090a0bad8b3","target":"record","created_at":"2026-07-04T23:52:08Z","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":"446b7c803baa59eef57e2df636582092df5442e5333fafe2b0de21838cf8f503","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-06T21:14:42Z","title_canon_sha256":"bb571b3887d37a1de7493ad0b4c8df75f28a7ba84d0689ef99eed0b9a1eadbcb"},"schema_version":"1.0","source":{"id":"1908.02370","kind":"arxiv","version":1}},"canonical_sha256":"82ae0bf39fbaa2828a1f9e6abc27497a266311c04c06ab568adeff7e6a46813f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"82ae0bf39fbaa2828a1f9e6abc27497a266311c04c06ab568adeff7e6a46813f","first_computed_at":"2026-07-04T23:52:08.047391Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:52:08.047391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UlI+wgqXeFG+tJwogxtFYBLm7LsuHQN6ICv7NDRmZalzecj5GqmVb1HZVQPOUiiIglp2JS4OVKIFxk/62mitCA==","signature_status":"signed_v1","signed_at":"2026-07-04T23:52:08.047851Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.02370","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33b5016577d34596a3b72b15c372735dbd5dda4d8e3517ceab36e090a0bad8b3","sha256:357505ed2af499c750278c8e1149f9ccf7cf02b4c4e7705806583bf78a83fdce"],"state_sha256":"9756b82b7eb8bfb64cc372b9fe173fbbc9d9216997cd6259a5d8a2f46dfa536e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"001kdg1m/ugiA1fmKeqREhyVGoCLgvnIrme9+0ouPjDR9I9iayMJ9R5XT2tqRyCNJGMf7V2JYkvCEPQbyi3uDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T14:23:55.426094Z","bundle_sha256":"f6f1a2a0dd22730acb4ad0ae3eb4071e20a37f64926a05fce75a3ad5c62418b1"}}