{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GWFVX3H25NQ4WFN6WNDWDYYMBI","short_pith_number":"pith:GWFVX3H2","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"},"canonical_sha256":"358b5becfaeb61cb15beb34761e30c0a1f12af16873a799ec36c0c63b9a30a94","source":{"kind":"arxiv","id":"1810.09736","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.09736","created_at":"2026-05-18T00:02:29Z"},{"alias_kind":"arxiv_version","alias_value":"1810.09736v1","created_at":"2026-05-18T00:02:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.09736","created_at":"2026-05-18T00:02:29Z"},{"alias_kind":"pith_short_12","alias_value":"GWFVX3H25NQ4","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GWFVX3H25NQ4WFN6","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GWFVX3H2","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GWFVX3H25NQ4WFN6WNDWDYYMBI","target":"record","payload":{"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"},"canonical_sha256":"358b5becfaeb61cb15beb34761e30c0a1f12af16873a799ec36c0c63b9a30a94","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"},"source_kind":"arxiv","source_id":"1810.09736","source_version":1,"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-05-18T00:02:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zrTSpeDqHZoGJ+hEjjQPrEu7sPgcJskf8KvTzMPM2H73PZorcfWI3VKP6JI5dg3Ev92giV1m+mHwEZqlDA0HCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:22:45.641607Z"},"content_sha256":"b4e1c9f64680b0ed9d7aeac7b62d8d6b71b0a93ce4c86b6552885aae687c93b6","schema_version":"1.0","event_id":"sha256:b4e1c9f64680b0ed9d7aeac7b62d8d6b71b0a93ce4c86b6552885aae687c93b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GWFVX3H25NQ4WFN6WNDWDYYMBI","target":"graph","payload":{"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"},"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-05-18T00:02:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XjG4l3Rthhyjbsavc6FoEsvDupG7Cb1USxgIDiy4heE61uzaYv6BbvzczRgG6SUTJubn5HOPnvYNxB044vPsBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:22:45.641947Z"},"content_sha256":"9a281eb5534076eddc027600afaac95a8e960ad7f82cbdd0ff916f8874bdfcdf","schema_version":"1.0","event_id":"sha256:9a281eb5534076eddc027600afaac95a8e960ad7f82cbdd0ff916f8874bdfcdf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GWFVX3H25NQ4WFN6WNDWDYYMBI/bundle.json","state_url":"https://pith.science/pith/GWFVX3H25NQ4WFN6WNDWDYYMBI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GWFVX3H25NQ4WFN6WNDWDYYMBI/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-06-01T16:22:45Z","links":{"resolver":"https://pith.science/pith/GWFVX3H25NQ4WFN6WNDWDYYMBI","bundle":"https://pith.science/pith/GWFVX3H25NQ4WFN6WNDWDYYMBI/bundle.json","state":"https://pith.science/pith/GWFVX3H25NQ4WFN6WNDWDYYMBI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GWFVX3H25NQ4WFN6WNDWDYYMBI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GWFVX3H25NQ4WFN6WNDWDYYMBI","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":"dd5fe5b2989c19d769b8988355236eb545604fc015a98ff400de21bdc17a7e4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-23T09:19:21Z","title_canon_sha256":"8a990ad1ade69126a2ec98b61c762a15fd4aa2048586d486224a7feab995ed0b"},"schema_version":"1.0","source":{"id":"1810.09736","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.09736","created_at":"2026-05-18T00:02:29Z"},{"alias_kind":"arxiv_version","alias_value":"1810.09736v1","created_at":"2026-05-18T00:02:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.09736","created_at":"2026-05-18T00:02:29Z"},{"alias_kind":"pith_short_12","alias_value":"GWFVX3H25NQ4","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GWFVX3H25NQ4WFN6","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GWFVX3H2","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:9a281eb5534076eddc027600afaac95a8e960ad7f82cbdd0ff916f8874bdfcdf","target":"graph","created_at":"2026-05-18T00:02:29Z","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"},"paper":{"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 ","authors_text":"Renying Chang, Xueliang Li, Xuqing Bai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-23T09:19:21Z","title":"More on rainbow disconnection in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.09736","kind":"arxiv","version":1},"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:b4e1c9f64680b0ed9d7aeac7b62d8d6b71b0a93ce4c86b6552885aae687c93b6","target":"record","created_at":"2026-05-18T00:02:29Z","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":"dd5fe5b2989c19d769b8988355236eb545604fc015a98ff400de21bdc17a7e4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-23T09:19:21Z","title_canon_sha256":"8a990ad1ade69126a2ec98b61c762a15fd4aa2048586d486224a7feab995ed0b"},"schema_version":"1.0","source":{"id":"1810.09736","kind":"arxiv","version":1}},"canonical_sha256":"358b5becfaeb61cb15beb34761e30c0a1f12af16873a799ec36c0c63b9a30a94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"358b5becfaeb61cb15beb34761e30c0a1f12af16873a799ec36c0c63b9a30a94","first_computed_at":"2026-05-18T00:02:29.572018Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:29.572018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fEZZOO7XdJdzZ1jR1MagMAYMRGqwH0R9zuNYEFDhXloVB55DO+JtYU+eiozmrPuAFq1xwWtVXzO5yEzhTXtOAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:29.572751Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.09736","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4e1c9f64680b0ed9d7aeac7b62d8d6b71b0a93ce4c86b6552885aae687c93b6","sha256:9a281eb5534076eddc027600afaac95a8e960ad7f82cbdd0ff916f8874bdfcdf"],"state_sha256":"a9c9b835897904c8242fb62a8ef5b1cc602435f85d5427a39d78c2bcf932ac8b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ZRms4D/5aU2egzMwx8OWeTYlBVCO7NeBwWGsnsVZ+F8xIhhEHevt91IBynTNDkMqsdqgWHmK6lfWdOCZJKpCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:22:45.643810Z","bundle_sha256":"ba7f7444660ab0727b83b7ebcd8e649735e4f42e20cb882f6115c72834070338"}}