{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5N35JEZW3Z72FKYSHYLYPS6JOR","short_pith_number":"pith:5N35JEZW","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"},"canonical_sha256":"eb77d49336de7fa2ab123e1787cbc9745d84817f5d6b9776c9bb525a70f8b02e","source":{"kind":"arxiv","id":"1303.4349","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5N35JEZW3Z72FKYSHYLYPS6JOR","target":"record","payload":{"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"},"canonical_sha256":"eb77d49336de7fa2ab123e1787cbc9745d84817f5d6b9776c9bb525a70f8b02e","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"},"source_kind":"arxiv","source_id":"1303.4349","source_version":3,"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-18T03:02:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o7g94VCEvvj8Uq3n9e1imrxT3u+YM7IKbITXHrwakUOcw1qGAb+FHmfyhJUm9UazXkx9D6dfZpp0MAg1CkmQCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:45:01.033473Z"},"content_sha256":"7d592db26ce44f5d5fc8dbd7a15552c50019af5257c69501c8bf40a6fab9bbd9","schema_version":"1.0","event_id":"sha256:7d592db26ce44f5d5fc8dbd7a15552c50019af5257c69501c8bf40a6fab9bbd9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5N35JEZW3Z72FKYSHYLYPS6JOR","target":"graph","payload":{"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"},"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-18T03:02:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4TFSp4ucztOZCt1LKAYNL/gGXDFssPu3A9fop2lxIKyuiPawlCmvi2lImmHGPVC+FNtVopx0Sg3ZkB82thp1Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:45:01.033842Z"},"content_sha256":"34ad687e385ab09daadfad63d665dc714c996bc55909d9f752afc93ba002a8d6","schema_version":"1.0","event_id":"sha256:34ad687e385ab09daadfad63d665dc714c996bc55909d9f752afc93ba002a8d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5N35JEZW3Z72FKYSHYLYPS6JOR/bundle.json","state_url":"https://pith.science/pith/5N35JEZW3Z72FKYSHYLYPS6JOR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5N35JEZW3Z72FKYSHYLYPS6JOR/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-06-06T16:45:01Z","links":{"resolver":"https://pith.science/pith/5N35JEZW3Z72FKYSHYLYPS6JOR","bundle":"https://pith.science/pith/5N35JEZW3Z72FKYSHYLYPS6JOR/bundle.json","state":"https://pith.science/pith/5N35JEZW3Z72FKYSHYLYPS6JOR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5N35JEZW3Z72FKYSHYLYPS6JOR/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nmi7662Hjk1ymHvTHR41wG9ZtndPLTULc3MrbbzJjet6LrriH5UB1cHAYONhw/sZAnVEKxBLq7B/OMFlMAxTBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T16:45:01.035821Z","bundle_sha256":"b6147c0f5138cc98ea01e731bd104d90ed578781219ec3a16db7d320c2d0457c"}}