{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:X7YGJE74WD3QKGXCWG64PS6IEY","short_pith_number":"pith:X7YGJE74","schema_version":"1.0","canonical_sha256":"bff06493fcb0f7051ae2b1bdc7cbc82618d3d5371f702d2df04f128886ebfff5","source":{"kind":"arxiv","id":"1609.00867","version":2},"attestation_state":"computed","paper":{"title":"Updating the Number of Crossings in Rectilinear Drawings of the Complete Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Frank Duque, Ruy Fabila-Monroy","submitted_at":"2016-09-03T21:44:27Z","abstract_excerpt":"Let $S$ be a set of $n$ points in general position in the plane. Join every pair of points in $S$ with a straight line segment. Let $\\overline{cr}(S)$ be number of pairs of these edges that intersect in their interior. Suppose that this number is known. In this paper we consider the problem of computing $\\overline{cr}(S')$, where $S'$ comes from adding, deleting or moving a point from $S$."},"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":"1609.00867","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-09-03T21:44:27Z","cross_cats_sorted":[],"title_canon_sha256":"bf436b009d3e93c8e1a6f50344ecb910ec9e6bb0544488b3627f7f1e21e4dcb7","abstract_canon_sha256":"7f8fedb912834fea6d647f9def6cf4f9ec4fd6dbeaf4853e547d3b8deabf3964"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:48.825559Z","signature_b64":"eApvP6+o//YuxSMhWrbHsnxQ1l+7pnxo/syhFUzATdGrkS0peVL1uGVHmt9ldHnMG0yeCcl8Gm5nLbcUPkkcCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bff06493fcb0f7051ae2b1bdc7cbc82618d3d5371f702d2df04f128886ebfff5","last_reissued_at":"2026-05-18T00:30:48.824764Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:48.824764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Updating the Number of Crossings in Rectilinear Drawings of the Complete Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Frank Duque, Ruy Fabila-Monroy","submitted_at":"2016-09-03T21:44:27Z","abstract_excerpt":"Let $S$ be a set of $n$ points in general position in the plane. Join every pair of points in $S$ with a straight line segment. Let $\\overline{cr}(S)$ be number of pairs of these edges that intersect in their interior. Suppose that this number is known. In this paper we consider the problem of computing $\\overline{cr}(S')$, where $S'$ comes from adding, deleting or moving a point from $S$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00867","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.00867","created_at":"2026-05-18T00:30:48.824884+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.00867v2","created_at":"2026-05-18T00:30:48.824884+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00867","created_at":"2026-05-18T00:30:48.824884+00:00"},{"alias_kind":"pith_short_12","alias_value":"X7YGJE74WD3Q","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"X7YGJE74WD3QKGXC","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"X7YGJE74","created_at":"2026-05-18T12:30:51.357362+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/X7YGJE74WD3QKGXCWG64PS6IEY","json":"https://pith.science/pith/X7YGJE74WD3QKGXCWG64PS6IEY.json","graph_json":"https://pith.science/api/pith-number/X7YGJE74WD3QKGXCWG64PS6IEY/graph.json","events_json":"https://pith.science/api/pith-number/X7YGJE74WD3QKGXCWG64PS6IEY/events.json","paper":"https://pith.science/paper/X7YGJE74"},"agent_actions":{"view_html":"https://pith.science/pith/X7YGJE74WD3QKGXCWG64PS6IEY","download_json":"https://pith.science/pith/X7YGJE74WD3QKGXCWG64PS6IEY.json","view_paper":"https://pith.science/paper/X7YGJE74","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.00867&json=true","fetch_graph":"https://pith.science/api/pith-number/X7YGJE74WD3QKGXCWG64PS6IEY/graph.json","fetch_events":"https://pith.science/api/pith-number/X7YGJE74WD3QKGXCWG64PS6IEY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X7YGJE74WD3QKGXCWG64PS6IEY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X7YGJE74WD3QKGXCWG64PS6IEY/action/storage_attestation","attest_author":"https://pith.science/pith/X7YGJE74WD3QKGXCWG64PS6IEY/action/author_attestation","sign_citation":"https://pith.science/pith/X7YGJE74WD3QKGXCWG64PS6IEY/action/citation_signature","submit_replication":"https://pith.science/pith/X7YGJE74WD3QKGXCWG64PS6IEY/action/replication_record"}},"created_at":"2026-05-18T00:30:48.824884+00:00","updated_at":"2026-05-18T00:30:48.824884+00:00"}