{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KRUBJWKDY3WZN2SNMWPTXEIL2J","short_pith_number":"pith:KRUBJWKD","canonical_record":{"source":{"id":"1708.09842","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-31T17:47:05Z","cross_cats_sorted":[],"title_canon_sha256":"ac2c2b62418a7b04f308a0da8052775d111a0447a968af774be5596cb59ad19d","abstract_canon_sha256":"6fcb5e75f3c56c20936a2ad02e30abdba79d9decc8b7ff330cff132f0e821306"},"schema_version":"1.0"},"canonical_sha256":"546814d943c6ed96ea4d659f3b910bd24a435b94b494e5d34ecf672a4b56aa6a","source":{"kind":"arxiv","id":"1708.09842","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09842","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09842v2","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09842","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"pith_short_12","alias_value":"KRUBJWKDY3WZ","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KRUBJWKDY3WZN2SN","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KRUBJWKD","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KRUBJWKDY3WZN2SNMWPTXEIL2J","target":"record","payload":{"canonical_record":{"source":{"id":"1708.09842","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-31T17:47:05Z","cross_cats_sorted":[],"title_canon_sha256":"ac2c2b62418a7b04f308a0da8052775d111a0447a968af774be5596cb59ad19d","abstract_canon_sha256":"6fcb5e75f3c56c20936a2ad02e30abdba79d9decc8b7ff330cff132f0e821306"},"schema_version":"1.0"},"canonical_sha256":"546814d943c6ed96ea4d659f3b910bd24a435b94b494e5d34ecf672a4b56aa6a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:13.677953Z","signature_b64":"quU0OWt/MB0sFJp0cX0UKm09psx8ITUPp1382YE3W4ifMxSwhpLlKclIhqSkMQVnCMEuFBShN5D75ptrM+6EAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"546814d943c6ed96ea4d659f3b910bd24a435b94b494e5d34ecf672a4b56aa6a","last_reissued_at":"2026-05-18T00:36:13.677475Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:13.677475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.09842","source_version":2,"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-18T00:36:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uXZz0yA4dsF/8Q3RyTY4EghEhPGTvs9vtZ/PHl80ofXnU1vkkYFqrzn5tuxfl23T63XLZn93q50cFMG6Fk7JDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:50:30.551906Z"},"content_sha256":"9efdd49a6ee631ca049f6ec272bfb37a31c4c539058b653a591faa8a4d843f14","schema_version":"1.0","event_id":"sha256:9efdd49a6ee631ca049f6ec272bfb37a31c4c539058b653a591faa8a4d843f14"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KRUBJWKDY3WZN2SNMWPTXEIL2J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reconstructing Generalized Staircase Polygons with Uniform Step Length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Darren Strash, Nodari Sitchinava","submitted_at":"2017-08-31T17:47:05Z","abstract_excerpt":"Visibility graph reconstruction, which asks us to construct a polygon that has a given visibility graph, is a fundamental problem with unknown complexity (although visibility graph recognition is known to be in PSPACE). We show that two classes of uniform step length polygons can be reconstructed efficiently by finding and removing rectangles formed between consecutive convex boundary vertices called tabs. In particular, we give an $O(n^2m)$-time reconstruction algorithm for orthogonally convex polygons, where $n$ and $m$ are the number of vertices and edges in the visibility graph, respective"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09842","kind":"arxiv","version":2},"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-18T00:36:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NLR0MrxyjQLLH2uBgXZWj3Wg7Lw7bh4Bc/Bs9jTtZq3CXpWGHCokTXa6Ajzca3Mt7fcAs0tgIzP54XI57WJkCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:50:30.552468Z"},"content_sha256":"e1dfef3e16cb43e660fe12a7e719b56c584df8d54029c2ca012573afe3837f43","schema_version":"1.0","event_id":"sha256:e1dfef3e16cb43e660fe12a7e719b56c584df8d54029c2ca012573afe3837f43"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KRUBJWKDY3WZN2SNMWPTXEIL2J/bundle.json","state_url":"https://pith.science/pith/KRUBJWKDY3WZN2SNMWPTXEIL2J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KRUBJWKDY3WZN2SNMWPTXEIL2J/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-05-31T22:50:30Z","links":{"resolver":"https://pith.science/pith/KRUBJWKDY3WZN2SNMWPTXEIL2J","bundle":"https://pith.science/pith/KRUBJWKDY3WZN2SNMWPTXEIL2J/bundle.json","state":"https://pith.science/pith/KRUBJWKDY3WZN2SNMWPTXEIL2J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KRUBJWKDY3WZN2SNMWPTXEIL2J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KRUBJWKDY3WZN2SNMWPTXEIL2J","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":"6fcb5e75f3c56c20936a2ad02e30abdba79d9decc8b7ff330cff132f0e821306","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-31T17:47:05Z","title_canon_sha256":"ac2c2b62418a7b04f308a0da8052775d111a0447a968af774be5596cb59ad19d"},"schema_version":"1.0","source":{"id":"1708.09842","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09842","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09842v2","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09842","created_at":"2026-05-18T00:36:13Z"},{"alias_kind":"pith_short_12","alias_value":"KRUBJWKDY3WZ","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"KRUBJWKDY3WZN2SN","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"KRUBJWKD","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:e1dfef3e16cb43e660fe12a7e719b56c584df8d54029c2ca012573afe3837f43","target":"graph","created_at":"2026-05-18T00:36:13Z","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":"Visibility graph reconstruction, which asks us to construct a polygon that has a given visibility graph, is a fundamental problem with unknown complexity (although visibility graph recognition is known to be in PSPACE). We show that two classes of uniform step length polygons can be reconstructed efficiently by finding and removing rectangles formed between consecutive convex boundary vertices called tabs. In particular, we give an $O(n^2m)$-time reconstruction algorithm for orthogonally convex polygons, where $n$ and $m$ are the number of vertices and edges in the visibility graph, respective","authors_text":"Darren Strash, Nodari Sitchinava","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-31T17:47:05Z","title":"Reconstructing Generalized Staircase Polygons with Uniform Step Length"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09842","kind":"arxiv","version":2},"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:9efdd49a6ee631ca049f6ec272bfb37a31c4c539058b653a591faa8a4d843f14","target":"record","created_at":"2026-05-18T00:36:13Z","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":"6fcb5e75f3c56c20936a2ad02e30abdba79d9decc8b7ff330cff132f0e821306","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-31T17:47:05Z","title_canon_sha256":"ac2c2b62418a7b04f308a0da8052775d111a0447a968af774be5596cb59ad19d"},"schema_version":"1.0","source":{"id":"1708.09842","kind":"arxiv","version":2}},"canonical_sha256":"546814d943c6ed96ea4d659f3b910bd24a435b94b494e5d34ecf672a4b56aa6a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"546814d943c6ed96ea4d659f3b910bd24a435b94b494e5d34ecf672a4b56aa6a","first_computed_at":"2026-05-18T00:36:13.677475Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:13.677475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"quU0OWt/MB0sFJp0cX0UKm09psx8ITUPp1382YE3W4ifMxSwhpLlKclIhqSkMQVnCMEuFBShN5D75ptrM+6EAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:13.677953Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.09842","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9efdd49a6ee631ca049f6ec272bfb37a31c4c539058b653a591faa8a4d843f14","sha256:e1dfef3e16cb43e660fe12a7e719b56c584df8d54029c2ca012573afe3837f43"],"state_sha256":"077ba4700b77688499bcf93dfa72801e9fe57a7e763f8eb8ba6e7fa381724fb8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uZkcABgVQyKB4z/RGFJeaqAbsZMsr8DwlKyzw/W4Guf6KuSvjlaZa/Rmmptwh6a0kXfRYcYG2crQ5cuY9I1iBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:50:30.555311Z","bundle_sha256":"26d7e6740f001e6750c9684f4d596602a7201b275a8b5ee2805e99818ca70b3c"}}