{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5VUEKQA64W2KJTMAJVOSIHSETN","short_pith_number":"pith:5VUEKQA6","schema_version":"1.0","canonical_sha256":"ed6845401ee5b4a4cd804d5d241e449b51b4658829e9b35f1cd1fee60b28c73a","source":{"kind":"arxiv","id":"2403.13702","version":2},"attestation_state":"computed","paper":{"title":"Constrained and Ordered Level Planarity Parameterized by the Number of Levels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexander Wolff, Boris Klemz, Felix Klesen, Johannes Zink, Marie Diana Sieper, V\\'aclav Bla\\v{z}ej","submitted_at":"2024-03-20T16:06:45Z","abstract_excerpt":"The problem Level Planarity asks for a crossing-free drawing of a graph in the plane such that vertices are placed at prescribed y-coordinates (called levels) and such that every edge is realized as a y-monotone curve. In the variant Constrained Level Planarity (CLP), each level $y$ is equipped with a partial order $\\prec_y$ on its vertices and in the desired drawing the left-to-right order of vertices on level $y$ has to be a linear extension of $\\prec_y$. Ordered Level Planarity (OLP) corresponds to the special case of CLP where the given partial orders $\\prec_y$ are total orders. Previous r"},"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":"2403.13702","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-03-20T16:06:45Z","cross_cats_sorted":[],"title_canon_sha256":"605aa4776aadf8bfe144e836e949b6ebc6034e1dc0aa4e976a8deebe2e6cd8cc","abstract_canon_sha256":"6ef24b3d370ef96c3d995304d131d7ade9fe9cb4b70b34a8361a04ee2dd586ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:22:39.213871Z","signature_b64":"EGk6kVWqvN6qExQgTxYNWp3EHqWveJ10NheWKP+OwlwofeExJQJlshUH7vCgHwkoBKmCd27KcSCgZQp54SYfBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed6845401ee5b4a4cd804d5d241e449b51b4658829e9b35f1cd1fee60b28c73a","last_reissued_at":"2026-07-05T09:22:39.213402Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:22:39.213402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constrained and Ordered Level Planarity Parameterized by the Number of Levels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexander Wolff, Boris Klemz, Felix Klesen, Johannes Zink, Marie Diana Sieper, V\\'aclav Bla\\v{z}ej","submitted_at":"2024-03-20T16:06:45Z","abstract_excerpt":"The problem Level Planarity asks for a crossing-free drawing of a graph in the plane such that vertices are placed at prescribed y-coordinates (called levels) and such that every edge is realized as a y-monotone curve. In the variant Constrained Level Planarity (CLP), each level $y$ is equipped with a partial order $\\prec_y$ on its vertices and in the desired drawing the left-to-right order of vertices on level $y$ has to be a linear extension of $\\prec_y$. Ordered Level Planarity (OLP) corresponds to the special case of CLP where the given partial orders $\\prec_y$ are total orders. Previous r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.13702","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.13702/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2403.13702","created_at":"2026-07-05T09:22:39.213461+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.13702v2","created_at":"2026-07-05T09:22:39.213461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.13702","created_at":"2026-07-05T09:22:39.213461+00:00"},{"alias_kind":"pith_short_12","alias_value":"5VUEKQA64W2K","created_at":"2026-07-05T09:22:39.213461+00:00"},{"alias_kind":"pith_short_16","alias_value":"5VUEKQA64W2KJTMA","created_at":"2026-07-05T09:22:39.213461+00:00"},{"alias_kind":"pith_short_8","alias_value":"5VUEKQA6","created_at":"2026-07-05T09:22:39.213461+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.04042","citing_title":"Recognizing 2-Layer and Outer $k$-Planar Graphs","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5VUEKQA64W2KJTMAJVOSIHSETN","json":"https://pith.science/pith/5VUEKQA64W2KJTMAJVOSIHSETN.json","graph_json":"https://pith.science/api/pith-number/5VUEKQA64W2KJTMAJVOSIHSETN/graph.json","events_json":"https://pith.science/api/pith-number/5VUEKQA64W2KJTMAJVOSIHSETN/events.json","paper":"https://pith.science/paper/5VUEKQA6"},"agent_actions":{"view_html":"https://pith.science/pith/5VUEKQA64W2KJTMAJVOSIHSETN","download_json":"https://pith.science/pith/5VUEKQA64W2KJTMAJVOSIHSETN.json","view_paper":"https://pith.science/paper/5VUEKQA6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.13702&json=true","fetch_graph":"https://pith.science/api/pith-number/5VUEKQA64W2KJTMAJVOSIHSETN/graph.json","fetch_events":"https://pith.science/api/pith-number/5VUEKQA64W2KJTMAJVOSIHSETN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5VUEKQA64W2KJTMAJVOSIHSETN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5VUEKQA64W2KJTMAJVOSIHSETN/action/storage_attestation","attest_author":"https://pith.science/pith/5VUEKQA64W2KJTMAJVOSIHSETN/action/author_attestation","sign_citation":"https://pith.science/pith/5VUEKQA64W2KJTMAJVOSIHSETN/action/citation_signature","submit_replication":"https://pith.science/pith/5VUEKQA64W2KJTMAJVOSIHSETN/action/replication_record"}},"created_at":"2026-07-05T09:22:39.213461+00:00","updated_at":"2026-07-05T09:22:39.213461+00:00"}