{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IOHWKXSJQ4C3HZD4WTWOB5MNEM","short_pith_number":"pith:IOHWKXSJ","schema_version":"1.0","canonical_sha256":"438f655e498705b3e47cb4ece0f58d2317660ce417271718a36f96788853e669","source":{"kind":"arxiv","id":"1509.03767","version":1},"attestation_state":"computed","paper":{"title":"Algorithms for Envelope Estimation II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Dennis Cook, Liliana Forzani, Zhihua Su","submitted_at":"2015-09-12T19:17:01Z","abstract_excerpt":"We propose a new algorithm for envelope estimation, along with a new root n consistent method for computing starting values. The new algorithm, which does not require optimization over a Grassmannian, is shown by simulation to be much faster and typically more accurate that the best existing algorithm proposed by Cook and Zhang (2015c)."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1509.03767","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-09-12T19:17:01Z","cross_cats_sorted":[],"title_canon_sha256":"b862f47e6faa53e272759c928275a01972ae70ca248596a677658b4917732308","abstract_canon_sha256":"e75fc7a85c2ef4160938ec4442bd19a1f60abbdbad0c90ce31a007b938216dab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:14.594616Z","signature_b64":"b1xbzUcaCs+1w/2brlTBlUtu1+c3K2PJhbdziY9khMwgeZpU8itB1TiZPxgqBwCHbiuVJve3m7Zqj9REK8hPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"438f655e498705b3e47cb4ece0f58d2317660ce417271718a36f96788853e669","last_reissued_at":"2026-05-18T01:33:14.593968Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:14.593968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for Envelope Estimation II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Dennis Cook, Liliana Forzani, Zhihua Su","submitted_at":"2015-09-12T19:17:01Z","abstract_excerpt":"We propose a new algorithm for envelope estimation, along with a new root n consistent method for computing starting values. The new algorithm, which does not require optimization over a Grassmannian, is shown by simulation to be much faster and typically more accurate that the best existing algorithm proposed by Cook and Zhang (2015c)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03767","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.03767","created_at":"2026-05-18T01:33:14.594066+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.03767v1","created_at":"2026-05-18T01:33:14.594066+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03767","created_at":"2026-05-18T01:33:14.594066+00:00"},{"alias_kind":"pith_short_12","alias_value":"IOHWKXSJQ4C3","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IOHWKXSJQ4C3HZD4","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IOHWKXSJ","created_at":"2026-05-18T12:29:25.134429+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IOHWKXSJQ4C3HZD4WTWOB5MNEM","json":"https://pith.science/pith/IOHWKXSJQ4C3HZD4WTWOB5MNEM.json","graph_json":"https://pith.science/api/pith-number/IOHWKXSJQ4C3HZD4WTWOB5MNEM/graph.json","events_json":"https://pith.science/api/pith-number/IOHWKXSJQ4C3HZD4WTWOB5MNEM/events.json","paper":"https://pith.science/paper/IOHWKXSJ"},"agent_actions":{"view_html":"https://pith.science/pith/IOHWKXSJQ4C3HZD4WTWOB5MNEM","download_json":"https://pith.science/pith/IOHWKXSJQ4C3HZD4WTWOB5MNEM.json","view_paper":"https://pith.science/paper/IOHWKXSJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.03767&json=true","fetch_graph":"https://pith.science/api/pith-number/IOHWKXSJQ4C3HZD4WTWOB5MNEM/graph.json","fetch_events":"https://pith.science/api/pith-number/IOHWKXSJQ4C3HZD4WTWOB5MNEM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IOHWKXSJQ4C3HZD4WTWOB5MNEM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IOHWKXSJQ4C3HZD4WTWOB5MNEM/action/storage_attestation","attest_author":"https://pith.science/pith/IOHWKXSJQ4C3HZD4WTWOB5MNEM/action/author_attestation","sign_citation":"https://pith.science/pith/IOHWKXSJQ4C3HZD4WTWOB5MNEM/action/citation_signature","submit_replication":"https://pith.science/pith/IOHWKXSJQ4C3HZD4WTWOB5MNEM/action/replication_record"}},"created_at":"2026-05-18T01:33:14.594066+00:00","updated_at":"2026-05-18T01:33:14.594066+00:00"}