{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:P75SB33GOPYEBTBWUUDO6L56UD","short_pith_number":"pith:P75SB33G","schema_version":"1.0","canonical_sha256":"7ffb20ef6673f040cc36a506ef2fbea0e503f52f72f55f3eb863dd986e10d2fd","source":{"kind":"arxiv","id":"1704.03486","version":1},"attestation_state":"computed","paper":{"title":"Simply Exponential Approximation of the Permanent of Positive Semidefinite Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.PR","quant-ph"],"primary_cat":"math.CO","authors_text":"Amin Saberi, Leonid Gurvits, Nima Anari, Shayan Oveis Gharan","submitted_at":"2017-04-11T18:28:13Z","abstract_excerpt":"We design a deterministic polynomial time $c^n$ approximation algorithm for the permanent of positive semidefinite matrices where $c=e^{\\gamma+1}\\simeq 4.84$. We write a natural convex relaxation and show that its optimum solution gives a $c^n$ approximation of the permanent. We further show that this factor is asymptotically tight by constructing a family of positive semidefinite matrices."},"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":"1704.03486","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-11T18:28:13Z","cross_cats_sorted":["cs.DS","math.PR","quant-ph"],"title_canon_sha256":"7569a1559557ece5f615c733e8c3972cade5c058f8e511d4f7b35f309f9650ad","abstract_canon_sha256":"304c0416722a5fe98f05b2b7781802bc7bd00b3f10b33f380c2b0c89454c5d16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:28.722070Z","signature_b64":"WmtWw8Ht6jLUIgk7KzHqjn0J9kDUmZV4DKKLFLJRt5pbHGgR7IbWBKerxC0EeqZp//lVb225q6pSwbWcPgnGCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ffb20ef6673f040cc36a506ef2fbea0e503f52f72f55f3eb863dd986e10d2fd","last_reissued_at":"2026-05-18T00:46:28.721343Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:28.721343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simply Exponential Approximation of the Permanent of Positive Semidefinite Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.PR","quant-ph"],"primary_cat":"math.CO","authors_text":"Amin Saberi, Leonid Gurvits, Nima Anari, Shayan Oveis Gharan","submitted_at":"2017-04-11T18:28:13Z","abstract_excerpt":"We design a deterministic polynomial time $c^n$ approximation algorithm for the permanent of positive semidefinite matrices where $c=e^{\\gamma+1}\\simeq 4.84$. We write a natural convex relaxation and show that its optimum solution gives a $c^n$ approximation of the permanent. We further show that this factor is asymptotically tight by constructing a family of positive semidefinite matrices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03486","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":"1704.03486","created_at":"2026-05-18T00:46:28.721462+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.03486v1","created_at":"2026-05-18T00:46:28.721462+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03486","created_at":"2026-05-18T00:46:28.721462+00:00"},{"alias_kind":"pith_short_12","alias_value":"P75SB33GOPYE","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"P75SB33GOPYEBTBW","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"P75SB33G","created_at":"2026-05-18T12:31:37.085036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.21946","citing_title":"Optimal $e^{(\\gamma+o(1))n}$-Approximation of the Permanent of Positive Semidefinite Matrices","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P75SB33GOPYEBTBWUUDO6L56UD","json":"https://pith.science/pith/P75SB33GOPYEBTBWUUDO6L56UD.json","graph_json":"https://pith.science/api/pith-number/P75SB33GOPYEBTBWUUDO6L56UD/graph.json","events_json":"https://pith.science/api/pith-number/P75SB33GOPYEBTBWUUDO6L56UD/events.json","paper":"https://pith.science/paper/P75SB33G"},"agent_actions":{"view_html":"https://pith.science/pith/P75SB33GOPYEBTBWUUDO6L56UD","download_json":"https://pith.science/pith/P75SB33GOPYEBTBWUUDO6L56UD.json","view_paper":"https://pith.science/paper/P75SB33G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.03486&json=true","fetch_graph":"https://pith.science/api/pith-number/P75SB33GOPYEBTBWUUDO6L56UD/graph.json","fetch_events":"https://pith.science/api/pith-number/P75SB33GOPYEBTBWUUDO6L56UD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P75SB33GOPYEBTBWUUDO6L56UD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P75SB33GOPYEBTBWUUDO6L56UD/action/storage_attestation","attest_author":"https://pith.science/pith/P75SB33GOPYEBTBWUUDO6L56UD/action/author_attestation","sign_citation":"https://pith.science/pith/P75SB33GOPYEBTBWUUDO6L56UD/action/citation_signature","submit_replication":"https://pith.science/pith/P75SB33GOPYEBTBWUUDO6L56UD/action/replication_record"}},"created_at":"2026-05-18T00:46:28.721462+00:00","updated_at":"2026-05-18T00:46:28.721462+00:00"}