{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5UG4BS5GBL45OFH5NKER5GY46U","short_pith_number":"pith:5UG4BS5G","schema_version":"1.0","canonical_sha256":"ed0dc0cba60af9d714fd6a891e9b1cf51f28c265f03d8ed417f1c39dfd8ad09f","source":{"kind":"arxiv","id":"1701.00679","version":2},"attestation_state":"computed","paper":{"title":"Removing Depth-Order Cycles Among Triangles: An Efficient Algorithm Generating Triangular Fragments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Mark de Berg","submitted_at":"2017-01-03T12:41:18Z","abstract_excerpt":"More than 25 years ago Chazelle~\\emph{et al.} (FOCS 1991) studied the following question: Is it possible to cut any set of $n$ lines in ${\\Bbb R}^3$ into a subquadratic number of fragments such that the resulting fragments admit a depth order? They proved an $O(n^{9/4})$ bound for the very special case of bipartite weavings of lines. Since then only little progress was made, until a recent breakthrough by Aronov and Sharir (STOC 2016) who showed that $O(n^{3/2}\\mathrm{polylog}\\; n)$ fragments suffice for any set of lines. In a follow-up paper Aronov, Miller and Sharir (SODA 2017) proved an $O("},"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":"1701.00679","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-01-03T12:41:18Z","cross_cats_sorted":[],"title_canon_sha256":"5535abe47a183cf336d529b9f3c0feae198ecf54682e43e6e5a48be2a16860ba","abstract_canon_sha256":"7bcfa72eab9f7e0dbf1bf61e412aaad42e4fcf02706bc018dfa33ec65880ab32"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:55.246916Z","signature_b64":"ULf5fXXhPGhg4da+yDoCPsHYM2VDoBH3Sj6NlDI9eZWoG3/pb7DYVB9OEEpmq6fpnQNzuik3ZMXGlKufk3SCBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed0dc0cba60af9d714fd6a891e9b1cf51f28c265f03d8ed417f1c39dfd8ad09f","last_reissued_at":"2026-05-18T00:46:55.246414Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:55.246414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Removing Depth-Order Cycles Among Triangles: An Efficient Algorithm Generating Triangular Fragments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Mark de Berg","submitted_at":"2017-01-03T12:41:18Z","abstract_excerpt":"More than 25 years ago Chazelle~\\emph{et al.} (FOCS 1991) studied the following question: Is it possible to cut any set of $n$ lines in ${\\Bbb R}^3$ into a subquadratic number of fragments such that the resulting fragments admit a depth order? They proved an $O(n^{9/4})$ bound for the very special case of bipartite weavings of lines. Since then only little progress was made, until a recent breakthrough by Aronov and Sharir (STOC 2016) who showed that $O(n^{3/2}\\mathrm{polylog}\\; n)$ fragments suffice for any set of lines. In a follow-up paper Aronov, Miller and Sharir (SODA 2017) proved an $O("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00679","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":"1701.00679","created_at":"2026-05-18T00:46:55.246501+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.00679v2","created_at":"2026-05-18T00:46:55.246501+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00679","created_at":"2026-05-18T00:46:55.246501+00:00"},{"alias_kind":"pith_short_12","alias_value":"5UG4BS5GBL45","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"5UG4BS5GBL45OFH5","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"5UG4BS5G","created_at":"2026-05-18T12:31:00.734936+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/5UG4BS5GBL45OFH5NKER5GY46U","json":"https://pith.science/pith/5UG4BS5GBL45OFH5NKER5GY46U.json","graph_json":"https://pith.science/api/pith-number/5UG4BS5GBL45OFH5NKER5GY46U/graph.json","events_json":"https://pith.science/api/pith-number/5UG4BS5GBL45OFH5NKER5GY46U/events.json","paper":"https://pith.science/paper/5UG4BS5G"},"agent_actions":{"view_html":"https://pith.science/pith/5UG4BS5GBL45OFH5NKER5GY46U","download_json":"https://pith.science/pith/5UG4BS5GBL45OFH5NKER5GY46U.json","view_paper":"https://pith.science/paper/5UG4BS5G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.00679&json=true","fetch_graph":"https://pith.science/api/pith-number/5UG4BS5GBL45OFH5NKER5GY46U/graph.json","fetch_events":"https://pith.science/api/pith-number/5UG4BS5GBL45OFH5NKER5GY46U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5UG4BS5GBL45OFH5NKER5GY46U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5UG4BS5GBL45OFH5NKER5GY46U/action/storage_attestation","attest_author":"https://pith.science/pith/5UG4BS5GBL45OFH5NKER5GY46U/action/author_attestation","sign_citation":"https://pith.science/pith/5UG4BS5GBL45OFH5NKER5GY46U/action/citation_signature","submit_replication":"https://pith.science/pith/5UG4BS5GBL45OFH5NKER5GY46U/action/replication_record"}},"created_at":"2026-05-18T00:46:55.246501+00:00","updated_at":"2026-05-18T00:46:55.246501+00:00"}