{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RQQP3T6Q566DFJBCZOPWGNOAYC","short_pith_number":"pith:RQQP3T6Q","canonical_record":{"source":{"id":"1705.04111","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-11T11:08:08Z","cross_cats_sorted":[],"title_canon_sha256":"0fef607f6144baf8a50f41c1a73ccf3875028e0aec38f046f2c004bcda309033","abstract_canon_sha256":"2061d81e139bb5bf94f6882a8b07c16292879abab0ccbc0fe797c376ce395ef5"},"schema_version":"1.0"},"canonical_sha256":"8c20fdcfd0efbc32a422cb9f6335c0c09f18b7177107cad4e4ef5d5adbc777c0","source":{"kind":"arxiv","id":"1705.04111","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04111","created_at":"2026-05-18T00:40:28Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04111v2","created_at":"2026-05-18T00:40:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04111","created_at":"2026-05-18T00:40:28Z"},{"alias_kind":"pith_short_12","alias_value":"RQQP3T6Q566D","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RQQP3T6Q566DFJBC","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RQQP3T6Q","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RQQP3T6Q566DFJBCZOPWGNOAYC","target":"record","payload":{"canonical_record":{"source":{"id":"1705.04111","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-11T11:08:08Z","cross_cats_sorted":[],"title_canon_sha256":"0fef607f6144baf8a50f41c1a73ccf3875028e0aec38f046f2c004bcda309033","abstract_canon_sha256":"2061d81e139bb5bf94f6882a8b07c16292879abab0ccbc0fe797c376ce395ef5"},"schema_version":"1.0"},"canonical_sha256":"8c20fdcfd0efbc32a422cb9f6335c0c09f18b7177107cad4e4ef5d5adbc777c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:28.406133Z","signature_b64":"BcgGD9wZNfpfCr5MawM/meevlS8oX63d+q0rMs3iXbpbi+WoazD5vxDL509ECqXximRQlyDB63kTe5UJbJBhDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c20fdcfd0efbc32a422cb9f6335c0c09f18b7177107cad4e4ef5d5adbc777c0","last_reissued_at":"2026-05-18T00:40:28.405487Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:28.405487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.04111","source_version":2,"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:40:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B7jcbhqgArNuPC8T2Zkz4SqEgjl6q77w2EBBYfh5wJpBXc5AcgOYLjTRQbG2ArdilS6FwMUQWfvteBGB6w2aAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T15:52:06.279683Z"},"content_sha256":"6da67d0647dff9db9796e40d275135a1e5fee793062c22f8a4f61cdca7a98380","schema_version":"1.0","event_id":"sha256:6da67d0647dff9db9796e40d275135a1e5fee793062c22f8a4f61cdca7a98380"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RQQP3T6Q566DFJBCZOPWGNOAYC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Critical Graphs for Minimum Vertex Cover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Andreas Jakoby, Eik List, Naveen Kumar Goswami, Stefan Lucks","submitted_at":"2017-05-11T11:08:08Z","abstract_excerpt":"In the context of the chromatic-number problem, a critical graph is an instance where the deletion of any element would decrease the graph's chromatic number. Such instances have shown to be interesting objects of study for deepen the understanding of the optimization problem.\n  This work introduces critical graphs in context of Minimum Vertex Cover. We demonstrate their potential for the generation of larger graphs with hidden a priori known solutions. Firstly, we propose a parametrized graph-generation process which preserves the knowledge of the minimum cover. Secondly, we conduct a systema"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04111","kind":"arxiv","version":2},"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:40:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JXPptVHRKmxvTqkBP/jOS3kJXSaprx27UUylo/DeVgdWaNnV+cVwOyNdY9/qjJk44riLZCSPaa90TaG8Y1BUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T15:52:06.280429Z"},"content_sha256":"3da6bfa696143fe70f6a805a3b0a262555052e40d883b66b1593412effc7a555","schema_version":"1.0","event_id":"sha256:3da6bfa696143fe70f6a805a3b0a262555052e40d883b66b1593412effc7a555"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RQQP3T6Q566DFJBCZOPWGNOAYC/bundle.json","state_url":"https://pith.science/pith/RQQP3T6Q566DFJBCZOPWGNOAYC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RQQP3T6Q566DFJBCZOPWGNOAYC/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-11T15:52:06Z","links":{"resolver":"https://pith.science/pith/RQQP3T6Q566DFJBCZOPWGNOAYC","bundle":"https://pith.science/pith/RQQP3T6Q566DFJBCZOPWGNOAYC/bundle.json","state":"https://pith.science/pith/RQQP3T6Q566DFJBCZOPWGNOAYC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RQQP3T6Q566DFJBCZOPWGNOAYC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RQQP3T6Q566DFJBCZOPWGNOAYC","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":"2061d81e139bb5bf94f6882a8b07c16292879abab0ccbc0fe797c376ce395ef5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-11T11:08:08Z","title_canon_sha256":"0fef607f6144baf8a50f41c1a73ccf3875028e0aec38f046f2c004bcda309033"},"schema_version":"1.0","source":{"id":"1705.04111","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.04111","created_at":"2026-05-18T00:40:28Z"},{"alias_kind":"arxiv_version","alias_value":"1705.04111v2","created_at":"2026-05-18T00:40:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.04111","created_at":"2026-05-18T00:40:28Z"},{"alias_kind":"pith_short_12","alias_value":"RQQP3T6Q566D","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RQQP3T6Q566DFJBC","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RQQP3T6Q","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:3da6bfa696143fe70f6a805a3b0a262555052e40d883b66b1593412effc7a555","target":"graph","created_at":"2026-05-18T00:40:28Z","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 context of the chromatic-number problem, a critical graph is an instance where the deletion of any element would decrease the graph's chromatic number. Such instances have shown to be interesting objects of study for deepen the understanding of the optimization problem.\n  This work introduces critical graphs in context of Minimum Vertex Cover. We demonstrate their potential for the generation of larger graphs with hidden a priori known solutions. Firstly, we propose a parametrized graph-generation process which preserves the knowledge of the minimum cover. Secondly, we conduct a systema","authors_text":"Andreas Jakoby, Eik List, Naveen Kumar Goswami, Stefan Lucks","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-11T11:08:08Z","title":"Critical Graphs for Minimum Vertex Cover"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.04111","kind":"arxiv","version":2},"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:6da67d0647dff9db9796e40d275135a1e5fee793062c22f8a4f61cdca7a98380","target":"record","created_at":"2026-05-18T00:40:28Z","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":"2061d81e139bb5bf94f6882a8b07c16292879abab0ccbc0fe797c376ce395ef5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-11T11:08:08Z","title_canon_sha256":"0fef607f6144baf8a50f41c1a73ccf3875028e0aec38f046f2c004bcda309033"},"schema_version":"1.0","source":{"id":"1705.04111","kind":"arxiv","version":2}},"canonical_sha256":"8c20fdcfd0efbc32a422cb9f6335c0c09f18b7177107cad4e4ef5d5adbc777c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c20fdcfd0efbc32a422cb9f6335c0c09f18b7177107cad4e4ef5d5adbc777c0","first_computed_at":"2026-05-18T00:40:28.405487Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:28.405487Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BcgGD9wZNfpfCr5MawM/meevlS8oX63d+q0rMs3iXbpbi+WoazD5vxDL509ECqXximRQlyDB63kTe5UJbJBhDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:28.406133Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.04111","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6da67d0647dff9db9796e40d275135a1e5fee793062c22f8a4f61cdca7a98380","sha256:3da6bfa696143fe70f6a805a3b0a262555052e40d883b66b1593412effc7a555"],"state_sha256":"794b37b869e670f7ab367d5ddcf59ce1f07541eff7d3d17b71034ee481f4fffa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"za1tExusUedtj7qXHssD5FXSLpGIGqeTkAny1zfHarcYU1NsYt1r3s2g+uNI46wTertc0QhcIJP8l3B4ViOnAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T15:52:06.284426Z","bundle_sha256":"c28dc8f9db9652b12fe6b24e90ac5c175e8d1f74b820f43e6e797c58d54aa59c"}}