{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IZ6GH5OCYAKC6RA3KJ7OEFOKER","short_pith_number":"pith:IZ6GH5OC","canonical_record":{"source":{"id":"1507.02168","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-08T14:21:59Z","cross_cats_sorted":[],"title_canon_sha256":"ca5ccee7445543be96f2062a49d0b863be451d85bc4795ce4d2069ccc51d5a9c","abstract_canon_sha256":"13790d4a194c4fd8d6e6657c315264e3516fb713022de77a9960f7833e3a20f6"},"schema_version":"1.0"},"canonical_sha256":"467c63f5c2c0142f441b527ee215ca24504311854177595a983cb27228e1e4b4","source":{"kind":"arxiv","id":"1507.02168","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02168","created_at":"2026-05-18T00:47:51Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02168v3","created_at":"2026-05-18T00:47:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02168","created_at":"2026-05-18T00:47:51Z"},{"alias_kind":"pith_short_12","alias_value":"IZ6GH5OCYAKC","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"IZ6GH5OCYAKC6RA3","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"IZ6GH5OC","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IZ6GH5OCYAKC6RA3KJ7OEFOKER","target":"record","payload":{"canonical_record":{"source":{"id":"1507.02168","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-08T14:21:59Z","cross_cats_sorted":[],"title_canon_sha256":"ca5ccee7445543be96f2062a49d0b863be451d85bc4795ce4d2069ccc51d5a9c","abstract_canon_sha256":"13790d4a194c4fd8d6e6657c315264e3516fb713022de77a9960f7833e3a20f6"},"schema_version":"1.0"},"canonical_sha256":"467c63f5c2c0142f441b527ee215ca24504311854177595a983cb27228e1e4b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:51.284855Z","signature_b64":"dtA8k1kc5RA/oQ5J2wz3FzScq5GeoPhx5peP7bafmNBuZbVV2PGVbyNhZpaJMXcei/xSqWo6UtkEt4DkfoaNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"467c63f5c2c0142f441b527ee215ca24504311854177595a983cb27228e1e4b4","last_reissued_at":"2026-05-18T00:47:51.284135Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:51.284135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.02168","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:47:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DUg5z7JL5CmPKE7QCd5QMlpa/b1zqDzOmnG5wMrNhm30K0dzKmA3h3cgCX9WvTZpq/IjEsxncku3Q3dnhrUlBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:05:41.929402Z"},"content_sha256":"67f9892a6e7f3117b04f1968a294d7286551ce8653a703c52d9d3fb51f608e29","schema_version":"1.0","event_id":"sha256:67f9892a6e7f3117b04f1968a294d7286551ce8653a703c52d9d3fb51f608e29"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IZ6GH5OCYAKC6RA3KJ7OEFOKER","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Edge Bipartization faster than $2^k$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Marcin Pilipczuk, Marcin Wrochna, Micha{\\l} Pilipczuk","submitted_at":"2015-07-08T14:21:59Z","abstract_excerpt":"In the Edge Bipartization problem one is given an undirected graph $G$ and an integer $k$, and the question is whether $k$ edges can be deleted from $G$ so that it becomes bipartite. In 2006, Guo et al. [J. Comput. Syst. Sci., 72(8):1386-1396, 2006] proposed an algorithm solving this problem in time $O(2^k m^2)$; today, this algorithm is a textbook example of an application of the iterative compression technique. Despite extensive progress in the understanding of the parameterized complexity of graph separation problems in the recent years, no significant improvement upon this result has been "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02168","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:47:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GD63MLjwlpj7pD6mo317NJZQ3heEbpiMBgH8qr9HZRcoSK/GurbtKv9SmMGL0FllsbeFblw//qRGf3b75ZhcCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:05:41.930003Z"},"content_sha256":"c3b41acd63766fee507b86da22fa96c3daf018b1247e7ad075b3cc813f72e8bd","schema_version":"1.0","event_id":"sha256:c3b41acd63766fee507b86da22fa96c3daf018b1247e7ad075b3cc813f72e8bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IZ6GH5OCYAKC6RA3KJ7OEFOKER/bundle.json","state_url":"https://pith.science/pith/IZ6GH5OCYAKC6RA3KJ7OEFOKER/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IZ6GH5OCYAKC6RA3KJ7OEFOKER/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-31T04:05:41Z","links":{"resolver":"https://pith.science/pith/IZ6GH5OCYAKC6RA3KJ7OEFOKER","bundle":"https://pith.science/pith/IZ6GH5OCYAKC6RA3KJ7OEFOKER/bundle.json","state":"https://pith.science/pith/IZ6GH5OCYAKC6RA3KJ7OEFOKER/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IZ6GH5OCYAKC6RA3KJ7OEFOKER/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IZ6GH5OCYAKC6RA3KJ7OEFOKER","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":"13790d4a194c4fd8d6e6657c315264e3516fb713022de77a9960f7833e3a20f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-08T14:21:59Z","title_canon_sha256":"ca5ccee7445543be96f2062a49d0b863be451d85bc4795ce4d2069ccc51d5a9c"},"schema_version":"1.0","source":{"id":"1507.02168","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02168","created_at":"2026-05-18T00:47:51Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02168v3","created_at":"2026-05-18T00:47:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02168","created_at":"2026-05-18T00:47:51Z"},{"alias_kind":"pith_short_12","alias_value":"IZ6GH5OCYAKC","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"IZ6GH5OCYAKC6RA3","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"IZ6GH5OC","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:c3b41acd63766fee507b86da22fa96c3daf018b1247e7ad075b3cc813f72e8bd","target":"graph","created_at":"2026-05-18T00:47:51Z","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 the Edge Bipartization problem one is given an undirected graph $G$ and an integer $k$, and the question is whether $k$ edges can be deleted from $G$ so that it becomes bipartite. In 2006, Guo et al. [J. Comput. Syst. Sci., 72(8):1386-1396, 2006] proposed an algorithm solving this problem in time $O(2^k m^2)$; today, this algorithm is a textbook example of an application of the iterative compression technique. Despite extensive progress in the understanding of the parameterized complexity of graph separation problems in the recent years, no significant improvement upon this result has been ","authors_text":"Marcin Pilipczuk, Marcin Wrochna, Micha{\\l} Pilipczuk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-08T14:21:59Z","title":"Edge Bipartization faster than $2^k$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02168","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:67f9892a6e7f3117b04f1968a294d7286551ce8653a703c52d9d3fb51f608e29","target":"record","created_at":"2026-05-18T00:47:51Z","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":"13790d4a194c4fd8d6e6657c315264e3516fb713022de77a9960f7833e3a20f6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-08T14:21:59Z","title_canon_sha256":"ca5ccee7445543be96f2062a49d0b863be451d85bc4795ce4d2069ccc51d5a9c"},"schema_version":"1.0","source":{"id":"1507.02168","kind":"arxiv","version":3}},"canonical_sha256":"467c63f5c2c0142f441b527ee215ca24504311854177595a983cb27228e1e4b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"467c63f5c2c0142f441b527ee215ca24504311854177595a983cb27228e1e4b4","first_computed_at":"2026-05-18T00:47:51.284135Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:51.284135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dtA8k1kc5RA/oQ5J2wz3FzScq5GeoPhx5peP7bafmNBuZbVV2PGVbyNhZpaJMXcei/xSqWo6UtkEt4DkfoaNDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:51.284855Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.02168","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67f9892a6e7f3117b04f1968a294d7286551ce8653a703c52d9d3fb51f608e29","sha256:c3b41acd63766fee507b86da22fa96c3daf018b1247e7ad075b3cc813f72e8bd"],"state_sha256":"be7d52a93aa5520b23f1009e4c0470c613fdb61ee6b39b422eaa18f2c8459208"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ZltXTKe+wtU7NEaR/oZLYYL+cOIave5brPkqKPZRrEClWzte6vQsEPUNIdmej6LNZc5JNtSDtOrldypYyD2Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:05:41.933127Z","bundle_sha256":"0d2bde834f0c7aca655915dfe24fbf36226e4572b7e724f78c740ee1ed232d1a"}}