{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FOHORYHXYDZRLHVLZDVCXE7RIO","short_pith_number":"pith:FOHORYHX","canonical_record":{"source":{"id":"1611.10059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-11-30T09:30:41Z","cross_cats_sorted":[],"title_canon_sha256":"f78c895f6dc344bae1c9da597c2de14c8b4840d6c995be86a5fb1de0cc6be4d3","abstract_canon_sha256":"200978c0969fb24f983e9b05db570eaea8523ca38398a5465bc9745d90c156af"},"schema_version":"1.0"},"canonical_sha256":"2b8ee8e0f7c0f3159eabc8ea2b93f1439e6ee211adaf19f7a5a4a4be6edfcaa1","source":{"kind":"arxiv","id":"1611.10059","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.10059","created_at":"2026-05-18T00:56:11Z"},{"alias_kind":"arxiv_version","alias_value":"1611.10059v1","created_at":"2026-05-18T00:56:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.10059","created_at":"2026-05-18T00:56:11Z"},{"alias_kind":"pith_short_12","alias_value":"FOHORYHXYDZR","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FOHORYHXYDZRLHVL","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FOHORYHX","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FOHORYHXYDZRLHVLZDVCXE7RIO","target":"record","payload":{"canonical_record":{"source":{"id":"1611.10059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-11-30T09:30:41Z","cross_cats_sorted":[],"title_canon_sha256":"f78c895f6dc344bae1c9da597c2de14c8b4840d6c995be86a5fb1de0cc6be4d3","abstract_canon_sha256":"200978c0969fb24f983e9b05db570eaea8523ca38398a5465bc9745d90c156af"},"schema_version":"1.0"},"canonical_sha256":"2b8ee8e0f7c0f3159eabc8ea2b93f1439e6ee211adaf19f7a5a4a4be6edfcaa1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:11.288184Z","signature_b64":"a6JRK9B9JKPAaRr1cCwILjVXURKpiU0/cUROjUj48P13VwqAAmIaRKFDduF4ia0ghvpOoEhefmWRzmeUAh8QCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b8ee8e0f7c0f3159eabc8ea2b93f1439e6ee211adaf19f7a5a4a4be6edfcaa1","last_reissued_at":"2026-05-18T00:56:11.287818Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:11.287818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.10059","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-05-18T00:56:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OIBpYf0RU7j6nbqMbkIU0hqKiwL+Z9+THgMD3rPynkF8Y9TxQ+ASb8UqXCorBe5ESFvR1puNNY918ru+duReAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:50:18.772934Z"},"content_sha256":"9402875e9cfd2cb86e30f13870418a18a4608149da17005ea5e563e2ee07a5f5","schema_version":"1.0","event_id":"sha256:9402875e9cfd2cb86e30f13870418a18a4608149da17005ea5e563e2ee07a5f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FOHORYHXYDZRLHVLZDVCXE7RIO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Algorithm for Vertex Enumeration of Two-Dimensional Projection of Polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Amit Gurung, Rajarshi Ray","submitted_at":"2016-11-30T09:30:41Z","abstract_excerpt":"An efficient algorithm to enumerate the vertices of a two-dimensional (2D) projection of a polytope, is presented in this paper. The proposed algorithm uses the support function of the polytope to be projected and enumerated for vertices. The complexity of our algorithm is linear in the number of vertices of the projected polytope and we show empirically that the performance is significantly better in comparison to some known efficient algorithms of projection and enumeration."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.10059","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":""},"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:56:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hkoD7ClnXC3ugMRqglkXrb+J7i+4NM9GcggknI67Osvphbqc+ypaVIMX++zV6ux2tnujytiGdEQBRA7yl+QJCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:50:18.773639Z"},"content_sha256":"98db4455737c34d8c1e73f5ad256d01e222142945c837afc0c47c0d84ab56402","schema_version":"1.0","event_id":"sha256:98db4455737c34d8c1e73f5ad256d01e222142945c837afc0c47c0d84ab56402"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FOHORYHXYDZRLHVLZDVCXE7RIO/bundle.json","state_url":"https://pith.science/pith/FOHORYHXYDZRLHVLZDVCXE7RIO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FOHORYHXYDZRLHVLZDVCXE7RIO/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-27T11:50:18Z","links":{"resolver":"https://pith.science/pith/FOHORYHXYDZRLHVLZDVCXE7RIO","bundle":"https://pith.science/pith/FOHORYHXYDZRLHVLZDVCXE7RIO/bundle.json","state":"https://pith.science/pith/FOHORYHXYDZRLHVLZDVCXE7RIO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FOHORYHXYDZRLHVLZDVCXE7RIO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FOHORYHXYDZRLHVLZDVCXE7RIO","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":"200978c0969fb24f983e9b05db570eaea8523ca38398a5465bc9745d90c156af","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-11-30T09:30:41Z","title_canon_sha256":"f78c895f6dc344bae1c9da597c2de14c8b4840d6c995be86a5fb1de0cc6be4d3"},"schema_version":"1.0","source":{"id":"1611.10059","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.10059","created_at":"2026-05-18T00:56:11Z"},{"alias_kind":"arxiv_version","alias_value":"1611.10059v1","created_at":"2026-05-18T00:56:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.10059","created_at":"2026-05-18T00:56:11Z"},{"alias_kind":"pith_short_12","alias_value":"FOHORYHXYDZR","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FOHORYHXYDZRLHVL","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FOHORYHX","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:98db4455737c34d8c1e73f5ad256d01e222142945c837afc0c47c0d84ab56402","target":"graph","created_at":"2026-05-18T00:56:11Z","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":"An efficient algorithm to enumerate the vertices of a two-dimensional (2D) projection of a polytope, is presented in this paper. The proposed algorithm uses the support function of the polytope to be projected and enumerated for vertices. The complexity of our algorithm is linear in the number of vertices of the projected polytope and we show empirically that the performance is significantly better in comparison to some known efficient algorithms of projection and enumeration.","authors_text":"Amit Gurung, Rajarshi Ray","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-11-30T09:30:41Z","title":"An Efficient Algorithm for Vertex Enumeration of Two-Dimensional Projection of Polytopes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.10059","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:9402875e9cfd2cb86e30f13870418a18a4608149da17005ea5e563e2ee07a5f5","target":"record","created_at":"2026-05-18T00:56:11Z","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":"200978c0969fb24f983e9b05db570eaea8523ca38398a5465bc9745d90c156af","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-11-30T09:30:41Z","title_canon_sha256":"f78c895f6dc344bae1c9da597c2de14c8b4840d6c995be86a5fb1de0cc6be4d3"},"schema_version":"1.0","source":{"id":"1611.10059","kind":"arxiv","version":1}},"canonical_sha256":"2b8ee8e0f7c0f3159eabc8ea2b93f1439e6ee211adaf19f7a5a4a4be6edfcaa1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b8ee8e0f7c0f3159eabc8ea2b93f1439e6ee211adaf19f7a5a4a4be6edfcaa1","first_computed_at":"2026-05-18T00:56:11.287818Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:11.287818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a6JRK9B9JKPAaRr1cCwILjVXURKpiU0/cUROjUj48P13VwqAAmIaRKFDduF4ia0ghvpOoEhefmWRzmeUAh8QCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:11.288184Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.10059","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9402875e9cfd2cb86e30f13870418a18a4608149da17005ea5e563e2ee07a5f5","sha256:98db4455737c34d8c1e73f5ad256d01e222142945c837afc0c47c0d84ab56402"],"state_sha256":"e7e0315de002229092d50a69572b9a469d347830c82b891f822ec875d04f29ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jm8GcZfHeq1xTAJbpCnpgyIsTg7MAzI4jqM/H643FWnalE/jtlSh+gzegwYOLq05ujlFrkw7zHS65ZjR2lUNDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:50:18.777424Z","bundle_sha256":"83b00e20c625ed08b72c0eb84becc5446cc450cc0287a14b21a74d85ebabaec1"}}