{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GYFKGOOX7PVVHRFVSU73SE7CPJ","short_pith_number":"pith:GYFKGOOX","canonical_record":{"source":{"id":"1805.03719","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-05-09T20:19:25Z","cross_cats_sorted":[],"title_canon_sha256":"8c39a0d0cb889a2ce1c55bcdf0438fdc0ee72908be37ca04dab0042567a7c3ee","abstract_canon_sha256":"8be91dcc79b38a89000587c1624d346085a2305bc9cdb5eba33aa15ea6a09a1d"},"schema_version":"1.0"},"canonical_sha256":"360aa339d7fbeb53c4b5953fb913e27a4ba7f8056469473191861953f326991a","source":{"kind":"arxiv","id":"1805.03719","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03719","created_at":"2026-05-17T23:56:10Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03719v5","created_at":"2026-05-17T23:56:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03719","created_at":"2026-05-17T23:56:10Z"},{"alias_kind":"pith_short_12","alias_value":"GYFKGOOX7PVV","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GYFKGOOX7PVVHRFV","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GYFKGOOX","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GYFKGOOX7PVVHRFVSU73SE7CPJ","target":"record","payload":{"canonical_record":{"source":{"id":"1805.03719","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-05-09T20:19:25Z","cross_cats_sorted":[],"title_canon_sha256":"8c39a0d0cb889a2ce1c55bcdf0438fdc0ee72908be37ca04dab0042567a7c3ee","abstract_canon_sha256":"8be91dcc79b38a89000587c1624d346085a2305bc9cdb5eba33aa15ea6a09a1d"},"schema_version":"1.0"},"canonical_sha256":"360aa339d7fbeb53c4b5953fb913e27a4ba7f8056469473191861953f326991a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:10.138005Z","signature_b64":"xsavH0oBiegWtqllV4jarW0CBBEZILzvtF5eMDja+7VSVjiAGFuPIrxkb2+INPV3ttMYVHVJJwiOKHBazy37Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"360aa339d7fbeb53c4b5953fb913e27a4ba7f8056469473191861953f326991a","last_reissued_at":"2026-05-17T23:56:10.137257Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:10.137257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.03719","source_version":5,"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-17T23:56:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NS4CpNAKwXVnDYagXe/w6Lvv+hK1s1cA50eZQ/hZv+5/GtdvarWFsJwkVM8S7P8N85FgMBnUTbhS3ttSafBnDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T12:46:31.934076Z"},"content_sha256":"b473344c1ac141be900cf68ded7838b0cdab1ebb7298c48d0c44af0e32603159","schema_version":"1.0","event_id":"sha256:b473344c1ac141be900cf68ded7838b0cdab1ebb7298c48d0c44af0e32603159"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GYFKGOOX7PVVHRFVSU73SE7CPJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An efficient two step algorithm for high dimensional change point regression models without grid search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Abhishek Kaul, Stergios B. Fotopoulos, Venkata K. Jandhyala","submitted_at":"2018-05-09T20:19:25Z","abstract_excerpt":"We propose a two step algorithm based on $\\ell_1/\\ell_0$ regularization for the detection and estimation of parameters of a high dimensional change point regression model and provide the corresponding rates of convergence for the change point as well as the regression parameter estimates. Importantly, the computational cost of our estimator is only $2\\cdotp$Lasso$(n,p)$, where Lasso$(n,p)$ represents the computational burden of one Lasso optimization in a model of size $(n,p)$. In comparison, existing grid search based approaches to this problem require a computational cost of at least $n\\cdot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03719","kind":"arxiv","version":5},"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-17T23:56:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B3KHnHQyfD8QiG0JWBBOVmc81ZSq6T8gfZiiyU44jNogg9w9fdbmKsnnlMaQDw+jptUKFeK8V6abSc0SVCUmCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T12:46:31.934424Z"},"content_sha256":"1c403c0061321273aa2a80bcc673ffd983fb44cf486880f9f8988e05f80a8185","schema_version":"1.0","event_id":"sha256:1c403c0061321273aa2a80bcc673ffd983fb44cf486880f9f8988e05f80a8185"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GYFKGOOX7PVVHRFVSU73SE7CPJ/bundle.json","state_url":"https://pith.science/pith/GYFKGOOX7PVVHRFVSU73SE7CPJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GYFKGOOX7PVVHRFVSU73SE7CPJ/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-22T12:46:31Z","links":{"resolver":"https://pith.science/pith/GYFKGOOX7PVVHRFVSU73SE7CPJ","bundle":"https://pith.science/pith/GYFKGOOX7PVVHRFVSU73SE7CPJ/bundle.json","state":"https://pith.science/pith/GYFKGOOX7PVVHRFVSU73SE7CPJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GYFKGOOX7PVVHRFVSU73SE7CPJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GYFKGOOX7PVVHRFVSU73SE7CPJ","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":"8be91dcc79b38a89000587c1624d346085a2305bc9cdb5eba33aa15ea6a09a1d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-05-09T20:19:25Z","title_canon_sha256":"8c39a0d0cb889a2ce1c55bcdf0438fdc0ee72908be37ca04dab0042567a7c3ee"},"schema_version":"1.0","source":{"id":"1805.03719","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03719","created_at":"2026-05-17T23:56:10Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03719v5","created_at":"2026-05-17T23:56:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03719","created_at":"2026-05-17T23:56:10Z"},{"alias_kind":"pith_short_12","alias_value":"GYFKGOOX7PVV","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GYFKGOOX7PVVHRFV","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GYFKGOOX","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:1c403c0061321273aa2a80bcc673ffd983fb44cf486880f9f8988e05f80a8185","target":"graph","created_at":"2026-05-17T23:56:10Z","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 propose a two step algorithm based on $\\ell_1/\\ell_0$ regularization for the detection and estimation of parameters of a high dimensional change point regression model and provide the corresponding rates of convergence for the change point as well as the regression parameter estimates. Importantly, the computational cost of our estimator is only $2\\cdotp$Lasso$(n,p)$, where Lasso$(n,p)$ represents the computational burden of one Lasso optimization in a model of size $(n,p)$. In comparison, existing grid search based approaches to this problem require a computational cost of at least $n\\cdot","authors_text":"Abhishek Kaul, Stergios B. Fotopoulos, Venkata K. Jandhyala","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-05-09T20:19:25Z","title":"An efficient two step algorithm for high dimensional change point regression models without grid search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03719","kind":"arxiv","version":5},"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:b473344c1ac141be900cf68ded7838b0cdab1ebb7298c48d0c44af0e32603159","target":"record","created_at":"2026-05-17T23:56:10Z","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":"8be91dcc79b38a89000587c1624d346085a2305bc9cdb5eba33aa15ea6a09a1d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-05-09T20:19:25Z","title_canon_sha256":"8c39a0d0cb889a2ce1c55bcdf0438fdc0ee72908be37ca04dab0042567a7c3ee"},"schema_version":"1.0","source":{"id":"1805.03719","kind":"arxiv","version":5}},"canonical_sha256":"360aa339d7fbeb53c4b5953fb913e27a4ba7f8056469473191861953f326991a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"360aa339d7fbeb53c4b5953fb913e27a4ba7f8056469473191861953f326991a","first_computed_at":"2026-05-17T23:56:10.137257Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:10.137257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xsavH0oBiegWtqllV4jarW0CBBEZILzvtF5eMDja+7VSVjiAGFuPIrxkb2+INPV3ttMYVHVJJwiOKHBazy37Aw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:10.138005Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.03719","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b473344c1ac141be900cf68ded7838b0cdab1ebb7298c48d0c44af0e32603159","sha256:1c403c0061321273aa2a80bcc673ffd983fb44cf486880f9f8988e05f80a8185"],"state_sha256":"06f8785925590ace17dbec619dab73a0ce279bbe1ed4cd470146126751d9be0b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EDFlmw0Be6a5j24yGu4vXIJBFNwH9YzseaXBwTqHwM10n+fIAizbN0GPZbv9whHiSwYk5OHAaiI7adZQYt29Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T12:46:31.936212Z","bundle_sha256":"ff37bb81d9f9aec044d97016582bf4ef04a56509a2935c79346c83f79e14ef3f"}}