{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UEUL5U6SBQPBLJSTH7K2HJT66Y","short_pith_number":"pith:UEUL5U6S","canonical_record":{"source":{"id":"1703.01421","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-03-04T09:12:42Z","cross_cats_sorted":["math.ST","stat.CO","stat.TH"],"title_canon_sha256":"a643fe1d332cc6e9fb899e3e05712cf31895a971a6d6a0ebfd134a03f042875c","abstract_canon_sha256":"c74560818b2f4ce39b46df92a02a5999892dd1241a693f9bd3164a8cda878a88"},"schema_version":"1.0"},"canonical_sha256":"a128bed3d20c1e15a6533fd5a3a67ef60c186c437f6c5023cbb7b86dab25b879","source":{"kind":"arxiv","id":"1703.01421","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.01421","created_at":"2026-05-18T00:34:09Z"},{"alias_kind":"arxiv_version","alias_value":"1703.01421v2","created_at":"2026-05-18T00:34:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01421","created_at":"2026-05-18T00:34:09Z"},{"alias_kind":"pith_short_12","alias_value":"UEUL5U6SBQPB","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UEUL5U6SBQPBLJST","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UEUL5U6S","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UEUL5U6SBQPBLJSTH7K2HJT66Y","target":"record","payload":{"canonical_record":{"source":{"id":"1703.01421","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-03-04T09:12:42Z","cross_cats_sorted":["math.ST","stat.CO","stat.TH"],"title_canon_sha256":"a643fe1d332cc6e9fb899e3e05712cf31895a971a6d6a0ebfd134a03f042875c","abstract_canon_sha256":"c74560818b2f4ce39b46df92a02a5999892dd1241a693f9bd3164a8cda878a88"},"schema_version":"1.0"},"canonical_sha256":"a128bed3d20c1e15a6533fd5a3a67ef60c186c437f6c5023cbb7b86dab25b879","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:09.989740Z","signature_b64":"WlPcWZ1E/5f+i+AVQeS0Il6YTfT95ZZX1zIZu2A9ROpccKNdyqo4AH/VN7tpUlrsHQPlwtPc64ywKSjAmzGJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a128bed3d20c1e15a6533fd5a3a67ef60c186c437f6c5023cbb7b86dab25b879","last_reissued_at":"2026-05-18T00:34:09.989081Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:09.989081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.01421","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-05-18T00:34:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"71A3840tEgPw/YSkf713fSnAsaqk7xIYUsIDVHm/8fqMtSXCs/p3ahLBo3TB0onD9NOBolkiguyIunf6MfmgBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:14:03.447989Z"},"content_sha256":"79a12af3cad2cbb91fa5e74b0c9fcd00ee888e5265ab66eb070eb8d4ffc8adb9","schema_version":"1.0","event_id":"sha256:79a12af3cad2cbb91fa5e74b0c9fcd00ee888e5265ab66eb070eb8d4ffc8adb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UEUL5U6SBQPBLJSTH7K2HJT66Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate $l_0$-penalized estimation of piecewise-constant signals on graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.CO","stat.TH"],"primary_cat":"stat.ME","authors_text":"Leying Guan, Zhou Fan","submitted_at":"2017-03-04T09:12:42Z","abstract_excerpt":"We study recovery of piecewise-constant signals on graphs by the estimator minimizing an $l_0$-edge-penalized objective. Although exact minimization of this objective may be computationally intractable, we show that the same statistical risk guarantees are achieved by the $\\alpha$-expansion algorithm which computes an approximate minimizer in polynomial time. We establish that for graphs with small average vertex degree, these guarantees are minimax rate-optimal over classes of edge-sparse signals. For spatially inhomogeneous graphs, we propose minimization of an edge-weighted objective where "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01421","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":""},"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:34:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NMgBeJxZNy6d+i78ssc/JSq/kc22OI7xVlY7Erl8hIbGwPWqxoVj2JAEPI0Mz8EdCTs7NdTSfP/pFDVg8QT+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:14:03.448715Z"},"content_sha256":"c09cad9decab35147db192056ed7157aaabcc734373c90176d6d98f13c1d97b4","schema_version":"1.0","event_id":"sha256:c09cad9decab35147db192056ed7157aaabcc734373c90176d6d98f13c1d97b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UEUL5U6SBQPBLJSTH7K2HJT66Y/bundle.json","state_url":"https://pith.science/pith/UEUL5U6SBQPBLJSTH7K2HJT66Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UEUL5U6SBQPBLJSTH7K2HJT66Y/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-08T19:14:03Z","links":{"resolver":"https://pith.science/pith/UEUL5U6SBQPBLJSTH7K2HJT66Y","bundle":"https://pith.science/pith/UEUL5U6SBQPBLJSTH7K2HJT66Y/bundle.json","state":"https://pith.science/pith/UEUL5U6SBQPBLJSTH7K2HJT66Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UEUL5U6SBQPBLJSTH7K2HJT66Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UEUL5U6SBQPBLJSTH7K2HJT66Y","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":"c74560818b2f4ce39b46df92a02a5999892dd1241a693f9bd3164a8cda878a88","cross_cats_sorted":["math.ST","stat.CO","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-03-04T09:12:42Z","title_canon_sha256":"a643fe1d332cc6e9fb899e3e05712cf31895a971a6d6a0ebfd134a03f042875c"},"schema_version":"1.0","source":{"id":"1703.01421","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.01421","created_at":"2026-05-18T00:34:09Z"},{"alias_kind":"arxiv_version","alias_value":"1703.01421v2","created_at":"2026-05-18T00:34:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01421","created_at":"2026-05-18T00:34:09Z"},{"alias_kind":"pith_short_12","alias_value":"UEUL5U6SBQPB","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UEUL5U6SBQPBLJST","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UEUL5U6S","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:c09cad9decab35147db192056ed7157aaabcc734373c90176d6d98f13c1d97b4","target":"graph","created_at":"2026-05-18T00:34:09Z","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 study recovery of piecewise-constant signals on graphs by the estimator minimizing an $l_0$-edge-penalized objective. Although exact minimization of this objective may be computationally intractable, we show that the same statistical risk guarantees are achieved by the $\\alpha$-expansion algorithm which computes an approximate minimizer in polynomial time. We establish that for graphs with small average vertex degree, these guarantees are minimax rate-optimal over classes of edge-sparse signals. For spatially inhomogeneous graphs, we propose minimization of an edge-weighted objective where ","authors_text":"Leying Guan, Zhou Fan","cross_cats":["math.ST","stat.CO","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-03-04T09:12:42Z","title":"Approximate $l_0$-penalized estimation of piecewise-constant signals on graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01421","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:79a12af3cad2cbb91fa5e74b0c9fcd00ee888e5265ab66eb070eb8d4ffc8adb9","target":"record","created_at":"2026-05-18T00:34:09Z","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":"c74560818b2f4ce39b46df92a02a5999892dd1241a693f9bd3164a8cda878a88","cross_cats_sorted":["math.ST","stat.CO","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-03-04T09:12:42Z","title_canon_sha256":"a643fe1d332cc6e9fb899e3e05712cf31895a971a6d6a0ebfd134a03f042875c"},"schema_version":"1.0","source":{"id":"1703.01421","kind":"arxiv","version":2}},"canonical_sha256":"a128bed3d20c1e15a6533fd5a3a67ef60c186c437f6c5023cbb7b86dab25b879","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a128bed3d20c1e15a6533fd5a3a67ef60c186c437f6c5023cbb7b86dab25b879","first_computed_at":"2026-05-18T00:34:09.989081Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:09.989081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WlPcWZ1E/5f+i+AVQeS0Il6YTfT95ZZX1zIZu2A9ROpccKNdyqo4AH/VN7tpUlrsHQPlwtPc64ywKSjAmzGJCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:09.989740Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.01421","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79a12af3cad2cbb91fa5e74b0c9fcd00ee888e5265ab66eb070eb8d4ffc8adb9","sha256:c09cad9decab35147db192056ed7157aaabcc734373c90176d6d98f13c1d97b4"],"state_sha256":"d0fda9812e24a97d0d9ffa991c8ea87f7c98187f9dd74c8f0193c96c518cb807"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zIkhh0jr1hF5zna81utkELrDN3gmwQEfyU/Yw5EQET9g+YSxi9APWwD3CAlv6GlAK3BlT6w5qD67RSfCtXTxAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:14:03.452589Z","bundle_sha256":"1ce4f79099cee605f41931d1c24d40a61d991c4d43e414e7a51a16120274c5c2"}}