{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TMBWZ2QEGMBAFLEQWZT2HVVL6Z","short_pith_number":"pith:TMBWZ2QE","schema_version":"1.0","canonical_sha256":"9b036cea04330202ac90b667a3d6abf66432d2b8d3489290662469a32d2c6faa","source":{"kind":"arxiv","id":"1501.00079","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1501.00079","created_at":"2026-05-18T02:30:10.212174+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.00079v1","created_at":"2026-05-18T02:30:10.212174+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00079","created_at":"2026-05-18T02:30:10.212174+00:00"},{"alias_kind":"pith_short_12","alias_value":"TMBWZ2QEGMBA","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TMBWZ2QEGMBAFLEQ","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TMBWZ2QE","created_at":"2026-05-18T12:28:49.207871+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/TMBWZ2QEGMBAFLEQWZT2HVVL6Z","json":"https://pith.science/pith/TMBWZ2QEGMBAFLEQWZT2HVVL6Z.json","graph_json":"https://pith.science/api/pith-number/TMBWZ2QEGMBAFLEQWZT2HVVL6Z/graph.json","events_json":"https://pith.science/api/pith-number/TMBWZ2QEGMBAFLEQWZT2HVVL6Z/events.json","paper":"https://pith.science/paper/TMBWZ2QE"},"agent_actions":{"view_html":"https://pith.science/pith/TMBWZ2QEGMBAFLEQWZT2HVVL6Z","download_json":"https://pith.science/pith/TMBWZ2QEGMBAFLEQWZT2HVVL6Z.json","view_paper":"https://pith.science/paper/TMBWZ2QE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.00079&json=true","fetch_graph":"https://pith.science/api/pith-number/TMBWZ2QEGMBAFLEQWZT2HVVL6Z/graph.json","fetch_events":"https://pith.science/api/pith-number/TMBWZ2QEGMBAFLEQWZT2HVVL6Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TMBWZ2QEGMBAFLEQWZT2HVVL6Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TMBWZ2QEGMBAFLEQWZT2HVVL6Z/action/storage_attestation","attest_author":"https://pith.science/pith/TMBWZ2QEGMBAFLEQWZT2HVVL6Z/action/author_attestation","sign_citation":"https://pith.science/pith/TMBWZ2QEGMBAFLEQWZT2HVVL6Z/action/citation_signature","submit_replication":"https://pith.science/pith/TMBWZ2QEGMBAFLEQWZT2HVVL6Z/action/replication_record"}},"created_at":"2026-05-18T02:30:10.212174+00:00","updated_at":"2026-05-18T02:30:10.212174+00:00"}