{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:KEWWCK7YEAIRU5QMSLHCDXB5SO","short_pith_number":"pith:KEWWCK7Y","canonical_record":{"source":{"id":"2502.01878","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-02-03T23:10:10Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"726dba2f3ba4347ac21ab44c95d359629e868e7fbd4cddd5aa655110f6b712bc","abstract_canon_sha256":"54553970554516618f33222d93ec5b80d3caa6e88a46a97f83e47ce3c067e803"},"schema_version":"1.0"},"canonical_sha256":"512d612bf820111a760c92ce21dc3d939f3f8543aab94b64736098c9613402a4","source":{"kind":"arxiv","id":"2502.01878","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.01878","created_at":"2026-05-18T03:09:46Z"},{"alias_kind":"arxiv_version","alias_value":"2502.01878v1","created_at":"2026-05-18T03:09:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.01878","created_at":"2026-05-18T03:09:46Z"},{"alias_kind":"pith_short_12","alias_value":"KEWWCK7YEAIR","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"KEWWCK7YEAIRU5QM","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"KEWWCK7Y","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:KEWWCK7YEAIRU5QMSLHCDXB5SO","target":"record","payload":{"canonical_record":{"source":{"id":"2502.01878","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-02-03T23:10:10Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"726dba2f3ba4347ac21ab44c95d359629e868e7fbd4cddd5aa655110f6b712bc","abstract_canon_sha256":"54553970554516618f33222d93ec5b80d3caa6e88a46a97f83e47ce3c067e803"},"schema_version":"1.0"},"canonical_sha256":"512d612bf820111a760c92ce21dc3d939f3f8543aab94b64736098c9613402a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:46.155346Z","signature_b64":"/8pkrq8L+58/J5w5vYjCrAGAR0sp1reLx1ycK8/WxxWt0o33NTHeyOCABYHzINqKLKHNMnujVHces6OI+8LnBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"512d612bf820111a760c92ce21dc3d939f3f8543aab94b64736098c9613402a4","last_reissued_at":"2026-05-18T03:09:46.154446Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:46.154446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.01878","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-18T03:09:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IsiUu3E5vizq0F9ZNIBXTVyR8x2C4ootzmDKZJZMElnirCYrMC2p9D0i0meFY4SFnJdxrhHLy8ooLJn4AngaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T15:10:13.357703Z"},"content_sha256":"a17ebc4285f3f3b8610665212802dd99d939f34cb75a8556824364fd4e6535b1","schema_version":"1.0","event_id":"sha256:a17ebc4285f3f3b8610665212802dd99d939f34cb75a8556824364fd4e6535b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:KEWWCK7YEAIRU5QMSLHCDXB5SO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Determining inscribability of polytopes via rank minimization based on slack matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Amy Wiebe, Jo\\~ao Gouveia, Warren Hare, Yiwen Chen","submitted_at":"2025-02-03T23:10:10Z","abstract_excerpt":"A polytope is inscribable if there is a realization where all vertices lie on the sphere. In this paper, we provide a necessary and sufficient condition for a polytope to be inscribable. Based on this condition, we characterize the problem of determining inscribability as a minimum rank optimization problem using slack matrices. We propose an SDP approximation for the minimum rank optimization problem and prove that it is tight for certain classes of polytopes. Given a polytope, we provide three algorithms to determine its inscribability. All the optimization problems and algorithms we propose"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.01878","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-18T03:09:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"63UcAAwP7oBrwP1SighBD1Ax3e0iG0yTbgVosv78vkiPVomc6TLGI12HScPkrRBMSLpXWRsgR24a9ijSX93yCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T15:10:13.358255Z"},"content_sha256":"135c32e114ec1763f2bf305d0c563f28bace206e3ca003fe79bcd2bb813f76f2","schema_version":"1.0","event_id":"sha256:135c32e114ec1763f2bf305d0c563f28bace206e3ca003fe79bcd2bb813f76f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KEWWCK7YEAIRU5QMSLHCDXB5SO/bundle.json","state_url":"https://pith.science/pith/KEWWCK7YEAIRU5QMSLHCDXB5SO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KEWWCK7YEAIRU5QMSLHCDXB5SO/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-22T15:10:13Z","links":{"resolver":"https://pith.science/pith/KEWWCK7YEAIRU5QMSLHCDXB5SO","bundle":"https://pith.science/pith/KEWWCK7YEAIRU5QMSLHCDXB5SO/bundle.json","state":"https://pith.science/pith/KEWWCK7YEAIRU5QMSLHCDXB5SO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KEWWCK7YEAIRU5QMSLHCDXB5SO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:KEWWCK7YEAIRU5QMSLHCDXB5SO","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":"54553970554516618f33222d93ec5b80d3caa6e88a46a97f83e47ce3c067e803","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-02-03T23:10:10Z","title_canon_sha256":"726dba2f3ba4347ac21ab44c95d359629e868e7fbd4cddd5aa655110f6b712bc"},"schema_version":"1.0","source":{"id":"2502.01878","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.01878","created_at":"2026-05-18T03:09:46Z"},{"alias_kind":"arxiv_version","alias_value":"2502.01878v1","created_at":"2026-05-18T03:09:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.01878","created_at":"2026-05-18T03:09:46Z"},{"alias_kind":"pith_short_12","alias_value":"KEWWCK7YEAIR","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"KEWWCK7YEAIRU5QM","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"KEWWCK7Y","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:135c32e114ec1763f2bf305d0c563f28bace206e3ca003fe79bcd2bb813f76f2","target":"graph","created_at":"2026-05-18T03:09:46Z","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":"A polytope is inscribable if there is a realization where all vertices lie on the sphere. In this paper, we provide a necessary and sufficient condition for a polytope to be inscribable. Based on this condition, we characterize the problem of determining inscribability as a minimum rank optimization problem using slack matrices. We propose an SDP approximation for the minimum rank optimization problem and prove that it is tight for certain classes of polytopes. Given a polytope, we provide three algorithms to determine its inscribability. All the optimization problems and algorithms we propose","authors_text":"Amy Wiebe, Jo\\~ao Gouveia, Warren Hare, Yiwen Chen","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-02-03T23:10:10Z","title":"Determining inscribability of polytopes via rank minimization based on slack matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.01878","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:a17ebc4285f3f3b8610665212802dd99d939f34cb75a8556824364fd4e6535b1","target":"record","created_at":"2026-05-18T03:09:46Z","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":"54553970554516618f33222d93ec5b80d3caa6e88a46a97f83e47ce3c067e803","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-02-03T23:10:10Z","title_canon_sha256":"726dba2f3ba4347ac21ab44c95d359629e868e7fbd4cddd5aa655110f6b712bc"},"schema_version":"1.0","source":{"id":"2502.01878","kind":"arxiv","version":1}},"canonical_sha256":"512d612bf820111a760c92ce21dc3d939f3f8543aab94b64736098c9613402a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"512d612bf820111a760c92ce21dc3d939f3f8543aab94b64736098c9613402a4","first_computed_at":"2026-05-18T03:09:46.154446Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:46.154446Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/8pkrq8L+58/J5w5vYjCrAGAR0sp1reLx1ycK8/WxxWt0o33NTHeyOCABYHzINqKLKHNMnujVHces6OI+8LnBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:46.155346Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.01878","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a17ebc4285f3f3b8610665212802dd99d939f34cb75a8556824364fd4e6535b1","sha256:135c32e114ec1763f2bf305d0c563f28bace206e3ca003fe79bcd2bb813f76f2"],"state_sha256":"3a319990114ad953183158116749d5914036b4045fd690ae3666dfe732685c0f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aXDFQAKRAxz3F1HnGzZpN+eINgA/NDzZaw1pmEm17OCKB84udHW/nZDj2WQpU7Wrm0wCQAlEJEMYIuC8tAF3Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T15:10:13.361569Z","bundle_sha256":"04425a9df16e67eb4e03175962ac34b97cd06223604eb575f9b8b414438f12fd"}}