{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XH5BCPZKHIS2W4U4I6PO5WOCJK","short_pith_number":"pith:XH5BCPZK","schema_version":"1.0","canonical_sha256":"b9fa113f2a3a25ab729c479eeed9c24a9ee2c322643b066a2939b940e3c95cb7","source":{"kind":"arxiv","id":"1807.08446","version":3},"attestation_state":"computed","paper":{"title":"Aligning Points to Lines: Provable Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dan Feldman, Ibrahim Jubran","submitted_at":"2018-07-23T06:45:15Z","abstract_excerpt":"We suggest a new optimization technique for minimizing the sum $\\sum_{i=1}^n f_i(x)$ of $n$ non-convex real functions that satisfy a property that we call piecewise log-Lipschitz. This is by forging links between techniques in computational geometry, combinatorics and convex optimization. As an example application, we provide the first constant-factor approximation algorithms whose running-time is polynomial in $n$ for the fundamental problem of \\emph{Points-to-Lines alignment}: Given $n$ points $p_1,\\cdots,p_n$ and $n$ lines $\\ell_1,\\cdots,\\ell_n$ on the plane and $z>0$, compute the matching "},"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":"1807.08446","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-23T06:45:15Z","cross_cats_sorted":["cs.CG","stat.ML"],"title_canon_sha256":"4dffc07294267f3f911a8e968146c4e63085bb75c2f7a4669f2072d0403c9f5f","abstract_canon_sha256":"6ce14e18eaac74986dc07c5e4f0dd95f84a09131cc0e2a0d848ef404acc032cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:02:53.830254Z","signature_b64":"sSK2lQk6KJ3ImeTTASOwUmg+eE3OV7XVtp+xJ+c9qr3iNKJqtN5nsaKbC+NgV/JJnLFvkPfSC1oZ4VV2D76SDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9fa113f2a3a25ab729c479eeed9c24a9ee2c322643b066a2939b940e3c95cb7","last_reissued_at":"2026-07-05T00:02:53.829818Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:02:53.829818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Aligning Points to Lines: Provable Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dan Feldman, Ibrahim Jubran","submitted_at":"2018-07-23T06:45:15Z","abstract_excerpt":"We suggest a new optimization technique for minimizing the sum $\\sum_{i=1}^n f_i(x)$ of $n$ non-convex real functions that satisfy a property that we call piecewise log-Lipschitz. This is by forging links between techniques in computational geometry, combinatorics and convex optimization. As an example application, we provide the first constant-factor approximation algorithms whose running-time is polynomial in $n$ for the fundamental problem of \\emph{Points-to-Lines alignment}: Given $n$ points $p_1,\\cdots,p_n$ and $n$ lines $\\ell_1,\\cdots,\\ell_n$ on the plane and $z>0$, compute the matching "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08446","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1807.08446/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1807.08446","created_at":"2026-07-05T00:02:53.829873+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.08446v3","created_at":"2026-07-05T00:02:53.829873+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08446","created_at":"2026-07-05T00:02:53.829873+00:00"},{"alias_kind":"pith_short_12","alias_value":"XH5BCPZKHIS2","created_at":"2026-07-05T00:02:53.829873+00:00"},{"alias_kind":"pith_short_16","alias_value":"XH5BCPZKHIS2W4U4","created_at":"2026-07-05T00:02:53.829873+00:00"},{"alias_kind":"pith_short_8","alias_value":"XH5BCPZK","created_at":"2026-07-05T00:02:53.829873+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/XH5BCPZKHIS2W4U4I6PO5WOCJK","json":"https://pith.science/pith/XH5BCPZKHIS2W4U4I6PO5WOCJK.json","graph_json":"https://pith.science/api/pith-number/XH5BCPZKHIS2W4U4I6PO5WOCJK/graph.json","events_json":"https://pith.science/api/pith-number/XH5BCPZKHIS2W4U4I6PO5WOCJK/events.json","paper":"https://pith.science/paper/XH5BCPZK"},"agent_actions":{"view_html":"https://pith.science/pith/XH5BCPZKHIS2W4U4I6PO5WOCJK","download_json":"https://pith.science/pith/XH5BCPZKHIS2W4U4I6PO5WOCJK.json","view_paper":"https://pith.science/paper/XH5BCPZK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.08446&json=true","fetch_graph":"https://pith.science/api/pith-number/XH5BCPZKHIS2W4U4I6PO5WOCJK/graph.json","fetch_events":"https://pith.science/api/pith-number/XH5BCPZKHIS2W4U4I6PO5WOCJK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XH5BCPZKHIS2W4U4I6PO5WOCJK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XH5BCPZKHIS2W4U4I6PO5WOCJK/action/storage_attestation","attest_author":"https://pith.science/pith/XH5BCPZKHIS2W4U4I6PO5WOCJK/action/author_attestation","sign_citation":"https://pith.science/pith/XH5BCPZKHIS2W4U4I6PO5WOCJK/action/citation_signature","submit_replication":"https://pith.science/pith/XH5BCPZKHIS2W4U4I6PO5WOCJK/action/replication_record"}},"created_at":"2026-07-05T00:02:53.829873+00:00","updated_at":"2026-07-05T00:02:53.829873+00:00"}