{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GWFVX3H25NQ4WFN6WNDWDYYMBI","short_pith_number":"pith:GWFVX3H2","schema_version":"1.0","canonical_sha256":"358b5becfaeb61cb15beb34761e30c0a1f12af16873a799ec36c0c63b9a30a94","source":{"kind":"arxiv","id":"1810.09736","version":1},"attestation_state":"computed","paper":{"title":"More on rainbow disconnection in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Renying Chang, Xueliang Li, Xuqing Bai","submitted_at":"2018-10-23T09:19:21Z","abstract_excerpt":"Let $G$ be a nontrivial edge-colored connected graph. An edge-cut $R$ of $G$ is called a rainbow cut if no two edges of it are colored the same. An edge-colored graph $G$ is rainbow disconnected if for every two vertices $u$ and $v$, there exists a $u-v$ rainbow cut. For a connected graph $G$, the rainbow disconnection number of $G$, denoted by $rd(G)$, is defined as the smallest number of colors that are needed in order to make $G$ rainbow disconnected. In this paper, we first solve a conjecture that determines the maximum size of a connected graph $G$ of order $n$ with $rd(G) = k$ for given "},"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":"1810.09736","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-23T09:19:21Z","cross_cats_sorted":[],"title_canon_sha256":"8a990ad1ade69126a2ec98b61c762a15fd4aa2048586d486224a7feab995ed0b","abstract_canon_sha256":"dd5fe5b2989c19d769b8988355236eb545604fc015a98ff400de21bdc17a7e4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:29.572751Z","signature_b64":"fEZZOO7XdJdzZ1jR1MagMAYMRGqwH0R9zuNYEFDhXloVB55DO+JtYU+eiozmrPuAFq1xwWtVXzO5yEzhTXtOAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"358b5becfaeb61cb15beb34761e30c0a1f12af16873a799ec36c0c63b9a30a94","last_reissued_at":"2026-05-18T00:02:29.572018Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:29.572018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"More on rainbow disconnection in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Renying Chang, Xueliang Li, Xuqing Bai","submitted_at":"2018-10-23T09:19:21Z","abstract_excerpt":"Let $G$ be a nontrivial edge-colored connected graph. An edge-cut $R$ of $G$ is called a rainbow cut if no two edges of it are colored the same. An edge-colored graph $G$ is rainbow disconnected if for every two vertices $u$ and $v$, there exists a $u-v$ rainbow cut. For a connected graph $G$, the rainbow disconnection number of $G$, denoted by $rd(G)$, is defined as the smallest number of colors that are needed in order to make $G$ rainbow disconnected. In this paper, we first solve a conjecture that determines the maximum size of a connected graph $G$ of order $n$ with $rd(G) = k$ for given "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.09736","kind":"arxiv","version":1},"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":"1810.09736","created_at":"2026-05-18T00:02:29.572117+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.09736v1","created_at":"2026-05-18T00:02:29.572117+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.09736","created_at":"2026-05-18T00:02:29.572117+00:00"},{"alias_kind":"pith_short_12","alias_value":"GWFVX3H25NQ4","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GWFVX3H25NQ4WFN6","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GWFVX3H2","created_at":"2026-05-18T12:32:25.280505+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/GWFVX3H25NQ4WFN6WNDWDYYMBI","json":"https://pith.science/pith/GWFVX3H25NQ4WFN6WNDWDYYMBI.json","graph_json":"https://pith.science/api/pith-number/GWFVX3H25NQ4WFN6WNDWDYYMBI/graph.json","events_json":"https://pith.science/api/pith-number/GWFVX3H25NQ4WFN6WNDWDYYMBI/events.json","paper":"https://pith.science/paper/GWFVX3H2"},"agent_actions":{"view_html":"https://pith.science/pith/GWFVX3H25NQ4WFN6WNDWDYYMBI","download_json":"https://pith.science/pith/GWFVX3H25NQ4WFN6WNDWDYYMBI.json","view_paper":"https://pith.science/paper/GWFVX3H2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.09736&json=true","fetch_graph":"https://pith.science/api/pith-number/GWFVX3H25NQ4WFN6WNDWDYYMBI/graph.json","fetch_events":"https://pith.science/api/pith-number/GWFVX3H25NQ4WFN6WNDWDYYMBI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GWFVX3H25NQ4WFN6WNDWDYYMBI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GWFVX3H25NQ4WFN6WNDWDYYMBI/action/storage_attestation","attest_author":"https://pith.science/pith/GWFVX3H25NQ4WFN6WNDWDYYMBI/action/author_attestation","sign_citation":"https://pith.science/pith/GWFVX3H25NQ4WFN6WNDWDYYMBI/action/citation_signature","submit_replication":"https://pith.science/pith/GWFVX3H25NQ4WFN6WNDWDYYMBI/action/replication_record"}},"created_at":"2026-05-18T00:02:29.572117+00:00","updated_at":"2026-05-18T00:02:29.572117+00:00"}