{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CC7QR5E54SKVEO5AL2CK3NU35Y","short_pith_number":"pith:CC7QR5E5","schema_version":"1.0","canonical_sha256":"10bf08f49de495523ba05e84adb69bee23acc3b0f87b79a31b25baad3ddbc90a","source":{"kind":"arxiv","id":"1710.09663","version":1},"attestation_state":"computed","paper":{"title":"A Fast Algorithm for Solving Henderson's Mixed Model Equation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Jiwoong Kim","submitted_at":"2017-10-26T12:24:12Z","abstract_excerpt":"This article investigates a fast and stable method to solve Henderson's mixed model equation. The proposed algorithm is stable in that it avoids inverting a matrix of a large dimension and hence is free from the curse of dimensionality. This tactic is enabled through row operations performed on the design matrix."},"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":"1710.09663","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-10-26T12:24:12Z","cross_cats_sorted":[],"title_canon_sha256":"19b5cdc1da1f0f8ba4a41edf38327015dfa11ea774102f88dc757992e0cfd746","abstract_canon_sha256":"4491e7165c4a117629976e2b82ee704007eb6e1e591451b190cf97fcb1f92d5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:56.692020Z","signature_b64":"DlgXnPaIvvriF3DWVNBjaT0obu/L7fasdjcErlkhBDs83HUWSjvkojzAcVxEaAPA9G4VrV9fE4v7m1D1tq0qCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10bf08f49de495523ba05e84adb69bee23acc3b0f87b79a31b25baad3ddbc90a","last_reissued_at":"2026-05-18T00:31:56.691599Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:56.691599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fast Algorithm for Solving Henderson's Mixed Model Equation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Jiwoong Kim","submitted_at":"2017-10-26T12:24:12Z","abstract_excerpt":"This article investigates a fast and stable method to solve Henderson's mixed model equation. The proposed algorithm is stable in that it avoids inverting a matrix of a large dimension and hence is free from the curse of dimensionality. This tactic is enabled through row operations performed on the design matrix."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09663","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":"1710.09663","created_at":"2026-05-18T00:31:56.691674+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.09663v1","created_at":"2026-05-18T00:31:56.691674+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09663","created_at":"2026-05-18T00:31:56.691674+00:00"},{"alias_kind":"pith_short_12","alias_value":"CC7QR5E54SKV","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CC7QR5E54SKVEO5A","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CC7QR5E5","created_at":"2026-05-18T12:31:10.602751+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/CC7QR5E54SKVEO5AL2CK3NU35Y","json":"https://pith.science/pith/CC7QR5E54SKVEO5AL2CK3NU35Y.json","graph_json":"https://pith.science/api/pith-number/CC7QR5E54SKVEO5AL2CK3NU35Y/graph.json","events_json":"https://pith.science/api/pith-number/CC7QR5E54SKVEO5AL2CK3NU35Y/events.json","paper":"https://pith.science/paper/CC7QR5E5"},"agent_actions":{"view_html":"https://pith.science/pith/CC7QR5E54SKVEO5AL2CK3NU35Y","download_json":"https://pith.science/pith/CC7QR5E54SKVEO5AL2CK3NU35Y.json","view_paper":"https://pith.science/paper/CC7QR5E5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.09663&json=true","fetch_graph":"https://pith.science/api/pith-number/CC7QR5E54SKVEO5AL2CK3NU35Y/graph.json","fetch_events":"https://pith.science/api/pith-number/CC7QR5E54SKVEO5AL2CK3NU35Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CC7QR5E54SKVEO5AL2CK3NU35Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CC7QR5E54SKVEO5AL2CK3NU35Y/action/storage_attestation","attest_author":"https://pith.science/pith/CC7QR5E54SKVEO5AL2CK3NU35Y/action/author_attestation","sign_citation":"https://pith.science/pith/CC7QR5E54SKVEO5AL2CK3NU35Y/action/citation_signature","submit_replication":"https://pith.science/pith/CC7QR5E54SKVEO5AL2CK3NU35Y/action/replication_record"}},"created_at":"2026-05-18T00:31:56.691674+00:00","updated_at":"2026-05-18T00:31:56.691674+00:00"}