{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:26DTHQFYE567FBVVOBRDGWKURX","short_pith_number":"pith:26DTHQFY","canonical_record":{"source":{"id":"2209.08904","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-09-19T10:21:56Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"3f43e27de9b0fe96be10d3f97f527d63d557605013f3663c89ecef18abd1e907","abstract_canon_sha256":"9bdd7d340d26deed4efffbd9d5840f9330958bd0b86ae648806662b49395142c"},"schema_version":"1.0"},"canonical_sha256":"d78733c0b8277df286b570623359548dfa8699a10802d7611a544ba40452079c","source":{"kind":"arxiv","id":"2209.08904","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.08904","created_at":"2026-07-05T04:58:47Z"},{"alias_kind":"arxiv_version","alias_value":"2209.08904v1","created_at":"2026-07-05T04:58:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.08904","created_at":"2026-07-05T04:58:47Z"},{"alias_kind":"pith_short_12","alias_value":"26DTHQFYE567","created_at":"2026-07-05T04:58:47Z"},{"alias_kind":"pith_short_16","alias_value":"26DTHQFYE567FBVV","created_at":"2026-07-05T04:58:47Z"},{"alias_kind":"pith_short_8","alias_value":"26DTHQFY","created_at":"2026-07-05T04:58:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:26DTHQFYE567FBVVOBRDGWKURX","target":"record","payload":{"canonical_record":{"source":{"id":"2209.08904","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-09-19T10:21:56Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"3f43e27de9b0fe96be10d3f97f527d63d557605013f3663c89ecef18abd1e907","abstract_canon_sha256":"9bdd7d340d26deed4efffbd9d5840f9330958bd0b86ae648806662b49395142c"},"schema_version":"1.0"},"canonical_sha256":"d78733c0b8277df286b570623359548dfa8699a10802d7611a544ba40452079c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:58:47.442765Z","signature_b64":"1RGwgIp+YEkz8yqIYjyckp02RbpnhhwWsnyitE3k4t4Y2iji8g/6k+N5HMm0SfQ7igh+3XFbiUAfx4tV6H1dDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d78733c0b8277df286b570623359548dfa8699a10802d7611a544ba40452079c","last_reissued_at":"2026-07-05T04:58:47.442426Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:58:47.442426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2209.08904","source_version":1,"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-07-05T04:58:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2FoDG9yvsHaxBRqnoLDu/00o9SpxhEo3DwUQ9xfpwjCzLhj9p4XFTSUbrDklGWJiyVUDfm5ywJ3G1ziLC0KKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T05:28:13.088858Z"},"content_sha256":"a16882a5258428e4a8049617b176afd1fd6edf3c36e15e03390ddcf86ee86b78","schema_version":"1.0","event_id":"sha256:a16882a5258428e4a8049617b176afd1fd6edf3c36e15e03390ddcf86ee86b78"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:26DTHQFYE567FBVVOBRDGWKURX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Anna Zych-Pawlewicz, Fran\\c{c}ois Dross, Karol W\\k{e}grzycki, Krzysztof Fleszar","submitted_at":"2022-09-19T10:21:56Z","abstract_excerpt":"In this paper, we study problems of connecting classes of points via noncrossing structures. Given a set of colored terminal points, we want to find a graph for each color that connects all terminals of its color with the restriction that no two graphs cross each other. We consider these problems both on the Euclidean plane and in planar graphs.\n  On the algorithmic side, we give a Gap-ETH-tight EPTAS for the two-colored traveling salesman problem as well as for the red-blue-green separation problem (in which we want to separate terminals of three colors with two noncrossing polygons of minimu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.08904","kind":"arxiv","version":1},"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/2209.08904/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"},"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-07-05T04:58:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2JQ4mIgw4BVQ0KPO4KkYMxvoPyn+tf8fGdRyMoSipioQWL0QvRiHRp+JpeqlOqIk4rSNsw5eiRns69RGm16HCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T05:28:13.089950Z"},"content_sha256":"820921776f29f6074354d89a512f323680978c273e9213293d51c0f8a85fa18e","schema_version":"1.0","event_id":"sha256:820921776f29f6074354d89a512f323680978c273e9213293d51c0f8a85fa18e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/26DTHQFYE567FBVVOBRDGWKURX/bundle.json","state_url":"https://pith.science/pith/26DTHQFYE567FBVVOBRDGWKURX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/26DTHQFYE567FBVVOBRDGWKURX/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-08-17T05:28:13Z","links":{"resolver":"https://pith.science/pith/26DTHQFYE567FBVVOBRDGWKURX","bundle":"https://pith.science/pith/26DTHQFYE567FBVVOBRDGWKURX/bundle.json","state":"https://pith.science/pith/26DTHQFYE567FBVVOBRDGWKURX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/26DTHQFYE567FBVVOBRDGWKURX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:26DTHQFYE567FBVVOBRDGWKURX","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":"9bdd7d340d26deed4efffbd9d5840f9330958bd0b86ae648806662b49395142c","cross_cats_sorted":["cs.CG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-09-19T10:21:56Z","title_canon_sha256":"3f43e27de9b0fe96be10d3f97f527d63d557605013f3663c89ecef18abd1e907"},"schema_version":"1.0","source":{"id":"2209.08904","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.08904","created_at":"2026-07-05T04:58:47Z"},{"alias_kind":"arxiv_version","alias_value":"2209.08904v1","created_at":"2026-07-05T04:58:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.08904","created_at":"2026-07-05T04:58:47Z"},{"alias_kind":"pith_short_12","alias_value":"26DTHQFYE567","created_at":"2026-07-05T04:58:47Z"},{"alias_kind":"pith_short_16","alias_value":"26DTHQFYE567FBVV","created_at":"2026-07-05T04:58:47Z"},{"alias_kind":"pith_short_8","alias_value":"26DTHQFY","created_at":"2026-07-05T04:58:47Z"}],"graph_snapshots":[{"event_id":"sha256:820921776f29f6074354d89a512f323680978c273e9213293d51c0f8a85fa18e","target":"graph","created_at":"2026-07-05T04:58:47Z","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/2209.08904/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we study problems of connecting classes of points via noncrossing structures. Given a set of colored terminal points, we want to find a graph for each color that connects all terminals of its color with the restriction that no two graphs cross each other. We consider these problems both on the Euclidean plane and in planar graphs.\n  On the algorithmic side, we give a Gap-ETH-tight EPTAS for the two-colored traveling salesman problem as well as for the red-blue-green separation problem (in which we want to separate terminals of three colors with two noncrossing polygons of minimu","authors_text":"Anna Zych-Pawlewicz, Fran\\c{c}ois Dross, Karol W\\k{e}grzycki, Krzysztof Fleszar","cross_cats":["cs.CG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-09-19T10:21:56Z","title":"Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.08904","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:a16882a5258428e4a8049617b176afd1fd6edf3c36e15e03390ddcf86ee86b78","target":"record","created_at":"2026-07-05T04:58:47Z","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":"9bdd7d340d26deed4efffbd9d5840f9330958bd0b86ae648806662b49395142c","cross_cats_sorted":["cs.CG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-09-19T10:21:56Z","title_canon_sha256":"3f43e27de9b0fe96be10d3f97f527d63d557605013f3663c89ecef18abd1e907"},"schema_version":"1.0","source":{"id":"2209.08904","kind":"arxiv","version":1}},"canonical_sha256":"d78733c0b8277df286b570623359548dfa8699a10802d7611a544ba40452079c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d78733c0b8277df286b570623359548dfa8699a10802d7611a544ba40452079c","first_computed_at":"2026-07-05T04:58:47.442426Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:58:47.442426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1RGwgIp+YEkz8yqIYjyckp02RbpnhhwWsnyitE3k4t4Y2iji8g/6k+N5HMm0SfQ7igh+3XFbiUAfx4tV6H1dDg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:58:47.442765Z","signed_message":"canonical_sha256_bytes"},"source_id":"2209.08904","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a16882a5258428e4a8049617b176afd1fd6edf3c36e15e03390ddcf86ee86b78","sha256:820921776f29f6074354d89a512f323680978c273e9213293d51c0f8a85fa18e"],"state_sha256":"dbbdd66af23733d6bafe60a02c82491c9f09160235eff52d82bc313f0ff6eb3a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hLT44zQ4pdOzFfzDvum8ZjJVSH6vnnB0XSNq6i1dYACuyKiFb34UxJwwCPa4y2aRKf+qsvYV5K7+yWrodzOLCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T05:28:13.123104Z","bundle_sha256":"6fb4744aa0db1bf2ae21a7a79de4645293e241d5259f2a46a3939ee2d5b3af32"}}