{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5N35JEZW3Z72FKYSHYLYPS6JOR","short_pith_number":"pith:5N35JEZW","schema_version":"1.0","canonical_sha256":"eb77d49336de7fa2ab123e1787cbc9745d84817f5d6b9776c9bb525a70f8b02e","source":{"kind":"arxiv","id":"1303.4349","version":3},"attestation_state":"computed","paper":{"title":"Finding all Convex Cuts of a Plane Graph in Polynomial Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Henning Meyerhenke, Roland Glantz","submitted_at":"2013-03-18T18:21:45Z","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"},"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":"1303.4349","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-18T18:21:45Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e87fa7cf93faf7cf7cbb80c7a76c0a12a3b1aa3753e2c17c71b002e6c094a416","abstract_canon_sha256":"fc7e5673b84bb53d7830630f186ba72e45f2a189daacd095e03408d382b77af4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:05.700814Z","signature_b64":"b46YLDiWTD6AytQLHguoMwwR8tKpPB3xTLqAnsQ3ksKR+5iQTEOuy7sqMT2HyHrlhAIfgHy8SLtM2h3BYGVwCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb77d49336de7fa2ab123e1787cbc9745d84817f5d6b9776c9bb525a70f8b02e","last_reissued_at":"2026-05-18T03:02:05.700185Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:05.700185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding all Convex Cuts of a Plane Graph in Polynomial Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Henning Meyerhenke, Roland Glantz","submitted_at":"2013-03-18T18:21:45Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.4349","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1303.4349","created_at":"2026-05-18T03:02:05.700290+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.4349v3","created_at":"2026-05-18T03:02:05.700290+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.4349","created_at":"2026-05-18T03:02:05.700290+00:00"},{"alias_kind":"pith_short_12","alias_value":"5N35JEZW3Z72","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5N35JEZW3Z72FKYS","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5N35JEZW","created_at":"2026-05-18T12:27:34.582898+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5N35JEZW3Z72FKYSHYLYPS6JOR","json":"https://pith.science/pith/5N35JEZW3Z72FKYSHYLYPS6JOR.json","graph_json":"https://pith.science/api/pith-number/5N35JEZW3Z72FKYSHYLYPS6JOR/graph.json","events_json":"https://pith.science/api/pith-number/5N35JEZW3Z72FKYSHYLYPS6JOR/events.json","paper":"https://pith.science/paper/5N35JEZW"},"agent_actions":{"view_html":"https://pith.science/pith/5N35JEZW3Z72FKYSHYLYPS6JOR","download_json":"https://pith.science/pith/5N35JEZW3Z72FKYSHYLYPS6JOR.json","view_paper":"https://pith.science/paper/5N35JEZW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.4349&json=true","fetch_graph":"https://pith.science/api/pith-number/5N35JEZW3Z72FKYSHYLYPS6JOR/graph.json","fetch_events":"https://pith.science/api/pith-number/5N35JEZW3Z72FKYSHYLYPS6JOR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5N35JEZW3Z72FKYSHYLYPS6JOR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5N35JEZW3Z72FKYSHYLYPS6JOR/action/storage_attestation","attest_author":"https://pith.science/pith/5N35JEZW3Z72FKYSHYLYPS6JOR/action/author_attestation","sign_citation":"https://pith.science/pith/5N35JEZW3Z72FKYSHYLYPS6JOR/action/citation_signature","submit_replication":"https://pith.science/pith/5N35JEZW3Z72FKYSHYLYPS6JOR/action/replication_record"}},"created_at":"2026-05-18T03:02:05.700290+00:00","updated_at":"2026-05-18T03:02:05.700290+00:00"}