{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TQCEIQTFQECV4D5MJ6TRQ3Z2XL","short_pith_number":"pith:TQCEIQTF","schema_version":"1.0","canonical_sha256":"9c0444426581055e0fac4fa7186f3abacc6f9140b4dc98535499361d92a2d064","source":{"kind":"arxiv","id":"1901.02740","version":1},"attestation_state":"computed","paper":{"title":"Erd\\H{o}s-Gallai-type results for the rainbow disconnection number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xueliang Li, Xuqing Bai","submitted_at":"2019-01-08T05:12:45Z","abstract_excerpt":"Let $G$ be a nontrivial connected and edge-colored graph. An edge-cut $R$ of $G$ is called a rainbow cut if no two edges of it are colored with a same color. An edge-colored graph $G$ is called rainbow disconnected if for every two distinct vertices $u$ and $v$ of $G$, there exists a $u-v$ rainbow cut separating them. 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 will study the Erd\\H{o}s-Gallai-type results for $rd(G)$, and completel"},"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":"1901.02740","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-08T05:12:45Z","cross_cats_sorted":[],"title_canon_sha256":"448a98610f6e3d4848c2da0df235dfdf848b08fb054ebea8d1e050c753a8fed9","abstract_canon_sha256":"64112cb5771a9db8b5ba280a838a7e2553bd9fde22470f187c87055daf701e97"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:39.579542Z","signature_b64":"1RuAAsZgsfY3I/JqB+8aSQmY3612tJTC8r8uCtuKke0gXy4oYfjU9JPjaw6Ij7wqAAU8mMm45bsxItRK6YcCAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c0444426581055e0fac4fa7186f3abacc6f9140b4dc98535499361d92a2d064","last_reissued_at":"2026-05-17T23:56:39.578804Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:39.578804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Erd\\H{o}s-Gallai-type results for the rainbow disconnection number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xueliang Li, Xuqing Bai","submitted_at":"2019-01-08T05:12:45Z","abstract_excerpt":"Let $G$ be a nontrivial connected and edge-colored graph. An edge-cut $R$ of $G$ is called a rainbow cut if no two edges of it are colored with a same color. An edge-colored graph $G$ is called rainbow disconnected if for every two distinct vertices $u$ and $v$ of $G$, there exists a $u-v$ rainbow cut separating them. 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 will study the Erd\\H{o}s-Gallai-type results for $rd(G)$, and completel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02740","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":"1901.02740","created_at":"2026-05-17T23:56:39.578897+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.02740v1","created_at":"2026-05-17T23:56:39.578897+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02740","created_at":"2026-05-17T23:56:39.578897+00:00"},{"alias_kind":"pith_short_12","alias_value":"TQCEIQTFQECV","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"TQCEIQTFQECV4D5M","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"TQCEIQTF","created_at":"2026-05-18T12:33:30.264802+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/TQCEIQTFQECV4D5MJ6TRQ3Z2XL","json":"https://pith.science/pith/TQCEIQTFQECV4D5MJ6TRQ3Z2XL.json","graph_json":"https://pith.science/api/pith-number/TQCEIQTFQECV4D5MJ6TRQ3Z2XL/graph.json","events_json":"https://pith.science/api/pith-number/TQCEIQTFQECV4D5MJ6TRQ3Z2XL/events.json","paper":"https://pith.science/paper/TQCEIQTF"},"agent_actions":{"view_html":"https://pith.science/pith/TQCEIQTFQECV4D5MJ6TRQ3Z2XL","download_json":"https://pith.science/pith/TQCEIQTFQECV4D5MJ6TRQ3Z2XL.json","view_paper":"https://pith.science/paper/TQCEIQTF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.02740&json=true","fetch_graph":"https://pith.science/api/pith-number/TQCEIQTFQECV4D5MJ6TRQ3Z2XL/graph.json","fetch_events":"https://pith.science/api/pith-number/TQCEIQTFQECV4D5MJ6TRQ3Z2XL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TQCEIQTFQECV4D5MJ6TRQ3Z2XL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TQCEIQTFQECV4D5MJ6TRQ3Z2XL/action/storage_attestation","attest_author":"https://pith.science/pith/TQCEIQTFQECV4D5MJ6TRQ3Z2XL/action/author_attestation","sign_citation":"https://pith.science/pith/TQCEIQTFQECV4D5MJ6TRQ3Z2XL/action/citation_signature","submit_replication":"https://pith.science/pith/TQCEIQTFQECV4D5MJ6TRQ3Z2XL/action/replication_record"}},"created_at":"2026-05-17T23:56:39.578897+00:00","updated_at":"2026-05-17T23:56:39.578897+00:00"}