{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ZR3QBINF7TEJBBAJAPRTLW6I3J","short_pith_number":"pith:ZR3QBINF","canonical_record":{"source":{"id":"2412.13938","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-12-18T15:21:37Z","cross_cats_sorted":[],"title_canon_sha256":"06fe4534e75a3101cc4db8fb5900d9f9564aa1cc7f61d5d48a264fb7e398c1f5","abstract_canon_sha256":"0c1683dc387f4f7408ea788270154802a98c3d7bf805acc246de52ab12f8ee36"},"schema_version":"1.0"},"canonical_sha256":"cc7700a1a5fcc890840903e335dbc8da527439e0c422e4ce45c0b98743abb5eb","source":{"kind":"arxiv","id":"2412.13938","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.13938","created_at":"2026-07-05T11:27:52Z"},{"alias_kind":"arxiv_version","alias_value":"2412.13938v3","created_at":"2026-07-05T11:27:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.13938","created_at":"2026-07-05T11:27:52Z"},{"alias_kind":"pith_short_12","alias_value":"ZR3QBINF7TEJ","created_at":"2026-07-05T11:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZR3QBINF7TEJBBAJ","created_at":"2026-07-05T11:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZR3QBINF","created_at":"2026-07-05T11:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ZR3QBINF7TEJBBAJAPRTLW6I3J","target":"record","payload":{"canonical_record":{"source":{"id":"2412.13938","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-12-18T15:21:37Z","cross_cats_sorted":[],"title_canon_sha256":"06fe4534e75a3101cc4db8fb5900d9f9564aa1cc7f61d5d48a264fb7e398c1f5","abstract_canon_sha256":"0c1683dc387f4f7408ea788270154802a98c3d7bf805acc246de52ab12f8ee36"},"schema_version":"1.0"},"canonical_sha256":"cc7700a1a5fcc890840903e335dbc8da527439e0c422e4ce45c0b98743abb5eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:27:52.155077Z","signature_b64":"vpxEbgccedlvyEOfsXPq1+EkDt0gsujDToVsq8DhzpROe6jMSvGTzmyuSnuxoeldoP4rTvP210hZ9frKoxrBCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc7700a1a5fcc890840903e335dbc8da527439e0c422e4ce45c0b98743abb5eb","last_reissued_at":"2026-07-05T11:27:52.154519Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:27:52.154519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.13938","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-07-05T11:27:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9zLfsGW8jDnalhquvBl8tMjJZ4lwas1SRakwIi23s5xm7AVxp6x08nz1GX1OYR4KmlWSam3wEKsoi9HfAEmBDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T02:24:49.355536Z"},"content_sha256":"9b54b7823a7445de332e283cf5c1b632faae5b20992ad17224a76a927c5bcf6f","schema_version":"1.0","event_id":"sha256:9b54b7823a7445de332e283cf5c1b632faae5b20992ad17224a76a927c5bcf6f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ZR3QBINF7TEJBBAJAPRTLW6I3J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Casper Moldrup Rysgaard, Jens Kristian Refsgaard Schou, Magnus Christian Ring Merrild, Rolf Svenning","submitted_at":"2024-12-18T15:21:37Z","abstract_excerpt":"In this paper, we study the Contiguous Art Gallery Problem, introduced by Thomas C. Shermer at the 2024 Canadian Conference on Computational Geometry, a variant of the classical art gallery problem from 1973 by Victor Klee.\n  In the contiguous variant, the input is a simple polygon $P$, and the goal is to partition the boundary into a minimum number of polygonal chains such that each chain is visible to a guard.\n  We present a polynomial-time RAM algorithm, which solves the contiguous art gallery problem.\n  Our algorithm is simple and practical, and we make a C++ implementation available.\n  In"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.13938","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.13938/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-05T11:27:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LS/JbHcsuMHx1cNyuoT/n4pLpI8J2+GUrXI/KiYwoAUo7zgRykb8tdwaL3oPdlABShtUYn/1I/ytFitPKYOXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T02:24:49.356614Z"},"content_sha256":"b7ab47e388144834b8b9c53a919decfe9e14083810f7fc65798e7b62395557e0","schema_version":"1.0","event_id":"sha256:b7ab47e388144834b8b9c53a919decfe9e14083810f7fc65798e7b62395557e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZR3QBINF7TEJBBAJAPRTLW6I3J/bundle.json","state_url":"https://pith.science/pith/ZR3QBINF7TEJBBAJAPRTLW6I3J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZR3QBINF7TEJBBAJAPRTLW6I3J/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-16T02:24:49Z","links":{"resolver":"https://pith.science/pith/ZR3QBINF7TEJBBAJAPRTLW6I3J","bundle":"https://pith.science/pith/ZR3QBINF7TEJBBAJAPRTLW6I3J/bundle.json","state":"https://pith.science/pith/ZR3QBINF7TEJBBAJAPRTLW6I3J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZR3QBINF7TEJBBAJAPRTLW6I3J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ZR3QBINF7TEJBBAJAPRTLW6I3J","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":"0c1683dc387f4f7408ea788270154802a98c3d7bf805acc246de52ab12f8ee36","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-12-18T15:21:37Z","title_canon_sha256":"06fe4534e75a3101cc4db8fb5900d9f9564aa1cc7f61d5d48a264fb7e398c1f5"},"schema_version":"1.0","source":{"id":"2412.13938","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.13938","created_at":"2026-07-05T11:27:52Z"},{"alias_kind":"arxiv_version","alias_value":"2412.13938v3","created_at":"2026-07-05T11:27:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.13938","created_at":"2026-07-05T11:27:52Z"},{"alias_kind":"pith_short_12","alias_value":"ZR3QBINF7TEJ","created_at":"2026-07-05T11:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZR3QBINF7TEJBBAJ","created_at":"2026-07-05T11:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZR3QBINF","created_at":"2026-07-05T11:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:b7ab47e388144834b8b9c53a919decfe9e14083810f7fc65798e7b62395557e0","target":"graph","created_at":"2026-07-05T11:27:52Z","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/2412.13938/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we study the Contiguous Art Gallery Problem, introduced by Thomas C. Shermer at the 2024 Canadian Conference on Computational Geometry, a variant of the classical art gallery problem from 1973 by Victor Klee.\n  In the contiguous variant, the input is a simple polygon $P$, and the goal is to partition the boundary into a minimum number of polygonal chains such that each chain is visible to a guard.\n  We present a polynomial-time RAM algorithm, which solves the contiguous art gallery problem.\n  Our algorithm is simple and practical, and we make a C++ implementation available.\n  In","authors_text":"Casper Moldrup Rysgaard, Jens Kristian Refsgaard Schou, Magnus Christian Ring Merrild, Rolf Svenning","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-12-18T15:21:37Z","title":"The Contiguous Art Gallery Problem is Solvable in Polynomial Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.13938","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:9b54b7823a7445de332e283cf5c1b632faae5b20992ad17224a76a927c5bcf6f","target":"record","created_at":"2026-07-05T11:27:52Z","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":"0c1683dc387f4f7408ea788270154802a98c3d7bf805acc246de52ab12f8ee36","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2024-12-18T15:21:37Z","title_canon_sha256":"06fe4534e75a3101cc4db8fb5900d9f9564aa1cc7f61d5d48a264fb7e398c1f5"},"schema_version":"1.0","source":{"id":"2412.13938","kind":"arxiv","version":3}},"canonical_sha256":"cc7700a1a5fcc890840903e335dbc8da527439e0c422e4ce45c0b98743abb5eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc7700a1a5fcc890840903e335dbc8da527439e0c422e4ce45c0b98743abb5eb","first_computed_at":"2026-07-05T11:27:52.154519Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:27:52.154519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vpxEbgccedlvyEOfsXPq1+EkDt0gsujDToVsq8DhzpROe6jMSvGTzmyuSnuxoeldoP4rTvP210hZ9frKoxrBCA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:27:52.155077Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.13938","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b54b7823a7445de332e283cf5c1b632faae5b20992ad17224a76a927c5bcf6f","sha256:b7ab47e388144834b8b9c53a919decfe9e14083810f7fc65798e7b62395557e0"],"state_sha256":"0d0650e840c8f383abf1450c3165a1735c847dcf0344bbcdea0aab0cfea8a7af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZBj1Ko2d84JXb72XJWEouzdWyhwRgLh3/LzWXH7nIuwXglTBZnu1E/N3albmMDhvN8J5Chsc0b4SEaUDbfVrCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T02:24:49.363331Z","bundle_sha256":"8629ec2a791e6c3086dd67f219d4e23b7363bb6a6e799b44ecd90385b503365c"}}