{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KEX2VY525UPVXZK2MOOGUSW7FM","short_pith_number":"pith:KEX2VY52","canonical_record":{"source":{"id":"1305.2743","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-13T11:25:01Z","cross_cats_sorted":[],"title_canon_sha256":"da6061e9e27d5fbfe93bb2a3edfe6ca1830cd3e1876147a11c6b4e4ec88c6fb2","abstract_canon_sha256":"8b069e31a3f93c909d96e3a6e819a95a1d9664f38f2d9221debaf889d9924806"},"schema_version":"1.0"},"canonical_sha256":"512faae3baed1f5be55a639c6a4adf2b010b6ac8ff272ff1cbeca9e0b619560a","source":{"kind":"arxiv","id":"1305.2743","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.2743","created_at":"2026-05-18T03:14:17Z"},{"alias_kind":"arxiv_version","alias_value":"1305.2743v3","created_at":"2026-05-18T03:14:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2743","created_at":"2026-05-18T03:14:17Z"},{"alias_kind":"pith_short_12","alias_value":"KEX2VY525UPV","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"KEX2VY525UPVXZK2","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"KEX2VY52","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KEX2VY525UPVXZK2MOOGUSW7FM","target":"record","payload":{"canonical_record":{"source":{"id":"1305.2743","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-13T11:25:01Z","cross_cats_sorted":[],"title_canon_sha256":"da6061e9e27d5fbfe93bb2a3edfe6ca1830cd3e1876147a11c6b4e4ec88c6fb2","abstract_canon_sha256":"8b069e31a3f93c909d96e3a6e819a95a1d9664f38f2d9221debaf889d9924806"},"schema_version":"1.0"},"canonical_sha256":"512faae3baed1f5be55a639c6a4adf2b010b6ac8ff272ff1cbeca9e0b619560a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:17.148468Z","signature_b64":"RGW3lo3q7NrZI7o6FGOOuUs07Z4VqNwGgnfoa4Gu6a2o8m0CeYUijDsOoAzE/SaVcNcP0fEGdSMN0oqjjV98BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"512faae3baed1f5be55a639c6a4adf2b010b6ac8ff272ff1cbeca9e0b619560a","last_reissued_at":"2026-05-18T03:14:17.147605Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:17.147605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.2743","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-18T03:14:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qpXw+huYoQWQpCwBk8W8AVynN9CKZjJrrL/9HWBC/DLA0EPtgCt38cZcdfewSD3R0ppsV3ywJLui6oGha5/hCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:54:26.787945Z"},"content_sha256":"1c0788a874353710e8d0f16fbf2f985dfa580379f9c410341e367cd4f885bc75","schema_version":"1.0","event_id":"sha256:1c0788a874353710e8d0f16fbf2f985dfa580379f9c410341e367cd4f885bc75"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KEX2VY525UPVXZK2MOOGUSW7FM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A faster FPT algorithm for Bipartite Contraction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"D\\'aniel Marx, Sylvain Guillemot","submitted_at":"2013-05-13T11:25:01Z","abstract_excerpt":"The \\textsc{Bipartite Contraction} problem is to decide, given a graph $G$ and a parameter $k$, whether we can can obtain a bipartite graph from $G$ by at most $k$ edge contractions. The fixed-parameter tractability of the problem was shown by [Heggernes et al. 2011], with an algorithm whose running time has double-exponential dependence on $k$. We present a new randomized FPT algorithm for the problem, which is both conceptually simpler and achieves an improved $2^{O(k^2)} n m$ running time, i.e., avoiding the double-exponential dependence on $k$. The algorithm can be derandomized using stand"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2743","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-18T03:14:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lj9+NMg3IWkIeIxurkVin0cv7B9dZKsigx1xI39DANlhFBvmFd2szevD09rv4nwXYaMEqChVx9NhkoSIkgHrCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:54:26.788296Z"},"content_sha256":"5a87d2104fe787e18e642d3e6f7676397f8b0d0f54b8e6f81679566585e80db7","schema_version":"1.0","event_id":"sha256:5a87d2104fe787e18e642d3e6f7676397f8b0d0f54b8e6f81679566585e80db7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KEX2VY525UPVXZK2MOOGUSW7FM/bundle.json","state_url":"https://pith.science/pith/KEX2VY525UPVXZK2MOOGUSW7FM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KEX2VY525UPVXZK2MOOGUSW7FM/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-26T11:54:26Z","links":{"resolver":"https://pith.science/pith/KEX2VY525UPVXZK2MOOGUSW7FM","bundle":"https://pith.science/pith/KEX2VY525UPVXZK2MOOGUSW7FM/bundle.json","state":"https://pith.science/pith/KEX2VY525UPVXZK2MOOGUSW7FM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KEX2VY525UPVXZK2MOOGUSW7FM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KEX2VY525UPVXZK2MOOGUSW7FM","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":"8b069e31a3f93c909d96e3a6e819a95a1d9664f38f2d9221debaf889d9924806","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-13T11:25:01Z","title_canon_sha256":"da6061e9e27d5fbfe93bb2a3edfe6ca1830cd3e1876147a11c6b4e4ec88c6fb2"},"schema_version":"1.0","source":{"id":"1305.2743","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.2743","created_at":"2026-05-18T03:14:17Z"},{"alias_kind":"arxiv_version","alias_value":"1305.2743v3","created_at":"2026-05-18T03:14:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2743","created_at":"2026-05-18T03:14:17Z"},{"alias_kind":"pith_short_12","alias_value":"KEX2VY525UPV","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"KEX2VY525UPVXZK2","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"KEX2VY52","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:5a87d2104fe787e18e642d3e6f7676397f8b0d0f54b8e6f81679566585e80db7","target":"graph","created_at":"2026-05-18T03:14:17Z","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":"The \\textsc{Bipartite Contraction} problem is to decide, given a graph $G$ and a parameter $k$, whether we can can obtain a bipartite graph from $G$ by at most $k$ edge contractions. The fixed-parameter tractability of the problem was shown by [Heggernes et al. 2011], with an algorithm whose running time has double-exponential dependence on $k$. We present a new randomized FPT algorithm for the problem, which is both conceptually simpler and achieves an improved $2^{O(k^2)} n m$ running time, i.e., avoiding the double-exponential dependence on $k$. The algorithm can be derandomized using stand","authors_text":"D\\'aniel Marx, Sylvain Guillemot","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-13T11:25:01Z","title":"A faster FPT algorithm for Bipartite Contraction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2743","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:1c0788a874353710e8d0f16fbf2f985dfa580379f9c410341e367cd4f885bc75","target":"record","created_at":"2026-05-18T03:14:17Z","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":"8b069e31a3f93c909d96e3a6e819a95a1d9664f38f2d9221debaf889d9924806","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-13T11:25:01Z","title_canon_sha256":"da6061e9e27d5fbfe93bb2a3edfe6ca1830cd3e1876147a11c6b4e4ec88c6fb2"},"schema_version":"1.0","source":{"id":"1305.2743","kind":"arxiv","version":3}},"canonical_sha256":"512faae3baed1f5be55a639c6a4adf2b010b6ac8ff272ff1cbeca9e0b619560a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"512faae3baed1f5be55a639c6a4adf2b010b6ac8ff272ff1cbeca9e0b619560a","first_computed_at":"2026-05-18T03:14:17.147605Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:17.147605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RGW3lo3q7NrZI7o6FGOOuUs07Z4VqNwGgnfoa4Gu6a2o8m0CeYUijDsOoAzE/SaVcNcP0fEGdSMN0oqjjV98BA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:17.148468Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.2743","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c0788a874353710e8d0f16fbf2f985dfa580379f9c410341e367cd4f885bc75","sha256:5a87d2104fe787e18e642d3e6f7676397f8b0d0f54b8e6f81679566585e80db7"],"state_sha256":"2886994f18c10487664b37bacdfa19eb86664e0f0cca44b2dc755adbfc19ebed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5+qNNGj0K/mXOLcw/jLZSF0JL1uMJjRYh3XNmFQ/pc7OEvDCGlG6Jhp5zQHqbCIFxqAGpefieT3z85d71yfrDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:54:26.790598Z","bundle_sha256":"638e989ab69b11f84747f79772a506ac0f5f9201df0a1171b9f037b22d993453"}}