{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZBLZUZ5CF6NUXT7LPPNXXVRVG3","short_pith_number":"pith:ZBLZUZ5C","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"},"canonical_sha256":"c8579a67a22f9b4bcfeb7bdb7bd63536e0067a34ccfc34b98c77f29453052caa","source":{"kind":"arxiv","id":"1607.06136","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06136","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06136v2","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06136","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"pith_short_12","alias_value":"ZBLZUZ5CF6NU","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZBLZUZ5CF6NUXT7L","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZBLZUZ5C","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZBLZUZ5CF6NUXT7LPPNXXVRVG3","target":"record","payload":{"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"},"canonical_sha256":"c8579a67a22f9b4bcfeb7bdb7bd63536e0067a34ccfc34b98c77f29453052caa","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"},"source_kind":"arxiv","source_id":"1607.06136","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:51:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M7Zgs4x4cgiwM8Y0RjJBII+3RX0D7bQanY+WqQM/CgkB4Vs9ClCKXXGlg26jhuL0CzWcwrMPKM077YjBAYs3AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:20:54.966223Z"},"content_sha256":"29b63712b35042c27ba7647b684e0df53ed7f3f864dd50c232e0035ad4244663","schema_version":"1.0","event_id":"sha256:29b63712b35042c27ba7647b684e0df53ed7f3f864dd50c232e0035ad4244663"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZBLZUZ5CF6NUXT7LPPNXXVRVG3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:51:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PtY87PVPBzUn5BcYYKze2ALPSqE0gk9unXamIuuQncdWjUOjMAz3DwOFgBVNVh5MJQYBtqOWeq+u4bAgDmfzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:20:54.966666Z"},"content_sha256":"aae6cbc69d28101e0a6a5cdbaec4605d7f04d43106e39e6cd96372dc3dcc1623","schema_version":"1.0","event_id":"sha256:aae6cbc69d28101e0a6a5cdbaec4605d7f04d43106e39e6cd96372dc3dcc1623"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZBLZUZ5CF6NUXT7LPPNXXVRVG3/bundle.json","state_url":"https://pith.science/pith/ZBLZUZ5CF6NUXT7LPPNXXVRVG3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZBLZUZ5CF6NUXT7LPPNXXVRVG3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T02:20:54Z","links":{"resolver":"https://pith.science/pith/ZBLZUZ5CF6NUXT7LPPNXXVRVG3","bundle":"https://pith.science/pith/ZBLZUZ5CF6NUXT7LPPNXXVRVG3/bundle.json","state":"https://pith.science/pith/ZBLZUZ5CF6NUXT7LPPNXXVRVG3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZBLZUZ5CF6NUXT7LPPNXXVRVG3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZBLZUZ5CF6NUXT7LPPNXXVRVG3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9e64f5eb52b3f48ba2eea7123fb6f8a8d27ca97a09bf1381ffb16dc12c907af6","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-20T22:11:48Z","title_canon_sha256":"82dd2283fceea4d251c5e4326f7f1425a48a8b90bcf473167f41d261e22a06e8"},"schema_version":"1.0","source":{"id":"1607.06136","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06136","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06136v2","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06136","created_at":"2026-05-17T23:51:55Z"},{"alias_kind":"pith_short_12","alias_value":"ZBLZUZ5CF6NU","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZBLZUZ5CF6NUXT7L","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZBLZUZ5C","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:aae6cbc69d28101e0a6a5cdbaec4605d7f04d43106e39e6cd96372dc3dcc1623","target":"graph","created_at":"2026-05-17T23:51:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Boris Aronov, Edward Y. Miller, Micha Sharir","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-20T22:11:48Z","title":"Eliminating Depth Cycles among Triangles in Three Dimensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06136","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:29b63712b35042c27ba7647b684e0df53ed7f3f864dd50c232e0035ad4244663","target":"record","created_at":"2026-05-17T23:51:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9e64f5eb52b3f48ba2eea7123fb6f8a8d27ca97a09bf1381ffb16dc12c907af6","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-20T22:11:48Z","title_canon_sha256":"82dd2283fceea4d251c5e4326f7f1425a48a8b90bcf473167f41d261e22a06e8"},"schema_version":"1.0","source":{"id":"1607.06136","kind":"arxiv","version":2}},"canonical_sha256":"c8579a67a22f9b4bcfeb7bdb7bd63536e0067a34ccfc34b98c77f29453052caa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8579a67a22f9b4bcfeb7bdb7bd63536e0067a34ccfc34b98c77f29453052caa","first_computed_at":"2026-05-17T23:51:55.016632Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:55.016632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2Hz0RZmPCk1rO+WgOMI+4AQd9xveipgX9gET8ON9eRymcjc9sL+0DoikT6c1G+OXKAMnqk2nGaGua1YekDhbAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:55.017260Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.06136","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29b63712b35042c27ba7647b684e0df53ed7f3f864dd50c232e0035ad4244663","sha256:aae6cbc69d28101e0a6a5cdbaec4605d7f04d43106e39e6cd96372dc3dcc1623"],"state_sha256":"316c716878e51c7bc1bf43737862881f55ecc5790e463bd8506809bf3f87aadd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1j93tthvZ/QpCJUe8xwk7SK8a/GqHjmkOA/WZPxBpxUkOSE9gtBq+KkW0Cx7Ip9Mx/SLxwZu+GrNPTf4otlRDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T02:20:54.968892Z","bundle_sha256":"035422d05e76057b86cc510bee3c86b215e40e1b3c6832102bcf082c7afdb521"}}