{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:2ZK5GODZFHWKSTVODC3R5HKWXT","short_pith_number":"pith:2ZK5GODZ","canonical_record":{"source":{"id":"2504.02631","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2025-04-03T14:28:50Z","cross_cats_sorted":[],"title_canon_sha256":"ddc7be1ff667a552305471cbb081372ba0e5fbe8350fb86c186adb2c6b878a47","abstract_canon_sha256":"7ba7add578b2877455ddb950f59ea1f8ed0892d7f509afc15d8d4c4dc06347de"},"schema_version":"1.0"},"canonical_sha256":"d655d3387929eca94eae18b71e9d56bcd6510e04c9c6fe69e27c6320b39c3c0b","source":{"kind":"arxiv","id":"2504.02631","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.02631","created_at":"2026-07-05T10:44:00Z"},{"alias_kind":"arxiv_version","alias_value":"2504.02631v1","created_at":"2026-07-05T10:44:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.02631","created_at":"2026-07-05T10:44:00Z"},{"alias_kind":"pith_short_12","alias_value":"2ZK5GODZFHWK","created_at":"2026-07-05T10:44:00Z"},{"alias_kind":"pith_short_16","alias_value":"2ZK5GODZFHWKSTVO","created_at":"2026-07-05T10:44:00Z"},{"alias_kind":"pith_short_8","alias_value":"2ZK5GODZ","created_at":"2026-07-05T10:44:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:2ZK5GODZFHWKSTVODC3R5HKWXT","target":"record","payload":{"canonical_record":{"source":{"id":"2504.02631","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2025-04-03T14:28:50Z","cross_cats_sorted":[],"title_canon_sha256":"ddc7be1ff667a552305471cbb081372ba0e5fbe8350fb86c186adb2c6b878a47","abstract_canon_sha256":"7ba7add578b2877455ddb950f59ea1f8ed0892d7f509afc15d8d4c4dc06347de"},"schema_version":"1.0"},"canonical_sha256":"d655d3387929eca94eae18b71e9d56bcd6510e04c9c6fe69e27c6320b39c3c0b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:44:00.151447Z","signature_b64":"AKdL3FTXuwB0X++pEx4ZLaTC73WZ3zog6b/U1LE9gRXsi+0jLHE3TbQwTHU1CAp27fgzwe/7lg0LNI2z5CAmAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d655d3387929eca94eae18b71e9d56bcd6510e04c9c6fe69e27c6320b39c3c0b","last_reissued_at":"2026-07-05T10:44:00.150978Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:44:00.150978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.02631","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-05T10:44:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Fn5x5mFywQuI7EiWLALoitFH840iPnKpmHn4H6BmaYgtz3Vww9IEwotCcOXC4EvKTd6OmVIktsVRTkis6gYCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T22:36:06.308593Z"},"content_sha256":"ceecf24148b1c745c03be47de7f1e6d1d73068daa9e808cbf7660b8cbe02dbb3","schema_version":"1.0","event_id":"sha256:ceecf24148b1c745c03be47de7f1e6d1d73068daa9e808cbf7660b8cbe02dbb3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:2ZK5GODZFHWKSTVODC3R5HKWXT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Feature splitting parallel algorithm for Dantzig selectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Rongmei Liang, Shi Tang, Xiaofei Wu, Yue Chao, Zhiming Zhang","submitted_at":"2025-04-03T14:28:50Z","abstract_excerpt":"The Dantzig selector is a widely used and effective method for variable selection in ultra-high-dimensional data. Feature splitting is an efficient processing technique that involves dividing these ultra-high-dimensional variable datasets into manageable subsets that can be stored and processed more easily on a single machine. This paper proposes a variable splitting parallel algorithm for solving both convex and nonconvex Dantzig selectors based on the proximal point algorithm. The primary advantage of our parallel algorithm, compared to existing parallel approaches, is the significantly redu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.02631","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/2504.02631/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-05T10:44:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P7rCuaorLaoXhJTwJQtp+hNL9M6s2LcSK8BC5b9VUDowHOsD+mfGmSjkdiAHlrEuLSl4Ef3/ELtl5x0h+MOXDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T22:36:06.309507Z"},"content_sha256":"5e825cc2fd10c134fa2186feddee83039cbc9826322bf8e90ab55afa4a0c7d3b","schema_version":"1.0","event_id":"sha256:5e825cc2fd10c134fa2186feddee83039cbc9826322bf8e90ab55afa4a0c7d3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2ZK5GODZFHWKSTVODC3R5HKWXT/bundle.json","state_url":"https://pith.science/pith/2ZK5GODZFHWKSTVODC3R5HKWXT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2ZK5GODZFHWKSTVODC3R5HKWXT/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-05T22:36:06Z","links":{"resolver":"https://pith.science/pith/2ZK5GODZFHWKSTVODC3R5HKWXT","bundle":"https://pith.science/pith/2ZK5GODZFHWKSTVODC3R5HKWXT/bundle.json","state":"https://pith.science/pith/2ZK5GODZFHWKSTVODC3R5HKWXT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2ZK5GODZFHWKSTVODC3R5HKWXT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:2ZK5GODZFHWKSTVODC3R5HKWXT","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":"7ba7add578b2877455ddb950f59ea1f8ed0892d7f509afc15d8d4c4dc06347de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2025-04-03T14:28:50Z","title_canon_sha256":"ddc7be1ff667a552305471cbb081372ba0e5fbe8350fb86c186adb2c6b878a47"},"schema_version":"1.0","source":{"id":"2504.02631","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.02631","created_at":"2026-07-05T10:44:00Z"},{"alias_kind":"arxiv_version","alias_value":"2504.02631v1","created_at":"2026-07-05T10:44:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.02631","created_at":"2026-07-05T10:44:00Z"},{"alias_kind":"pith_short_12","alias_value":"2ZK5GODZFHWK","created_at":"2026-07-05T10:44:00Z"},{"alias_kind":"pith_short_16","alias_value":"2ZK5GODZFHWKSTVO","created_at":"2026-07-05T10:44:00Z"},{"alias_kind":"pith_short_8","alias_value":"2ZK5GODZ","created_at":"2026-07-05T10:44:00Z"}],"graph_snapshots":[{"event_id":"sha256:5e825cc2fd10c134fa2186feddee83039cbc9826322bf8e90ab55afa4a0c7d3b","target":"graph","created_at":"2026-07-05T10:44:00Z","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/2504.02631/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Dantzig selector is a widely used and effective method for variable selection in ultra-high-dimensional data. Feature splitting is an efficient processing technique that involves dividing these ultra-high-dimensional variable datasets into manageable subsets that can be stored and processed more easily on a single machine. This paper proposes a variable splitting parallel algorithm for solving both convex and nonconvex Dantzig selectors based on the proximal point algorithm. The primary advantage of our parallel algorithm, compared to existing parallel approaches, is the significantly redu","authors_text":"Rongmei Liang, Shi Tang, Xiaofei Wu, Yue Chao, Zhiming Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2025-04-03T14:28:50Z","title":"Feature splitting parallel algorithm for Dantzig selectors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.02631","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:ceecf24148b1c745c03be47de7f1e6d1d73068daa9e808cbf7660b8cbe02dbb3","target":"record","created_at":"2026-07-05T10:44:00Z","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":"7ba7add578b2877455ddb950f59ea1f8ed0892d7f509afc15d8d4c4dc06347de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2025-04-03T14:28:50Z","title_canon_sha256":"ddc7be1ff667a552305471cbb081372ba0e5fbe8350fb86c186adb2c6b878a47"},"schema_version":"1.0","source":{"id":"2504.02631","kind":"arxiv","version":1}},"canonical_sha256":"d655d3387929eca94eae18b71e9d56bcd6510e04c9c6fe69e27c6320b39c3c0b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d655d3387929eca94eae18b71e9d56bcd6510e04c9c6fe69e27c6320b39c3c0b","first_computed_at":"2026-07-05T10:44:00.150978Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:44:00.150978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AKdL3FTXuwB0X++pEx4ZLaTC73WZ3zog6b/U1LE9gRXsi+0jLHE3TbQwTHU1CAp27fgzwe/7lg0LNI2z5CAmAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:44:00.151447Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.02631","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ceecf24148b1c745c03be47de7f1e6d1d73068daa9e808cbf7660b8cbe02dbb3","sha256:5e825cc2fd10c134fa2186feddee83039cbc9826322bf8e90ab55afa4a0c7d3b"],"state_sha256":"93b419b6d2a87fdb17119453204b66a21b340ea1ee7ec461e8e201045c46979d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NmXnPM4yBJBw1qf0ymtwb+Ct14Rcb1cBLBK/0YU4aSi2aLeCK4OnAPoRy0IL5VyKEW5a73HK+lymq+RirCtmDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T22:36:06.332575Z","bundle_sha256":"e8690638f4abfe09273c71186cb4d4995ad5bedebbb94efc238bb12df890611d"}}