{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5T2A6CBYBENDJDOJKWWRRALHOK","short_pith_number":"pith:5T2A6CBY","canonical_record":{"source":{"id":"1704.06311","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-20T19:26:56Z","cross_cats_sorted":[],"title_canon_sha256":"a111de0841a2e9b2e8f3907e6638bf07792f56c8a6d2ec43ac840decb23d0872","abstract_canon_sha256":"0d5b2668f3c5b0b107a9d859f23d5f6f542ec5e9059283f56452fdb991452bd8"},"schema_version":"1.0"},"canonical_sha256":"ecf40f0838091a348dc955ad1881677290378ee6cc549621c200560de473f1ab","source":{"kind":"arxiv","id":"1704.06311","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.06311","created_at":"2026-05-18T00:46:00Z"},{"alias_kind":"arxiv_version","alias_value":"1704.06311v1","created_at":"2026-05-18T00:46:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06311","created_at":"2026-05-18T00:46:00Z"},{"alias_kind":"pith_short_12","alias_value":"5T2A6CBYBEND","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5T2A6CBYBENDJDOJ","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5T2A6CBY","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5T2A6CBYBENDJDOJKWWRRALHOK","target":"record","payload":{"canonical_record":{"source":{"id":"1704.06311","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-20T19:26:56Z","cross_cats_sorted":[],"title_canon_sha256":"a111de0841a2e9b2e8f3907e6638bf07792f56c8a6d2ec43ac840decb23d0872","abstract_canon_sha256":"0d5b2668f3c5b0b107a9d859f23d5f6f542ec5e9059283f56452fdb991452bd8"},"schema_version":"1.0"},"canonical_sha256":"ecf40f0838091a348dc955ad1881677290378ee6cc549621c200560de473f1ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:00.036229Z","signature_b64":"ATXhjkOQZfF8kLM8/cehXVvMJdGjXdcKxiG6Cn0tkOzZiydPngpERdCqPLDWy/ivDiJWGW+9KhbFVcxdztwYAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecf40f0838091a348dc955ad1881677290378ee6cc549621c200560de473f1ab","last_reissued_at":"2026-05-18T00:46:00.035559Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:00.035559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.06311","source_version":1,"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-18T00:46:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AD4lCNZXI8azI5C2RnDwVunSPFnkY/F8izWJr3vsVrh8YPSaf5PJB0Fis4Nh7OKp3JKyLZyaoCSBjmwHAGpiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T23:07:43.634696Z"},"content_sha256":"58cb50661c84fa57f17492b91ca18162bbf22f819d40cc9bafb976723be83049","schema_version":"1.0","event_id":"sha256:58cb50661c84fa57f17492b91ca18162bbf22f819d40cc9bafb976723be83049"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5T2A6CBYBENDJDOJKWWRRALHOK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Euclidean Distance to a Convex Cone Generated by a Large Number of Discrete Points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ali Fattahi, Reza Ahmadi, Sriram Dasu","submitted_at":"2017-04-20T19:26:56Z","abstract_excerpt":"In this paper, we study the problem of finding the Euclidean distance to a convex cone generated by a set of discrete points in $\\mathbb{R}^n_+$. In particular, we are interested in problems where the discrete points are the set of feasible solutions of some binary linear programming constraints. This problem has applications in manufacturing, machine learning, clustering, pattern recognition, and statistics. Our problem is a high-dimensional constrained optimization problem. We propose a Frank-Wolfe based algorithm to solve this non-convex optimization problem with a convex-noncompact feasibl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06311","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"},"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-18T00:46:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bnFi2JfMi3TeeCLGo/IAQpsIi+6+GofDi5ubRDeUu+EDrMRMjolJeQKi8EX+jCyQmz59LDkc8AoS5QnRUq2WDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T23:07:43.635429Z"},"content_sha256":"e940d80f4d44e7a40ab00aa4a3fdb4954550a6bf84c7419c86414eaf268c3f0a","schema_version":"1.0","event_id":"sha256:e940d80f4d44e7a40ab00aa4a3fdb4954550a6bf84c7419c86414eaf268c3f0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5T2A6CBYBENDJDOJKWWRRALHOK/bundle.json","state_url":"https://pith.science/pith/5T2A6CBYBENDJDOJKWWRRALHOK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5T2A6CBYBENDJDOJKWWRRALHOK/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-06-06T23:07:43Z","links":{"resolver":"https://pith.science/pith/5T2A6CBYBENDJDOJKWWRRALHOK","bundle":"https://pith.science/pith/5T2A6CBYBENDJDOJKWWRRALHOK/bundle.json","state":"https://pith.science/pith/5T2A6CBYBENDJDOJKWWRRALHOK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5T2A6CBYBENDJDOJKWWRRALHOK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5T2A6CBYBENDJDOJKWWRRALHOK","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":"0d5b2668f3c5b0b107a9d859f23d5f6f542ec5e9059283f56452fdb991452bd8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-20T19:26:56Z","title_canon_sha256":"a111de0841a2e9b2e8f3907e6638bf07792f56c8a6d2ec43ac840decb23d0872"},"schema_version":"1.0","source":{"id":"1704.06311","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.06311","created_at":"2026-05-18T00:46:00Z"},{"alias_kind":"arxiv_version","alias_value":"1704.06311v1","created_at":"2026-05-18T00:46:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.06311","created_at":"2026-05-18T00:46:00Z"},{"alias_kind":"pith_short_12","alias_value":"5T2A6CBYBEND","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5T2A6CBYBENDJDOJ","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5T2A6CBY","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:e940d80f4d44e7a40ab00aa4a3fdb4954550a6bf84c7419c86414eaf268c3f0a","target":"graph","created_at":"2026-05-18T00:46:00Z","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":"In this paper, we study the problem of finding the Euclidean distance to a convex cone generated by a set of discrete points in $\\mathbb{R}^n_+$. In particular, we are interested in problems where the discrete points are the set of feasible solutions of some binary linear programming constraints. This problem has applications in manufacturing, machine learning, clustering, pattern recognition, and statistics. Our problem is a high-dimensional constrained optimization problem. We propose a Frank-Wolfe based algorithm to solve this non-convex optimization problem with a convex-noncompact feasibl","authors_text":"Ali Fattahi, Reza Ahmadi, Sriram Dasu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-20T19:26:56Z","title":"Finding Euclidean Distance to a Convex Cone Generated by a Large Number of Discrete Points"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.06311","kind":"arxiv","version":1},"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:58cb50661c84fa57f17492b91ca18162bbf22f819d40cc9bafb976723be83049","target":"record","created_at":"2026-05-18T00:46:00Z","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":"0d5b2668f3c5b0b107a9d859f23d5f6f542ec5e9059283f56452fdb991452bd8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-20T19:26:56Z","title_canon_sha256":"a111de0841a2e9b2e8f3907e6638bf07792f56c8a6d2ec43ac840decb23d0872"},"schema_version":"1.0","source":{"id":"1704.06311","kind":"arxiv","version":1}},"canonical_sha256":"ecf40f0838091a348dc955ad1881677290378ee6cc549621c200560de473f1ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ecf40f0838091a348dc955ad1881677290378ee6cc549621c200560de473f1ab","first_computed_at":"2026-05-18T00:46:00.035559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:00.035559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ATXhjkOQZfF8kLM8/cehXVvMJdGjXdcKxiG6Cn0tkOzZiydPngpERdCqPLDWy/ivDiJWGW+9KhbFVcxdztwYAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:00.036229Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.06311","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58cb50661c84fa57f17492b91ca18162bbf22f819d40cc9bafb976723be83049","sha256:e940d80f4d44e7a40ab00aa4a3fdb4954550a6bf84c7419c86414eaf268c3f0a"],"state_sha256":"e01d3a8ccfbe8d02869740871403d21fb6d77ba164a88a51af6eadf794a47ffa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"szdWsJIGDuoCh2JKqcaaABBDLljNloR4JkXOX/Bxbgrs85OBTbEWMf0enKJzhEDWEo3zD4uGWwbb0+ihzFfKBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T23:07:43.639191Z","bundle_sha256":"c5b9e3e7d7b35a6fb3a56c92b098c689bf1b753dabfb4234c02963d2a7b4bff2"}}