{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MJANTS2DKLFED7BDEQN6QHXC4M","short_pith_number":"pith:MJANTS2D","schema_version":"1.0","canonical_sha256":"6240d9cb4352ca41fc23241be81ee2e307ea52ff104f69ffc650b742d0418597","source":{"kind":"arxiv","id":"1709.01860","version":1},"attestation_state":"computed","paper":{"title":"The low-rank hurdle model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Christopher Dienes","submitted_at":"2017-09-06T15:41:11Z","abstract_excerpt":"A composite loss framework is proposed for low-rank modeling of data consisting of interesting and common values, such as excess zeros or missing values. The methodology is motivated by the generalized low-rank framework and the hurdle method which is commonly used to analyze zero-inflated counts. The model is demonstrated on a manufacturing data set and applied to the problem of missing value imputation."},"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":"1709.01860","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-09-06T15:41:11Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"551d05fe805d43ba231e8e5d6af778c9e03a153308bc7faded1e4b002f25171b","abstract_canon_sha256":"460def831b059481aedc1591c5a586e83318ea86706d104e03b23739522a0134"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:54.180040Z","signature_b64":"GTE+cKq0lMKalLHYXaG7J459dyo4BG9E0Xb1+YoOFwJvqlQ6jHC0mitJnZNdvl7toPRL9XTJAm+3+DEleADABQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6240d9cb4352ca41fc23241be81ee2e307ea52ff104f69ffc650b742d0418597","last_reissued_at":"2026-05-18T00:35:54.179640Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:54.179640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The low-rank hurdle model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Christopher Dienes","submitted_at":"2017-09-06T15:41:11Z","abstract_excerpt":"A composite loss framework is proposed for low-rank modeling of data consisting of interesting and common values, such as excess zeros or missing values. The methodology is motivated by the generalized low-rank framework and the hurdle method which is commonly used to analyze zero-inflated counts. The model is demonstrated on a manufacturing data set and applied to the problem of missing value imputation."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01860","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":"1709.01860","created_at":"2026-05-18T00:35:54.179701+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.01860v1","created_at":"2026-05-18T00:35:54.179701+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01860","created_at":"2026-05-18T00:35:54.179701+00:00"},{"alias_kind":"pith_short_12","alias_value":"MJANTS2DKLFE","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MJANTS2DKLFED7BD","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MJANTS2D","created_at":"2026-05-18T12:31:31.346846+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/MJANTS2DKLFED7BDEQN6QHXC4M","json":"https://pith.science/pith/MJANTS2DKLFED7BDEQN6QHXC4M.json","graph_json":"https://pith.science/api/pith-number/MJANTS2DKLFED7BDEQN6QHXC4M/graph.json","events_json":"https://pith.science/api/pith-number/MJANTS2DKLFED7BDEQN6QHXC4M/events.json","paper":"https://pith.science/paper/MJANTS2D"},"agent_actions":{"view_html":"https://pith.science/pith/MJANTS2DKLFED7BDEQN6QHXC4M","download_json":"https://pith.science/pith/MJANTS2DKLFED7BDEQN6QHXC4M.json","view_paper":"https://pith.science/paper/MJANTS2D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.01860&json=true","fetch_graph":"https://pith.science/api/pith-number/MJANTS2DKLFED7BDEQN6QHXC4M/graph.json","fetch_events":"https://pith.science/api/pith-number/MJANTS2DKLFED7BDEQN6QHXC4M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MJANTS2DKLFED7BDEQN6QHXC4M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MJANTS2DKLFED7BDEQN6QHXC4M/action/storage_attestation","attest_author":"https://pith.science/pith/MJANTS2DKLFED7BDEQN6QHXC4M/action/author_attestation","sign_citation":"https://pith.science/pith/MJANTS2DKLFED7BDEQN6QHXC4M/action/citation_signature","submit_replication":"https://pith.science/pith/MJANTS2DKLFED7BDEQN6QHXC4M/action/replication_record"}},"created_at":"2026-05-18T00:35:54.179701+00:00","updated_at":"2026-05-18T00:35:54.179701+00:00"}