{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KEZA3MWBFFUL5TGZCULMXLJO53","short_pith_number":"pith:KEZA3MWB","canonical_record":{"source":{"id":"1903.07156","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2019-03-17T19:53:45Z","cross_cats_sorted":[],"title_canon_sha256":"73295782c624d2ee47c47b5b7dd46e00d3959c4601f534b42d57e7e424a52fed","abstract_canon_sha256":"865d9ec6b91bc9e219a51c1415958f8a6026f017766be5784038221c2f001fd3"},"schema_version":"1.0"},"canonical_sha256":"51320db2c12968beccd91516cbad2eeee5a6acb751f63fd7e31362e4d5873292","source":{"kind":"arxiv","id":"1903.07156","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.07156","created_at":"2026-05-17T23:50:44Z"},{"alias_kind":"arxiv_version","alias_value":"1903.07156v2","created_at":"2026-05-17T23:50:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07156","created_at":"2026-05-17T23:50:44Z"},{"alias_kind":"pith_short_12","alias_value":"KEZA3MWBFFUL","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KEZA3MWBFFUL5TGZ","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KEZA3MWB","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KEZA3MWBFFUL5TGZCULMXLJO53","target":"record","payload":{"canonical_record":{"source":{"id":"1903.07156","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2019-03-17T19:53:45Z","cross_cats_sorted":[],"title_canon_sha256":"73295782c624d2ee47c47b5b7dd46e00d3959c4601f534b42d57e7e424a52fed","abstract_canon_sha256":"865d9ec6b91bc9e219a51c1415958f8a6026f017766be5784038221c2f001fd3"},"schema_version":"1.0"},"canonical_sha256":"51320db2c12968beccd91516cbad2eeee5a6acb751f63fd7e31362e4d5873292","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:44.374824Z","signature_b64":"XComAOrKhtz9nOy/5V3gGOwxdXFw8dIVZm5GEX9nmpSN9xnNhDe748r0BMv0d5pETUEjRwQTzzmIdj/Z0Ag9BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51320db2c12968beccd91516cbad2eeee5a6acb751f63fd7e31362e4d5873292","last_reissued_at":"2026-05-17T23:50:44.374194Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:44.374194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.07156","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:50:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N2KWT3yKRAgP47SrdBBJjBXsZKEAVGSBOO+0lBhVZTQB/CMVqUN6OvypN6s53v+hGAlQe8eR0GW9EFqBc5/qCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T01:00:22.972821Z"},"content_sha256":"50d0f3f62d6ef50c02932ccb4a9ce5ec53f837760434ba7f49ea9b8a0034b21b","schema_version":"1.0","event_id":"sha256:50d0f3f62d6ef50c02932ccb4a9ce5ec53f837760434ba7f49ea9b8a0034b21b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KEZA3MWBFFUL5TGZCULMXLJO53","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A linear programming approach to sparse linear regression with quantized data","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Diego Regruto, Sophie M. Fosson, Vito Cerone","submitted_at":"2019-03-17T19:53:45Z","abstract_excerpt":"The sparse linear regression problem is difficult to handle with usual sparse optimization models when both predictors and measurements are either quantized or represented in low-precision, due to non-convexity. In this paper, we provide a novel linear programming approach, which is effective to tackle this problem. In particular, we prove theoretical guarantees of robustness, and we present numerical results that show improved performance with respect to the state-of-the-art methods."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07156","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:50:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lrowXbdsXFUrawvr4PJn3+WfJEIdqQIKAbfrtwVkRwGy8kEPDKqoim15+miZJ6B9xkzGw/GOScKuOdnlFl5DDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T01:00:22.973419Z"},"content_sha256":"c78b1ff78a89d031a49a25795611511d6cc64bb92077304a64e983849ddd82c3","schema_version":"1.0","event_id":"sha256:c78b1ff78a89d031a49a25795611511d6cc64bb92077304a64e983849ddd82c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KEZA3MWBFFUL5TGZCULMXLJO53/bundle.json","state_url":"https://pith.science/pith/KEZA3MWBFFUL5TGZCULMXLJO53/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KEZA3MWBFFUL5TGZCULMXLJO53/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-04T01:00:22Z","links":{"resolver":"https://pith.science/pith/KEZA3MWBFFUL5TGZCULMXLJO53","bundle":"https://pith.science/pith/KEZA3MWBFFUL5TGZCULMXLJO53/bundle.json","state":"https://pith.science/pith/KEZA3MWBFFUL5TGZCULMXLJO53/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KEZA3MWBFFUL5TGZCULMXLJO53/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KEZA3MWBFFUL5TGZCULMXLJO53","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"865d9ec6b91bc9e219a51c1415958f8a6026f017766be5784038221c2f001fd3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2019-03-17T19:53:45Z","title_canon_sha256":"73295782c624d2ee47c47b5b7dd46e00d3959c4601f534b42d57e7e424a52fed"},"schema_version":"1.0","source":{"id":"1903.07156","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.07156","created_at":"2026-05-17T23:50:44Z"},{"alias_kind":"arxiv_version","alias_value":"1903.07156v2","created_at":"2026-05-17T23:50:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07156","created_at":"2026-05-17T23:50:44Z"},{"alias_kind":"pith_short_12","alias_value":"KEZA3MWBFFUL","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KEZA3MWBFFUL5TGZ","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KEZA3MWB","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:c78b1ff78a89d031a49a25795611511d6cc64bb92077304a64e983849ddd82c3","target":"graph","created_at":"2026-05-17T23:50:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The sparse linear regression problem is difficult to handle with usual sparse optimization models when both predictors and measurements are either quantized or represented in low-precision, due to non-convexity. In this paper, we provide a novel linear programming approach, which is effective to tackle this problem. In particular, we prove theoretical guarantees of robustness, and we present numerical results that show improved performance with respect to the state-of-the-art methods.","authors_text":"Diego Regruto, Sophie M. Fosson, Vito Cerone","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2019-03-17T19:53:45Z","title":"A linear programming approach to sparse linear regression with quantized data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07156","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:50d0f3f62d6ef50c02932ccb4a9ce5ec53f837760434ba7f49ea9b8a0034b21b","target":"record","created_at":"2026-05-17T23:50:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"865d9ec6b91bc9e219a51c1415958f8a6026f017766be5784038221c2f001fd3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2019-03-17T19:53:45Z","title_canon_sha256":"73295782c624d2ee47c47b5b7dd46e00d3959c4601f534b42d57e7e424a52fed"},"schema_version":"1.0","source":{"id":"1903.07156","kind":"arxiv","version":2}},"canonical_sha256":"51320db2c12968beccd91516cbad2eeee5a6acb751f63fd7e31362e4d5873292","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51320db2c12968beccd91516cbad2eeee5a6acb751f63fd7e31362e4d5873292","first_computed_at":"2026-05-17T23:50:44.374194Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:44.374194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XComAOrKhtz9nOy/5V3gGOwxdXFw8dIVZm5GEX9nmpSN9xnNhDe748r0BMv0d5pETUEjRwQTzzmIdj/Z0Ag9BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:44.374824Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.07156","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50d0f3f62d6ef50c02932ccb4a9ce5ec53f837760434ba7f49ea9b8a0034b21b","sha256:c78b1ff78a89d031a49a25795611511d6cc64bb92077304a64e983849ddd82c3"],"state_sha256":"90cb17c778c4fa942f25b7573ac79e0f8328bf3a8075e60a9f025611c46662fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q8HjI9a7Ltjr0uui6+MKnd3cNjRnAbrKihgwoQ8E+xmRZb9x8wehzxB7XXCGZN2R72wCeEmwaJW3MIvBVgGDAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T01:00:22.976730Z","bundle_sha256":"2dbd5d72916fc6b88fccb89e7bb3cfbc82d2ae01d2e30edac8c74f096711fabf"}}