{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ZBLZUZ5CF6NUXT7LPPNXXVRVG3","short_pith_number":"pith:ZBLZUZ5C","schema_version":"1.0","canonical_sha256":"c8579a67a22f9b4bcfeb7bdb7bd63536e0067a34ccfc34b98c77f29453052caa","source":{"kind":"arxiv","id":"1607.06136","version":2},"attestation_state":"computed","paper":{"title":"Eliminating Depth Cycles among Triangles in Three Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Boris Aronov, Edward Y. Miller, Micha Sharir","submitted_at":"2016-07-20T22:11:48Z","abstract_excerpt":"Given $n$ pairwise openly disjoint triangles in 3-space, their vertical depth relation may contain cycles. We show that, for any $\\varepsilon>0$, the triangles can be cut into $O(n^{3/2+\\varepsilon})$ connected semi-algebraic pieces, whose description complexity depends only on the choice of $\\varepsilon$, such that the depth relation among these pieces is now a proper partial order. This bound is nearly tight in the worst case. We are not aware of any previous study of this problem, in this full generality, with a subquadratic bound on the number of pieces.\n  This work extends the recent stud"},"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":"1607.06136","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-20T22:11:48Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"82dd2283fceea4d251c5e4326f7f1425a48a8b90bcf473167f41d261e22a06e8","abstract_canon_sha256":"9e64f5eb52b3f48ba2eea7123fb6f8a8d27ca97a09bf1381ffb16dc12c907af6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:55.017260Z","signature_b64":"2Hz0RZmPCk1rO+WgOMI+4AQd9xveipgX9gET8ON9eRymcjc9sL+0DoikT6c1G+OXKAMnqk2nGaGua1YekDhbAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8579a67a22f9b4bcfeb7bdb7bd63536e0067a34ccfc34b98c77f29453052caa","last_reissued_at":"2026-05-17T23:51:55.016632Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:55.016632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Eliminating Depth Cycles among Triangles in Three Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Boris Aronov, Edward Y. Miller, Micha Sharir","submitted_at":"2016-07-20T22:11:48Z","abstract_excerpt":"Given $n$ pairwise openly disjoint triangles in 3-space, their vertical depth relation may contain cycles. We show that, for any $\\varepsilon>0$, the triangles can be cut into $O(n^{3/2+\\varepsilon})$ connected semi-algebraic pieces, whose description complexity depends only on the choice of $\\varepsilon$, such that the depth relation among these pieces is now a proper partial order. This bound is nearly tight in the worst case. We are not aware of any previous study of this problem, in this full generality, with a subquadratic bound on the number of pieces.\n  This work extends the recent stud"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06136","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":"1607.06136","created_at":"2026-05-17T23:51:55.016727+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.06136v2","created_at":"2026-05-17T23:51:55.016727+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06136","created_at":"2026-05-17T23:51:55.016727+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZBLZUZ5CF6NU","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZBLZUZ5CF6NUXT7L","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZBLZUZ5C","created_at":"2026-05-18T12:30:53.716459+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/ZBLZUZ5CF6NUXT7LPPNXXVRVG3","json":"https://pith.science/pith/ZBLZUZ5CF6NUXT7LPPNXXVRVG3.json","graph_json":"https://pith.science/api/pith-number/ZBLZUZ5CF6NUXT7LPPNXXVRVG3/graph.json","events_json":"https://pith.science/api/pith-number/ZBLZUZ5CF6NUXT7LPPNXXVRVG3/events.json","paper":"https://pith.science/paper/ZBLZUZ5C"},"agent_actions":{"view_html":"https://pith.science/pith/ZBLZUZ5CF6NUXT7LPPNXXVRVG3","download_json":"https://pith.science/pith/ZBLZUZ5CF6NUXT7LPPNXXVRVG3.json","view_paper":"https://pith.science/paper/ZBLZUZ5C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.06136&json=true","fetch_graph":"https://pith.science/api/pith-number/ZBLZUZ5CF6NUXT7LPPNXXVRVG3/graph.json","fetch_events":"https://pith.science/api/pith-number/ZBLZUZ5CF6NUXT7LPPNXXVRVG3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZBLZUZ5CF6NUXT7LPPNXXVRVG3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZBLZUZ5CF6NUXT7LPPNXXVRVG3/action/storage_attestation","attest_author":"https://pith.science/pith/ZBLZUZ5CF6NUXT7LPPNXXVRVG3/action/author_attestation","sign_citation":"https://pith.science/pith/ZBLZUZ5CF6NUXT7LPPNXXVRVG3/action/citation_signature","submit_replication":"https://pith.science/pith/ZBLZUZ5CF6NUXT7LPPNXXVRVG3/action/replication_record"}},"created_at":"2026-05-17T23:51:55.016727+00:00","updated_at":"2026-05-17T23:51:55.016727+00:00"}