{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5MVS746R7CCZEY6UP5REOJVN3R","short_pith_number":"pith:5MVS746R","schema_version":"1.0","canonical_sha256":"eb2b2ff3d1f8859263d47f624726addc6fd4bf360981003f46314c80b9b8fb5c","source":{"kind":"arxiv","id":"1412.0036","version":2},"attestation_state":"computed","paper":{"title":"Randomized Rounding for the Largest Simplex Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.FA"],"primary_cat":"cs.CG","authors_text":"Aleksandar Nikolov","submitted_at":"2014-11-28T21:51:40Z","abstract_excerpt":"The maximum volume $j$-simplex problem asks to compute the $j$-dimensional simplex of maximum volume inside the convex hull of a given set of $n$ points in $\\mathbb{Q}^d$. We give a deterministic approximation algorithm for this problem which achieves an approximation ratio of $e^{j/2 + o(j)}$. The problem is known to be $\\mathrm{NP}$-hard to approximate within a factor of $c^{j}$ for some constant $c > 1$. Our algorithm also gives a factor $e^{j + o(j)}$ approximation for the problem of finding the principal $j\\times j$ submatrix of a rank $d$ positive semidefinite matrix with the largest det"},"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":"1412.0036","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-11-28T21:51:40Z","cross_cats_sorted":["cs.DS","math.FA"],"title_canon_sha256":"c110949dc9b92850ee5392fa294f002180620c6261a96980875cf2096ada1eb3","abstract_canon_sha256":"d03620da4e39b2fb7e3f9c9ac79a4cdcd38d44aa59db2a70bf6917be73ecb30d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:58.297157Z","signature_b64":"bbKI4anSBAlVSM4hZ1kkrhY81b/CM36QjW/pzOyI97DItqBFGSGoCQiDMI7GOQozmtJcbvc1afW6sDR8mObwCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb2b2ff3d1f8859263d47f624726addc6fd4bf360981003f46314c80b9b8fb5c","last_reissued_at":"2026-05-18T02:18:58.296421Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:58.296421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized Rounding for the Largest Simplex Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.FA"],"primary_cat":"cs.CG","authors_text":"Aleksandar Nikolov","submitted_at":"2014-11-28T21:51:40Z","abstract_excerpt":"The maximum volume $j$-simplex problem asks to compute the $j$-dimensional simplex of maximum volume inside the convex hull of a given set of $n$ points in $\\mathbb{Q}^d$. We give a deterministic approximation algorithm for this problem which achieves an approximation ratio of $e^{j/2 + o(j)}$. The problem is known to be $\\mathrm{NP}$-hard to approximate within a factor of $c^{j}$ for some constant $c > 1$. Our algorithm also gives a factor $e^{j + o(j)}$ approximation for the problem of finding the principal $j\\times j$ submatrix of a rank $d$ positive semidefinite matrix with the largest det"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0036","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":"1412.0036","created_at":"2026-05-18T02:18:58.296539+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.0036v2","created_at":"2026-05-18T02:18:58.296539+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0036","created_at":"2026-05-18T02:18:58.296539+00:00"},{"alias_kind":"pith_short_12","alias_value":"5MVS746R7CCZ","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"5MVS746R7CCZEY6U","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"5MVS746R","created_at":"2026-05-18T12:28:14.216126+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/5MVS746R7CCZEY6UP5REOJVN3R","json":"https://pith.science/pith/5MVS746R7CCZEY6UP5REOJVN3R.json","graph_json":"https://pith.science/api/pith-number/5MVS746R7CCZEY6UP5REOJVN3R/graph.json","events_json":"https://pith.science/api/pith-number/5MVS746R7CCZEY6UP5REOJVN3R/events.json","paper":"https://pith.science/paper/5MVS746R"},"agent_actions":{"view_html":"https://pith.science/pith/5MVS746R7CCZEY6UP5REOJVN3R","download_json":"https://pith.science/pith/5MVS746R7CCZEY6UP5REOJVN3R.json","view_paper":"https://pith.science/paper/5MVS746R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.0036&json=true","fetch_graph":"https://pith.science/api/pith-number/5MVS746R7CCZEY6UP5REOJVN3R/graph.json","fetch_events":"https://pith.science/api/pith-number/5MVS746R7CCZEY6UP5REOJVN3R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5MVS746R7CCZEY6UP5REOJVN3R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5MVS746R7CCZEY6UP5REOJVN3R/action/storage_attestation","attest_author":"https://pith.science/pith/5MVS746R7CCZEY6UP5REOJVN3R/action/author_attestation","sign_citation":"https://pith.science/pith/5MVS746R7CCZEY6UP5REOJVN3R/action/citation_signature","submit_replication":"https://pith.science/pith/5MVS746R7CCZEY6UP5REOJVN3R/action/replication_record"}},"created_at":"2026-05-18T02:18:58.296539+00:00","updated_at":"2026-05-18T02:18:58.296539+00:00"}