{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OMF5PO7DLNMQMF6IQ44R6S4IC3","short_pith_number":"pith:OMF5PO7D","schema_version":"1.0","canonical_sha256":"730bd7bbe35b590617c887391f4b8816d45f7273cd4fcd95591d65f43a55eabb","source":{"kind":"arxiv","id":"1701.01419","version":1},"attestation_state":"computed","paper":{"title":"On Convex Programming Relaxations for the Permanent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"cs.DS","authors_text":"Damian Straszak, Nisheeth K. Vishnoi","submitted_at":"2017-01-05T18:43:17Z","abstract_excerpt":"In recent years, several convex programming relaxations have been proposed to estimate the permanent of a non-negative matrix, notably in the works of Gurvits and Samorodnitsky. However, the origins of these relaxations and their relationships to each other have remained somewhat mysterious. We present a conceptual framework, implicit in the belief propagation literature, to systematically arrive at these convex programming relaxations for estimating the permanent -- as approximations to an exponential-sized max-entropy convex program for computing the permanent. Further, using standard convex"},"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":"1701.01419","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-01-05T18:43:17Z","cross_cats_sorted":["cs.DM","math.OC"],"title_canon_sha256":"cdc3cf990c210c44dd2de61ed1954ad9c023b0dafda7545df0936bd38c2542ab","abstract_canon_sha256":"f0f827dfeff5aab7b5007b5730db1b1726718abb6aee410419ef467d713c06cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:19.717418Z","signature_b64":"2FtnxTVXBAoCOOKAJ7ihl5AFv6C8xP0V493vJFCP6fAp6UvdlDjD9jyAA59SwGtWtTSMCfDgvXReDTaYWwCoBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"730bd7bbe35b590617c887391f4b8816d45f7273cd4fcd95591d65f43a55eabb","last_reissued_at":"2026-05-18T00:53:19.716887Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:19.716887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Convex Programming Relaxations for the Permanent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"cs.DS","authors_text":"Damian Straszak, Nisheeth K. Vishnoi","submitted_at":"2017-01-05T18:43:17Z","abstract_excerpt":"In recent years, several convex programming relaxations have been proposed to estimate the permanent of a non-negative matrix, notably in the works of Gurvits and Samorodnitsky. However, the origins of these relaxations and their relationships to each other have remained somewhat mysterious. We present a conceptual framework, implicit in the belief propagation literature, to systematically arrive at these convex programming relaxations for estimating the permanent -- as approximations to an exponential-sized max-entropy convex program for computing the permanent. Further, using standard convex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01419","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":"1701.01419","created_at":"2026-05-18T00:53:19.716963+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.01419v1","created_at":"2026-05-18T00:53:19.716963+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01419","created_at":"2026-05-18T00:53:19.716963+00:00"},{"alias_kind":"pith_short_12","alias_value":"OMF5PO7DLNMQ","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OMF5PO7DLNMQMF6I","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OMF5PO7D","created_at":"2026-05-18T12:31:34.259226+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/OMF5PO7DLNMQMF6IQ44R6S4IC3","json":"https://pith.science/pith/OMF5PO7DLNMQMF6IQ44R6S4IC3.json","graph_json":"https://pith.science/api/pith-number/OMF5PO7DLNMQMF6IQ44R6S4IC3/graph.json","events_json":"https://pith.science/api/pith-number/OMF5PO7DLNMQMF6IQ44R6S4IC3/events.json","paper":"https://pith.science/paper/OMF5PO7D"},"agent_actions":{"view_html":"https://pith.science/pith/OMF5PO7DLNMQMF6IQ44R6S4IC3","download_json":"https://pith.science/pith/OMF5PO7DLNMQMF6IQ44R6S4IC3.json","view_paper":"https://pith.science/paper/OMF5PO7D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.01419&json=true","fetch_graph":"https://pith.science/api/pith-number/OMF5PO7DLNMQMF6IQ44R6S4IC3/graph.json","fetch_events":"https://pith.science/api/pith-number/OMF5PO7DLNMQMF6IQ44R6S4IC3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OMF5PO7DLNMQMF6IQ44R6S4IC3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OMF5PO7DLNMQMF6IQ44R6S4IC3/action/storage_attestation","attest_author":"https://pith.science/pith/OMF5PO7DLNMQMF6IQ44R6S4IC3/action/author_attestation","sign_citation":"https://pith.science/pith/OMF5PO7DLNMQMF6IQ44R6S4IC3/action/citation_signature","submit_replication":"https://pith.science/pith/OMF5PO7DLNMQMF6IQ44R6S4IC3/action/replication_record"}},"created_at":"2026-05-18T00:53:19.716963+00:00","updated_at":"2026-05-18T00:53:19.716963+00:00"}