{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PM5EHCA7TBM267OD5UOBTZN735","short_pith_number":"pith:PM5EHCA7","schema_version":"1.0","canonical_sha256":"7b3a43881f9859af7dc3ed1c19e5bfdf4e27ead027817a6a046882ab85a04d48","source":{"kind":"arxiv","id":"1406.3512","version":1},"attestation_state":"computed","paper":{"title":"On largest volume simplices and sub-determinants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Carsten Moldenhauer, Friedrich Eisenbrand, Marco Di Summa, Yuri Faenza","submitted_at":"2014-06-13T11:48:09Z","abstract_excerpt":"We show that the problem of finding the simplex of largest volume in the convex hull of $n$ points in $\\mathbb{Q}^d$ can be approximated with a factor of $O(\\log d)^{d/2}$ in polynomial time. This improves upon the previously best known approximation guarantee of $d^{(d-1)/2}$ by Khachiyan. On the other hand, we show that there exists a constant $c>1$ such that this problem cannot be approximated with a factor of $c^d$, unless $P=NP$. % This improves over the $1.09$ inapproximability that was previously known. Our hardness result holds even if $n = O(d)$, in which case there exists a $\\bar c\\,"},"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":"1406.3512","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-06-13T11:48:09Z","cross_cats_sorted":[],"title_canon_sha256":"4f5fbcf0ec93e4fc42616c847c1d6089938334eadbb1560282adeea85ac094b1","abstract_canon_sha256":"9a2d489d6e4be0801aeefbb5d66763170ff7a4e3ecb65290e44df8f49a9f865c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:46.534414Z","signature_b64":"WcQjCmzCmGlvBCV+fHNnkO8tb1YJHtRgLdLHDgbkZcdreEXnmAmluuu07pM3+ZjVnYk8rcmOMo64RXCtrbT4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b3a43881f9859af7dc3ed1c19e5bfdf4e27ead027817a6a046882ab85a04d48","last_reissued_at":"2026-05-18T02:49:46.534072Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:46.534072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On largest volume simplices and sub-determinants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Carsten Moldenhauer, Friedrich Eisenbrand, Marco Di Summa, Yuri Faenza","submitted_at":"2014-06-13T11:48:09Z","abstract_excerpt":"We show that the problem of finding the simplex of largest volume in the convex hull of $n$ points in $\\mathbb{Q}^d$ can be approximated with a factor of $O(\\log d)^{d/2}$ in polynomial time. This improves upon the previously best known approximation guarantee of $d^{(d-1)/2}$ by Khachiyan. On the other hand, we show that there exists a constant $c>1$ such that this problem cannot be approximated with a factor of $c^d$, unless $P=NP$. % This improves over the $1.09$ inapproximability that was previously known. Our hardness result holds even if $n = O(d)$, in which case there exists a $\\bar c\\,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3512","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1406.3512","created_at":"2026-05-18T02:49:46.534125+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.3512v1","created_at":"2026-05-18T02:49:46.534125+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3512","created_at":"2026-05-18T02:49:46.534125+00:00"},{"alias_kind":"pith_short_12","alias_value":"PM5EHCA7TBM2","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PM5EHCA7TBM267OD","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PM5EHCA7","created_at":"2026-05-18T12:28:43.426989+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/PM5EHCA7TBM267OD5UOBTZN735","json":"https://pith.science/pith/PM5EHCA7TBM267OD5UOBTZN735.json","graph_json":"https://pith.science/api/pith-number/PM5EHCA7TBM267OD5UOBTZN735/graph.json","events_json":"https://pith.science/api/pith-number/PM5EHCA7TBM267OD5UOBTZN735/events.json","paper":"https://pith.science/paper/PM5EHCA7"},"agent_actions":{"view_html":"https://pith.science/pith/PM5EHCA7TBM267OD5UOBTZN735","download_json":"https://pith.science/pith/PM5EHCA7TBM267OD5UOBTZN735.json","view_paper":"https://pith.science/paper/PM5EHCA7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.3512&json=true","fetch_graph":"https://pith.science/api/pith-number/PM5EHCA7TBM267OD5UOBTZN735/graph.json","fetch_events":"https://pith.science/api/pith-number/PM5EHCA7TBM267OD5UOBTZN735/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PM5EHCA7TBM267OD5UOBTZN735/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PM5EHCA7TBM267OD5UOBTZN735/action/storage_attestation","attest_author":"https://pith.science/pith/PM5EHCA7TBM267OD5UOBTZN735/action/author_attestation","sign_citation":"https://pith.science/pith/PM5EHCA7TBM267OD5UOBTZN735/action/citation_signature","submit_replication":"https://pith.science/pith/PM5EHCA7TBM267OD5UOBTZN735/action/replication_record"}},"created_at":"2026-05-18T02:49:46.534125+00:00","updated_at":"2026-05-18T02:49:46.534125+00:00"}