{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:26LEFJJTWSZYF5RFIH6ZFSLLJV","short_pith_number":"pith:26LEFJJT","schema_version":"1.0","canonical_sha256":"d79642a533b4b382f62541fd92c96b4d589f96ba9570637a6fe89263fd7e476b","source":{"kind":"arxiv","id":"0804.4150","version":2},"attestation_state":"computed","paper":{"title":"On Computing the Shadows and Slices of Polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.CC","authors_text":"Hans Raj Tiwary","submitted_at":"2008-04-25T17:05:16Z","abstract_excerpt":"We study the complexity of computing the projection of an arbitrary $d$-polytope along $k$ orthogonal vectors for various input and output forms. We show that if $d$ and $k$ are part of the input (i.e. not a constant) and we are interested in output-sensitive algorithms, then in most forms the problem is equivalent to enumerating vertices of polytopes, except in two where it is NP-hard. In two other forms the problem is trivial. We also review the complexity of computing projections when the projection directions are in some sense non-degenerate. For full-dimensional polytopes containing origi"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"0804.4150","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2008-04-25T17:05:16Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"3661fe29c5c161b0f44c7e705c0248342c0010c0211317aa7c89a734c9febe93","abstract_canon_sha256":"41226cdc5218de22d62ef01a8dd8de5372db449acb952c4a0617b6cfdb87263e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:14.889872Z","signature_b64":"XuYwRGHb/xCgB+vVeSUrFFWfBLHt5/R25myIv8vVILq5ZX0j3wmWhNa7rH2exgMiV2V21JfH13hU6nvrjjWQAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d79642a533b4b382f62541fd92c96b4d589f96ba9570637a6fe89263fd7e476b","last_reissued_at":"2026-05-18T03:40:14.889293Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:14.889293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Computing the Shadows and Slices of Polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.CC","authors_text":"Hans Raj Tiwary","submitted_at":"2008-04-25T17:05:16Z","abstract_excerpt":"We study the complexity of computing the projection of an arbitrary $d$-polytope along $k$ orthogonal vectors for various input and output forms. We show that if $d$ and $k$ are part of the input (i.e. not a constant) and we are interested in output-sensitive algorithms, then in most forms the problem is equivalent to enumerating vertices of polytopes, except in two where it is NP-hard. In two other forms the problem is trivial. We also review the complexity of computing projections when the projection directions are in some sense non-degenerate. For full-dimensional polytopes containing origi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0804.4150","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0804.4150","created_at":"2026-05-18T03:40:14.889382+00:00"},{"alias_kind":"arxiv_version","alias_value":"0804.4150v2","created_at":"2026-05-18T03:40:14.889382+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0804.4150","created_at":"2026-05-18T03:40:14.889382+00:00"},{"alias_kind":"pith_short_12","alias_value":"26LEFJJTWSZY","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_16","alias_value":"26LEFJJTWSZYF5RF","created_at":"2026-05-18T12:25:56.245647+00:00"},{"alias_kind":"pith_short_8","alias_value":"26LEFJJT","created_at":"2026-05-18T12:25:56.245647+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/26LEFJJTWSZYF5RFIH6ZFSLLJV","json":"https://pith.science/pith/26LEFJJTWSZYF5RFIH6ZFSLLJV.json","graph_json":"https://pith.science/api/pith-number/26LEFJJTWSZYF5RFIH6ZFSLLJV/graph.json","events_json":"https://pith.science/api/pith-number/26LEFJJTWSZYF5RFIH6ZFSLLJV/events.json","paper":"https://pith.science/paper/26LEFJJT"},"agent_actions":{"view_html":"https://pith.science/pith/26LEFJJTWSZYF5RFIH6ZFSLLJV","download_json":"https://pith.science/pith/26LEFJJTWSZYF5RFIH6ZFSLLJV.json","view_paper":"https://pith.science/paper/26LEFJJT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0804.4150&json=true","fetch_graph":"https://pith.science/api/pith-number/26LEFJJTWSZYF5RFIH6ZFSLLJV/graph.json","fetch_events":"https://pith.science/api/pith-number/26LEFJJTWSZYF5RFIH6ZFSLLJV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/26LEFJJTWSZYF5RFIH6ZFSLLJV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/26LEFJJTWSZYF5RFIH6ZFSLLJV/action/storage_attestation","attest_author":"https://pith.science/pith/26LEFJJTWSZYF5RFIH6ZFSLLJV/action/author_attestation","sign_citation":"https://pith.science/pith/26LEFJJTWSZYF5RFIH6ZFSLLJV/action/citation_signature","submit_replication":"https://pith.science/pith/26LEFJJTWSZYF5RFIH6ZFSLLJV/action/replication_record"}},"created_at":"2026-05-18T03:40:14.889382+00:00","updated_at":"2026-05-18T03:40:14.889382+00:00"}