{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JZPJGTLNW3WXZPQCS5YLVMSALG","short_pith_number":"pith:JZPJGTLN","canonical_record":{"source":{"id":"1512.00358","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-12-01T17:43:00Z","cross_cats_sorted":[],"title_canon_sha256":"68c8455e482333de59cc6b5666ad3a38650d0afefdb70f71e63f0a54fa0e67c1","abstract_canon_sha256":"c6f470ca077209d60defc1b72d3deafad6902042c169f6e90bb890ce7d228416"},"schema_version":"1.0"},"canonical_sha256":"4e5e934d6db6ed7cbe029770bab24059ae8588e764d3ef68694ed65c9a5305d9","source":{"kind":"arxiv","id":"1512.00358","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.00358","created_at":"2026-05-18T01:12:43Z"},{"alias_kind":"arxiv_version","alias_value":"1512.00358v2","created_at":"2026-05-18T01:12:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00358","created_at":"2026-05-18T01:12:43Z"},{"alias_kind":"pith_short_12","alias_value":"JZPJGTLNW3WX","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JZPJGTLNW3WXZPQC","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JZPJGTLN","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JZPJGTLNW3WXZPQCS5YLVMSALG","target":"record","payload":{"canonical_record":{"source":{"id":"1512.00358","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-12-01T17:43:00Z","cross_cats_sorted":[],"title_canon_sha256":"68c8455e482333de59cc6b5666ad3a38650d0afefdb70f71e63f0a54fa0e67c1","abstract_canon_sha256":"c6f470ca077209d60defc1b72d3deafad6902042c169f6e90bb890ce7d228416"},"schema_version":"1.0"},"canonical_sha256":"4e5e934d6db6ed7cbe029770bab24059ae8588e764d3ef68694ed65c9a5305d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:43.336462Z","signature_b64":"AzxJ7rfu+OKweKHx8NfCAqG5k2CQP5wAoWMRhhan1fXVMt4DiPJoRNetZY6hgoGu4UMtEv3EkPwDcDahaPtSDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e5e934d6db6ed7cbe029770bab24059ae8588e764d3ef68694ed65c9a5305d9","last_reissued_at":"2026-05-18T01:12:43.336038Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:43.336038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.00358","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-18T01:12:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TAUvuSBCAQLy7o4H20FsPuh6fyKbQuUMCQaOo0nV8zsIQ9BRrm/efLVMA4mh3xpfgUJdmfv/0t1jolpxkmZHBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:10:38.238958Z"},"content_sha256":"87f7ca106c4ec9a54107f6eed8f6df6b27ae200241887636b4842e8ac69e3282","schema_version":"1.0","event_id":"sha256:87f7ca106c4ec9a54107f6eed8f6df6b27ae200241887636b4842e8ac69e3282"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JZPJGTLNW3WXZPQCS5YLVMSALG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Almost Tight Bounds for Eliminating Depth Cycles in Three Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Boris Aronov, Micha Sharir","submitted_at":"2015-12-01T17:43:00Z","abstract_excerpt":"Given $n$ non-vertical lines in 3-space, their vertical depth (above/below) relation can contain cycles. We show that the lines can be cut into $O(n^{3/2}\\mathop{\\mathrm{polylog}} n)$ pieces, such that the depth relation among these pieces is now a proper partial order. This bound is nearly tight in the worst case.\n  Previous results on this topic could only handle restricted cases of the problem (such as handling only triangular cycles, by Aronov, Koltun, and Sharir (2005), or only cycles in grid-like patterns, by Chazelle et al. (1992)), and the bounds were considerably weaker---much closer "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00358","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-18T01:12:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7L2595T7Aj0InDp2J8W1PbIUK3MLdN6gctRdK14vghj1/6uT98pj6zIdVu8He+Izt2TGkbIJOBkBPnz48zA5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:10:38.239473Z"},"content_sha256":"abd82018d967b6000bc639ff66341a2455ae6f92d375ebe23bfc85051c0526ea","schema_version":"1.0","event_id":"sha256:abd82018d967b6000bc639ff66341a2455ae6f92d375ebe23bfc85051c0526ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JZPJGTLNW3WXZPQCS5YLVMSALG/bundle.json","state_url":"https://pith.science/pith/JZPJGTLNW3WXZPQCS5YLVMSALG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JZPJGTLNW3WXZPQCS5YLVMSALG/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-27T20:10:38Z","links":{"resolver":"https://pith.science/pith/JZPJGTLNW3WXZPQCS5YLVMSALG","bundle":"https://pith.science/pith/JZPJGTLNW3WXZPQCS5YLVMSALG/bundle.json","state":"https://pith.science/pith/JZPJGTLNW3WXZPQCS5YLVMSALG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JZPJGTLNW3WXZPQCS5YLVMSALG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JZPJGTLNW3WXZPQCS5YLVMSALG","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":"c6f470ca077209d60defc1b72d3deafad6902042c169f6e90bb890ce7d228416","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-12-01T17:43:00Z","title_canon_sha256":"68c8455e482333de59cc6b5666ad3a38650d0afefdb70f71e63f0a54fa0e67c1"},"schema_version":"1.0","source":{"id":"1512.00358","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.00358","created_at":"2026-05-18T01:12:43Z"},{"alias_kind":"arxiv_version","alias_value":"1512.00358v2","created_at":"2026-05-18T01:12:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00358","created_at":"2026-05-18T01:12:43Z"},{"alias_kind":"pith_short_12","alias_value":"JZPJGTLNW3WX","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JZPJGTLNW3WXZPQC","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JZPJGTLN","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:abd82018d967b6000bc639ff66341a2455ae6f92d375ebe23bfc85051c0526ea","target":"graph","created_at":"2026-05-18T01:12:43Z","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$ non-vertical lines in 3-space, their vertical depth (above/below) relation can contain cycles. We show that the lines can be cut into $O(n^{3/2}\\mathop{\\mathrm{polylog}} n)$ pieces, such that the depth relation among these pieces is now a proper partial order. This bound is nearly tight in the worst case.\n  Previous results on this topic could only handle restricted cases of the problem (such as handling only triangular cycles, by Aronov, Koltun, and Sharir (2005), or only cycles in grid-like patterns, by Chazelle et al. (1992)), and the bounds were considerably weaker---much closer ","authors_text":"Boris Aronov, Micha Sharir","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-12-01T17:43:00Z","title":"Almost Tight Bounds for Eliminating Depth Cycles in Three Dimensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00358","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:87f7ca106c4ec9a54107f6eed8f6df6b27ae200241887636b4842e8ac69e3282","target":"record","created_at":"2026-05-18T01:12:43Z","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":"c6f470ca077209d60defc1b72d3deafad6902042c169f6e90bb890ce7d228416","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-12-01T17:43:00Z","title_canon_sha256":"68c8455e482333de59cc6b5666ad3a38650d0afefdb70f71e63f0a54fa0e67c1"},"schema_version":"1.0","source":{"id":"1512.00358","kind":"arxiv","version":2}},"canonical_sha256":"4e5e934d6db6ed7cbe029770bab24059ae8588e764d3ef68694ed65c9a5305d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e5e934d6db6ed7cbe029770bab24059ae8588e764d3ef68694ed65c9a5305d9","first_computed_at":"2026-05-18T01:12:43.336038Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:43.336038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AzxJ7rfu+OKweKHx8NfCAqG5k2CQP5wAoWMRhhan1fXVMt4DiPJoRNetZY6hgoGu4UMtEv3EkPwDcDahaPtSDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:43.336462Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.00358","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87f7ca106c4ec9a54107f6eed8f6df6b27ae200241887636b4842e8ac69e3282","sha256:abd82018d967b6000bc639ff66341a2455ae6f92d375ebe23bfc85051c0526ea"],"state_sha256":"3eda348fde19557c362a7dba112d2fe11cd64f2a806b52d6ba1d811bf64c6dce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mV/Mf3+vxkVOD5SVT1UsK59PLNZSLfj8NRLPzZ4UiOanMnXSw9e2udAmfnQQsR8Q+TRs+xNwZGP4pIpowal7Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:10:38.242652Z","bundle_sha256":"c4c350c667f6dda7ca5de7b142fbfca62d6055c41e9f2a0a5485f97e42ec0bb2"}}