{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:A3Z356RTJWUAFWTT7BPSRIFCVG","short_pith_number":"pith:A3Z356RT","schema_version":"1.0","canonical_sha256":"06f3befa334da802da73f85f28a0a2a99feadf28694678f408271154b3393bee","source":{"kind":"arxiv","id":"1811.01383","version":1},"attestation_state":"computed","paper":{"title":"An Algorithm for Integer Least-squares with Equality, Sparsity and Rank Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Arun Ayyar, Nirav Bhatt","submitted_at":"2018-11-04T15:02:59Z","abstract_excerpt":"In this work, we deal with rank-constrained integer least-squares optimization problems arising in low-rank matrix factorization related applications. We propose a solution for constrained integer least-squares problem subject to equality, sparsity, and rank constraints. The algorithm combines the Fincke-Pohst enumeration (or sphere decoding algorithm) with rank constraints and sparse solutions of Diophantine equations to arrive at an optimal solution. The proposed approach consists of two steps as follows: (i) find the solution set for Diophantine equations arising from the linear and sparsit"},"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":"1811.01383","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-04T15:02:59Z","cross_cats_sorted":[],"title_canon_sha256":"14522221f0c9382b0a16de220364950295175581956d44a88a5da98ac814cd74","abstract_canon_sha256":"2518af6653458df477abaa4ef3a9432eb50854a7a45f5a74584a2ec9c7ee78ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:34.468249Z","signature_b64":"KQsF991a6qe+h8V1XbCZR1YLuyoZYqsWFRNorA5teVejIoSpZ9M1ewpRhmL0mQETRg4dq/zbViZyvJtNjZEpDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06f3befa334da802da73f85f28a0a2a99feadf28694678f408271154b3393bee","last_reissued_at":"2026-05-18T00:01:34.467688Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:34.467688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Algorithm for Integer Least-squares with Equality, Sparsity and Rank Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Arun Ayyar, Nirav Bhatt","submitted_at":"2018-11-04T15:02:59Z","abstract_excerpt":"In this work, we deal with rank-constrained integer least-squares optimization problems arising in low-rank matrix factorization related applications. We propose a solution for constrained integer least-squares problem subject to equality, sparsity, and rank constraints. The algorithm combines the Fincke-Pohst enumeration (or sphere decoding algorithm) with rank constraints and sparse solutions of Diophantine equations to arrive at an optimal solution. The proposed approach consists of two steps as follows: (i) find the solution set for Diophantine equations arising from the linear and sparsit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01383","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":"1811.01383","created_at":"2026-05-18T00:01:34.467782+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.01383v1","created_at":"2026-05-18T00:01:34.467782+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01383","created_at":"2026-05-18T00:01:34.467782+00:00"},{"alias_kind":"pith_short_12","alias_value":"A3Z356RTJWUA","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"A3Z356RTJWUAFWTT","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"A3Z356RT","created_at":"2026-05-18T12:32:13.499390+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/A3Z356RTJWUAFWTT7BPSRIFCVG","json":"https://pith.science/pith/A3Z356RTJWUAFWTT7BPSRIFCVG.json","graph_json":"https://pith.science/api/pith-number/A3Z356RTJWUAFWTT7BPSRIFCVG/graph.json","events_json":"https://pith.science/api/pith-number/A3Z356RTJWUAFWTT7BPSRIFCVG/events.json","paper":"https://pith.science/paper/A3Z356RT"},"agent_actions":{"view_html":"https://pith.science/pith/A3Z356RTJWUAFWTT7BPSRIFCVG","download_json":"https://pith.science/pith/A3Z356RTJWUAFWTT7BPSRIFCVG.json","view_paper":"https://pith.science/paper/A3Z356RT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.01383&json=true","fetch_graph":"https://pith.science/api/pith-number/A3Z356RTJWUAFWTT7BPSRIFCVG/graph.json","fetch_events":"https://pith.science/api/pith-number/A3Z356RTJWUAFWTT7BPSRIFCVG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A3Z356RTJWUAFWTT7BPSRIFCVG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A3Z356RTJWUAFWTT7BPSRIFCVG/action/storage_attestation","attest_author":"https://pith.science/pith/A3Z356RTJWUAFWTT7BPSRIFCVG/action/author_attestation","sign_citation":"https://pith.science/pith/A3Z356RTJWUAFWTT7BPSRIFCVG/action/citation_signature","submit_replication":"https://pith.science/pith/A3Z356RTJWUAFWTT7BPSRIFCVG/action/replication_record"}},"created_at":"2026-05-18T00:01:34.467782+00:00","updated_at":"2026-05-18T00:01:34.467782+00:00"}