{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5UG4BS5GBL45OFH5NKER5GY46U","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":"7bcfa72eab9f7e0dbf1bf61e412aaad42e4fcf02706bc018dfa33ec65880ab32","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-01-03T12:41:18Z","title_canon_sha256":"5535abe47a183cf336d529b9f3c0feae198ecf54682e43e6e5a48be2a16860ba"},"schema_version":"1.0","source":{"id":"1701.00679","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.00679","created_at":"2026-05-18T00:46:55Z"},{"alias_kind":"arxiv_version","alias_value":"1701.00679v2","created_at":"2026-05-18T00:46:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00679","created_at":"2026-05-18T00:46:55Z"},{"alias_kind":"pith_short_12","alias_value":"5UG4BS5GBL45","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5UG4BS5GBL45OFH5","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5UG4BS5G","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:59ce9819ae15b3db519b8410d6382be07de2c66b7a7557598e30148a2d1abf68","target":"graph","created_at":"2026-05-18T00:46: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":"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(","authors_text":"Mark de Berg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-01-03T12:41:18Z","title":"Removing Depth-Order Cycles Among Triangles: An Efficient Algorithm Generating Triangular Fragments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00679","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:019f37dd9056a39e6d972e43dc3a35559f5e8027dcf90c7350e0d1e9834f74f8","target":"record","created_at":"2026-05-18T00:46: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":"7bcfa72eab9f7e0dbf1bf61e412aaad42e4fcf02706bc018dfa33ec65880ab32","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-01-03T12:41:18Z","title_canon_sha256":"5535abe47a183cf336d529b9f3c0feae198ecf54682e43e6e5a48be2a16860ba"},"schema_version":"1.0","source":{"id":"1701.00679","kind":"arxiv","version":2}},"canonical_sha256":"ed0dc0cba60af9d714fd6a891e9b1cf51f28c265f03d8ed417f1c39dfd8ad09f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed0dc0cba60af9d714fd6a891e9b1cf51f28c265f03d8ed417f1c39dfd8ad09f","first_computed_at":"2026-05-18T00:46:55.246414Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:55.246414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ULf5fXXhPGhg4da+yDoCPsHYM2VDoBH3Sj6NlDI9eZWoG3/pb7DYVB9OEEpmq6fpnQNzuik3ZMXGlKufk3SCBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:55.246916Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.00679","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:019f37dd9056a39e6d972e43dc3a35559f5e8027dcf90c7350e0d1e9834f74f8","sha256:59ce9819ae15b3db519b8410d6382be07de2c66b7a7557598e30148a2d1abf68"],"state_sha256":"3547648ca7a7ac4ab103b428de33e53b50288fb86b95c09635950232f6c189f9"}