{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:YOLMZ7NM74NJ56SLMAGFAK6HOJ","short_pith_number":"pith:YOLMZ7NM","canonical_record":{"source":{"id":"2605.30602","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-28T21:49:26Z","cross_cats_sorted":[],"title_canon_sha256":"0603be03a78e486b9371649851dde9382fa4a99229710ef821394e76511b4a1f","abstract_canon_sha256":"b7ca4ce3080b53094ce5ec8ec18ab9213f655ad9fec3c9bbcbef7fb4be7e6d76"},"schema_version":"1.0"},"canonical_sha256":"c396ccfdacff1a9efa4b600c502bc77274302f798d31eb5d237c02a53b4138fd","source":{"kind":"arxiv","id":"2605.30602","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.30602","created_at":"2026-06-01T01:03:03Z"},{"alias_kind":"arxiv_version","alias_value":"2605.30602v1","created_at":"2026-06-01T01:03:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.30602","created_at":"2026-06-01T01:03:03Z"},{"alias_kind":"pith_short_12","alias_value":"YOLMZ7NM74NJ","created_at":"2026-06-01T01:03:03Z"},{"alias_kind":"pith_short_16","alias_value":"YOLMZ7NM74NJ56SL","created_at":"2026-06-01T01:03:03Z"},{"alias_kind":"pith_short_8","alias_value":"YOLMZ7NM","created_at":"2026-06-01T01:03:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:YOLMZ7NM74NJ56SLMAGFAK6HOJ","target":"record","payload":{"canonical_record":{"source":{"id":"2605.30602","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-28T21:49:26Z","cross_cats_sorted":[],"title_canon_sha256":"0603be03a78e486b9371649851dde9382fa4a99229710ef821394e76511b4a1f","abstract_canon_sha256":"b7ca4ce3080b53094ce5ec8ec18ab9213f655ad9fec3c9bbcbef7fb4be7e6d76"},"schema_version":"1.0"},"canonical_sha256":"c396ccfdacff1a9efa4b600c502bc77274302f798d31eb5d237c02a53b4138fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T01:03:03.372198Z","signature_b64":"KqplygylBk+U8DLWMGi7xiANfi2AhmdiewZFyaCMHueuPG/mDoo5k4Wc5u0+d+WuOCTvjnIpswFRoJZpV0ezBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c396ccfdacff1a9efa4b600c502bc77274302f798d31eb5d237c02a53b4138fd","last_reissued_at":"2026-06-01T01:03:03.371592Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T01:03:03.371592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.30602","source_version":1,"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-06-01T01:03:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ufUHO3giRz8ckXOaHHecVoY8G+lKTYUOTDXL0MPeM1634ZNpQOE+3rY/i9psCouyNGpzfqu6go9SY/VH6ZqAAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:20:58.879190Z"},"content_sha256":"3c7dcb6b0cfbf46e29e0fab9e4f55708b4004a280f85876232d80de415de7d83","schema_version":"1.0","event_id":"sha256:3c7dcb6b0cfbf46e29e0fab9e4f55708b4004a280f85876232d80de415de7d83"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:YOLMZ7NM74NJ56SLMAGFAK6HOJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A characterization of maximal inhomogeneous-quadratic-free sets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Felipe Serrano, Gonzalo Mu\\~noz, Joseph Paat","submitted_at":"2026-05-28T21:49:26Z","abstract_excerpt":"The intersection cut framework is a versatile tool for generating valid inequalities in optimization. Its main ingredients are so-called $S$-free sets: convex sets whose interiors do not intersect a given set $S$. Among these, inclusion-wise maximal $S$-free sets are particularly important, as they yield the strongest intersection cuts. In the integer programming setting, maximal lattice-free sets are well studied and admit explicit characterizations. In the quadratic optimization context, Mu\\~noz, Paat, and Serrano (2025) characterized maximal $S$-free sets when $S$ is defined by a homogeneou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.30602","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.30602/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-01T01:03:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ep/Xev5aPCHPkezuWRaLcpiJxhWjJLOvz6Ay9J7Ra/l+09sCeeruVFwVAbcKlCaipu4nVRPsqPEMgZwV1yXkDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T16:20:58.879572Z"},"content_sha256":"10d94ff078407fe1f1b4b8346caf27f981c949627cda974e9b859a75fea020ac","schema_version":"1.0","event_id":"sha256:10d94ff078407fe1f1b4b8346caf27f981c949627cda974e9b859a75fea020ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YOLMZ7NM74NJ56SLMAGFAK6HOJ/bundle.json","state_url":"https://pith.science/pith/YOLMZ7NM74NJ56SLMAGFAK6HOJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YOLMZ7NM74NJ56SLMAGFAK6HOJ/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-06-09T16:20:58Z","links":{"resolver":"https://pith.science/pith/YOLMZ7NM74NJ56SLMAGFAK6HOJ","bundle":"https://pith.science/pith/YOLMZ7NM74NJ56SLMAGFAK6HOJ/bundle.json","state":"https://pith.science/pith/YOLMZ7NM74NJ56SLMAGFAK6HOJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YOLMZ7NM74NJ56SLMAGFAK6HOJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:YOLMZ7NM74NJ56SLMAGFAK6HOJ","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":"b7ca4ce3080b53094ce5ec8ec18ab9213f655ad9fec3c9bbcbef7fb4be7e6d76","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-28T21:49:26Z","title_canon_sha256":"0603be03a78e486b9371649851dde9382fa4a99229710ef821394e76511b4a1f"},"schema_version":"1.0","source":{"id":"2605.30602","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.30602","created_at":"2026-06-01T01:03:03Z"},{"alias_kind":"arxiv_version","alias_value":"2605.30602v1","created_at":"2026-06-01T01:03:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.30602","created_at":"2026-06-01T01:03:03Z"},{"alias_kind":"pith_short_12","alias_value":"YOLMZ7NM74NJ","created_at":"2026-06-01T01:03:03Z"},{"alias_kind":"pith_short_16","alias_value":"YOLMZ7NM74NJ56SL","created_at":"2026-06-01T01:03:03Z"},{"alias_kind":"pith_short_8","alias_value":"YOLMZ7NM","created_at":"2026-06-01T01:03:03Z"}],"graph_snapshots":[{"event_id":"sha256:10d94ff078407fe1f1b4b8346caf27f981c949627cda974e9b859a75fea020ac","target":"graph","created_at":"2026-06-01T01:03:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.30602/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The intersection cut framework is a versatile tool for generating valid inequalities in optimization. Its main ingredients are so-called $S$-free sets: convex sets whose interiors do not intersect a given set $S$. Among these, inclusion-wise maximal $S$-free sets are particularly important, as they yield the strongest intersection cuts. In the integer programming setting, maximal lattice-free sets are well studied and admit explicit characterizations. In the quadratic optimization context, Mu\\~noz, Paat, and Serrano (2025) characterized maximal $S$-free sets when $S$ is defined by a homogeneou","authors_text":"Felipe Serrano, Gonzalo Mu\\~noz, Joseph Paat","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-28T21:49:26Z","title":"A characterization of maximal inhomogeneous-quadratic-free sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.30602","kind":"arxiv","version":1},"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:3c7dcb6b0cfbf46e29e0fab9e4f55708b4004a280f85876232d80de415de7d83","target":"record","created_at":"2026-06-01T01:03:03Z","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":"b7ca4ce3080b53094ce5ec8ec18ab9213f655ad9fec3c9bbcbef7fb4be7e6d76","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-28T21:49:26Z","title_canon_sha256":"0603be03a78e486b9371649851dde9382fa4a99229710ef821394e76511b4a1f"},"schema_version":"1.0","source":{"id":"2605.30602","kind":"arxiv","version":1}},"canonical_sha256":"c396ccfdacff1a9efa4b600c502bc77274302f798d31eb5d237c02a53b4138fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c396ccfdacff1a9efa4b600c502bc77274302f798d31eb5d237c02a53b4138fd","first_computed_at":"2026-06-01T01:03:03.371592Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-01T01:03:03.371592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KqplygylBk+U8DLWMGi7xiANfi2AhmdiewZFyaCMHueuPG/mDoo5k4Wc5u0+d+WuOCTvjnIpswFRoJZpV0ezBg==","signature_status":"signed_v1","signed_at":"2026-06-01T01:03:03.372198Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.30602","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c7dcb6b0cfbf46e29e0fab9e4f55708b4004a280f85876232d80de415de7d83","sha256:10d94ff078407fe1f1b4b8346caf27f981c949627cda974e9b859a75fea020ac"],"state_sha256":"3e9f1b1b908006b817bb1833977219a6ca742c55dadf687ed798cedd2ba0ac64"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QBoehw0qTA5CmAYY/3+EmpEkbv2JZ4Ip3Ji2yT88H6MRMEieOOP/guUEpfw72Ej32urMNMbb9iF4O1+InDKnDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T16:20:58.881632Z","bundle_sha256":"c6dc0b6ccd46920ce358e3535f79852b654925d6e8030f133d37a72f763976a2"}}