{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TMBWZ2QEGMBAFLEQWZT2HVVL6Z","short_pith_number":"pith:TMBWZ2QE","canonical_record":{"source":{"id":"1501.00079","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-31T05:27:22Z","cross_cats_sorted":[],"title_canon_sha256":"1211e696293b4b579fc39f67b4ef2adeb17ee796c1e8e30405c29f6035c9009b","abstract_canon_sha256":"e65dab7a7441700ac01a2e409f111ca873e67951fd0d045c6b26420aebe9db76"},"schema_version":"1.0"},"canonical_sha256":"9b036cea04330202ac90b667a3d6abf66432d2b8d3489290662469a32d2c6faa","source":{"kind":"arxiv","id":"1501.00079","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00079","created_at":"2026-05-18T02:30:10Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00079v1","created_at":"2026-05-18T02:30:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00079","created_at":"2026-05-18T02:30:10Z"},{"alias_kind":"pith_short_12","alias_value":"TMBWZ2QEGMBA","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TMBWZ2QEGMBAFLEQ","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TMBWZ2QE","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TMBWZ2QEGMBAFLEQWZT2HVVL6Z","target":"record","payload":{"canonical_record":{"source":{"id":"1501.00079","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-31T05:27:22Z","cross_cats_sorted":[],"title_canon_sha256":"1211e696293b4b579fc39f67b4ef2adeb17ee796c1e8e30405c29f6035c9009b","abstract_canon_sha256":"e65dab7a7441700ac01a2e409f111ca873e67951fd0d045c6b26420aebe9db76"},"schema_version":"1.0"},"canonical_sha256":"9b036cea04330202ac90b667a3d6abf66432d2b8d3489290662469a32d2c6faa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:10.212591Z","signature_b64":"D/QqqTEvaUgXn39YNQBU+mdQncI0nV9gMOwvjc5vVm02FQpMd7XB/1UUGOhBdoWO0iwzX6n0tkZAxe1iWSsFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b036cea04330202ac90b667a3d6abf66432d2b8d3489290662469a32d2c6faa","last_reissued_at":"2026-05-18T02:30:10.212098Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:10.212098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.00079","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-18T02:30:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tnhWYgd7HTltFaHDaQS3uwE1Dco8+ZdvyjT07zb5fpMRrUz0BxRmBGo8WUPtWieEtfPyTezPyfOT9mlTi+oUBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:16:41.015212Z"},"content_sha256":"90b261813f6e60937d533fc98c554f2e2ff8e8fabf523f7833c7c831680f86bc","schema_version":"1.0","event_id":"sha256:90b261813f6e60937d533fc98c554f2e2ff8e8fabf523f7833c7c831680f86bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TMBWZ2QEGMBAFLEQWZT2HVVL6Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Colorful monochromatic connectivity of random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ran Gu, Xueliang Li, Zhongmei Qin","submitted_at":"2014-12-31T05:27:22Z","abstract_excerpt":"An edge-coloring of a connected graph $G$ is called a {\\it monochromatic connection coloring} (MC-coloring, for short), introduced by Caro and Yuster, if there is a monochromatic path joining any two vertices of the graph $G$. Let $mc(G)$ denote the maximum number of colors used in an MC-coloring of a graph $G$. Note that an MC-coloring does not exist if $G$ is not connected, and in this case we simply let $mc(G)=0$. We use $G(n,p)$ to denote the Erd\\\"{o}s-R\\'{e}nyi random graph model, in which each of the $\\binom{n}{2}$ pairs of vertices appears as an edge with probability $p$ independently f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00079","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-18T02:30:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T4yGH4s7vuD7WbN0C1xA8xgwuS/+XwUh1xw8lR3FtrrcDJ7sgLDoFRp6GbjY/upeefWHCusZhj2c2aCKLYxvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:16:41.015562Z"},"content_sha256":"cb77f32aaceadb83e7ed4bb6775cc30557aef91a3a173e956cd09eac81b4da8b","schema_version":"1.0","event_id":"sha256:cb77f32aaceadb83e7ed4bb6775cc30557aef91a3a173e956cd09eac81b4da8b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TMBWZ2QEGMBAFLEQWZT2HVVL6Z/bundle.json","state_url":"https://pith.science/pith/TMBWZ2QEGMBAFLEQWZT2HVVL6Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TMBWZ2QEGMBAFLEQWZT2HVVL6Z/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-03T18:16:41Z","links":{"resolver":"https://pith.science/pith/TMBWZ2QEGMBAFLEQWZT2HVVL6Z","bundle":"https://pith.science/pith/TMBWZ2QEGMBAFLEQWZT2HVVL6Z/bundle.json","state":"https://pith.science/pith/TMBWZ2QEGMBAFLEQWZT2HVVL6Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TMBWZ2QEGMBAFLEQWZT2HVVL6Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TMBWZ2QEGMBAFLEQWZT2HVVL6Z","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":"e65dab7a7441700ac01a2e409f111ca873e67951fd0d045c6b26420aebe9db76","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-31T05:27:22Z","title_canon_sha256":"1211e696293b4b579fc39f67b4ef2adeb17ee796c1e8e30405c29f6035c9009b"},"schema_version":"1.0","source":{"id":"1501.00079","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00079","created_at":"2026-05-18T02:30:10Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00079v1","created_at":"2026-05-18T02:30:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00079","created_at":"2026-05-18T02:30:10Z"},{"alias_kind":"pith_short_12","alias_value":"TMBWZ2QEGMBA","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TMBWZ2QEGMBAFLEQ","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TMBWZ2QE","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:cb77f32aaceadb83e7ed4bb6775cc30557aef91a3a173e956cd09eac81b4da8b","target":"graph","created_at":"2026-05-18T02:30:10Z","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":"An edge-coloring of a connected graph $G$ is called a {\\it monochromatic connection coloring} (MC-coloring, for short), introduced by Caro and Yuster, if there is a monochromatic path joining any two vertices of the graph $G$. Let $mc(G)$ denote the maximum number of colors used in an MC-coloring of a graph $G$. Note that an MC-coloring does not exist if $G$ is not connected, and in this case we simply let $mc(G)=0$. We use $G(n,p)$ to denote the Erd\\\"{o}s-R\\'{e}nyi random graph model, in which each of the $\\binom{n}{2}$ pairs of vertices appears as an edge with probability $p$ independently f","authors_text":"Ran Gu, Xueliang Li, Zhongmei Qin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-31T05:27:22Z","title":"Colorful monochromatic connectivity of random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00079","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:90b261813f6e60937d533fc98c554f2e2ff8e8fabf523f7833c7c831680f86bc","target":"record","created_at":"2026-05-18T02:30:10Z","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":"e65dab7a7441700ac01a2e409f111ca873e67951fd0d045c6b26420aebe9db76","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-31T05:27:22Z","title_canon_sha256":"1211e696293b4b579fc39f67b4ef2adeb17ee796c1e8e30405c29f6035c9009b"},"schema_version":"1.0","source":{"id":"1501.00079","kind":"arxiv","version":1}},"canonical_sha256":"9b036cea04330202ac90b667a3d6abf66432d2b8d3489290662469a32d2c6faa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b036cea04330202ac90b667a3d6abf66432d2b8d3489290662469a32d2c6faa","first_computed_at":"2026-05-18T02:30:10.212098Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:10.212098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D/QqqTEvaUgXn39YNQBU+mdQncI0nV9gMOwvjc5vVm02FQpMd7XB/1UUGOhBdoWO0iwzX6n0tkZAxe1iWSsFBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:10.212591Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.00079","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90b261813f6e60937d533fc98c554f2e2ff8e8fabf523f7833c7c831680f86bc","sha256:cb77f32aaceadb83e7ed4bb6775cc30557aef91a3a173e956cd09eac81b4da8b"],"state_sha256":"424792bd2a42f724f9852f733ca6f449a761579cb1c9eb44a4968a4319165c61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LTDC5RA4/Wn+bTx3/gkGXAac7R9xSXjjYNzDjTFPQb8OX0gFptd6RFzSBZYMbEu0OIz5Y/v077IHyWZKYOtzBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T18:16:41.017519Z","bundle_sha256":"c7864b46c437b74fa5d0af7a3eea07dddd80c2350606488abf8dc27e420615dd"}}