{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:THOBR2QRIOFO56FHVZ2RG7THFW","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":"d6deb8dfacc02a0483460be1f92201cdfd2f093814cdb7aa817e312b10ba75a1","cross_cats_sorted":["cs.DS","math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-08-17T13:10:18Z","title_canon_sha256":"83d11a5b08e2707868991bafbbb2cae26b8d9038465b07cdbe6cc65ee057b2a6"},"schema_version":"1.0","source":{"id":"1908.06300","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.06300","created_at":"2026-07-04T23:58:14Z"},{"alias_kind":"arxiv_version","alias_value":"1908.06300v1","created_at":"2026-07-04T23:58:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06300","created_at":"2026-07-04T23:58:14Z"},{"alias_kind":"pith_short_12","alias_value":"THOBR2QRIOFO","created_at":"2026-07-04T23:58:14Z"},{"alias_kind":"pith_short_16","alias_value":"THOBR2QRIOFO56FH","created_at":"2026-07-04T23:58:14Z"},{"alias_kind":"pith_short_8","alias_value":"THOBR2QR","created_at":"2026-07-04T23:58:14Z"}],"graph_snapshots":[{"event_id":"sha256:2e03f6ecea2f5d232b57d04446e669c02af2af0ddff66a7b17ee22f3f4c01d0d","target":"graph","created_at":"2026-07-04T23:58:14Z","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/1908.06300/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Consider the family of graphs without $ k $ node-disjoint odd cycles, where $ k $ is a constant. Determining the complexity of the stable set problem for such graphs $ G $ is a long-standing problem. We give a polynomial-time algorithm for the case that $ G $ can be further embedded in a (possibly non-orientable) surface of bounded genus. Moreover, we obtain polynomial-size extended formulations for the respective stable set polytopes.\n  To this end, we show that $2$-sided odd cycles satisfy the Erd\\H{o}s-P\\'osa property in graphs embedded in a fixed surface. This extends the fact that odd cyc","authors_text":"Gwena\\\"el Joret, Michele Conforti, Samuel Fiorin, Stefan Weltge, Tony Huynh","cross_cats":["cs.DS","math.CO","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-08-17T13:10:18Z","title":"The stable set problem in graphs with bounded genus and bounded odd cycle packing number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06300","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:3b3ea4788793fd42c10e10e8673f08d083793214e2fec746b2e7ea4487566ac2","target":"record","created_at":"2026-07-04T23:58:14Z","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":"d6deb8dfacc02a0483460be1f92201cdfd2f093814cdb7aa817e312b10ba75a1","cross_cats_sorted":["cs.DS","math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-08-17T13:10:18Z","title_canon_sha256":"83d11a5b08e2707868991bafbbb2cae26b8d9038465b07cdbe6cc65ee057b2a6"},"schema_version":"1.0","source":{"id":"1908.06300","kind":"arxiv","version":1}},"canonical_sha256":"99dc18ea11438aeef8a7ae75137e672d8e9a760db1a4cfb19a729a1aa24aa191","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99dc18ea11438aeef8a7ae75137e672d8e9a760db1a4cfb19a729a1aa24aa191","first_computed_at":"2026-07-04T23:58:14.411277Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:58:14.411277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SmIaB+N2t8l1037ptL6REO4vhx8nGj4Vt3lB3MxH/TrmiDdDiqrnCaX+sJHd6XFK9HSKVfOFFBff5NEe46tMBQ==","signature_status":"signed_v1","signed_at":"2026-07-04T23:58:14.411637Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.06300","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b3ea4788793fd42c10e10e8673f08d083793214e2fec746b2e7ea4487566ac2","sha256:2e03f6ecea2f5d232b57d04446e669c02af2af0ddff66a7b17ee22f3f4c01d0d"],"state_sha256":"cbf7e8ace043ae90d909d45cab31ccea38e2ee56e8d764389e1fc9930eb64ce9"}