{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5N35JEZW3Z72FKYSHYLYPS6JOR","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":"fc7e5673b84bb53d7830630f186ba72e45f2a189daacd095e03408d382b77af4","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-18T18:21:45Z","title_canon_sha256":"e87fa7cf93faf7cf7cbb80c7a76c0a12a3b1aa3753e2c17c71b002e6c094a416"},"schema_version":"1.0","source":{"id":"1303.4349","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.4349","created_at":"2026-05-18T03:02:05Z"},{"alias_kind":"arxiv_version","alias_value":"1303.4349v3","created_at":"2026-05-18T03:02:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4349","created_at":"2026-05-18T03:02:05Z"},{"alias_kind":"pith_short_12","alias_value":"5N35JEZW3Z72","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5N35JEZW3Z72FKYS","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5N35JEZW","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:34ad687e385ab09daadfad63d665dc714c996bc55909d9f752afc93ba002a8d6","target":"graph","created_at":"2026-05-18T03:02:05Z","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":"Convexity is a notion that has been defined for subsets of $\\RR^n$ and for subsets of general graphs. A convex cut of a graph $G=(V, E)$ is a $2$-partition $V_1 \\dot{\\cup} V_2=V$ such that both $V_1$ and $V_2$ are convex, \\ie shortest paths between vertices in $V_i$ never leave $V_i$, $i \\in \\{1, 2\\}$. Finding convex cuts is $\\mathcal{NP}$-hard for general graphs. To characterize convex cuts, we employ the Djokovic relation, a reflexive and symmetric relation on the edges of a graph that is based on shortest paths between the edges' end vertices.\n  It is known for a long time that, if $G$ is b","authors_text":"Henning Meyerhenke, Roland Glantz","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-18T18:21:45Z","title":"Finding all Convex Cuts of a Plane Graph in Polynomial Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4349","kind":"arxiv","version":3},"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:7d592db26ce44f5d5fc8dbd7a15552c50019af5257c69501c8bf40a6fab9bbd9","target":"record","created_at":"2026-05-18T03:02:05Z","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":"fc7e5673b84bb53d7830630f186ba72e45f2a189daacd095e03408d382b77af4","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-18T18:21:45Z","title_canon_sha256":"e87fa7cf93faf7cf7cbb80c7a76c0a12a3b1aa3753e2c17c71b002e6c094a416"},"schema_version":"1.0","source":{"id":"1303.4349","kind":"arxiv","version":3}},"canonical_sha256":"eb77d49336de7fa2ab123e1787cbc9745d84817f5d6b9776c9bb525a70f8b02e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb77d49336de7fa2ab123e1787cbc9745d84817f5d6b9776c9bb525a70f8b02e","first_computed_at":"2026-05-18T03:02:05.700185Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:05.700185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b46YLDiWTD6AytQLHguoMwwR8tKpPB3xTLqAnsQ3ksKR+5iQTEOuy7sqMT2HyHrlhAIfgHy8SLtM2h3BYGVwCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:05.700814Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.4349","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d592db26ce44f5d5fc8dbd7a15552c50019af5257c69501c8bf40a6fab9bbd9","sha256:34ad687e385ab09daadfad63d665dc714c996bc55909d9f752afc93ba002a8d6"],"state_sha256":"0e29c986f71626939688eb4cda54f906dba74dc9a064f96a1fb558a4f4040c82"}