{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:IIDMOCG5Q3RM37HRIVATNDOTY5","short_pith_number":"pith:IIDMOCG5","canonical_record":{"source":{"id":"2409.13040","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-09-19T18:21:43Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b087b5060e53dce39c57a46d23a587c4fc54085de6690b58ba34f59767fc539c","abstract_canon_sha256":"1e806be79866df3fc2292862049b66275b63e97de5983b4d6f139669551bf35e"},"schema_version":"1.0"},"canonical_sha256":"4206c708dd86e2cdfcf14541368dd3c76f057768a9b68ca1774a93ae05e31098","source":{"kind":"arxiv","id":"2409.13040","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.13040","created_at":"2026-07-05T09:09:28Z"},{"alias_kind":"arxiv_version","alias_value":"2409.13040v1","created_at":"2026-07-05T09:09:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.13040","created_at":"2026-07-05T09:09:28Z"},{"alias_kind":"pith_short_12","alias_value":"IIDMOCG5Q3RM","created_at":"2026-07-05T09:09:28Z"},{"alias_kind":"pith_short_16","alias_value":"IIDMOCG5Q3RM37HR","created_at":"2026-07-05T09:09:28Z"},{"alias_kind":"pith_short_8","alias_value":"IIDMOCG5","created_at":"2026-07-05T09:09:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:IIDMOCG5Q3RM37HRIVATNDOTY5","target":"record","payload":{"canonical_record":{"source":{"id":"2409.13040","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-09-19T18:21:43Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b087b5060e53dce39c57a46d23a587c4fc54085de6690b58ba34f59767fc539c","abstract_canon_sha256":"1e806be79866df3fc2292862049b66275b63e97de5983b4d6f139669551bf35e"},"schema_version":"1.0"},"canonical_sha256":"4206c708dd86e2cdfcf14541368dd3c76f057768a9b68ca1774a93ae05e31098","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:09:28.295405Z","signature_b64":"FditZHb7da2UPrxXrA16Pq+XI8Jq8Bt04eRr4MvqQ80AaWnj7l1NcdkETd39o8jsDaOtxtE675GBSfL64YU0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4206c708dd86e2cdfcf14541368dd3c76f057768a9b68ca1774a93ae05e31098","last_reissued_at":"2026-07-05T09:09:28.294969Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:09:28.294969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.13040","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-05T09:09:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5eq5k+kXwK4HnVhgeB7LUyJwNmhxNKun3RfmZbi1MptXEM+1ImnW6HSzx1V4miEYcQfWfPrBYt9ZKFPw66aKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T15:59:31.238677Z"},"content_sha256":"1326b82cdb8247b74eb33fb64968f45dfc482b5df1b735335513e191c6b2e968","schema_version":"1.0","event_id":"sha256:1326b82cdb8247b74eb33fb64968f45dfc482b5df1b735335513e191c6b2e968"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:IIDMOCG5Q3RM37HRIVATNDOTY5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nesting of Touching Polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Carsten R. Seemann, Marc Hellmuth, Peter F. Stadler","submitted_at":"2024-09-19T18:21:43Z","abstract_excerpt":"Polygons are cycles embedded into the plane; their vertices are associated with $x$- and $y$-coordinates and the edges are straight lines. Here, we consider a set of polygons with pairwise non-overlapping interior that may touch along their boundaries. Ideas of the sweep line algorithm by Bajaj and Dey for non-touching polygons are adapted to accommodate polygons that share boundary points. The algorithms established here achieves a running time of $\\mathcal{O}(n+N\\log N)$, where $n$ is the total number of vertices and $N<n$ is the total number of \"maximal outstretched segments\" of all polygon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.13040","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/2409.13040/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-05T09:09:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h9b3kcsVIzx7oiElYE+eSSgIsNPE4SfwaIT1j+kpLnAgdb3q2voujT9umE9ZJqFjM0YP43U2CXD4AE96QitLBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T15:59:31.239544Z"},"content_sha256":"b53f1a6547878e380d6b0b0ca81da00d2022a5fcf74a8739199734a046678ac0","schema_version":"1.0","event_id":"sha256:b53f1a6547878e380d6b0b0ca81da00d2022a5fcf74a8739199734a046678ac0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IIDMOCG5Q3RM37HRIVATNDOTY5/bundle.json","state_url":"https://pith.science/pith/IIDMOCG5Q3RM37HRIVATNDOTY5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IIDMOCG5Q3RM37HRIVATNDOTY5/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-13T15:59:31Z","links":{"resolver":"https://pith.science/pith/IIDMOCG5Q3RM37HRIVATNDOTY5","bundle":"https://pith.science/pith/IIDMOCG5Q3RM37HRIVATNDOTY5/bundle.json","state":"https://pith.science/pith/IIDMOCG5Q3RM37HRIVATNDOTY5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IIDMOCG5Q3RM37HRIVATNDOTY5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:IIDMOCG5Q3RM37HRIVATNDOTY5","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":"1e806be79866df3fc2292862049b66275b63e97de5983b4d6f139669551bf35e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-09-19T18:21:43Z","title_canon_sha256":"b087b5060e53dce39c57a46d23a587c4fc54085de6690b58ba34f59767fc539c"},"schema_version":"1.0","source":{"id":"2409.13040","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.13040","created_at":"2026-07-05T09:09:28Z"},{"alias_kind":"arxiv_version","alias_value":"2409.13040v1","created_at":"2026-07-05T09:09:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.13040","created_at":"2026-07-05T09:09:28Z"},{"alias_kind":"pith_short_12","alias_value":"IIDMOCG5Q3RM","created_at":"2026-07-05T09:09:28Z"},{"alias_kind":"pith_short_16","alias_value":"IIDMOCG5Q3RM37HR","created_at":"2026-07-05T09:09:28Z"},{"alias_kind":"pith_short_8","alias_value":"IIDMOCG5","created_at":"2026-07-05T09:09:28Z"}],"graph_snapshots":[{"event_id":"sha256:b53f1a6547878e380d6b0b0ca81da00d2022a5fcf74a8739199734a046678ac0","target":"graph","created_at":"2026-07-05T09:09:28Z","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/2409.13040/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Polygons are cycles embedded into the plane; their vertices are associated with $x$- and $y$-coordinates and the edges are straight lines. Here, we consider a set of polygons with pairwise non-overlapping interior that may touch along their boundaries. Ideas of the sweep line algorithm by Bajaj and Dey for non-touching polygons are adapted to accommodate polygons that share boundary points. The algorithms established here achieves a running time of $\\mathcal{O}(n+N\\log N)$, where $n$ is the total number of vertices and $N<n$ is the total number of \"maximal outstretched segments\" of all polygon","authors_text":"Carsten R. Seemann, Marc Hellmuth, Peter F. Stadler","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-09-19T18:21:43Z","title":"Nesting of Touching Polygons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.13040","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:1326b82cdb8247b74eb33fb64968f45dfc482b5df1b735335513e191c6b2e968","target":"record","created_at":"2026-07-05T09:09:28Z","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":"1e806be79866df3fc2292862049b66275b63e97de5983b4d6f139669551bf35e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-09-19T18:21:43Z","title_canon_sha256":"b087b5060e53dce39c57a46d23a587c4fc54085de6690b58ba34f59767fc539c"},"schema_version":"1.0","source":{"id":"2409.13040","kind":"arxiv","version":1}},"canonical_sha256":"4206c708dd86e2cdfcf14541368dd3c76f057768a9b68ca1774a93ae05e31098","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4206c708dd86e2cdfcf14541368dd3c76f057768a9b68ca1774a93ae05e31098","first_computed_at":"2026-07-05T09:09:28.294969Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:09:28.294969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FditZHb7da2UPrxXrA16Pq+XI8Jq8Bt04eRr4MvqQ80AaWnj7l1NcdkETd39o8jsDaOtxtE675GBSfL64YU0Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:09:28.295405Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.13040","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1326b82cdb8247b74eb33fb64968f45dfc482b5df1b735335513e191c6b2e968","sha256:b53f1a6547878e380d6b0b0ca81da00d2022a5fcf74a8739199734a046678ac0"],"state_sha256":"b255ebec6e1726ade756d54748a60e99750bb78733a1c503a1142bca78fa1fea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/KpBqTwNqyP3xPbWWWqWqkU6pRQw3qRIjypVNxbBMOzYB2fbqaWc5mZNvXNZFtIfrtotNQTTu4rbm8Pa+YCIBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T15:59:31.246229Z","bundle_sha256":"b0bf15b787f71c43fd20e6786b2004bdd59608f849988bc7225286c0a8ac177f"}}