{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:X2VYLS4AMXJSY6VYYRUJBAWAN2","short_pith_number":"pith:X2VYLS4A","schema_version":"1.0","canonical_sha256":"beab85cb8065d32c7ab8c4689082c06ebdb8fed9e26e6f6788a365e7e0d970d3","source":{"kind":"arxiv","id":"1911.09998","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1911.09998","created_at":"2026-07-05T05:20:06.779083+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.09998v2","created_at":"2026-07-05T05:20:06.779083+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.09998","created_at":"2026-07-05T05:20:06.779083+00:00"},{"alias_kind":"pith_short_12","alias_value":"X2VYLS4AMXJS","created_at":"2026-07-05T05:20:06.779083+00:00"},{"alias_kind":"pith_short_16","alias_value":"X2VYLS4AMXJSY6VY","created_at":"2026-07-05T05:20:06.779083+00:00"},{"alias_kind":"pith_short_8","alias_value":"X2VYLS4A","created_at":"2026-07-05T05:20:06.779083+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.03244","citing_title":"Every graph with no $K_7^{\\vee}$-minor is $6$-colorable","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X2VYLS4AMXJSY6VYYRUJBAWAN2","json":"https://pith.science/pith/X2VYLS4AMXJSY6VYYRUJBAWAN2.json","graph_json":"https://pith.science/api/pith-number/X2VYLS4AMXJSY6VYYRUJBAWAN2/graph.json","events_json":"https://pith.science/api/pith-number/X2VYLS4AMXJSY6VYYRUJBAWAN2/events.json","paper":"https://pith.science/paper/X2VYLS4A"},"agent_actions":{"view_html":"https://pith.science/pith/X2VYLS4AMXJSY6VYYRUJBAWAN2","download_json":"https://pith.science/pith/X2VYLS4AMXJSY6VYYRUJBAWAN2.json","view_paper":"https://pith.science/paper/X2VYLS4A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.09998&json=true","fetch_graph":"https://pith.science/api/pith-number/X2VYLS4AMXJSY6VYYRUJBAWAN2/graph.json","fetch_events":"https://pith.science/api/pith-number/X2VYLS4AMXJSY6VYYRUJBAWAN2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X2VYLS4AMXJSY6VYYRUJBAWAN2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X2VYLS4AMXJSY6VYYRUJBAWAN2/action/storage_attestation","attest_author":"https://pith.science/pith/X2VYLS4AMXJSY6VYYRUJBAWAN2/action/author_attestation","sign_citation":"https://pith.science/pith/X2VYLS4AMXJSY6VYYRUJBAWAN2/action/citation_signature","submit_replication":"https://pith.science/pith/X2VYLS4AMXJSY6VYYRUJBAWAN2/action/replication_record"}},"created_at":"2026-07-05T05:20:06.779083+00:00","updated_at":"2026-07-05T05:20:06.779083+00:00"}