{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:N3WAPVN57UFDKZ4YN424OFEL5M","short_pith_number":"pith:N3WAPVN5","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"},"canonical_sha256":"6eec07d5bdfd0a3567986f35c7148beb0e9dcff3197ffab69f57da677b2f5bd9","source":{"kind":"arxiv","id":"1711.01358","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01358","created_at":"2026-05-18T00:12:32Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01358v3","created_at":"2026-05-18T00:12:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01358","created_at":"2026-05-18T00:12:32Z"},{"alias_kind":"pith_short_12","alias_value":"N3WAPVN57UFD","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"N3WAPVN57UFDKZ4Y","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"N3WAPVN5","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:N3WAPVN57UFDKZ4YN424OFEL5M","target":"record","payload":{"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"},"canonical_sha256":"6eec07d5bdfd0a3567986f35c7148beb0e9dcff3197ffab69f57da677b2f5bd9","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"},"source_kind":"arxiv","source_id":"1711.01358","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:12:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qVh8nafJGQCvg687s0OPSqsuTUO8ci9K3olxd1UkgaLVR1h1DTQxpX3ZA7MHhN7Jh8/c8ZRorHRHOTT2a2ckDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T00:09:18.488071Z"},"content_sha256":"af30ea0256bd4eb3627d5218b982e22621c1c73fa9758e5b5a5222d9083e3f05","schema_version":"1.0","event_id":"sha256:af30ea0256bd4eb3627d5218b982e22621c1c73fa9758e5b5a5222d9083e3f05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:N3WAPVN57UFDKZ4YN424OFEL5M","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:12:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CuLd+yyaTTqHRntRQV0vpFh9UxKlmZhwWnfPuC3hJc3CBFPbBx41+DOYdffZgWVivuz5eA5sIuBNcZjLhMNoBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T00:09:18.488778Z"},"content_sha256":"6f03100cbe0f3c982d9252f3d983d632eedf8ea40b9f70ed5efc08681c6b8a46","schema_version":"1.0","event_id":"sha256:6f03100cbe0f3c982d9252f3d983d632eedf8ea40b9f70ed5efc08681c6b8a46"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N3WAPVN57UFDKZ4YN424OFEL5M/bundle.json","state_url":"https://pith.science/pith/N3WAPVN57UFDKZ4YN424OFEL5M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N3WAPVN57UFDKZ4YN424OFEL5M/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-24T00:09:18Z","links":{"resolver":"https://pith.science/pith/N3WAPVN57UFDKZ4YN424OFEL5M","bundle":"https://pith.science/pith/N3WAPVN57UFDKZ4YN424OFEL5M/bundle.json","state":"https://pith.science/pith/N3WAPVN57UFDKZ4YN424OFEL5M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N3WAPVN57UFDKZ4YN424OFEL5M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:N3WAPVN57UFDKZ4YN424OFEL5M","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5608d1fadf0dde742da6ca9b35d9390d9b3508119f98c3e5adc203bdc37128c7","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-03T23:15:41Z","title_canon_sha256":"5f800d1e1870911b06062c6a9ac76c15ac3a04bfba9d315a078c1b6c2c11d7f2"},"schema_version":"1.0","source":{"id":"1711.01358","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01358","created_at":"2026-05-18T00:12:32Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01358v3","created_at":"2026-05-18T00:12:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01358","created_at":"2026-05-18T00:12:32Z"},{"alias_kind":"pith_short_12","alias_value":"N3WAPVN57UFD","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"N3WAPVN57UFDKZ4Y","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"N3WAPVN5","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:6f03100cbe0f3c982d9252f3d983d632eedf8ea40b9f70ed5efc08681c6b8a46","target":"graph","created_at":"2026-05-18T00:12:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Samuel Fiorini, Stefan Weltge, Tony Huynh","cross_cats":["cs.DM","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-03T23:15:41Z","title":"Strengthening Convex Relaxations of 0/1-Sets Using Boolean Formulas"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01358","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:af30ea0256bd4eb3627d5218b982e22621c1c73fa9758e5b5a5222d9083e3f05","target":"record","created_at":"2026-05-18T00:12:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5608d1fadf0dde742da6ca9b35d9390d9b3508119f98c3e5adc203bdc37128c7","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-03T23:15:41Z","title_canon_sha256":"5f800d1e1870911b06062c6a9ac76c15ac3a04bfba9d315a078c1b6c2c11d7f2"},"schema_version":"1.0","source":{"id":"1711.01358","kind":"arxiv","version":3}},"canonical_sha256":"6eec07d5bdfd0a3567986f35c7148beb0e9dcff3197ffab69f57da677b2f5bd9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6eec07d5bdfd0a3567986f35c7148beb0e9dcff3197ffab69f57da677b2f5bd9","first_computed_at":"2026-05-18T00:12:32.760710Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:32.760710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LbuR4HKOG7Ame2oAwTpo+uQIcu5SoKlx76ormy5WG9D2Pcu2bTlGoJAhOh/+OPznA8FR5DatYjUSRMLrSoaOCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:32.761488Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.01358","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af30ea0256bd4eb3627d5218b982e22621c1c73fa9758e5b5a5222d9083e3f05","sha256:6f03100cbe0f3c982d9252f3d983d632eedf8ea40b9f70ed5efc08681c6b8a46"],"state_sha256":"f03b603bf53745a0c65aec884a677dafb2d017bcfa06f3bc62d974dea64f7f62"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vz6uVkkMgtCuoy1kErZRMrC+Mnuuxev3LmCKzd8mdWG5qAFR1IN1OeUkA/M07JPwgtZpUqHILg1L5sBlAZJICQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T00:09:18.492359Z","bundle_sha256":"9f219fe9a497470fec4763beb89766d68a513a3fcb55bfd50c81d73afad7322e"}}