{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GWA6JEIWINCIMYFLAJTSX7BLPG","short_pith_number":"pith:GWA6JEIW","schema_version":"1.0","canonical_sha256":"3581e4911643448660ab02672bfc2b79b9f3393e6daf05baefdab3e5706c45a2","source":{"kind":"arxiv","id":"1510.01891","version":1},"attestation_state":"computed","paper":{"title":"On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Adam Kurpisz, Monaldo Mastrolilli, Samuli Lepp\\\"anen","submitted_at":"2015-10-07T10:57:45Z","abstract_excerpt":"The Lasserre/Sum-of-Squares (SoS) hierarchy is a systematic procedure for constructing a sequence of increasingly tight semidefinite relaxations. It is known that the hierarchy converges to the 0/1 polytope in n levels and captures the convex relaxations used in the best available approximation algorithms for a wide variety of optimization problems.\n  In this paper we characterize the set of 0/1 integer linear problems and unconstrained 0/1 polynomial optimization problems that can still have an integrality gap at level n-1. These problems are the hardest for the Lasserre hierarchy in this sen"},"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":"1510.01891","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-10-07T10:57:45Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e9c9562999ee2c623deda507d3fe6750c1b598f92183f507ad5d31a37861e194","abstract_canon_sha256":"5a37086df0399136c2c34733a4ff79eec3b15aa0c8e616eaee38f7e340995906"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:50.110574Z","signature_b64":"ifTWOhkboCB5P9T4Jgji1/5tOIWAucKI1tnUyy8YWqgT22Xf/RObXsB20bOwq9eGS2Wx0DzeRzeU6US69wccDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3581e4911643448660ab02672bfc2b79b9f3393e6daf05baefdab3e5706c45a2","last_reissued_at":"2026-05-18T01:30:50.110069Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:50.110069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Adam Kurpisz, Monaldo Mastrolilli, Samuli Lepp\\\"anen","submitted_at":"2015-10-07T10:57:45Z","abstract_excerpt":"The Lasserre/Sum-of-Squares (SoS) hierarchy is a systematic procedure for constructing a sequence of increasingly tight semidefinite relaxations. It is known that the hierarchy converges to the 0/1 polytope in n levels and captures the convex relaxations used in the best available approximation algorithms for a wide variety of optimization problems.\n  In this paper we characterize the set of 0/1 integer linear problems and unconstrained 0/1 polynomial optimization problems that can still have an integrality gap at level n-1. These problems are the hardest for the Lasserre hierarchy in this sen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.01891","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":"1510.01891","created_at":"2026-05-18T01:30:50.110152+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.01891v1","created_at":"2026-05-18T01:30:50.110152+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.01891","created_at":"2026-05-18T01:30:50.110152+00:00"},{"alias_kind":"pith_short_12","alias_value":"GWA6JEIWINCI","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GWA6JEIWINCIMYFL","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GWA6JEIW","created_at":"2026-05-18T12:29:22.688609+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/GWA6JEIWINCIMYFLAJTSX7BLPG","json":"https://pith.science/pith/GWA6JEIWINCIMYFLAJTSX7BLPG.json","graph_json":"https://pith.science/api/pith-number/GWA6JEIWINCIMYFLAJTSX7BLPG/graph.json","events_json":"https://pith.science/api/pith-number/GWA6JEIWINCIMYFLAJTSX7BLPG/events.json","paper":"https://pith.science/paper/GWA6JEIW"},"agent_actions":{"view_html":"https://pith.science/pith/GWA6JEIWINCIMYFLAJTSX7BLPG","download_json":"https://pith.science/pith/GWA6JEIWINCIMYFLAJTSX7BLPG.json","view_paper":"https://pith.science/paper/GWA6JEIW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.01891&json=true","fetch_graph":"https://pith.science/api/pith-number/GWA6JEIWINCIMYFLAJTSX7BLPG/graph.json","fetch_events":"https://pith.science/api/pith-number/GWA6JEIWINCIMYFLAJTSX7BLPG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GWA6JEIWINCIMYFLAJTSX7BLPG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GWA6JEIWINCIMYFLAJTSX7BLPG/action/storage_attestation","attest_author":"https://pith.science/pith/GWA6JEIWINCIMYFLAJTSX7BLPG/action/author_attestation","sign_citation":"https://pith.science/pith/GWA6JEIWINCIMYFLAJTSX7BLPG/action/citation_signature","submit_replication":"https://pith.science/pith/GWA6JEIWINCIMYFLAJTSX7BLPG/action/replication_record"}},"created_at":"2026-05-18T01:30:50.110152+00:00","updated_at":"2026-05-18T01:30:50.110152+00:00"}