{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CMXEDMPDUYWNTS5NF5MNNQI6FI","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":"57ee8f8b278238f3f58ddaa29994db7c2b4d409f9d7a72e756544807c54a889c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-08-14T08:33:55Z","title_canon_sha256":"7ea15aa4bd4cea01a3edf21d7155352775278e77cbfb2bd271bd2ec86e542540"},"schema_version":"1.0","source":{"id":"1908.05015","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05015","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05015v1","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05015","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"pith_short_12","alias_value":"CMXEDMPDUYWN","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"pith_short_16","alias_value":"CMXEDMPDUYWNTS5N","created_at":"2026-07-04T23:55:59Z"},{"alias_kind":"pith_short_8","alias_value":"CMXEDMPD","created_at":"2026-07-04T23:55:59Z"}],"graph_snapshots":[{"event_id":"sha256:5934be3bfaec1da9d65e0beee93b7f4179740373e6ff422f55507b9710dc3ac1","target":"graph","created_at":"2026-07-04T23:55:59Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.05015/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a planar graph $G$ and an integer $b$, OrthogonalPlanarity is the problem of deciding whether $G$ admits an orthogonal drawing with at most $b$ bends in total. We show that OrthogonalPlanarity can be solved in polynomial time if $G$ has bounded treewidth. Our proof is based on an FPT algorithm whose parameters are the number of bends, the treewidth and the number of degree-2 vertices of $G$. This result is based on the concept of sketched orthogonal representation that synthetically describes a family of equivalent orthogonal representations. Our approach can be extended to related probl","authors_text":"Emilio Di Giacomo, Fabrizio Montecchiani, Giuseppe Liotta","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-08-14T08:33:55Z","title":"Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05015","kind":"arxiv","version":1},"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:da274bec4b6ceafb68fc6b96d7817a58baa661cd1eea83c94cbd64f04d9210f7","target":"record","created_at":"2026-07-04T23:55:59Z","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":"57ee8f8b278238f3f58ddaa29994db7c2b4d409f9d7a72e756544807c54a889c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-08-14T08:33:55Z","title_canon_sha256":"7ea15aa4bd4cea01a3edf21d7155352775278e77cbfb2bd271bd2ec86e542540"},"schema_version":"1.0","source":{"id":"1908.05015","kind":"arxiv","version":1}},"canonical_sha256":"132e41b1e3a62cd9cbad2f58d6c11e2a36d0afc7266d4051e986073d48d89eaf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"132e41b1e3a62cd9cbad2f58d6c11e2a36d0afc7266d4051e986073d48d89eaf","first_computed_at":"2026-07-04T23:55:59.162326Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:55:59.162326Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"01chQ2ok4hGVTOooOasAMZuJ+LAF8ZFEGDJsTIotsFHnVepePiu1prNwBczy6o1WV9nTFnn7KozDDAh7o3S4CQ==","signature_status":"signed_v1","signed_at":"2026-07-04T23:55:59.162660Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.05015","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da274bec4b6ceafb68fc6b96d7817a58baa661cd1eea83c94cbd64f04d9210f7","sha256:5934be3bfaec1da9d65e0beee93b7f4179740373e6ff422f55507b9710dc3ac1"],"state_sha256":"c225e29b6c10e1b974a709094ab56a38c70b2e56b3e9ada5798395cd252d5a4b"}