{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:X2VYLS4AMXJSY6VYYRUJBAWAN2","short_pith_number":"pith:X2VYLS4A","canonical_record":{"source":{"id":"1911.09998","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-11-22T12:27:30Z","cross_cats_sorted":[],"title_canon_sha256":"dbe2e6ec13ac5fca49673833e7316a4bfc8795fa592f9cbb297ad1527efce480","abstract_canon_sha256":"7e06a033731042fad0d8438fa2c9cee42566ff7d8e87aab1a8da4c98beaffa01"},"schema_version":"1.0"},"canonical_sha256":"beab85cb8065d32c7ab8c4689082c06ebdb8fed9e26e6f6788a365e7e0d970d3","source":{"kind":"arxiv","id":"1911.09998","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.09998","created_at":"2026-07-05T05:20:06Z"},{"alias_kind":"arxiv_version","alias_value":"1911.09998v2","created_at":"2026-07-05T05:20:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.09998","created_at":"2026-07-05T05:20:06Z"},{"alias_kind":"pith_short_12","alias_value":"X2VYLS4AMXJS","created_at":"2026-07-05T05:20:06Z"},{"alias_kind":"pith_short_16","alias_value":"X2VYLS4AMXJSY6VY","created_at":"2026-07-05T05:20:06Z"},{"alias_kind":"pith_short_8","alias_value":"X2VYLS4A","created_at":"2026-07-05T05:20:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:X2VYLS4AMXJSY6VYYRUJBAWAN2","target":"record","payload":{"canonical_record":{"source":{"id":"1911.09998","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-11-22T12:27:30Z","cross_cats_sorted":[],"title_canon_sha256":"dbe2e6ec13ac5fca49673833e7316a4bfc8795fa592f9cbb297ad1527efce480","abstract_canon_sha256":"7e06a033731042fad0d8438fa2c9cee42566ff7d8e87aab1a8da4c98beaffa01"},"schema_version":"1.0"},"canonical_sha256":"beab85cb8065d32c7ab8c4689082c06ebdb8fed9e26e6f6788a365e7e0d970d3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:20:06.779526Z","signature_b64":"RmaTacHEpMDKZuPz49Mk8Wg8XD11isA0D+CCVNF3XWMj6eaDJqZtpgH/2i2wefz+AZSaygPqFSD92RoZXTLoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"beab85cb8065d32c7ab8c4689082c06ebdb8fed9e26e6f6788a365e7e0d970d3","last_reissued_at":"2026-07-05T05:20:06.779019Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:20:06.779019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1911.09998","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-07-05T05:20:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lPDFxIm8WufH7beRaz/DXMKP1SxbN+FOu5Ox6iqgsVLQIClXijcuPYJT9ozsYdlxMjwXAosACc7wVRnK7BFaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T11:06:08.225163Z"},"content_sha256":"db39caba57aca1e1705e655028ec2e62ab52d0e97bbb65a07719a561f3c3f189","schema_version":"1.0","event_id":"sha256:db39caba57aca1e1705e655028ec2e62ab52d0e97bbb65a07719a561f3c3f189"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:X2VYLS4AMXJSY6VYYRUJBAWAN2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Kempe Chains and Rooted Minors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Matthias Kriesell, Samuel Mohr","submitted_at":"2019-11-22T12:27:30Z","abstract_excerpt":"A (minimal) transversal of a partition is a set which contains exactly one element from each member of the partition and nothing else. A coloring of a graph is a partition of its vertex set into anticliques, that is, sets of pairwise nonadjacent vertices. We study the following problem: Given a transversal $T$ of a proper coloring $\\mathfrak{C}$ of some graph $G$, is there a partition $\\mathfrak{H}$ of a subset of $V(G)$ into connected sets such that $T$ is a transversal of $\\mathfrak{H}$ and such that two sets of $\\mathfrak{H}$ are adjacent if their corresponding vertices from $T$ are connect"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.09998","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1911.09998/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-07-05T05:20:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2gN9jJ12krTlw6cg/c86WMegpWNkRXIC5c2HT6EQ1UlcfWnmpYLixhfQiWCFNzyXYDNG7aqS53Tk1mMSbTPqDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T11:06:08.225681Z"},"content_sha256":"9f6d76888379fc69478ea4939ccdc2623368aa0db48f228351fbb5a0a1763bb1","schema_version":"1.0","event_id":"sha256:9f6d76888379fc69478ea4939ccdc2623368aa0db48f228351fbb5a0a1763bb1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X2VYLS4AMXJSY6VYYRUJBAWAN2/bundle.json","state_url":"https://pith.science/pith/X2VYLS4AMXJSY6VYYRUJBAWAN2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X2VYLS4AMXJSY6VYYRUJBAWAN2/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-08-14T11:06:08Z","links":{"resolver":"https://pith.science/pith/X2VYLS4AMXJSY6VYYRUJBAWAN2","bundle":"https://pith.science/pith/X2VYLS4AMXJSY6VYYRUJBAWAN2/bundle.json","state":"https://pith.science/pith/X2VYLS4AMXJSY6VYYRUJBAWAN2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X2VYLS4AMXJSY6VYYRUJBAWAN2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:X2VYLS4AMXJSY6VYYRUJBAWAN2","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":"7e06a033731042fad0d8438fa2c9cee42566ff7d8e87aab1a8da4c98beaffa01","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-11-22T12:27:30Z","title_canon_sha256":"dbe2e6ec13ac5fca49673833e7316a4bfc8795fa592f9cbb297ad1527efce480"},"schema_version":"1.0","source":{"id":"1911.09998","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.09998","created_at":"2026-07-05T05:20:06Z"},{"alias_kind":"arxiv_version","alias_value":"1911.09998v2","created_at":"2026-07-05T05:20:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.09998","created_at":"2026-07-05T05:20:06Z"},{"alias_kind":"pith_short_12","alias_value":"X2VYLS4AMXJS","created_at":"2026-07-05T05:20:06Z"},{"alias_kind":"pith_short_16","alias_value":"X2VYLS4AMXJSY6VY","created_at":"2026-07-05T05:20:06Z"},{"alias_kind":"pith_short_8","alias_value":"X2VYLS4A","created_at":"2026-07-05T05:20:06Z"}],"graph_snapshots":[{"event_id":"sha256:9f6d76888379fc69478ea4939ccdc2623368aa0db48f228351fbb5a0a1763bb1","target":"graph","created_at":"2026-07-05T05:20:06Z","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/1911.09998/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A (minimal) transversal of a partition is a set which contains exactly one element from each member of the partition and nothing else. A coloring of a graph is a partition of its vertex set into anticliques, that is, sets of pairwise nonadjacent vertices. We study the following problem: Given a transversal $T$ of a proper coloring $\\mathfrak{C}$ of some graph $G$, is there a partition $\\mathfrak{H}$ of a subset of $V(G)$ into connected sets such that $T$ is a transversal of $\\mathfrak{H}$ and such that two sets of $\\mathfrak{H}$ are adjacent if their corresponding vertices from $T$ are connect","authors_text":"Matthias Kriesell, Samuel Mohr","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-11-22T12:27:30Z","title":"Kempe Chains and Rooted Minors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.09998","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:db39caba57aca1e1705e655028ec2e62ab52d0e97bbb65a07719a561f3c3f189","target":"record","created_at":"2026-07-05T05:20:06Z","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":"7e06a033731042fad0d8438fa2c9cee42566ff7d8e87aab1a8da4c98beaffa01","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-11-22T12:27:30Z","title_canon_sha256":"dbe2e6ec13ac5fca49673833e7316a4bfc8795fa592f9cbb297ad1527efce480"},"schema_version":"1.0","source":{"id":"1911.09998","kind":"arxiv","version":2}},"canonical_sha256":"beab85cb8065d32c7ab8c4689082c06ebdb8fed9e26e6f6788a365e7e0d970d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"beab85cb8065d32c7ab8c4689082c06ebdb8fed9e26e6f6788a365e7e0d970d3","first_computed_at":"2026-07-05T05:20:06.779019Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:20:06.779019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RmaTacHEpMDKZuPz49Mk8Wg8XD11isA0D+CCVNF3XWMj6eaDJqZtpgH/2i2wefz+AZSaygPqFSD92RoZXTLoAg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:20:06.779526Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.09998","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db39caba57aca1e1705e655028ec2e62ab52d0e97bbb65a07719a561f3c3f189","sha256:9f6d76888379fc69478ea4939ccdc2623368aa0db48f228351fbb5a0a1763bb1"],"state_sha256":"2011a4648f8613d3f91a7537c3c964c6849ab2dee8109a06f72e15598d8e97e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"51sYq+IOPQRECCYhw7UaJI7RZkWL8RXIaAWX20EVGDQw9xVkL0YAaRpSv5skjidZVpdYXKEKaM0PJ6K7W2lPCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T11:06:08.229902Z","bundle_sha256":"6e5c6a0034d7c6f67c256c7af50ae4c495343dbc9313520c20628b63d00aff62"}}