{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:N3WAPVN57UFDKZ4YN424OFEL5M","short_pith_number":"pith:N3WAPVN5","schema_version":"1.0","canonical_sha256":"6eec07d5bdfd0a3567986f35c7148beb0e9dcff3197ffab69f57da677b2f5bd9","source":{"kind":"arxiv","id":"1711.01358","version":3},"attestation_state":"computed","paper":{"title":"Strengthening Convex Relaxations of 0/1-Sets Using Boolean Formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"math.CO","authors_text":"Samuel Fiorini, Stefan Weltge, Tony Huynh","submitted_at":"2017-11-03T23:15:41Z","abstract_excerpt":"In convex integer programming, various procedures have been developed to strengthen convex relaxations of sets of integer points. On the one hand, there exist several general-purpose methods that strengthen relaxations without specific knowledge of the set $ S $, such as popular linear programming or semi-definite programming hierarchies. On the other hand, various methods have been designed for obtaining strengthened relaxations for very specific sets that arise in combinatorial optimization. We propose a new efficient method that interpolates between these two approaches.\n  Our procedure str"},"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":"1711.01358","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-03T23:15:41Z","cross_cats_sorted":["cs.DM","math.OC"],"title_canon_sha256":"5f800d1e1870911b06062c6a9ac76c15ac3a04bfba9d315a078c1b6c2c11d7f2","abstract_canon_sha256":"5608d1fadf0dde742da6ca9b35d9390d9b3508119f98c3e5adc203bdc37128c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:32.761488Z","signature_b64":"LbuR4HKOG7Ame2oAwTpo+uQIcu5SoKlx76ormy5WG9D2Pcu2bTlGoJAhOh/+OPznA8FR5DatYjUSRMLrSoaOCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6eec07d5bdfd0a3567986f35c7148beb0e9dcff3197ffab69f57da677b2f5bd9","last_reissued_at":"2026-05-18T00:12:32.760710Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:32.760710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strengthening Convex Relaxations of 0/1-Sets Using Boolean Formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"math.CO","authors_text":"Samuel Fiorini, Stefan Weltge, Tony Huynh","submitted_at":"2017-11-03T23:15:41Z","abstract_excerpt":"In convex integer programming, various procedures have been developed to strengthen convex relaxations of sets of integer points. On the one hand, there exist several general-purpose methods that strengthen relaxations without specific knowledge of the set $ S $, such as popular linear programming or semi-definite programming hierarchies. On the other hand, various methods have been designed for obtaining strengthened relaxations for very specific sets that arise in combinatorial optimization. We propose a new efficient method that interpolates between these two approaches.\n  Our procedure str"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01358","kind":"arxiv","version":3},"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":"1711.01358","created_at":"2026-05-18T00:12:32.760835+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.01358v3","created_at":"2026-05-18T00:12:32.760835+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01358","created_at":"2026-05-18T00:12:32.760835+00:00"},{"alias_kind":"pith_short_12","alias_value":"N3WAPVN57UFD","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"N3WAPVN57UFDKZ4Y","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"N3WAPVN5","created_at":"2026-05-18T12:31:31.346846+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/N3WAPVN57UFDKZ4YN424OFEL5M","json":"https://pith.science/pith/N3WAPVN57UFDKZ4YN424OFEL5M.json","graph_json":"https://pith.science/api/pith-number/N3WAPVN57UFDKZ4YN424OFEL5M/graph.json","events_json":"https://pith.science/api/pith-number/N3WAPVN57UFDKZ4YN424OFEL5M/events.json","paper":"https://pith.science/paper/N3WAPVN5"},"agent_actions":{"view_html":"https://pith.science/pith/N3WAPVN57UFDKZ4YN424OFEL5M","download_json":"https://pith.science/pith/N3WAPVN57UFDKZ4YN424OFEL5M.json","view_paper":"https://pith.science/paper/N3WAPVN5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.01358&json=true","fetch_graph":"https://pith.science/api/pith-number/N3WAPVN57UFDKZ4YN424OFEL5M/graph.json","fetch_events":"https://pith.science/api/pith-number/N3WAPVN57UFDKZ4YN424OFEL5M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N3WAPVN57UFDKZ4YN424OFEL5M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N3WAPVN57UFDKZ4YN424OFEL5M/action/storage_attestation","attest_author":"https://pith.science/pith/N3WAPVN57UFDKZ4YN424OFEL5M/action/author_attestation","sign_citation":"https://pith.science/pith/N3WAPVN57UFDKZ4YN424OFEL5M/action/citation_signature","submit_replication":"https://pith.science/pith/N3WAPVN57UFDKZ4YN424OFEL5M/action/replication_record"}},"created_at":"2026-05-18T00:12:32.760835+00:00","updated_at":"2026-05-18T00:12:32.760835+00:00"}