{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DRMZIQU6EV2K6SVOZPEIZVW3WE","short_pith_number":"pith:DRMZIQU6","schema_version":"1.0","canonical_sha256":"1c5994429e2574af4aaecbc88cd6dbb1343ead8b58853522f80852636ea8fa12","source":{"kind":"arxiv","id":"1705.08731","version":1},"attestation_state":"computed","paper":{"title":"Kronecker Product Least Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Pranay Seshadri","submitted_at":"2017-05-21T22:03:52Z","abstract_excerpt":"In this rather brief note we present and discuss techniques for solving Kronecker matrix product least squares problems. Our main contribution is an iterative approach that uses the efficient Kronecker matrix-vector multiplication strategy (Fernandes et al. 1998) with a conjugate gradient solver. Numerical results contrast this approach---in terms of running times and accuracy---against the direct approach."},"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":"1705.08731","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-05-21T22:03:52Z","cross_cats_sorted":[],"title_canon_sha256":"962af1fd91a7abfd2fea4f52a80ddb76cb7e42bc4dabcf059270a1a58b378c2d","abstract_canon_sha256":"fecc4e0766d3c5559f3d5872249dbb6ee671336468fb7495723cf1868fcef4d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:44.414117Z","signature_b64":"jonl20JH9TyVEcx/bwkjMNbeiu0W7KGzYZKtziFeCwQSnJL2a1tqqn1KoeY+nVKE9oRDDeieXuIPKnFdH9UfDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c5994429e2574af4aaecbc88cd6dbb1343ead8b58853522f80852636ea8fa12","last_reissued_at":"2026-05-18T00:43:44.413431Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:44.413431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Kronecker Product Least Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Pranay Seshadri","submitted_at":"2017-05-21T22:03:52Z","abstract_excerpt":"In this rather brief note we present and discuss techniques for solving Kronecker matrix product least squares problems. Our main contribution is an iterative approach that uses the efficient Kronecker matrix-vector multiplication strategy (Fernandes et al. 1998) with a conjugate gradient solver. Numerical results contrast this approach---in terms of running times and accuracy---against the direct approach."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08731","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":"1705.08731","created_at":"2026-05-18T00:43:44.413544+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.08731v1","created_at":"2026-05-18T00:43:44.413544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08731","created_at":"2026-05-18T00:43:44.413544+00:00"},{"alias_kind":"pith_short_12","alias_value":"DRMZIQU6EV2K","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"DRMZIQU6EV2K6SVO","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"DRMZIQU6","created_at":"2026-05-18T12:31:12.930513+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/DRMZIQU6EV2K6SVOZPEIZVW3WE","json":"https://pith.science/pith/DRMZIQU6EV2K6SVOZPEIZVW3WE.json","graph_json":"https://pith.science/api/pith-number/DRMZIQU6EV2K6SVOZPEIZVW3WE/graph.json","events_json":"https://pith.science/api/pith-number/DRMZIQU6EV2K6SVOZPEIZVW3WE/events.json","paper":"https://pith.science/paper/DRMZIQU6"},"agent_actions":{"view_html":"https://pith.science/pith/DRMZIQU6EV2K6SVOZPEIZVW3WE","download_json":"https://pith.science/pith/DRMZIQU6EV2K6SVOZPEIZVW3WE.json","view_paper":"https://pith.science/paper/DRMZIQU6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.08731&json=true","fetch_graph":"https://pith.science/api/pith-number/DRMZIQU6EV2K6SVOZPEIZVW3WE/graph.json","fetch_events":"https://pith.science/api/pith-number/DRMZIQU6EV2K6SVOZPEIZVW3WE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DRMZIQU6EV2K6SVOZPEIZVW3WE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DRMZIQU6EV2K6SVOZPEIZVW3WE/action/storage_attestation","attest_author":"https://pith.science/pith/DRMZIQU6EV2K6SVOZPEIZVW3WE/action/author_attestation","sign_citation":"https://pith.science/pith/DRMZIQU6EV2K6SVOZPEIZVW3WE/action/citation_signature","submit_replication":"https://pith.science/pith/DRMZIQU6EV2K6SVOZPEIZVW3WE/action/replication_record"}},"created_at":"2026-05-18T00:43:44.413544+00:00","updated_at":"2026-05-18T00:43:44.413544+00:00"}