{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2004:K36TPUWMJVNEEJJ4YO7OTWGY6N","short_pith_number":"pith:K36TPUWM","canonical_record":{"source":{"id":"cs/0407020","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CG","submitted_at":"2004-07-08T19:03:32Z","cross_cats_sorted":[],"title_canon_sha256":"f8410834028db547f85a301036cf0e280795622df4fe683cc2ede087e96e628b","abstract_canon_sha256":"7ffe431db48ae2322237ec3af53b09529674a9115bfc2f735fd50bfae2620828"},"schema_version":"1.0"},"canonical_sha256":"56fd37d2cc4d5a42253cc3bee9d8d8f34aa4876a58bebce20742e42e62d235cd","source":{"kind":"arxiv","id":"cs/0407020","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0407020","created_at":"2026-07-04T14:24:44Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0407020v1","created_at":"2026-07-04T14:24:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0407020","created_at":"2026-07-04T14:24:44Z"},{"alias_kind":"pith_short_12","alias_value":"K36TPUWMJVNE","created_at":"2026-07-04T14:24:44Z"},{"alias_kind":"pith_short_16","alias_value":"K36TPUWMJVNEEJJ4","created_at":"2026-07-04T14:24:44Z"},{"alias_kind":"pith_short_8","alias_value":"K36TPUWM","created_at":"2026-07-04T14:24:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2004:K36TPUWMJVNEEJJ4YO7OTWGY6N","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0407020","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CG","submitted_at":"2004-07-08T19:03:32Z","cross_cats_sorted":[],"title_canon_sha256":"f8410834028db547f85a301036cf0e280795622df4fe683cc2ede087e96e628b","abstract_canon_sha256":"7ffe431db48ae2322237ec3af53b09529674a9115bfc2f735fd50bfae2620828"},"schema_version":"1.0"},"canonical_sha256":"56fd37d2cc4d5a42253cc3bee9d8d8f34aa4876a58bebce20742e42e62d235cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:24:44.992050Z","signature_b64":"ftlmcFobBc2SI5hkR4HnbLSVB5jxRFmdcqopwrWdnqKsf0SkdbqE1b0Mz8X6nu7ipliH/VaUKwx8h5La/LK/Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56fd37d2cc4d5a42253cc3bee9d8d8f34aa4876a58bebce20742e42e62d235cd","last_reissued_at":"2026-07-04T14:24:44.991694Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:24:44.991694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0407020","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-04T14:24:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dcJA/DTz3FZQ2EkjgpfbecGSnKi9hbgV1azwDJs4EBZo23zeMMR8R2c4vm3CUvfUZFkrlKXQJqmjy8aV7tQpAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T20:16:20.530861Z"},"content_sha256":"6e32569a298c3f26f129e4f8003701d3ece0da249b2d0c27683f8cfcd43d768a","schema_version":"1.0","event_id":"sha256:6e32569a298c3f26f129e4f8003701d3ece0da249b2d0c27683f8cfcd43d768a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2004:K36TPUWMJVNEEJJ4YO7OTWGY6N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum Enclosing Polytope in High Dimensions","license":"","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Rina Panigrahy","submitted_at":"2004-07-08T19:03:32Z","abstract_excerpt":"We study the problem of covering a given set of $n$ points in a high, $d$-dimensional space by the minimum enclosing polytope of a given arbitrary shape. We present algorithms that work for a large family of shapes, provided either only translations and no rotations are allowed, or only rotation about a fixed point is allowed; that is, one is allowed to only scale and translate a given shape, or scale and rotate the shape around a fixed point. Our algorithms start with a polytope guessed to be of optimal size and iteratively moves it based on a greedy principle: simply move the current polytop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0407020","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/cs/0407020/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-04T14:24:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mhv6xFvpLyo/tJ8LOMeEOvFqGvLXBRqeW2lIir0vNogwyShbqg1qGmkwZQqIctEL17Vbqtb+ohGvYutKAP27Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T20:16:20.531343Z"},"content_sha256":"d0719c0280656db1c4ceea9905c4957639de0a4c865e2bac98c631b18170f536","schema_version":"1.0","event_id":"sha256:d0719c0280656db1c4ceea9905c4957639de0a4c865e2bac98c631b18170f536"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K36TPUWMJVNEEJJ4YO7OTWGY6N/bundle.json","state_url":"https://pith.science/pith/K36TPUWMJVNEEJJ4YO7OTWGY6N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K36TPUWMJVNEEJJ4YO7OTWGY6N/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-10T20:16:20Z","links":{"resolver":"https://pith.science/pith/K36TPUWMJVNEEJJ4YO7OTWGY6N","bundle":"https://pith.science/pith/K36TPUWMJVNEEJJ4YO7OTWGY6N/bundle.json","state":"https://pith.science/pith/K36TPUWMJVNEEJJ4YO7OTWGY6N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K36TPUWMJVNEEJJ4YO7OTWGY6N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2004:K36TPUWMJVNEEJJ4YO7OTWGY6N","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":"7ffe431db48ae2322237ec3af53b09529674a9115bfc2f735fd50bfae2620828","cross_cats_sorted":[],"license":"","primary_cat":"cs.CG","submitted_at":"2004-07-08T19:03:32Z","title_canon_sha256":"f8410834028db547f85a301036cf0e280795622df4fe683cc2ede087e96e628b"},"schema_version":"1.0","source":{"id":"cs/0407020","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0407020","created_at":"2026-07-04T14:24:44Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0407020v1","created_at":"2026-07-04T14:24:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0407020","created_at":"2026-07-04T14:24:44Z"},{"alias_kind":"pith_short_12","alias_value":"K36TPUWMJVNE","created_at":"2026-07-04T14:24:44Z"},{"alias_kind":"pith_short_16","alias_value":"K36TPUWMJVNEEJJ4","created_at":"2026-07-04T14:24:44Z"},{"alias_kind":"pith_short_8","alias_value":"K36TPUWM","created_at":"2026-07-04T14:24:44Z"}],"graph_snapshots":[{"event_id":"sha256:d0719c0280656db1c4ceea9905c4957639de0a4c865e2bac98c631b18170f536","target":"graph","created_at":"2026-07-04T14:24:44Z","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/cs/0407020/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of covering a given set of $n$ points in a high, $d$-dimensional space by the minimum enclosing polytope of a given arbitrary shape. We present algorithms that work for a large family of shapes, provided either only translations and no rotations are allowed, or only rotation about a fixed point is allowed; that is, one is allowed to only scale and translate a given shape, or scale and rotate the shape around a fixed point. Our algorithms start with a polytope guessed to be of optimal size and iteratively moves it based on a greedy principle: simply move the current polytop","authors_text":"Rina Panigrahy","cross_cats":[],"headline":"","license":"","primary_cat":"cs.CG","submitted_at":"2004-07-08T19:03:32Z","title":"Minimum Enclosing Polytope in High Dimensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0407020","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:6e32569a298c3f26f129e4f8003701d3ece0da249b2d0c27683f8cfcd43d768a","target":"record","created_at":"2026-07-04T14:24:44Z","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":"7ffe431db48ae2322237ec3af53b09529674a9115bfc2f735fd50bfae2620828","cross_cats_sorted":[],"license":"","primary_cat":"cs.CG","submitted_at":"2004-07-08T19:03:32Z","title_canon_sha256":"f8410834028db547f85a301036cf0e280795622df4fe683cc2ede087e96e628b"},"schema_version":"1.0","source":{"id":"cs/0407020","kind":"arxiv","version":1}},"canonical_sha256":"56fd37d2cc4d5a42253cc3bee9d8d8f34aa4876a58bebce20742e42e62d235cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56fd37d2cc4d5a42253cc3bee9d8d8f34aa4876a58bebce20742e42e62d235cd","first_computed_at":"2026-07-04T14:24:44.991694Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:24:44.991694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ftlmcFobBc2SI5hkR4HnbLSVB5jxRFmdcqopwrWdnqKsf0SkdbqE1b0Mz8X6nu7ipliH/VaUKwx8h5La/LK/Bw==","signature_status":"signed_v1","signed_at":"2026-07-04T14:24:44.992050Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0407020","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e32569a298c3f26f129e4f8003701d3ece0da249b2d0c27683f8cfcd43d768a","sha256:d0719c0280656db1c4ceea9905c4957639de0a4c865e2bac98c631b18170f536"],"state_sha256":"ec01964b759644c48bee34e08436865fba7bcd00d169406f9eb7837558ebcffe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rUVChGLinjt/aQwwWTZCvuGy3OoPibDGYRt4WioNBlHf5mzm5c7qj/r7hiAspsWji50BweCQnxJVikclalpKCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T20:16:20.534978Z","bundle_sha256":"2d94ad9772a5b1335da5cae5355c785eafa3f5867aed7ad4eb502bbaf9ac588c"}}