{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TXYLOUVPAG3E3GT2MDW33ZAD57","short_pith_number":"pith:TXYLOUVP","schema_version":"1.0","canonical_sha256":"9df0b752af01b64d9a7a60edbde403efc1cbe2346ff3084f75bc80bb125fb970","source":{"kind":"arxiv","id":"1808.07608","version":1},"attestation_state":"computed","paper":{"title":"Crossing Minimization in Perturbed Drawings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Csaba D. T\\'oth, Radoslav Fulek","submitted_at":"2018-08-23T02:16:08Z","abstract_excerpt":"Due to data compression or low resolution, nearby vertices and edges of a graph drawing may be bundled to a common node or arc. We model such a `compromised' drawing by a piecewise linear map $\\varphi:G\\rightarrow \\mathbb{R}^2$. We wish to perturb $\\varphi$ by an arbitrarily small $\\varepsilon>0$ into a proper drawing (in which the vertices are distinct points, any two edges intersect in finitely many points, and no three edges have a common interior point) that minimizes the number of crossings. An $\\varepsilon$-perturbation, for every $\\varepsilon>0$, is given by a piecewise linear map $\\psi"},"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":"1808.07608","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-08-23T02:16:08Z","cross_cats_sorted":[],"title_canon_sha256":"99ec1a0f2c3f462aa52891016fb366614b4d302469d696c439fd8bfb80d8f7ec","abstract_canon_sha256":"7cbbf672b7c634daf5126c7a37d622ef6d456129b85b2d4f836f436b95c1d639"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:26.775392Z","signature_b64":"TH5w/ATra08TcsfdSWGrWc446qJ3RHiC5fFFyw2Kdk/L1r6BpaV4bRho/GBJo+XnN0NpSAffN+LYdCUczuOgAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9df0b752af01b64d9a7a60edbde403efc1cbe2346ff3084f75bc80bb125fb970","last_reissued_at":"2026-05-18T00:07:26.774739Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:26.774739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Crossing Minimization in Perturbed Drawings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Csaba D. T\\'oth, Radoslav Fulek","submitted_at":"2018-08-23T02:16:08Z","abstract_excerpt":"Due to data compression or low resolution, nearby vertices and edges of a graph drawing may be bundled to a common node or arc. We model such a `compromised' drawing by a piecewise linear map $\\varphi:G\\rightarrow \\mathbb{R}^2$. We wish to perturb $\\varphi$ by an arbitrarily small $\\varepsilon>0$ into a proper drawing (in which the vertices are distinct points, any two edges intersect in finitely many points, and no three edges have a common interior point) that minimizes the number of crossings. An $\\varepsilon$-perturbation, for every $\\varepsilon>0$, is given by a piecewise linear map $\\psi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.07608","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":"1808.07608","created_at":"2026-05-18T00:07:26.774836+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.07608v1","created_at":"2026-05-18T00:07:26.774836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07608","created_at":"2026-05-18T00:07:26.774836+00:00"},{"alias_kind":"pith_short_12","alias_value":"TXYLOUVPAG3E","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"TXYLOUVPAG3E3GT2","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"TXYLOUVP","created_at":"2026-05-18T12:32:56.356000+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/TXYLOUVPAG3E3GT2MDW33ZAD57","json":"https://pith.science/pith/TXYLOUVPAG3E3GT2MDW33ZAD57.json","graph_json":"https://pith.science/api/pith-number/TXYLOUVPAG3E3GT2MDW33ZAD57/graph.json","events_json":"https://pith.science/api/pith-number/TXYLOUVPAG3E3GT2MDW33ZAD57/events.json","paper":"https://pith.science/paper/TXYLOUVP"},"agent_actions":{"view_html":"https://pith.science/pith/TXYLOUVPAG3E3GT2MDW33ZAD57","download_json":"https://pith.science/pith/TXYLOUVPAG3E3GT2MDW33ZAD57.json","view_paper":"https://pith.science/paper/TXYLOUVP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.07608&json=true","fetch_graph":"https://pith.science/api/pith-number/TXYLOUVPAG3E3GT2MDW33ZAD57/graph.json","fetch_events":"https://pith.science/api/pith-number/TXYLOUVPAG3E3GT2MDW33ZAD57/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TXYLOUVPAG3E3GT2MDW33ZAD57/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TXYLOUVPAG3E3GT2MDW33ZAD57/action/storage_attestation","attest_author":"https://pith.science/pith/TXYLOUVPAG3E3GT2MDW33ZAD57/action/author_attestation","sign_citation":"https://pith.science/pith/TXYLOUVPAG3E3GT2MDW33ZAD57/action/citation_signature","submit_replication":"https://pith.science/pith/TXYLOUVPAG3E3GT2MDW33ZAD57/action/replication_record"}},"created_at":"2026-05-18T00:07:26.774836+00:00","updated_at":"2026-05-18T00:07:26.774836+00:00"}