{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4YXNUBMQTN7IURLUS7MQZWJ3BE","short_pith_number":"pith:4YXNUBMQ","schema_version":"1.0","canonical_sha256":"e62eda05909b7e8a457497d90cd93b092da0165444b610d29aaaa256bea228d4","source":{"kind":"arxiv","id":"1811.11939","version":2},"attestation_state":"computed","paper":{"title":"Hardness results for rainbow disconnection of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"math.CO","authors_text":"Xueliang Li, Zhong Huang","submitted_at":"2018-11-21T03:34:31Z","abstract_excerpt":"Let $G$ be a nontrivial connected, edge-colored graph. An edge-cut $S$ of $G$ is called a rainbow cut if no two edges in $S$ are colored with a same color. An edge-coloring of $G$ is a rainbow disconnection coloring if for every two distinct vertices $s$ and $t$ of $G$, there exists a rainbow cut $S$ in $G$ such that $s$ and $t$ belong to different components of $G\\setminus S$. For a connected graph $G$, the {\\it rainbow disconnection number} of $G$, denoted by $rd(G)$, is defined as the smallest number of colors such that $G$ has a rainbow disconnection coloring by using this number of colors"},"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":"1811.11939","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-21T03:34:31Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"aa028d9d26bf5524b231b6f10b967138a0a059992967a408b64a3d09bdccefa3","abstract_canon_sha256":"d1d41d1b1169ab6937ac109f29c02a7869b8ba6e0a362526c67cd6255132af7e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:13.609293Z","signature_b64":"3vvJakUaAgWrYrcG5tn/CyuJMyIDVXpUByEgek2pY/9sGZHT1kYyquWGMorwllUQBuzMc1BbFwM76ZOdW9bYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e62eda05909b7e8a457497d90cd93b092da0165444b610d29aaaa256bea228d4","last_reissued_at":"2026-05-17T23:59:13.608886Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:13.608886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hardness results for rainbow disconnection of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"math.CO","authors_text":"Xueliang Li, Zhong Huang","submitted_at":"2018-11-21T03:34:31Z","abstract_excerpt":"Let $G$ be a nontrivial connected, edge-colored graph. An edge-cut $S$ of $G$ is called a rainbow cut if no two edges in $S$ are colored with a same color. An edge-coloring of $G$ is a rainbow disconnection coloring if for every two distinct vertices $s$ and $t$ of $G$, there exists a rainbow cut $S$ in $G$ such that $s$ and $t$ belong to different components of $G\\setminus S$. For a connected graph $G$, the {\\it rainbow disconnection number} of $G$, denoted by $rd(G)$, is defined as the smallest number of colors such that $G$ has a rainbow disconnection coloring by using this number of colors"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11939","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.11939","created_at":"2026-05-17T23:59:13.608942+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.11939v2","created_at":"2026-05-17T23:59:13.608942+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11939","created_at":"2026-05-17T23:59:13.608942+00:00"},{"alias_kind":"pith_short_12","alias_value":"4YXNUBMQTN7I","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4YXNUBMQTN7IURLU","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4YXNUBMQ","created_at":"2026-05-18T12:32:05.422762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4YXNUBMQTN7IURLUS7MQZWJ3BE","json":"https://pith.science/pith/4YXNUBMQTN7IURLUS7MQZWJ3BE.json","graph_json":"https://pith.science/api/pith-number/4YXNUBMQTN7IURLUS7MQZWJ3BE/graph.json","events_json":"https://pith.science/api/pith-number/4YXNUBMQTN7IURLUS7MQZWJ3BE/events.json","paper":"https://pith.science/paper/4YXNUBMQ"},"agent_actions":{"view_html":"https://pith.science/pith/4YXNUBMQTN7IURLUS7MQZWJ3BE","download_json":"https://pith.science/pith/4YXNUBMQTN7IURLUS7MQZWJ3BE.json","view_paper":"https://pith.science/paper/4YXNUBMQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.11939&json=true","fetch_graph":"https://pith.science/api/pith-number/4YXNUBMQTN7IURLUS7MQZWJ3BE/graph.json","fetch_events":"https://pith.science/api/pith-number/4YXNUBMQTN7IURLUS7MQZWJ3BE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4YXNUBMQTN7IURLUS7MQZWJ3BE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4YXNUBMQTN7IURLUS7MQZWJ3BE/action/storage_attestation","attest_author":"https://pith.science/pith/4YXNUBMQTN7IURLUS7MQZWJ3BE/action/author_attestation","sign_citation":"https://pith.science/pith/4YXNUBMQTN7IURLUS7MQZWJ3BE/action/citation_signature","submit_replication":"https://pith.science/pith/4YXNUBMQTN7IURLUS7MQZWJ3BE/action/replication_record"}},"created_at":"2026-05-17T23:59:13.608942+00:00","updated_at":"2026-05-17T23:59:13.608942+00:00"}