{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LP2WRROVBMXHLLSKELYID7P4UZ","short_pith_number":"pith:LP2WRROV","schema_version":"1.0","canonical_sha256":"5bf568c5d50b2e75ae4a22f081fdfca6475de55fced0df56edffc19791e864cf","source":{"kind":"arxiv","id":"1901.10084","version":1},"attestation_state":"computed","paper":{"title":"A Parallel Projection Method for Metric Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.DC","authors_text":"Cameron Ruggles, David F. Gleich, Nate Veldt","submitted_at":"2019-01-29T03:14:24Z","abstract_excerpt":"Many clustering applications in machine learning and data mining rely on solving metric-constrained optimization problems. These problems are characterized by $O(n^3)$ constraints that enforce triangle inequalities on distance variables associated with $n$ objects in a large dataset. Despite its usefulness, metric-constrained optimization is challenging in practice due to the cubic number of constraints and the high-memory requirements of standard optimization software. Recent work has shown that iterative projection methods are able to solve metric-constrained optimization problems on a much "},"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":"1901.10084","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-29T03:14:24Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"f10cdefce5f3f7644b5d3c77161c613be4f857544844492313600bed9d144e7e","abstract_canon_sha256":"bb7ce52066da3353757897015230c2b1f81daf35c32b4f656f345417338aea25"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:16.209238Z","signature_b64":"AYM7TdwtmtstGOjlhn5xpRZWSFyVxfHFZ45zxwUvgLzT9agoqSth0OdSTVDP6W1Vs56ROttod90zw9Cd34rTDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bf568c5d50b2e75ae4a22f081fdfca6475de55fced0df56edffc19791e864cf","last_reissued_at":"2026-05-17T23:55:16.208781Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:16.208781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Parallel Projection Method for Metric Constrained Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.DC","authors_text":"Cameron Ruggles, David F. Gleich, Nate Veldt","submitted_at":"2019-01-29T03:14:24Z","abstract_excerpt":"Many clustering applications in machine learning and data mining rely on solving metric-constrained optimization problems. These problems are characterized by $O(n^3)$ constraints that enforce triangle inequalities on distance variables associated with $n$ objects in a large dataset. Despite its usefulness, metric-constrained optimization is challenging in practice due to the cubic number of constraints and the high-memory requirements of standard optimization software. Recent work has shown that iterative projection methods are able to solve metric-constrained optimization problems on a much "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10084","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":"1901.10084","created_at":"2026-05-17T23:55:16.208850+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.10084v1","created_at":"2026-05-17T23:55:16.208850+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10084","created_at":"2026-05-17T23:55:16.208850+00:00"},{"alias_kind":"pith_short_12","alias_value":"LP2WRROVBMXH","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"LP2WRROVBMXHLLSK","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"LP2WRROV","created_at":"2026-05-18T12:33:21.387695+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/LP2WRROVBMXHLLSKELYID7P4UZ","json":"https://pith.science/pith/LP2WRROVBMXHLLSKELYID7P4UZ.json","graph_json":"https://pith.science/api/pith-number/LP2WRROVBMXHLLSKELYID7P4UZ/graph.json","events_json":"https://pith.science/api/pith-number/LP2WRROVBMXHLLSKELYID7P4UZ/events.json","paper":"https://pith.science/paper/LP2WRROV"},"agent_actions":{"view_html":"https://pith.science/pith/LP2WRROVBMXHLLSKELYID7P4UZ","download_json":"https://pith.science/pith/LP2WRROVBMXHLLSKELYID7P4UZ.json","view_paper":"https://pith.science/paper/LP2WRROV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.10084&json=true","fetch_graph":"https://pith.science/api/pith-number/LP2WRROVBMXHLLSKELYID7P4UZ/graph.json","fetch_events":"https://pith.science/api/pith-number/LP2WRROVBMXHLLSKELYID7P4UZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LP2WRROVBMXHLLSKELYID7P4UZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LP2WRROVBMXHLLSKELYID7P4UZ/action/storage_attestation","attest_author":"https://pith.science/pith/LP2WRROVBMXHLLSKELYID7P4UZ/action/author_attestation","sign_citation":"https://pith.science/pith/LP2WRROVBMXHLLSKELYID7P4UZ/action/citation_signature","submit_replication":"https://pith.science/pith/LP2WRROVBMXHLLSKELYID7P4UZ/action/replication_record"}},"created_at":"2026-05-17T23:55:16.208850+00:00","updated_at":"2026-05-17T23:55:16.208850+00:00"}